larvit/fejkdata
3
0
Fork 0
Code Pull Requests 1 Actions Activity

State the row lookup whole in the key-map decision

Browse Source
This commit is contained in:
Lilleman auf Larv
2026-09-28 11:52:40 +02:00
committed by Lillem4n
parent 8f86de2187
commit ce469cb3a3
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/decisions.md
+2 -2
View File
@@ -442,8 +442,8 @@ option earns its place.
## The key map is built at load, the rest on first draw ## The key map is built at load, the rest on first draw
A link is proved against the parent's keys and a key's uniqueness is a data mistake, so A link is proved against the parent's keys and a key's uniqueness is a data mistake, so
both are load-time; the per-parent child lists serve only a draw, so they wait for the both are load-time; the row lookup, by name and by parent, serves only a draw, so it waits
first one, keeping `New` linear in the bytes read. for the first one, keeping `New` linear in the bytes read.
## Two categories may name one TSV ## Two categories may name one TSV