 lilleman
|
791d76923c
|
Record the panel's scores on the restructured code, and file what it named as items 118 to 128
|
2026-10-05 23:02:52 +02:00 |
|
|
lilleman
|
ce6337e829
|
Record the scoring run's project values in AGENTS.md
|
2026-10-05 23:02:52 +02:00 |
|
|
lilleman
|
b0cd3fea16
|
Answer stability round 1 and product-owner round 1: a Layout line for link.go that names no step, inline.go's line naming its bind, the decision title read as linking in steps, and file item 117
|
2026-10-05 22:49:04 +02:00 |
|
|
lilleman
|
0993d86f22
|
Answer architecture round 1: the read-once check back at link over uses from the compiled arms, every link step taking its inputs as arguments in link.go, a record column holding its name and datatype, and items 104 to 106 dropped from the plan with the decisions citing them reworded
|
2026-10-05 22:49:04 +02:00 |
|
|
lilleman
|
707cd6b203
|
Move a table's rows, links and pins into internal/rows, and walk every path through one per-step function, so Fake refuses a level carrying a repeat
|
2026-10-05 22:10:04 +02:00 |
|
|
lilleman
|
d7613bd7c7
|
Answer prose round 2: a complexity rule whose exception excepts, and plainer walk and ancestor comments
|
2026-10-05 21:21:46 +02:00 |
|
|
lilleman
|
449e8e3233
|
Answer prose round 1 and product-owner round 1: plainer walk, link and ancestor comments, a complexity rule that reads one way, shorter items 115 and 116, and a cycle through a cell filed under item 115
|
2026-10-05 21:21:46 +02:00 |
|
|
lilleman
|
8ffaa31e39
|
Set a table's path when it compiles, link a table family in one function, and label a cell from the walk
|
2026-10-05 21:21:46 +02:00 |
|
|
lilleman
|
f3e71522ae
|
Answer prose round 1: a title that says what holds, an example that runs with no option, and a premise naming the template syntax's escape
|
2026-10-05 20:56:54 +02:00 |
|
|
lilleman
|
bd1dcb7fc8
|
Record goal 7.2 as an aim: a first template can be written with no escape
|
2026-10-05 20:56:54 +02:00 |
|
|
lilleman
|
68c896b916
|
Answer prose round 1: a true validity premise, the reading in two plain sentences, and the braces named one by one
|
2026-10-05 17:18:02 +02:00 |
|
|
lilleman
|
ad28f6621c
|
Record that goal 7.2's "no escaping" means no special character beyond the braces, and drop question 114
|
2026-10-05 17:18:02 +02:00 |
|
|
lilleman
|
533258e662
|
Answer prose round 1: a plainer decision title, name which braces belong to the syntax, and file goal 7.2's escaping as question 114
|
2026-10-05 16:34:46 +02:00 |
|
|
lilleman
|
7ce34ba1fc
|
Record that goal 5.1 counts the doubled-brace escape and a lone } as template syntax
|
2026-10-05 16:34:46 +02:00 |
|
|
lilleman
|
e8b7357cfc
|
Drop items 99, 100 and 103 from the plan, and name the moves in the decisions citing them
|
2026-10-05 16:30:28 +02:00 |
|
|
lilleman
|
177dd4b50b
|
Answer prose round 1: delete two false comments, plainer SplitPath, evalCalc and decision wording, a shorter comprehension floor title, and item 110 owes a changelog entry
|
2026-10-05 12:35:08 +02:00 |
|
|
lilleman
|
5e56b44dfa
|
Drop item 98 from the plan, list internal/grammar in the Layout, and name the grammar in the decisions citing item 98
|
2026-10-05 12:35:08 +02:00 |
|
|
lilleman
|
1d0fe9f555
|
Answer architecture round 1: read the module path from go.mod, keep the randomness behind State's methods, rename the field drawState and the counter Seq, and file items 108 and 109
|
2026-10-05 12:03:38 +02:00 |
|
|
lilleman
|
ddc3193593
|
Drop item 97 from the plan, list internal/drawstate in the Layout, and name the draw state in the decisions citing item 97
|
2026-10-05 12:03:38 +02:00 |
|
|
lilleman
|
e17660e8ba
|
Answer prose round 1: state the gate once in item 5, title the engine decision by what this commit holds, and plainer wording across items 97 to 107 and the decisions
|
2026-10-05 11:40:05 +02:00 |
|
|
lilleman
|
2ce8afd0fe
|
Plan the restructure as items 97 to 107: one writer per value, what stands alone in internal/, the engine in the root until item 107
|
2026-10-05 11:40:05 +02:00 |
|
|
lilleman
|
f89ffd1b73
|
Answer stability round 3, product-owner round 3 and prose round 1: a column reading a bound column takes its datatype and null, a column bound in part draws afresh, and plainer wording across the README, decisions, plan and errors
|
2026-10-05 10:19:01 +02:00 |
|
|
lilleman
|
1a15a139c8
|
Answer architecture round 1: refuse a name read inside the field it binds, check every scope's cycles, build a column read in one pass, drop the implicit struct pick for names across tags, and state the fresh-draw rule once
|
2026-10-05 10:19:01 +02:00 |
|
|
lilleman
|
a45edf8fb5
|
Document fresh draws and named picks, revise the decisions the restructure ends, and close items 4 and 87
|
2026-10-05 10:19:01 +02:00 |
|
|
lilleman
|
03577ebca2
|
Answer prose round 1 and product-owner round 1: give goal 5.7 a test a reader can apply, drop the AGENTS.md copy of it, and cite the key decision to goal 5.5
|
2026-10-05 07:55:01 +02:00 |
|
|
lilleman
|
0130a46ced
|
Refuse only a spelling that restates another, and drop item 93
|
2026-10-05 07:55:01 +02:00 |
|
|
lilleman
|
d1b3b05a0c
|
Close item 71, and suspend scoring for items 4 and 90
|
2026-10-05 01:23:55 +02:00 |
|
|
lilleman
|
06c17411d6
|
Document the named person and address picks, revise the address decision, and close item 3
|
2026-10-05 00:50:23 +02:00 |
|
|
lilleman
|
ec1dcbf9d3
|
Answer prose round 1: name the parent after .., mark the step down as the one exception to the shared draw, and plainer errors
|
2026-10-05 00:23:18 +02:00 |
|
|
lilleman
|
1ec2bee098
|
Answer architecture round 1: share a step down's draw per draw group and pick, own descend's pins, name the spelling to write, and record the .. decision
|
2026-10-05 00:23:18 +02:00 |
|
|
lilleman
|
4b5506d07b
|
Document .., drop the step-up decision item 2 replaces, and close item 2
|
2026-10-05 00:23:18 +02:00 |
|
|
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 |
|