todo for branch-free example

2018-04-09 09:45:08 -07:00 · 2018-04-09 09:45:08 -07:00 · 5dc09ee650
commit 5dc09ee650
parent 4c6200bf44
1 changed files with 1 additions and 0 deletions
--- a/performance.md
+++ b/performance.md
@ -943,6 +943,7 @@ Techniques specific to the architecture running the code

    counts[i & 1] ++
    "branch-free code", benchmark; not always faster, but frequently harder to read
+    TODO: ASCII class counts example, with benchmarks

 * sorting data can help improve performance via both cache locality and branch prediction, even taking into account the time it takes to sort
 * function call overhead