Commit Graph

191 Commits

Author SHA1 Message Date
lilleman 90be0ee6d8 Make everything replaceable goal 9, require changing inputs in the library and default them in the CLI, and record item 77's answers 2026-10-04 23:08:31 +02:00
lilleman b2406ef4bc Answer prose round 3: say where NaN prints, and leave item 77's option name open 2026-10-04 17:00:28 +02:00
lilleman fd313b76b6 Wrap the zero-divisor decision's last lines 2026-10-04 17:00:28 +02:00
lilleman 665c532f8c Answer prose and product-owner round 2: one idea per sentence in items 77 and 81, item 77's open API points, and NaN explained where the decision names it 2026-10-04 17:00:28 +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 fa49e8ad2b Refuse a template that could render an invalid value, count TSV tables as data, and promise one output per seed and version 2026-10-04 17:00:28 +02:00
lilleman 1538d1ab2c Say that loadShipped follows the reads of everything it loads, and what the 45 ms holds 2026-10-03 20:37:07 +02:00
lilleman f608040986 Answer prose round 2: item 79 names every set it loads, New maps a data author's keys, and fewer comments restating the code 2026-10-03 20:37:07 +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 1d6b96143f Plan on-demand shipped data first: a build-time index, data modules for the library, and population-weighted 10% geo slices 2026-10-03 16:47:52 +02:00
lilleman 568c875888 Let misc.timezone drop the zones of unshipped territories: agreement wins over the last rows 2026-10-03 16:02:11 +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 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
lilleman 62214370ed Make the names prose true of the code and readable on one pass, and state each refusal once 2026-10-03 14:23:58 +02:00
lilleman 740f2bc3bd Refuse a name read across draw groups or in a repeat where it reads a reference path, or read once; name the spelling in each refusal 2026-10-03 14:23:58 +02:00
lilleman b1aed332e7 Keep in a pick only what reads of its name address, look frames up on the stack alone, and refuse a name read once whole 2026-10-03 14:23:58 +02:00
lilleman df63d0f562 Draw a pick's references in the draw group of the read of the name, where the draw fences survey them 2026-10-03 14:23:58 +02:00
lilleman 4362905b82 Fix a render's fallback frame to its unnamed group, and draw a pick's references in draw groups of its own 2026-10-03 14:23:58 +02:00
lilleman d0c477ec78 Keep a name's frame with the read entering its category, refuse a binding in a choice's item, and read a name as a transform operand 2026-10-03 14:23:58 +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 724937e9ae Weigh each goal 0.05 below the one before it, a sub-goal as its goal 2026-10-03 01:29:22 +02:00
lilleman ae70c31d96 Answer prose round 2: one spelling for a dependency, the recorded score explained, the tld miss filed 2026-10-03 01:29:22 +02:00
lilleman a260feefe8 Answer the prose review: decision lines by goal, item details true after the restructure, defects kept 2026-10-03 01:29:22 +02:00
lilleman c3d47e5b21 Reshape todo.md into the scored table, planning the draw restructure first 2026-10-03 01:29:22 +02:00
lilleman 4bf8deddb4 Name the goals behind probing a path before drawing it, and cut comments restating their code 2026-09-30 20:20:28 +02:00
lilleman 270ba93fbe Name a failed step's index in drawSteps' panics, and quote the decision's measurement as the experiment it was 2026-09-30 20:20:28 +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 d279408ba5 Step a table's routes past its selector, and panic on an arm with no bound head 2026-09-30 20:02:16 +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 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 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