| Commit message (Expand) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Read a slice's bucket and first cell some rounds ahead of the loop that opens... | eunhhu | 2026-10-05 | 1 | -1/+6 |
| * | Design 022: stored lists as arrays with a bucket index fitted to the keys sea... | eunhhu | 2026-10-05 | 6 | -7/+283 |
| * | Measure 021: BFS 190 to 90 ms over HTTP against C's 9.1, short of C; Pure's f... | eunhhu | 2026-10-05 | 72 | -0/+1024 |
| * | Measure an index for a stored list's slices outside the list: three times a t... | eunhhu | 2026-10-05 | 2 | -0/+113 |
| * | Say what a search's floor is with stored lists as trees: 373 ns a node to fin... | eunhhu | 2026-10-05 | 3 | -0/+75 |
