aboutsummaryrefslogtreecommitdiffstats
path: root/core
Commit message (Expand)AuthorAgeFilesLines
* Batch executor, stage 5 of design 025: decide finds a kept round's bit once (...eunhhu11 days1-18/+15
* Batch executor, stage 5 of design 025: the sums into cells at once from round...eunhhu11 days1-2/+75
* Batch executor, stage 4 of design 025: a four-byte comparison counts its 1s i...eunhhu12 days1-14/+28
* Batch executor, stage 4 of design 025: a column read at affine rows in memory...eunhhu12 days1-4/+26
* Batch executor: a list's cells once a batch (cells_of, the first four lists i...eunhhu12 days1-11/+27
* Batch executor, stage 3 of design 025: a reduction starts with no lanes: whil...eunhhu12 days1-8/+57
* Batch executor: select and deselect named select_arm and deselect_arm (POSIX'...eunhhu12 days1-6/+6
* Batch executor, stage 3 of design 025: four-byte MUL (words_op): a product be...eunhhu12 days1-1/+6
* Batch plans: stage 2's check let go (segments run as made); with it gone the ...eunhhu12 days1-38/+5
* Batch plans, stage 2 of design 025: segments, runs of a batch loop's instruct...eunhhu12 days1-5/+232
* Batch plans: the check (PURE_BATCH_CHECK) let go, stage 1 made; with it gone ...eunhhu12 days1-122/+0
* Batch plans: the recurrences read once at load too (design 025, stage 1): the...eunhhu12 days1-98/+227
* Batch plans, stage 1 of design 025: each batch loop's block read once at load...eunhhu12 days4-30/+150
* PURE_REUSE_KEPT a define: as an enum constant UINT32_MAX is past int, which c...eunhhu12 days1-1/+1
* Batch: a selection's rows given back affine over the lanes around when they a...eunhhu12 days3-6/+27
* Batch: general cuts (docs/research/131). A value computed by the same code as...eunhhu12 days6-79/+636
* Batch: filters, if !L.has(k) { a line appending } in a batch's block or in a ...eunhhu2026-10-065-18/+399
* Batch: a count's loop whose block begins if slot >= L.count { break } (L only...eunhhu2026-10-063-27/+324
* Batch: a round of the recurrences one loop of actions laid out once a batch (...eunhhu2026-10-061-34/+59
* Batch: reductions' ends in any order where the order cannot tell (the least a...eunhhu2026-10-061-1/+53
* Batch: a recurrence's steps each an operation of two numbers a round keeps (a...eunhhu2026-10-061-39/+60
* Batch: a batch's appends made at once (pure_list_add_many, a call a chunk of ...eunhhu2026-10-063-14/+291
* Batch: a walk (EACH) whose block has batch forms runs a batch of its items at...eunhhu2026-10-062-27/+55
* Batch: a sum into a cell, L[k].f = L[k].f + e (k computed twice the same and ...eunhhu2026-10-061-12/+166
* Batch executor stage 5 (024): a recurrence (a local a round reads before it s...eunhhu2026-10-063-14/+206
* JIT: books written back only for lists their nest keeps books of: a nest with...eunhhu2026-10-061-0/+1
* Batch executor stage 4, first part (024): an item of numbers and bools append...eunhhu2026-10-063-17/+89
* JIT: an append to a HASHED list in a nest whose books keep DENSE appends' gro...eunhhu2026-10-061-10/+14
* Batch: numbers' results checked finite as they are made (in integers, in the ...eunhhu2026-10-051-39/+117
* Batch executor stage 2 (024): a loop in the batch's block runs its rounds for...eunhhu2026-10-053-42/+339
* Batch executor stage 1 (024): a count's loop whose block has batch forms (lan...eunhhu2026-10-056-56/+1227
* The tier checks a number finite in integers (its exponent's bits all ones), o...eunhhu2026-10-051-4/+6
* Pointer induction (023): an inner count's access by a key affine in its round...eunhhu2026-10-051-4/+156
* A text-keyed list let go at an event's end starts no key set (a number's bits...eunhhu2026-10-052-17/+20
* The tier's numbers' arithmetic in a run, each read by the next alone (constan...eunhhu2026-10-051-11/+64
* A HASHED list's table four fifths full at most (100,000 keys in 1 MB of slots...eunhhu2026-10-052-7/+71
* Text keys (023): a list knows the text field it is keyed by; an event's list ...eunhhu2026-10-055-29/+256
* HASHED (023): an event's list keyed by numbers that came out of order keeps e...eunhhu2026-10-053-18/+279
* The tier's loops tighter: a latch's way out takes the round as the next less ...eunhhu2026-10-051-20/+72
* The tier's inner loops: a count's work paid for every round as it opens (the ...eunhhu2026-10-051-60/+158
* The tier's keys and positions in range for every round, checked once where th...eunhhu2026-10-053-54/+203
* The tier, first (023): a nest of loops as SSA, its stack, locals and states v...eunhhu2026-10-054-8/+2173
* Keep a DENSE list's counted keys last in the list, apart from what is read of...eunhhu2026-10-051-9/+9
* A keyed event list given small whole keys in order becomes DENSE too, and a D...eunhhu2026-10-051-18/+95
* Research 124's suite: seven kinds of work in one event each (roots, knapsack,...eunhhu2026-10-051-0/+2
* In the integers' code, walk only the slices it opens (the step's go to the ex...eunhhu2026-10-051-26/+72
* Read ahead in integers in the integers' code, and the bucket's last cell as w...eunhhu2026-10-051-12/+103
* Keep the work an event may still do in a register, x30 among what is kept, sm...eunhhu2026-10-051-54/+132
* Keep a nest's books in registers: a FLAT list's count and a DENSE one's items...eunhhu2026-10-051-44/+265
* Compile each nest of loops twice, the second with whole numbers as integers (...eunhhu2026-10-053-75/+410
generated by cgit v1.2.3 (git 2.46.0) at 2026-10-20 18:38:20 +0000