lilleman
|
e63efe327f
|
Load each spelling that only restated a shorter one, as that shorter form
|
2026-10-08 12:37:59 +02:00 |
|
lilleman
|
e5babf413d
|
Answer architecture round 3, stability round 2, product-owner round 2 and prose round 1: the CLI renders exactly the template on stdin and adds nothing, --separator defaults to empty, whitespace around JSON is dropped, a lone reference under --format allows one newline, a blank stdin is refused, an unexpected argument names the spelling to use, and the prose names one lone reference
|
2026-10-07 21:58:29 +02:00 |
|
lilleman
|
83b4b0bdf0
|
Answer architecture round 1: stdin drops one newline, \n or \r\n, and reaches the library unchanged, inputError names the input's fault, two decisions and item 110 stop naming a CLI argument, the gate exemption moves to the floor entry, and item 156 asks about the JSON string
|
2026-10-07 21:58:29 +02:00 |
|
lilleman
|
9f96eb5a02
|
Answer prose round 1: pick key leaves its root rule to pickKey, the worked example lists l's addressed keys, refuseTwiceDrawnIn recurses on an addressed key, the street rule and NANPA's sit where their readers look, and street_delivery cites only what its source states
|
2026-10-07 02:04:32 +02:00 |
|
lilleman
|
b71d8a2ee5
|
Answer stability round 1 and product-owner round 1: the Swedish address paragraph warns of a street under a neighbouring postort, the street row names the centre point, phone-exchange's rule gets its own sentence, and a level is a path prefix
|
2026-10-07 02:04:32 +02:00 |
|
lilleman
|
a840ab06a4
|
Show at refuseSingleRead why a calc's one read of a name stands, and at refuseTwiceDrawnIn how it reaches a nested level
|
2026-10-07 02:04:32 +02:00 |
|
lilleman
|
ac6158e841
|
Answer prose round 2: resolvedRef names its two fields, checkCalcFields and refuseTwiceDrawn read on one pass, refuseSingleRead says why a calc's read stands, street_delivery states both rules, and Template.Fake claims nothing about names
|
2026-10-07 01:22:24 +02:00 |
|
lilleman
|
1419673b96
|
Answer prose round 1 and product-owner round 1: plainer resolvedRef, checkCalcFields and name-fence docs, geo-se.py's pointers name their headings, Fake and Columns keep a godoc line, and arm.go's Layout line names what an arm is
|
2026-10-07 01:22:24 +02:00 |
|
lilleman
|
ee25212618
|
Answer stability round 1: readsRow counts a selector, checkNameReads defers to refuseSingleRead, climbed names the child's row, and geo-se.py owns its big-city reading
|
2026-10-07 01:22:24 +02:00 |
|
lilleman
|
ac44a2f89b
|
Name the name fences refuseSingleRead and refuseTwiceDrawn, each doc stating the rule it holds
|
2026-10-07 01:22:24 +02:00 |
|
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
|
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
|
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
|
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
|
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
|
6fd7da19e5
|
Answer architecture round 1: calls carry no operands in the grammar, ParseCalc returns its operands, one empty-segment check, sorted token kinds, and file items 110 and 111
|
2026-10-05 12:35:08 +02:00 |
|
lilleman
|
c2f2e86735
|
Move how the template language is written into internal/grammar
|
2026-10-05 12:35:08 +02:00 |
|
lilleman
|
bf81c38315
|
Answer prose round 2: one wording for what a binding binds, the calc exception scoped in the decision, and rewrapped lines
|
2026-10-05 10:19:01 +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
|
8d82759520
|
Answer stability round 1 and product-owner round 1: refuse a field binding read once from above its binder, word the self-read refusal plainly, say how a bound field's column keeps the pick, and ask item 96
|
2026-10-05 10:19:01 +02:00 |
|
lilleman
|
f4a05fbb36
|
Answer architecture round 3: walk a table's row node in the cycle check, record where the read-once spelling meets an inline refusal, and cite goal 5.2 for a path tag drawing afresh
|
2026-10-05 10:19:01 +02:00 |
|
lilleman
|
938bbb5c43
|
Answer architecture round 2: refuse a self-read only inside what the binding lands on, fix the struct.go Layout line, move loneRef beside its caller, and widen item 83 to the link passes
|
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
|
6aebeebb72
|
Draw every {…} afresh, keep a pick only by name, and delete drawGroup with the hold and draw fences
|
2026-10-05 10:19:01 +02:00 |
|
lilleman
|
94cf741706
|
Answer architecture round 1: exempt only a calc operand from the read-once refusal, run the name passes from one list, read every operand's leaves, show a name operand in a README example, and plan a path through a name as an operand
|
2026-10-05 01:23:55 +02:00 |
|
lilleman
|
b4052f77f9
|
Accept a name as a calc operand
|
2026-10-05 01:23:55 +02:00 |
|
lilleman
|
cc8797744b
|
Answer architecture round 3: the generated header names go generate, one sorted-keys helper everywhere, one site constructor, and an inline folder reference refused before anything loads
|
2026-10-03 20:37:07 +02:00 |
|
lilleman
|
2bb795e08c
|
Split the picks and the name fences out of name.go, state the repeat refusal and the naming rule where they hold, and draw a memo's variants one way
|
2026-10-03 14:23:58 +02:00 |
|