||2 years ago|
|.github/workflows||2 years ago|
|src||2 years ago|
|.gitignore||2 years ago|
|CHANGELOG.md||2 years ago|
|Cargo.toml||2 years ago|
|LICENSE-APACHE||2 years ago|
|LICENSE-MIT||2 years ago|
|README.md||2 years ago|
|RELEASING.md||2 years ago|
A simple and efficient
no_std input debouncer that uses integer bit shifting
to debounce inputs. The algorithm can detect rising and falling edges and only
requires 1 byte of RAM for detecting up to 8 consecutive high/low states or 2
bytes of RAM for detecting up to 16 consecutive high/low states.
The algorithm is based on the Ganssle Guide to Debouncing (section "An Alternative").
Licensed under either of
- Apache License, Version 2.0 (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT) at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.