aboutsummaryrefslogtreecommitdiffstats
path: root/core/module-list.c
Commit message (Expand)AuthorAgeFilesLines
* A text-keyed list let go at an event's end starts no key set (a number's bits...eunhhu2026-10-051-12/+13
* A HASHED list's table four fifths full at most (100,000 keys in 1 MB of slots...eunhhu2026-10-051-3/+6
* Text keys (023): a list knows the text field it is keyed by; an event's list ...eunhhu2026-10-051-21/+114
* HASHED (023): an event's list keyed by numbers that came out of order keeps e...eunhhu2026-10-051-8/+195
* The tier's keys and positions in range for every round, checked once where th...eunhhu2026-10-051-2/+5
* The tier, first (023): a nest of loops as SSA, its stack, locals and states v...eunhhu2026-10-051-1/+14
* 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
* Read a slice's bucket and first cell some rounds ahead of the loop that opens...eunhhu2026-10-051-1/+1
* Keep arrays' number columns as narrow as their values (u8, u32, f64; a DENSE ...eunhhu2026-10-051-35/+172
* Compile with the stack's values in registers, comparisons and bits branched o...eunhhu2026-10-051-1/+2
* Pack a stored keyed list searched often into arrays and a bucket index fitted...eunhhu2026-10-051-31/+287
* Read a tree's items in compiled code from a run the frame keeps, start a run ...eunhhu2026-10-051-1/+31
* Write the hot instructions as code: constants, states, locals, rows, arithmet...eunhhu2026-10-051-0/+7
* Share an event's empty list as it is: a snapshot made every event's lists tre...eunhhu2026-10-051-1/+2
* Keep an event's lists in arrays, flat or at their keys, and read a field by k...eunhhu2026-10-051-8/+444
* Keep one finger a thread, as before: four cost the bank's queries instruction...eunhhu2026-10-041-32/+21
* Search an event's keyed lists by a key set and lists by fingers, add by key i...eunhhu2026-10-041-34/+316
* Count in loops that nest, break, and keep an event's own lists, every event b...eunhhu2026-10-041-0/+2
* Read a list cell's place after finding its leaf, not beside iteunhhu2026-10-011-1/+2
* Keep i64 off the number paths: lanes fold numbers, cells read as byteseunhhu2026-09-301-4/+9
* Give i64 its own type in modules, lists, stores and the host (016 stage 2)eunhhu2026-09-301-48/+94
* Let a value's 8 bytes hold a number or an integereunhhu2026-09-301-4/+4
* Let a list make its next nodes of those no snapshot reads any moreeunhhu2026-09-301-30/+65
* Let a held snapshot keep the states of its time, not all that came aftereunhhu2026-09-301-3/+37
* Keep the outbox as a list: a save logs only the sends and trims it madeeunhhu2026-09-291-3/+5
* Log list changes compact: varint positions and integers, the rest bit for biteunhhu2026-09-281-28/+106
* Write list images a chunk at a time, and keep the log within the lists' sizeeunhhu2026-09-281-0/+23
* Guide a list's inner nodes: items before each child and its first key, search...eunhhu2026-09-281-41/+171
* Save a list as its items and a journal of its changes sinceeunhhu2026-09-281-96/+126
* Walk a list in a handler, and fill a list with a message's rowseunhhu2026-09-281-0/+8
* Answer a fold in a column from one pass over its listeunhhu2026-09-281-0/+5
* Run folds and filters a leaf of their list at a timeeunhhu2026-09-281-7/+46
* Keep a list's items field by field in its leaveseunhhu2026-09-281-231/+343
* Keep a list's items in a persistent treeeunhhu2026-09-271-108/+462
* Lay Pure out as a core with the parts selected around iteunhhu2026-09-271-0/+428
generated by cgit v1.2.3 (git 2.46.0) at 2026-10-20 17:35:36 +0000