aboutsummaryrefslogtreecommitdiff
path: root/quantum/debounce/readme.md
diff options
context:
space:
mode:
Diffstat (limited to 'quantum/debounce/readme.md')
-rw-r--r--quantum/debounce/readme.md28
1 files changed, 28 insertions, 0 deletions
diff --git a/quantum/debounce/readme.md b/quantum/debounce/readme.md
new file mode 100644
index 000000000..1a77d44df
--- /dev/null
+++ b/quantum/debounce/readme.md
@@ -0,0 +1,28 @@
1Debounce algorithms belong in this folder.
2Here are a few ideas
3
41) Global vs Per-Key vs Per-Row
5 * Global - one timer for all keys. Any key change state affects global timer
6 * Per key - one timer per key
7 * Per row - one timer per row
8
92) Eager vs symmetric vs assymetric
10 * Eager - any key change is reported immediately. All further inputs for DEBOUNCE ms are ignored.
11 * Symmetric - wait for no changes for DEBOUNCE ms before reporting change
12 * Assymetric - wait for different times depending on key-down/key-up. E.g. Eager key-down, DEBOUNCE ms key up.
13
143) Timestamp vs cycles
15 * old old old code waits n cycles, decreasing count by one each matrix_scan
16 * newer code stores the millisecond the change occurred, and does subraction to figure out time elapsed.
17 * Timestamps are superior, i don't think cycles will ever be used again once upgraded.
18
19The default algorithm is symmetric and global.
20Here are a few that could be implemented:
21
22debounce_sym_g.c
23debounce_sym_pk.c
24debounce_sym_pr.c
25debounce_sym_pr_cycles.c //currently used in ergo-dox
26debounce_eager_g.c
27debounce_eager_pk.c
28debounce_eager_pr.c //could be used in ergo-dox!