aboutsummaryrefslogtreecommitdiffstats
path: root/research/experiments/038-past-c
Commit message (Expand)AuthorAgeFilesLines
* Read a slice's bucket and first cell some rounds ahead of the loop that opens...eunhhu2026-10-051-1/+6
* Design 022: stored lists as arrays with a bucket index fitted to the keys sea...eunhhu2026-10-056-7/+283
* Measure 021: BFS 190 to 90 ms over HTTP against C's 9.1, short of C; Pure's f...eunhhu2026-10-0572-0/+1024
* Measure an index for a stored list's slices outside the list: three times a t...eunhhu2026-10-052-0/+113
* Say what a search's floor is with stored lists as trees: 373 ns a node to fin...eunhhu2026-10-053-0/+75