aboutsummaryrefslogtreecommitdiffstats
path: root/docs/design/027-computation-core.md
diff options
context:
space:
mode:
authoreunhhu <[email protected]>2026-10-19 14:37:55 +0100
committereunhhu <[email protected]>2026-10-19 14:37:55 +0100
commit519df326fe131c94a706c0d8b8f23ca8f093af3b (patch)
treed0abae610187ff9c3b160d30a2cf8cc095831a0a /docs/design/027-computation-core.md
parentcf3a1d66c2af6146d895065fa65d132191d48e00 (diff)
downloadpure-519df326fe131c94a706c0d8b8f23ca8f093af3b.tar.gz
pure-519df326fe131c94a706c0d8b8f23ca8f093af3b.zip
045: the app keyed and its range found by a seek, emitted as it says (no algorithm the app does not state, nothing copied out of the tree): aup takes ranges as a list keyed by last and first(x in ranges where x.last >= code) as its range, the executor answers every line and is itself 40,258 to 27,934 machine instructions a point; the hand rungs on it (the seek by each level's guide keys and the leaf's key column, the found item's fields read from it, the other ranges read by key): keyed_shared 788 a point, end to end 813 with 348 cycles (the position-halving seek of a1382de, another program, 604 with 373 cycles; Vega's C 251 with 93)
Diffstat (limited to 'docs/design/027-computation-core.md')
0 files changed, 0 insertions, 0 deletions