lilleman
|
98bb73f096
|
Give scope, binding, link, pick and head one meaning each: renderEnv, nodeSet, pipeline, resolvedRef, resolveTemplates, drawItem and a read's start
|
2026-10-07 01:04:44 +02:00 |
|
lilleman
|
dfa7271850
|
Answer prose round 3 and product-owner round 3: the changelog line drops its now, plain text names a string field's tag, and the default table comes from the library's parse
|
2026-10-07 00:45:19 +02:00 |
|
lilleman
|
e46753aa73
|
Answer prose round 2: item 129 defines a lone reference, closes item 40, spells {…} one way, and states that plain text prints as written in every surface
|
2026-10-07 00:45:19 +02:00 |
|
lilleman
|
38f6100cc3
|
Answer prose round 1 and product-owner round 1: item 129 names every decision and surface it revises, folds FakeRecordTemplate too, keeps Fake's cost, and says where the old spelling meets an error
|
2026-10-07 00:45:19 +02:00 |
|
lilleman
|
ee9b6ca971
|
Set goal 5.9, everything fejkdata renders is written as a template, and file item 129 to take a template wherever fejkdata renders
|
2026-10-07 00:45:19 +02:00 |
|
lilleman
|
1a684c072d
|
Answer prose round 3: the no-margin rule states its reason the right way round, and the performance gate decision names goal 13
|
2026-10-06 13:46:44 +02:00 |
|
lilleman
|
fb3fb16deb
|
Answer stability round 3: the allocation case of a read two levels under a pick holds at its baseline with no margin, as the performance gate decision now says
|
2026-10-06 13:46:44 +02:00 |
|
lilleman
|
f07764bce1
|
Hold the allocation case of a read two levels under a pick at 12, what the lowest supported Go allocates
|
2026-10-06 13:46:44 +02:00 |
|
lilleman
|
c814d36985
|
Answer prose round 1: pickKey names its two roots, readUnder says when it reads, levelKeys, draw and readField read on one pass, and the allocation case is named for what it reads
|
2026-10-06 13:46:44 +02:00 |
|
lilleman
|
93c96968dc
|
Answer stability round 1: readUnder builds the leaf key once, the pick's comments name the pickKey, and the allocation gate covers a read under a nested pick
|
2026-10-06 13:46:44 +02:00 |
|
lilleman
|
44b6f1ef89
|
Give a pick key one type, pickKey, and key every read's levels from the head its steps start at to its leaf
|
2026-10-06 13:46:44 +02:00 |
|
lilleman
|
b726edd7cb
|
Test that a fresh read and a named read key their levels from the head they walk from to their leaf
|
2026-10-06 13:46:44 +02:00 |
|
lilleman
|
0293e800ae
|
Prioritize sourced data rather than require it, loosen the data-format and dependency goals, and size the audience at millions of rows
|
2026-10-06 13:16:26 +02:00 |
|
lilleman
|
fd7101dfbc
|
Answer prose round 1: readName and readField say one idea a sentence and name what each pick and read is, and the test's message names whose b it checks
|
2026-10-05 23:20:02 +02:00 |
|
lilleman
|
3a29bdb1f0
|
Answer stability round 1: the readField comment names both directions of the shared value, and readName drops what namedPick states
|
2026-10-05 23:20:02 +02:00 |
|
lilleman
|
977431b1e3
|
State how every read of a name stays on one pick, and why a fresh read leaves it
|
2026-10-05 23:20:02 +02:00 |
|
lilleman
|
dc9d962690
|
Test that a fresh read inside a named pick reads none of the pick
|
2026-10-05 23:20:02 +02:00 |
|
lilleman
|
f0f81b066e
|
Answer prose round 2: item 119 says where each rule is stated, a checkable item 118, a shorter item 121, and the decision naming what the panel found in the code
|
2026-10-05 23:02:52 +02:00 |
|
lilleman
|
03e00cc0a2
|
Answer prose round 1: a true path to the scoring run's prompts, the panel named by its date, plainer items 118, 119, 121 and 127, and Next ID 129
|
2026-10-05 23:02:52 +02:00 |
|
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
|
bcc6858922
|
Answer prose round 2: resolveReads says it resolves fields before the format, and a plainer item 117
|
2026-10-05 22:49:04 +02:00 |
|
lilleman
|
338358c70e
|
Answer prose round 1: plainer linkTemplates, ownScope, resolveReads, compileArm and settleRecords docs, recordOf naming its three entry points, a plainer engine decision, and item 117 read as a path's last step
|
2026-10-05 22:49:04 +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
|
69703dec91
|
Answer architecture round 2: linkTemplates' doc says which steps pass names as arguments, checkEveryNameRead, and an invariant guard on a binding with no read at link
|
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
|
cd7f0a04dc
|
Link each template in steps that each return what they build, create a name scope with its owner in one place, and settle each record's columns at load, so Generator.records goes
|
2026-10-05 22:49:04 +02:00 |
|
lilleman
|
cdc82a99c6
|
Test a name read before its binder links, and that every record carries its shape once loaded
|
2026-10-05 22:49:04 +02:00 |
|
lilleman
|
34a0fb3a18
|
Answer prose round 2: the selector's reserved quote named as opening a JSON value, and the List doc rewrapped
|
2026-10-05 22:10:04 +02:00 |
|
lilleman
|
54f68735df
|
Answer prose round 1: true fixture and item 116 claims, plainer DrawIn, takeStep, Link and decision wording, and two comments deleted
|
2026-10-05 22:10:04 +02:00 |
|
lilleman
|
8cd602c31a
|
Test that List advertises no path through a choice into a variant carrying a repeat
|
2026-10-05 22:10:04 +02:00 |
|
lilleman
|
964f04c7c8
|
Answer stability round 1 and product-owner round 1: List advertises no path into a level carrying a repeat, a refusal that says to read the level whole, and plainer walk-position docs
|
2026-10-05 22:10:04 +02:00 |
|
lilleman
|
a9c59ba6b7
|
Test that List advertises no path into a level carrying a repeat
|
2026-10-05 22:10:04 +02:00 |
|
lilleman
|
36329f1328
|
Answer architecture round 2: a keyed walk position, a plainer Above test, and docs naming the owner and the key-name refusal
|
2026-10-05 22:10:04 +02:00 |
|
lilleman
|
29a5314f60
|
Answer architecture round 1: rows.Options checked whole in internal/rows, Owner and ProveStepUp, neutral pin docs, one walk position, tests of internal/rows and Weighted, and a true README list of Fake's failures
|
2026-10-05 22:10: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
|
05d9fcd8c1
|
Test the character a selector cannot spell
|
2026-10-05 22:10:04 +02:00 |
|
lilleman
|
880621f6bb
|
Test that a caller's path refuses a level carrying a repeat, and list internal/rows among the module's packages
|
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
|
15b94b2718
|
Answer architecture round 2: name eachNode's callback parameter label in node_test.go
|
2026-10-05 21:21:46 +02:00 |
|
lilleman
|
54cb52b483
|
Answer architecture round 1: one categoryPath, the walk's label named label, checkAncestors split from proveParent, and file items 115 and 116
|
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
|
21a4ed1795
|
Test that a table's errors name its path, and a cell's its line
|
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
|
a256645fdb
|
Answer prose round 2: one word for the escape, the goal and its conflict in two sentences, and a plainer item 114
|
2026-10-05 16:34:46 +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 |
|