Commit Graph

1209 Commits

Author SHA1 Message Date
lilleman 2e56af5d63 Record the reading cost of the last chunk 2026-10-10 11:24:32 +02:00
lilleman c320344fac Load each category of a source whose manifest carries an index on first reach, and move the shipped index into data/.fejkdata.json 2026-10-10 11:24:32 +02:00
lilleman 7d5b32fe3f Test that a source whose manifest carries an index loads each category on first reach, and that a data path loads only what it reads and what reaches what it replaces 2026-10-10 11:24:32 +02:00
lilleman 8d309cd827 Rescore: the paired ruling at 8b5a972 against 2652779 is the same 2026-10-09 18:57:01 +02:00
lilleman f663e1af1e Record the maintainer's answers: a manifest names no fejkdata version and item 183 goes, and the shipped data is held under 100 MiB by item 192, past which item 193 carves out Go modules 2026-10-09 18:57:01 +02:00
lilleman 3744b60f7f Answer goals audit round 1: item 182 names the import guard and the embedded manifest, and item 183 says Go module 2026-10-09 18:57:01 +02:00
lilleman 687a3d37bf Answer prose round 1: module means fejkdata's unit and Go module the Go one, only anyone else's manifest names a version, goal 2.3 says a program links what it imports, and a carved-out module requires the core release that drops its package 2026-10-09 18:57:01 +02:00
lilleman 22ca7caa40 Record the reading cost of the last chunk 2026-10-09 18:57:01 +02:00
lilleman 3e12849f65 Ship the data as Go packages in the core's module: goal 2.3 and the shipped-data decision say packages, item 179 goes, items 180 to 186 follow, and item 191 files the release tag-guard bug 2026-10-09 18:57:01 +02:00
lilleman dc32e24188 Plan item 190: decide whether fejkdata pseudonymises real datasets 2026-10-09 16:38:09 +02:00
lilleman b08b3e94d5 Answer prose round 1: the exact-match reason reads one idea a sentence, and item 180 says its goal-13 effect once 2026-10-09 15:00:50 +02:00
lilleman c597d0a2e0 Record the maintainer's answers: an exact version match, goal 6.3 for modules that load on first reach, and items 79 and 54 folded into items 180 and 179 2026-10-09 15:00:50 +02:00
lilleman 24a30161f7 Answer prose round 1: the decision keeps only what the goals leave open, and the new items' taglines read once 2026-10-09 14:43:13 +02:00
lilleman 65ccc132ae Record the reading cost of the last chunk 2026-10-09 14:43:13 +02:00
lilleman 9558472c96 Split item 77 into items 179 to 189, and record its module decision in docs/decisions.md 2026-10-09 14:43:13 +02:00
lilleman fa734fda3c Answer prose round 1: AGENTS.md names the paired ruling as what still blocks a 0.1.0 merge, item 107 promises what item 178 plans, and the floor entry says one thing a sentence 2026-10-09 14:14:59 +02:00
lilleman 30a4445a47 Ship 0.1.0 under the comprehension floor, drop item 176, and plan item 107 for 0.2.0 behind an architect's plan for grouping and untangling the engine 2026-10-09 14:14:59 +02:00
lilleman 265277953c Rescore: the paired ruling at 344023d against 1c342bc is better 2026-10-09 13:11:50 +02:00
lilleman edec28f58f Answer prose round 1: the Data paragraph names the set first, the choice comment says what shared counts, and the plan's new items read once 2026-10-09 13:11:50 +02:00
lilleman 0243e8d42d Answer product-owner round 1: the Data section names the geo trees, and Layout says what the docs records hold 2026-10-09 13:11:50 +02:00
lilleman 18a264db59 Answer stability round 1: the choice comment defines shared, and names none of its readers 2026-10-09 13:11:50 +02:00
lilleman fd6d80e2c2 Wrap the README's Data paragraph 2026-10-09 13:11:50 +02:00
lilleman 3d62683c69 Move the scoring runs of ad59967 and b9d1af6 into the comprehension history 2026-10-09 13:11:50 +02:00
lilleman f30bdc1380 Record the reading cost of the chunk before item 153 2026-10-09 13:11:50 +02:00
lilleman 5d85944359 Record the 2026-10-09 panel's scores, file what it named as items 170 to 177, and correct four claims it found false 2026-10-09 13:11:50 +02:00
lilleman b9d1af6565 Answer prose round 1: loadCallerPath's name and docstring say it loads, and that the caller walks next 2026-10-09 12:43:20 +02:00
lilleman 51c0bd518e Record the reading cost of the chunk before item 151 2026-10-09 12:43:20 +02:00
lilleman 00f31e6f59 Load a caller's path in the one method that splits it, so Fake and FakeRecord walk only what has loaded 2026-10-09 12:43:20 +02:00
lilleman c9ad86a2dd Close item 148 2026-10-09 12:35:12 +02:00
lilleman 1c342bc2af Rescore: the paired ruling at 8433689 against d74c0ed is better 2026-10-09 12:35:12 +02:00
lilleman a318dc7f42 Answer prose round 1: fence's docstring splits rule, shapes and result, each drop message names what was missing, the US geo row says a place needs a street, and file item 169 2026-10-09 12:35:12 +02:00
lilleman 32e01565b4 Answer architecture round 3: fence's docstring says a locality needs entries in both child maps, and zcta_localities says what it maps to 2026-10-09 12:35:12 +02:00
lilleman c032cb779c Answer architecture round 2: street.tsv is written from the kept localities, fence checks a child holds rows, and its names say what they hold 2026-10-09 12:35:12 +02:00
lilleman b49e0cac6e Rescore: the paired ruling at c27e8b7 against d74c0ed is better 2026-10-09 12:35:12 +02:00
lilleman 71b17d104b Answer architecture round 1: fence keeps a locality holding both a street and a postal code, returns what it dropped so the SE import still exits on a lost kommun and the US one counts its counties, and file item 168 for data-import tests 2026-10-09 12:35:12 +02:00
lilleman 4f369b961c Record the reading cost, and refresh item 167's figures 2026-10-09 12:35:12 +02:00
lilleman 6d285249e4 Meet the parent-has-a-child fence in one shared geo.fence step, which states the locality row each country hands it 2026-10-09 12:35:12 +02:00
lilleman 825b01408b Answer prose round 1: the skips comment holds for routeSteps, the finder is named for what it finds, and the failure names which list to extend 2026-10-09 12:00:54 +02:00
lilleman 5945a32bc3 Answer stability round 1: a method is keyed by its receiver, and panicsOnOtherNodeKinds names what it checks 2026-10-09 12:00:54 +02:00
lilleman ae5a4e5a6c Record the reading cost, and refresh item 167's files 2026-10-09 12:00:54 +02:00
lilleman 0d7aee50a2 Close item 10 2026-10-09 12:00:54 +02:00
lilleman 8338f0a5e3 Find every node switch with a panicking default from the source, and test routeSteps beside the seven listed by hand 2026-10-09 12:00:54 +02:00
lilleman 588cb328bf Rename item 167 to the title larv-review now files 2026-10-09 11:48:47 +02:00
lilleman d74c0ed7eb Rescore: the paired ruling at d9f0fc9 against ee4b40b is better 2026-10-09 11:32:51 +02:00
lilleman f81aa1a56e Reuse the leaf's moved key in readUnder, so the lowest Go meets the allocation gate 2026-10-09 11:32:51 +02:00
lilleman 5a010952d6 Rescore: the paired ruling at 65a32db against ee4b40b is better 2026-10-09 11:32:51 +02:00
lilleman 75c8b74cdc Answer stability round 3: the selector hint asks bindsField 2026-10-09 11:32:51 +02:00
lilleman 8989cae9d9 Answer prose round 1: the keep rule names what is kept and who decides, headSpans says what it counts, and compileStep and config.load stop restating 2026-10-09 11:32:51 +02:00
lilleman 2bd04b528a Answer stability round 2: only a name bound to a reference hints reading the row without it 2026-10-09 11:32:51 +02:00
lilleman 76277ed61a Test the selector hint's new wording, read the row without the name 2026-10-09 11:32:51 +02:00