 lilleman
|
85cc000d23
|
Drop the backfilled date where a decision already records its own
|
2026-09-29 20:12:33 +02:00 |
|
|
lilleman
|
dbac4c5ad8
|
Date every decision from the history that first names it, and credit it to Lilleman
|
2026-09-29 18:41:41 +02:00 |
|
|
lilleman
|
e84522f244
|
Scope the held-reference decision to a draw group, and give both hold decisions their goal
|
2026-09-29 16:50:44 +02:00 |
|
|
lilleman
|
f1b0cda818
|
Say a draw group holds a reference path, and correct the stale hold wording
|
2026-09-29 14:45:34 +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
|
79e63829c4
|
Keep the four path walks: one loop fails the allocation gate
|
2026-09-29 11:04:05 +02:00 |
|
|
lilleman
|
d519a61f58
|
Keep Fake as the one example of a shared name
|
2026-09-29 04:31:25 +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
|
243094e4ab
|
Name every Fake receiver and fold the function-method rule into its test in the one-name decision
|
2026-09-28 23:32:31 +02:00 |
|
|
lilleman
|
54d933ecc2
|
Name renderScope.groupHold for what it returns, correct pathDraw's pins comment, and drop the done round item
|
2026-09-28 23:32:31 +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
|
e4d075af6c
|
Name the hold set in the decision's first line
|
2026-09-28 19:08:07 +02:00 |
|
|
lilleman
|
a1852076fe
|
Start a named draw group from an empty hold, and state the decision's goal and cost exactly
|
2026-09-28 19:08:07 +02:00 |
|
|
lilleman
|
1b9cf00a26
|
Start every render from the zero hold set
|
2026-09-28 19:08:07 +02:00 |
|
|
lilleman
|
ce469cb3a3
|
State the row lookup whole in the key-map decision
|
2026-09-28 12:06:03 +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
|
2254b33f0e
|
Keep the binding's prose to what its code cannot say
|
2026-09-28 10:53:26 +02:00 |
|
|
lilleman
|
01a60d06f1
|
Name the inline drawGroup refusal as a binding's reference fence, beside the cycle fence
|
2026-09-28 10:53:26 +02:00 |
|
|
lilleman
|
cfe653de4d
|
Run New, NewTemplate and FakeStruct through one bind pipeline naming where they differ
|
2026-09-28 10:53:26 +02:00 |
|
|
lilleman
|
9ea8f84421
|
Approve and reword the link-time checks decision
|
2026-09-28 10:21:25 +02:00 |
|
|
lilleman
|
ecb90f828f
|
Correct the comments and decision around link-time compilation
|
2026-09-28 03:23:27 +02:00 |
|
|
lilleman
|
306b88ef56
|
Compile every format at link
|
2026-09-28 03:23:27 +02:00 |
|
|
lilleman
|
2d506e79eb
|
Approve the four-loops decision
|
2026-09-28 02:31:52 +02:00 |
|
|
lilleman
|
e9bb89f044
|
Correct and trim the comments around the path walks
|
2026-09-28 00:55:48 +02:00 |
|
|
lilleman
|
79cacb2823
|
Record that the probe's drawn map is never nil
|
2026-09-28 00:55:48 +02:00 |
|
|
lilleman
|
060fb42fee
|
Refuse a selector on a template before its level fence, give pathCheck one entry over its own tail, and scope the probe decision to descend
|
2026-09-28 00:55:48 +02:00 |
|
|
lilleman
|
1073232ca7
|
Record why the probe has no entry function
|
2026-09-28 00:55:48 +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
|
52292d3669
|
Number the first postort ids in name order, keep them by the unique name, and rewrap
|
2026-09-27 23:17:37 +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
|
8c4ee8362e
|
Name the near miss by the row whose cell spells it, retire the rules the key-only selector makes false, and ask which key each table keeps
|
2026-09-27 17:01:35 +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
|
55eacf0319
|
Leave a path stepping up and back down an open question, and say List stops advertising a path ending on a link column
|
2026-09-27 16:48:20 +02:00 |
|
|
lilleman
|
4ec20e6e3a
|
Scope the step up to drawn rows too, name the format rewrite and what Fake, List and records do, and leave the second-spelling question open
|
2026-09-27 16:48:20 +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
|
430bdbcaae
|
Rewrap the render-draw decision
|
2026-09-27 15:08:58 +02:00 |
|
|
lilleman
|
98b25177e7
|
Name goal 4's check and the rewrite the refusal offers, scope the render-draw decision to unselected paths, and state the step-up clash
|
2026-09-27 15:08:58 +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
|
203b235fdd
|
State the copy rule on renderScope once, and say the allocation gate prices what keeps a hold set off the heap
|
2026-09-26 15:17:05 +02:00 |
|
|
lilleman
|
c0cbb71d26
|
Define what one meaning is in the naming decision
|
2026-09-25 19:31:09 +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
|
57966b59ee
|
Say what makes rows alternatives without history, and drop what the whole-draw rule already implies
|
2026-09-25 08:39:38 +02:00 |
|
|
lilleman
|
3500f8e1c3
|
Hold every whole draw's row a walk is in, so a nested whole draw keeps the outer one's
|
2026-09-25 08:39:38 +02:00 |
|
|
lilleman
|
4a016c119c
|
Have the probe report the tables a read draws, and hold a row rendered whole in drawAt apart from the pins
|
2026-09-25 08:39:38 +02:00 |
|