parseman 0.1.0 → 0.1.1

package/README.md

@@ -1,5 +1,5 @@
 <p align="center">
-  <img src="assets/parseman.png" alt="Parmésan — 100% Pure Parsing" width="220" />
+  <img src="https://raw.githubusercontent.com/matthew-dean/parsecraft/main/assets/parseman.png" alt="Parmésan — 100% Pure Parsing" width="220" />
 </p>
 
 # Parmésan (PAR-zə-mahn)
@@ -8,6 +8,18 @@ Write parsers with combinators, then let the bundler plugin compile them to opti
 
 The same code runs without the plugin: the interpreter produces identical results. Use the macro build for production; skip it in tests and anywhere a bundler isn't in the picture.
 
+## Benchmarks
+
+Measured on Apple M2 Pro. Bars show µs per parse — shorter is faster.
+
+![JSON parsing benchmarks](https://raw.githubusercontent.com/matthew-dean/parsecraft/main/assets/bench-json.svg)
+
+![CSV parsing benchmarks](https://raw.githubusercontent.com/matthew-dean/parsecraft/main/assets/bench-csv.svg)
+
+Parmésan compiled edges out Peggy on small and medium JSON. At 12 kB Peggy pulls ahead by ~10% — it's been doing this a while. On CSV, where the grammar is non-recursive and fully inlines, Parmésan compiled wins going away.
+
+---
+
 ## Install
 
 ```bash
@@ -483,18 +495,6 @@ type CSTRawChild = CSTNode | CSTLeaf | CSTTrivia | CSTError
 
 ---
 
-## Benchmarks
-
-Measured on Apple M2 Pro. Bars show µs per parse — shorter is faster.
-
-![JSON parsing benchmarks](assets/bench-json.svg)
-
-![CSV parsing benchmarks](assets/bench-csv.svg)
-
-Parmésan compiled edges out Peggy on small and medium JSON. At 12 kB Peggy pulls ahead by ~10% — it's been doing this a while. On CSV, where the grammar is non-recursive and fully inlines, Parmésan compiled wins going away.
-
----
-
 ## Developing
 
 ```bash

package/dist/cst/incremental.d.ts

@@ -10,7 +10,7 @@ import type { NodeLike } from './types.ts';
  *   doc.errors  // ParseFail[], empty on success
  *   doc.input   // the source string that produced this tree
  *
- *   const doc2 = doc.edit(newSrc, changeStart, changeEnd)
+ *   const doc2 = doc.edit(changeStart, changeEnd, newText)  // "select from→to, type newText"
  */
 export interface ParseDoc<N extends NodeLike = NodeLike> {
     readonly tree: N | null;
@@ -19,16 +19,20 @@ export interface ParseDoc<N extends NodeLike = NodeLike> {
     /**
      * Incrementally re-parse after a text change.
      *
-     * @param changeStart  Byte offset where the change begins (same in old and new text).
-     * @param oldChangeEnd Byte offset where the replaced region ends in the OLD text (exclusive).
-     * @param newText      The replacement text (may be empty for a pure deletion).
+     * Think of it as "select from → to, replace with replacement": both `from`
+     * and `to` are byte offsets in the OLD input. `replacement` is what fills
+     * that range in the new text.
+     *
+     *   doc.edit(3, 7, 'hi')  →  old: "foo [XXXX] bar"   new: "foo hi bar"
+     *                                       ↑    ↑
+     *                                      from  to   (both in old text)
      *
      * Maps directly to editor change events:
-     *   VSCode:     doc.edit(change.rangeOffset, change.rangeOffset + change.rangeLength, change.text)
-     *   CodeMirror: doc.edit(change.from, change.to, change.insert)
-     *   LSP:        doc.edit(startByte, endByte, change.text)  // after line/col → byte conversion
+     *   VSCode / Monaco:  doc.edit(change.rangeOffset, change.rangeOffset + change.rangeLength, change.text)
+     *   CodeMirror 6:     doc.edit(change.from, change.to, change.insert)
+     *   LSP:              doc.edit(startByte, endByte, change.text)  // after line/col → byte offset
      */
-    edit(changeStart: number, oldChangeEnd: number, newText: string): ParseDoc<N>;
+    edit(from: number, to: number, replacement: string): ParseDoc<N>;
 }
 export declare function makeParseDoc<N extends NodeLike>(parser: Parser<N>, ruleName: string, input: string): ParseDoc<N>;
 //# sourceMappingURL=incremental.d.ts.map

package/dist/cst/incremental.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"incremental.d.ts","sourceRoot":"","sources":["../../src/cst/incremental.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAgB,SAAS,EAAE,MAAM,aAAa,CAAA;AAC1D,OAAO,KAAK,EAAE,MAAM,EAAY,MAAM,cAAc,CAAA;AACpD,OAAO,KAAK,EAAqB,QAAQ,EAAE,MAAM,YAAY,CAAA;AAM7D;;;;;;;;;;GAUG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC,SAAS,QAAQ,GAAG,QAAQ;IACrD,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAA;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS,EAAE,CAAA;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB;;;;;;;;;;;OAWG;IACH,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;CAC9E;AA+GD,wBAAgB,YAAY,CAAC,CAAC,SAAS,QAAQ,EAC7C,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EACjB,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,GACZ,QAAQ,CAAC,CAAC,CAAC,CAOb"}
+{"version":3,"file":"incremental.d.ts","sourceRoot":"","sources":["../../src/cst/incremental.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAgB,SAAS,EAAE,MAAM,aAAa,CAAA;AAC1D,OAAO,KAAK,EAAE,MAAM,EAAY,MAAM,cAAc,CAAA;AACpD,OAAO,KAAK,EAAqB,QAAQ,EAAE,MAAM,YAAY,CAAA;AAM7D;;;;;;;;;;GAUG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC,SAAS,QAAQ,GAAG,QAAQ;IACrD,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAA;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS,EAAE,CAAA;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB;;;;;;;;;;;;;;;OAeG;IACH,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;CACjE;AA+GD,wBAAgB,YAAY,CAAC,CAAC,SAAS,QAAQ,EAC7C,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EACjB,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,GACZ,QAAQ,CAAC,CAAC,CAAC,CAOb"}

package/dist/index.cjs

@@ -1646,11 +1646,11 @@ var ParseDocImpl = class _ParseDocImpl {
     this.errors = errors;
     this.input = input;
   }
-  edit(changeStart, oldChangeEnd, newText) {
-    const newInput = this.input.slice(0, changeStart) + newText + this.input.slice(oldChangeEnd);
+  edit(from, to, replacement) {
+    const newInput = this.input.slice(0, from) + replacement + this.input.slice(to);
     if (!this.tree) return makeParseDoc(this._parser, this._ruleName, newInput);
-    const delta = newText.length - (oldChangeEnd - changeStart);
-    const found = findContaining(this.tree, changeStart);
+    const delta = replacement.length - (to - from);
+    const found = findContaining(this.tree, from);
     if (!found) return makeParseDoc(this._parser, this._ruleName, newInput);
     const ancestors = ancestorsAt(this.tree, found.path);
     const candidates = [found];