60 Commits

Author	SHA1	Message	Date
lilleman	e14c9d0f4c	Answer prose round 1: item 5 scores the restructure, which is the round the comprehension rule lets merge, and item 90 says what internal/ buys	2026-10-04 23:45:29 +02:00
lilleman	d160de3ee1	Scrap the flat-package decision, plan item 90's folder restructure before the panel, and suspend scoring until item 5	2026-10-04 23:45:29 +02:00
lilleman	9cb0ed32d3	Answer prose and product-owner round 1: item 81 covers NaN too, the seed decision folds into goal 9, and each decision names its goal	2026-10-04 17:00:28 +02:00
lilleman	53431ab908	Answer prose round 1: plainer decision titles and body, comments that say what the code cannot, and claims New no longer makes	2026-10-03 20:37:07 +02:00
lilleman	3bb8628e39	Answer architecture round 2: one folder walk and one sorted-keys helper, REGENERATE for the index, and the held decisions naming the items that end them	2026-10-03 20:37:07 +02:00
lilleman	c3b462ec0a	Answer architecture round 1: one inline load-and-bind, go generate for the index, sorted unloaded names, item 79 named in the decision, and the audit's other findings filed	2026-10-03 20:37:07 +02:00
lilleman	8b3bbc4003	Load shipped categories before binding, panic on an index that misses a read, and name the index entry and unloaded category plainly	2026-10-03 20:37:07 +02:00
lilleman	5667cd5dc3	Load a shipped category on the first call reaching it, from an index generated from data/	2026-10-03 20:37:07 +02:00
lilleman	c569bf907f	Count a lower panel score as a lower score, noise or not, and record the named-pick decision's approval	2026-10-03 15:55:04 +02:00
lilleman	23e426016d	Bind a pick to a name with {ref as n}, and read it with {n} and {n.path}	2026-10-03 14:23:58 +02:00
lilleman	c7f9885821	Add goal 2, enough built-in data for the ten most-spoken languages and the Nordics, and renumber every goal reference	2026-10-03 01:29:22 +02:00
lilleman	0c1e380bed	Ship v0.1.0 before packaging, tier the releases by score, and keep the Gitea mirror by decision	2026-10-03 01:29:22 +02:00
lilleman	96d9e2ab24	Draw every path through drawSteps over its compiled steps, deleting pathDraw and pathProbe	2026-09-30 20:20:28 +02:00
lilleman	6b9755b3ef	Compile each path's steps, leaves and cover once at link, deleting pathCover, coverPath and pathLeaves	2026-09-30 20:02:16 +02:00
lilleman	a898df62c1	Exempt below the floor a repair of documented behaviour, where goal 5 no longer promises one	2026-09-30 11:11:04 +02:00
lilleman	49e47d6103	Rewrite goal 5 as an aim, and plan a load reporting every mistake at once	2026-09-30 11:11:04 +02:00
lilleman	78b08b699f	Have the draw fence query the read fold, deleting hasRead and its helpers	2026-09-29 21:31:07 +02:00
lilleman	45bdd10c9b	Record that a cell may read a reference, and plan the round as the approved restructure	2026-09-29 20:12:33 +02:00
lilleman	0e8c054a46	Check CodeRabbit once at ready, and never wait for it below 10 stars	2026-09-29 18:41:41 +02:00
lilleman	b99966fe19	Name the render's draws apart from the expansion hold: drawMemo, groupDraws, renderDraws	2026-09-29 14:45:34 +02:00
lilleman	4e4254fa84	Title the stem decision by its rule, and point doc.go's whole at surveyAt	2026-09-29 03:14:13 +02:00
lilleman	f7cfc75394	Name the fence drawFence and the route surveyRoute, and move the survey tests to readsurvey_test.go	2026-09-29 03:14:13 +02:00
lilleman	2d82f34cd4	Rename the load-time draw types to the read survey and fence, and move the survey to readsurvey.go	2026-09-29 03:14:13 +02:00
lilleman	7eb1b2473f	State in the README which reads never render together, and drop the decision restating alternatives	2026-09-28 21:57:33 +02:00
lilleman	a84997d2f4	Settle the open questions through the goals and audience	2026-09-28 20:49:17 +02:00
lilleman	1b9cf00a26	Start every render from the zero hold set	2026-09-28 19:08:07 +02:00
lilleman	8f86de2187	Name pathKeys, pathKeyReaders, proveKeys and readValue's hold for what they hold, and give no token kind to the zero value	2026-09-28 12:06:03 +02:00
lilleman	9ea8f84421	Approve and reword the link-time checks decision	2026-09-28 10:21:25 +02:00
lilleman	306b88ef56	Compile every format at link	2026-09-28 03:23:27 +02:00
lilleman	68033bd42f	Name the path walks after their entry points, keep the probe allocation-free, and record why the walks are four loops	2026-09-28 00:55:48 +02:00
lilleman	03a48e378c	Key only a table a user selects into, state how a postort keeps its id, retire what the name option served, and make the doc sweep a grep	2026-09-27 23:17:37 +02:00
lilleman	7acb2136ec	Key every table on one code, never a free-form name, and plan each table's key	2026-09-27 23:17:37 +02:00
lilleman	003ce9deb4	Decide a selector names a row by its key alone, a route through another row is another path, and a step up may not step back down	2026-09-27 17:01:35 +02:00
lilleman	f8e9d9a280	Answer the step-up question at goal level: a path renders what every writer expects, so a link column steps up to its parent and may not end a path	2026-09-27 16:48:20 +02:00
lilleman	fb7a30e505	Make goal 4 ask for intuitive templates, and decide a selected row is fixed, not drawn	2026-09-27 15:08:58 +02:00
lilleman	8312b44a43	Say a whole read draws the family apart, drop the decision the bare-reference one already states, and link the naming test to its decision	2026-09-26 15:42:42 +02:00
lilleman	d6ac8ed9fd	Give check, children, column, columns, draw, drawn, fields, format, head, index, key, n, name, named, names, null, number, op, reads, record, root, row, t and whole one meaning each	2026-09-25 19:31:09 +02:00
lilleman	44a824ccf5	Decide one name, one meaning, and file the names that break it	2026-09-25 18:15:55 +02:00
lilleman	191186ec94	Record why each entry point to drawCheck.reads keeps its own doc	2026-09-25 17:25:10 +02:00
lilleman	949b2e8db1	Record that a format holding a reference is fenced at link, naming its path	2026-09-24 22:45:36 +02:00
lilleman	9f00ad039e	Move the decisions to docs/decisions.md, indexed in AGENTS.md and linked from the fences they back	2026-09-24 13:44:06 +02:00
lilleman	fab6ab4f2e	Move the project to GitHub, where a stranger can file an issue and open a PR	2026-09-21 00:30:16 +02:00
lilleman	976d2e5ac1	Rank understanding the code second, and say why it is not an afterthought	2026-09-20 23:19:53 +02:00
lilleman	343c9fa98a	Make being the best fake-data tool, and known for it, the goal the rest serve	2026-09-20 23:01:30 +02:00
lilleman	f206a18027	Gate everything on the comprehension score, and replay the round until it passes	2026-09-20 22:53:14 +02:00
lilleman	3dc1cf82f1	Make the cost of reading the code a goal, and answer to a reader panel each PR	2026-09-20 22:45:22 +02:00
lilleman	1035f8bb2a	Name the register read before claiming none publishes a spelling	2026-09-20 21:41:00 +02:00
lilleman	b3be1ee137	Record why a register with no frequency draws evenly, and the rule three misses shared	2026-09-20 00:48:50 +02:00
lilleman	ad57bf0c54	Add the breadth and inertness goals, name the contributor in the audience, and move the handoff's contents into the repo	2026-09-19 13:30:29 +02:00
lilleman	2dbfb0a622	Give the cache chown a command that works, record the pop-culture exclusion, and read the plan's breaking unit off the versioning table	2026-09-19 01:53:01 +02:00