| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | 125: forms and newton runs named; BFS's time after the graph's load is the ↵ | eunhhu | 2026-10-05 | 1 | -0/+2 |
| | | | | | generic code's (steps 0.1%), what the tier needs for it (a list's count as a changing value); 023 cites words at e2e56dd | ||||
| * | 040 forms.c: matmul's inner loop in the forms the tier may make it (index ↵ | eunhhu | 2026-10-05 | 1 | -0/+1 |
| 20.7 ms, pointer with multiply-add 13.1, apart 10.0, with checks 10.2, a bit tested before each load 13.4): the position's multiply and the pre-load branch cost, the checks hardly; 023 section 5 says so and what comes first (pointer induction, then a full list's copy) | |||||
