aboutsummaryrefslogtreecommitdiffstats
path: root/docs/design/020-computing-faster.md
diff options
context:
space:
mode:
authoreunhhu <[email protected]>2026-10-05 10:41:18 +0100
committereunhhu <[email protected]>2026-10-05 10:41:18 +0100
commit68a1987919d18380abd38b0b60f46a5102f0fb2b (patch)
tree92d9cb6c9c423193aac3a500fcb11ceecc14faf7 /docs/design/020-computing-faster.md
parent7e96ef822a441145979b5b8aaa3429d600dae187 (diff)
downloadpure-68a1987919d18380abd38b0b60f46a5102f0fb2b.tar.gz
pure-68a1987919d18380abd38b0b60f46a5102f0fb2b.zip
Keep arrays' number columns as narrow as their values (u8, u32, f64; a DENSE list's keys as its slots), open a packed list's slice in code with an integer index, keep a nest of loops' values in registers of their own: BFS core 27.5 to 19.6 ms (022)
Diffstat (limited to 'docs/design/020-computing-faster.md')
0 files changed, 0 insertions, 0 deletions