| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Measure 021: BFS 190 to 90 ms over HTTP against C's 9.1, short of C; Pure's ↵ | eunhhu | 2026-10-05 | 1 | -1/+2 |
| | | | | | forms by hand beat C only packed, narrow and read ahead (123) | ||||
| * | Measure an index for a stored list's slices outside the list: three times a ↵ | eunhhu | 2026-10-05 | 1 | -3/+8 |
| | | | | | tree's seek, still seven times C's (021) | ||||
| * | Say what a search's floor is with stored lists as trees: 373 ns a node to ↵ | eunhhu | 2026-10-05 | 1 | -1/+16 |
| | | | | | find a slice against C's 21 (021) | ||||
| * | Say how a search gets past C: event lists as arrays, a directory for stored ↵ | eunhhu | 2026-10-05 | 1 | -0/+112 |
| keys, then a JIT, with criteria (021) | |||||
