parseman 0.60.0 → 0.60.2

package/dist/table/assemble.d.ts

@@ -227,7 +227,7 @@ export declare class AssemblyCache {
      * That is not a hole in G5, it is G5's own first clause: "quickly building the
      * grammar reference ON RUN START, making some swaps on rules or sub-rules, and
      * then the run actually runs with no logic branching for that option input"
-     * (`notes/TABLE-DRIVER.md`). This IS the run-start step. What the criterion
+     * (`notes/history/TABLE-DRIVER.md`). This IS the run-start step. What the criterion
      * forbids is the second sentence, and past this call there is no option read
      * anywhere — `scripts/check-invariants.mjs` INV-6 decides that mechanically.
      *

package/dist/table/compile-rule-map.d.ts

@@ -57,7 +57,7 @@ export type TableRuleMapOptions = {
      * `coverage: grammarCoverage` here for every `rules()` grammar — so this is what
      * makes `{ grammarCoverage: true }` a working build under the table lowering.
      *
-     * COUNTERS ONLY, per the owner ruling recorded in `notes/RELEASE-0.48-TARGET.md`
+     * COUNTERS ONLY, per the owner ruling recorded in `notes/history/RELEASE-0.48-TARGET.md`
      * §1; `_grammarTrace` parity is 0.48 work. The plugin's coverage path needs the
      * DEFINITIONS STAMP and the HITS, and both are here.
      */

package/dist/table/compile.d.ts

@@ -34,7 +34,7 @@ export type TableCompileOptions = {
      *
      * COUNTERS ONLY — owner ruling. `_grammarTrace`'s six phases are emitted at
      * ~40 fine-grained sites by codegen and are deferred to 0.48
-     * (`notes/RELEASE-0.48-TARGET.md` §1). A table entry rejects a context carrying
+     * (`notes/history/RELEASE-0.48-TARGET.md` §1). A table entry rejects a context carrying
      * a trace sink before parsing: silently returning an empty trace would look
      * exactly like a real trace whose grammar sites were never visited. The
      * plugin's coverage path reads `_grammarCoverage` and the definitions stamp,

package/dist/table/exec.d.ts

@@ -1,39 +1,4 @@
 import { type CompactProgram, type TableProgram, type TableRule } from './program.ts';
-/**
- * DIAGNOSTIC ROW COUNTER — off unless `PM_TABLE_COUNT=1` at process start.
- *
- * Read ONCE, at module load, into a module const, so this is not the per-parse
- * option branch G5 forbids: with the variable false the whole thing folds away
- * after tier-up. It exists because "too many rows" and "each row too slow" are
- * different defects with the same symptom, and only a count separates them.
- * No timing run in this repo may set it — see `bench/jess/table-rows.ts`.
- */
-export declare const tableCounters: {
-    rows: number;
-    byOp: Int32Array;
-    /** Distinct reducer/host functions actually reaching each shared call site. */
-    sites: Map<string, Set<unknown>>;
-    /**
-     * SPECULATION AT UNGATED CHOICES. `encode.ts:368-376` gives a choice its
-     * first-char dispatch only when NO arm is nullable, ALL arms are pairwise
-     * disjoint and ALL map to a char class; any one failure ungates every arm of
-     * the site, which then runs the linear loop below. Codegen has no such
-     * all-or-nothing rule — `emitFirstMatch` guards each arm on its OWN first set
-     * — so these counts are work the table does and the compiled engine does not.
-     *
-     * `ungatedEntries` is arms entered there; `ungatedFails` is those that then
-     * failed, which is pure waste by construction: a failing arm consumed nothing
-     * the winning arm will not scan again.
-     */
-    ungatedEntries: number;
-    ungatedFails: number;
-    /** Rows executed INSIDE failed ungated arms — the subtree each wasted entry drags. */
-    ungatedFailRows: number;
-    gatedEntries: number;
-    /** Arm entries DECLINED by the per-arm class gate — the work this change removes. */
-    armGateSkips: number;
-};
-export declare function resetTableCounters(): void;
 /**
  * THE REFERENCE DRIVER. Turn a program into a rule map, by INTERPRETING the
  * bytecode. Nothing ships on this — `tableRules` (`table/assemble.ts`) is

package/dist/table/exec.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"exec.d.ts","sourceRoot":"","sources":["../../src/table/exec.ts"],"names":[],"mappings":"AA6CA,OAAO,EAEL,KAAK,cAAc,EACF,KAAK,YAAY,EAAE,KAAK,SAAS,EACnD,MAAM,cAAc,CAAA;AA4BrB;;;;;;;;GAQG;AACH,eAAO,MAAM,aAAa,EAAE;IAC1B,IAAI,EAAE,MAAM,CAAA;IACZ,IAAI,EAAE,UAAU,CAAA;IAChB,+EAA+E;IAC/E,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAA;IAChC;;;;;;;;;;;OAWG;IACH,cAAc,EAAE,MAAM,CAAA;IACtB,YAAY,EAAE,MAAM,CAAA;IACpB,sFAAsF;IACtF,eAAe,EAAE,MAAM,CAAA;IACvB,YAAY,EAAE,MAAM,CAAA;IACpB,qFAAqF;IACrF,YAAY,EAAE,MAAM,CAAA;CAC+H,CAAA;AAUrJ,wBAAgB,kBAAkB,IAAI,IAAI,CASzC;AAuoDD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,SAAS,CACvB,MAAM,EAAE,YAAY,GAAG,cAAc;AACrC;;;;;;;;GAQG;AACH,IAAI,GAAE;IAAE,QAAQ,CAAC,EAAE,OAAO,CAAA;CAAO,EACjC,gBAAgB,GAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAM,GACvD,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAiC3B"}
+{"version":3,"file":"exec.d.ts","sourceRoot":"","sources":["../../src/table/exec.ts"],"names":[],"mappings":"AA6CA,OAAO,EAEL,KAAK,cAAc,EACF,KAAK,YAAY,EAAE,KAAK,SAAS,EACnD,MAAM,cAAc,CAAA;AAkpDrB;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,SAAS,CACvB,MAAM,EAAE,YAAY,GAAG,cAAc;AACrC;;;;;;;;GAQG;AACH,IAAI,GAAE;IAAE,QAAQ,CAAC,EAAE,OAAO,CAAA;CAAO,EACjC,gBAAgB,GAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAM,GACvD,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAiC3B"}

package/dist/table/index.js

@@ -5728,7 +5728,7 @@ function projectChild(children2, project, type) {
 }
 
 // src/version.ts
-var PARSEMAN_VERSION = "0.60.0";
+var PARSEMAN_VERSION = "0.60.2";
 
 // src/table/assemble.ts
 import { PlainBuf as PlainBuf2, PlainField, PlainLeaf as PlainLeaf8, PlainNode as PlainNode2, PlainSpan as PlainSpan9 } from "../cst/plain.js";
@@ -13265,7 +13265,7 @@ var AssemblyCache = class {
    * That is not a hole in G5, it is G5's own first clause: "quickly building the
    * grammar reference ON RUN START, making some swaps on rules or sub-rules, and
    * then the run actually runs with no logic branching for that option input"
-   * (`notes/TABLE-DRIVER.md`). This IS the run-start step. What the criterion
+   * (`notes/history/TABLE-DRIVER.md`). This IS the run-start step. What the criterion
    * forbids is the second sentence, and past this call there is no option read
    * anywhere — `scripts/check-invariants.mjs` INV-6 decides that mechanically.
    *
@@ -15136,7 +15136,7 @@ var Encoder = class {
    * simply parses it with the gate switched off at every choice arm that reaches
    * a hole.
    *
-   * Measured on jess's less grammar (`bench/jess/macro-program-diff.ts`): 195 of
+   * Measured on jess's less grammar (with the one-off `macro-program-diff` bench, last at `4a5d0341`): 195 of
    * 562 reachable choice arms carried NO first set in the shipped artifact
    * against 103 of 540 in the runtime encode, and 10 dispatch sites lost the O(1)
    * `exclusive` piece (`assemble.ts:1758`) for the candidate-mask loop. With this