@reiwuzen/blocky 1.1.1 → 1.2.0

package/package.json

@@ -1,30 +1,27 @@
 {
   "name": "@reiwuzen/blocky",
-  "version": "1.1.1",
+  "version": "1.2.0",
   "description": "Pure TypeScript block editor engine. Headless, framework-agnostic — content mutation, formatting, transforms, serialization, and history.",
+  "author": "Rei WuZen",
+  "license": "ISC",
   "type": "module",
-  "main": "dist/index.js",
-  "types": "dist/index.d.ts",
+  "sideEffects": false,
+  "main": "./dist/index.cjs",
+  "module": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js",
+      "require": "./dist/index.cjs"
+    }
+  },
   "files": [
     "dist"
   ],
-  "scripts": {
-    "build": "tsc",
-    "dev": "tsc --watch",
-    "clean": "rimraf dist",
-    "test": "tsx tests/test.ts"
+  "engines": {
+    "node": ">=18"
   },
-  "keywords": [
-    "block-editor",
-    "headless-editor",
-    "block-based",
-    "rich-text",
-    "editor-engine",
-    "editor-core",
-    "typescript"
-  ],
-  "author": "Rei WuZen",
-  "license": "ISC",
   "dependencies": {
     "uuid": "^13.0.0"
   },
@@ -33,13 +30,23 @@
   },
   "devDependencies": {
     "rimraf": "^6.0.1",
+    "tsup": "^8.5.1",
     "tsx": "^4.19.3",
     "typescript": "^5.9.3"
   },
-  "exports": {
-    ".": {
-      "import": "./dist/index.js",
-      "types": "./dist/index.d.ts"
-    }
+  "keywords": [
+    "block-editor",
+    "headless-editor",
+    "block-based",
+    "rich-text",
+    "editor-engine",
+    "editor-core",
+    "typescript"
+  ],
+  "scripts": {
+    "clean": "rimraf dist",
+    "build": "tsup src/index.ts --format esm,cjs --dts --clean",
+    "dev": "tsup src/index.ts --format esm,cjs --dts --watch",
+    "test": "tsx tests/test.ts"
   }
-}
+}

package/dist/engine/block.d.ts

@@ -1,13 +0,0 @@
-import type { AnyBlock, Node } from "../types/block";
-import { Result } from "@reiwuzen/result";
-import { splitBlock, mergeBlocks } from "./content";
-/**─── Wrappers ──────────────────────────────────────────────────────────────────
-* Each function runs the content engine operation and returns Result<AnyBlock>
-instead of Result<BlockContent<T>> — caller gets the full updated block back.
-*/
-export declare function blockInsertAt(block: AnyBlock, nodeIndex: number, offset: number, incoming: Node): Result<AnyBlock>;
-export declare function blockDeleteLastChar(block: AnyBlock): Result<AnyBlock>;
-export declare function blockDeleteRange(block: AnyBlock, startNodeIndex: number, startOffset: number, endNodeIndex: number, endOffset: number): Result<AnyBlock>;
-export declare function blockReplaceRange(block: AnyBlock, startNodeIndex: number, startOffset: number, endNodeIndex: number, endOffset: number, incoming: Node): Result<AnyBlock>;
-export { splitBlock, mergeBlocks };
-//# sourceMappingURL=block.d.ts.map

package/dist/engine/block.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"block.d.ts","sourceRoot":"","sources":["../../src/engine/block.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAoB,IAAI,EAAE,MAAM,gBAAgB,CAAC;AACvE,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAC1C,OAAO,EAKL,UAAU,EACV,WAAW,EACZ,MAAM,WAAW,CAAC;AAEnB;;;EAGE;AAEF,wBAAgB,aAAa,CAC3B,KAAK,EAAE,QAAQ,EACf,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,IAAI,GACb,MAAM,CAAC,QAAQ,CAAC,CAQlB;AAED,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,CAQrE;AAED,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,QAAQ,EACf,cAAc,EAAE,MAAM,EACtB,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,MAAM,GAChB,MAAM,CAAC,QAAQ,CAAC,CAQlB;AAED,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,QAAQ,EACf,cAAc,EAAE,MAAM,EACtB,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,IAAI,GACb,MAAM,CAAC,QAAQ,CAAC,CASlB;AAGD,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC"}

package/dist/engine/block.js

@@ -1,26 +0,0 @@
-import { insertAt, deleteLastChar, deleteRange, replaceRange, splitBlock, mergeBlocks, } from "./content";
-/**─── Wrappers ──────────────────────────────────────────────────────────────────
-* Each function runs the content engine operation and returns Result<AnyBlock>
-instead of Result<BlockContent<T>> — caller gets the full updated block back.
-*/
-export function blockInsertAt(block, nodeIndex, offset, incoming) {
-    return insertAt(block, nodeIndex, offset, incoming).map((content) => ({
-        ...block,
-        content,
-    }));
-}
-export function blockDeleteLastChar(block) {
-    return deleteLastChar(block).map((content) => ({
-        ...block,
-        content,
-    }));
-}
-export function blockDeleteRange(block, startNodeIndex, startOffset, endNodeIndex, endOffset) {
-    return deleteRange(block, startNodeIndex, startOffset, endNodeIndex, endOffset).map((content) => ({ ...block, content }));
-}
-export function blockReplaceRange(block, startNodeIndex, startOffset, endNodeIndex, endOffset, incoming) {
-    return replaceRange(block, startNodeIndex, startOffset, endNodeIndex, endOffset, incoming).map((content) => ({ ...block, content }));
-}
-// splitBlock already returns Result<[AnyBlock, AnyBlock]> — re-exported as-is
-export { splitBlock, mergeBlocks };
-//# sourceMappingURL=block.js.map

package/dist/engine/block.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"block.js","sourceRoot":"","sources":["../../src/engine/block.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,QAAQ,EACR,cAAc,EACd,WAAW,EACX,YAAY,EACZ,UAAU,EACV,WAAW,GACZ,MAAM,WAAW,CAAC;AAEnB;;;EAGE;AAEF,MAAM,UAAU,aAAa,CAC3B,KAAe,EACf,SAAiB,EACjB,MAAc,EACd,QAAc;IAEd,OAAO,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,GAAG,CACrD,CAAC,OAAO,EAAE,EAAE,CACV,CAAC;QACC,GAAG,KAAK;QACR,OAAO;KACR,CAAa,CACjB,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,KAAe;IACjD,OAAO,cAAc,CAAC,KAAK,CAAC,CAAC,GAAG,CAC9B,CAAC,OAAO,EAAE,EAAE,CACV,CAAC;QACC,GAAG,KAAK;QACR,OAAO;KACR,CAAa,CACjB,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC9B,KAAe,EACf,cAAsB,EACtB,WAAmB,EACnB,YAAoB,EACpB,SAAiB;IAEjB,OAAO,WAAW,CAChB,KAAK,EACL,cAAc,EACd,WAAW,EACX,YAAY,EACZ,SAAS,CACV,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,CAAa,CAAC,CAAC;AAC1D,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC/B,KAAe,EACf,cAAsB,EACtB,WAAmB,EACnB,YAAoB,EACpB,SAAiB,EACjB,QAAc;IAEd,OAAO,YAAY,CACjB,KAAK,EACL,cAAc,EACd,WAAW,EACX,YAAY,EACZ,SAAS,EACT,QAAQ,CACT,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,CAAa,CAAC,CAAC;AAC1D,CAAC;AAED,8EAA8E;AAC9E,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC"}

package/dist/engine/content.d.ts

@@ -1,46 +0,0 @@
-import type { Node, AnyBlock, BlockContent, BlockType } from '../types/block';
-import { Result } from '@reiwuzen/result';
-/**
- * Insert a Node at a specific position within block content.
- *
- * - nodeIndex: which node to insert into
- * - offset: char position within that node
- *
- * End-of-node (offset === length) naturally becomes an append —
- * sliceNode produces no right half, incoming merges with left or gets pushed.
- * No separate append function needed.
- */
-export declare function insertAt<T extends BlockType>(block: AnyBlock, nodeIndex: number, offset: number, incoming: Node): Result<BlockContent<T>>;
-export declare function deleteLastChar(block: AnyBlock): Result<BlockContent<BlockType>>;
-/**
- * Delete content across a selection.
- * After deletion, left and right boundaries are merged if formats match.
- *
- * For code/equation blocks: deletes within the single tuple node's text/latex.
- */
-export declare function deleteRange<T extends BlockType>(block: AnyBlock, startNodeIndex: number, startOffset: number, endNodeIndex: number, endOffset: number): Result<BlockContent<T>>;
-/**
- * Split a block at a given position into two blocks.
- * The original block keeps content before the cursor.
- * A new block gets content after the cursor — always of type "paragraph".
- *
- * Not supported for code/equation blocks — returns Err.
- */
-export declare function splitBlock(block: AnyBlock, nodeIndex: number, offset: number): Result<[AnyBlock, AnyBlock]>;
-/**
- * Merge blockB into blockA — blockB's content is appended to blockA's content.
- * blockA's type and meta are preserved.
- *
- * Not supported if either block is code or equation — returns Err.
- */
-export declare function mergeBlocks(blockA: AnyBlock, blockB: AnyBlock): Result<AnyBlock>;
-/**
- * Replace a selected range with an incoming Node — atomic deleteRange + insertAt.
- * This is what fires when the user has a selection and types a character.
- *
- * Internally chains:
- *   1. deleteRange  — remove selected content
- *   2. insertAt     — insert incoming at the start of the deleted range
- */
-export declare function replaceRange<T extends BlockType>(block: AnyBlock, startNodeIndex: number, startOffset: number, endNodeIndex: number, endOffset: number, incoming: Node): Result<BlockContent<T>>;
-//# sourceMappingURL=content.d.ts.map

package/dist/engine/content.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"content.d.ts","sourceRoot":"","sources":["../../src/engine/content.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAE9E,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAmD1C;;;;;;;;;GASG;AACH,wBAAgB,QAAQ,CAAC,CAAC,SAAS,SAAS,EAC1C,KAAK,EAAE,QAAQ,EACf,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,IAAI,GACb,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CA4EzB;AAID,wBAAgB,cAAc,CAAC,KAAK,EAAE,QAAQ,GAAG,MAAM,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAgC/E;AAKD;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,CAAC,SAAS,SAAS,EAC7C,KAAK,EAAE,QAAQ,EACf,cAAc,EAAE,MAAM,EACtB,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,MAAM,GAChB,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CA8DzB;AAID;;;;;;GAMG;AACH,wBAAgB,UAAU,CACxB,KAAK,EAAE,QAAQ,EACf,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,GACb,MAAM,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAwC9B;AAID;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,QAAQ,EAChB,MAAM,EAAE,QAAQ,GACf,MAAM,CAAC,QAAQ,CAAC,CAsBlB;AAKD;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,CAAC,SAAS,SAAS,EAC9C,KAAK,EAAE,QAAQ,EACf,cAAc,EAAE,MAAM,EACtB,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,IAAI,GACb,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAUzB"}

package/dist/engine/content.js

@@ -1,317 +0,0 @@
-import { generateId } from '../utils/block';
-import { Result } from '@reiwuzen/result';
-import { formatsMatch } from './format';
-// ─── Helpers ───────────────────────────────────────────────────────────────────
-function isClean(node) {
-    return (node.bold === undefined &&
-        node.italic === undefined &&
-        node.underline === undefined &&
-        node.strikethrough === undefined &&
-        node.highlighted === undefined &&
-        node.color === undefined &&
-        node.link === undefined);
-}
-function getTextLength(node) {
-    if (node.type === "text" || node.type === "code")
-        return node.text.length;
-    if (node.type === "equation")
-        return node.latex.length;
-    return 0;
-}
-function tryMerge(a, b) {
-    if (a.type !== b.type)
-        return null;
-    if (a.type === "code" && b.type === "code")
-        return { ...a, text: a.text + b.text };
-    if (a.type === "equation" && b.type === "equation")
-        return { ...a, latex: a.latex + b.latex };
-    if (a.type === "text" && b.type === "text") {
-        if ((isClean(a) && isClean(b)) || formatsMatch(a, b))
-            return { ...a, text: a.text + b.text };
-    }
-    return null;
-}
-function sliceNode(node, start, end) {
-    if (start >= end)
-        return null;
-    if (node.type === "text") {
-        const text = node.text.slice(start, end);
-        return text.length ? { ...node, text } : null;
-    }
-    if (node.type === "code") {
-        const text = node.text.slice(start, end);
-        return text.length ? { ...node, text } : null;
-    }
-    if (node.type === "equation") {
-        const latex = node.latex.slice(start, end);
-        return latex.length ? { ...node, latex } : null;
-    }
-    return null;
-}
-// ─── insertAt (sole public API) ────────────────────────────────────────────────
-/**
- * Insert a Node at a specific position within block content.
- *
- * - nodeIndex: which node to insert into
- * - offset: char position within that node
- *
- * End-of-node (offset === length) naturally becomes an append —
- * sliceNode produces no right half, incoming merges with left or gets pushed.
- * No separate append function needed.
- */
-export function insertAt(block, nodeIndex, offset, incoming) {
-    // ── code block ────────────────────────────────────────────────────────────
-    if (block.type === "code") {
-        if (incoming.type !== "code")
-            return Result.Err(`code block only accepts a code node, got "${incoming.type}"`);
-        const node = block.content[0];
-        if (offset < 0 || offset > node.text.length)
-            return Result.Err(`offset (${offset}) out of bounds for code node`);
-        const text = node.text.slice(0, offset) + incoming.text + node.text.slice(offset);
-        return Result.Ok([{ ...node, text }]);
-    }
-    // ── equation block ────────────────────────────────────────────────────────
-    if (block.type === "equation") {
-        if (incoming.type !== "equation")
-            return Result.Err(`equation block only accepts an equation node, got "${incoming.type}"`);
-        const node = block.content[0];
-        if (offset < 0 || offset > node.latex.length)
-            return Result.Err(`offset (${offset}) out of bounds for equation node`);
-        const latex = node.latex.slice(0, offset) + incoming.latex + node.latex.slice(offset);
-        return Result.Ok([{ ...node, latex }]);
-    }
-    // ── rich blocks ───────────────────────────────────────────────────────────
-    const content = block.content;
-    // Empty content — just push
-    if (content.length === 0) {
-        return Result.Ok([incoming]);
-    }
-    if (nodeIndex < 0 || nodeIndex >= content.length)
-        return Result.Err(`nodeIndex (${nodeIndex}) out of bounds (length=${content.length})`);
-    const target = content[nodeIndex];
-    const targetLen = getTextLength(target);
-    if (offset < 0 || offset > targetLen)
-        return Result.Err(`offset (${offset}) out of bounds for node at index ${nodeIndex}`);
-    const before = content.slice(0, nodeIndex);
-    const after = content.slice(nodeIndex + 1);
-    const middle = [];
-    // Left half of split — empty when offset=0
-    const left = sliceNode(target, 0, offset);
-    if (left)
-        middle.push(left);
-    // Incoming — try merge with left half
-    if (middle.length > 0) {
-        const merged = tryMerge(middle[middle.length - 1], incoming);
-        if (merged)
-            middle[middle.length - 1] = merged;
-        else
-            middle.push(incoming);
-    }
-    else {
-        middle.push(incoming);
-    }
-    // Right half — empty when offset=targetLen (end of node → natural append)
-    const right = sliceNode(target, offset, targetLen);
-    if (right) {
-        const merged = tryMerge(middle[middle.length - 1], right);
-        if (merged)
-            middle[middle.length - 1] = merged;
-        else
-            middle.push(right);
-    }
-    // Merge across all boundaries
-    const result = [];
-    for (const node of [...before, ...middle, ...after]) {
-        const prev = result[result.length - 1];
-        const merged = prev ? tryMerge(prev, node) : null;
-        if (merged)
-            result[result.length - 1] = merged;
-        else
-            result.push(node);
-    }
-    return Result.Ok(result);
-}
-// ─── deleteLastChar ────────────────────────────────────────────────────────────
-export function deleteLastChar(block) {
-    if (block.type === "code") {
-        const node = block.content[0];
-        if (!node.text.length)
-            return Result.Err("Nothing to delete");
-        return Result.Ok([{ ...node, text: node.text.slice(0, -1) }]);
-    }
-    if (block.type === "equation") {
-        const node = block.content[0];
-        if (!node.latex.length)
-            return Result.Err("Nothing to delete");
-        return Result.Ok([{ ...node, latex: node.latex.slice(0, -1) }]);
-    }
-    const next = [...block.content];
-    for (let i = next.length - 1; i >= 0; i--) {
-        const node = next[i];
-        if (node.type === "text" || node.type === "code") {
-            const trimmed = node.text.slice(0, -1);
-            if (!trimmed.length)
-                next.splice(i, 1);
-            else
-                next[i] = { ...node, text: trimmed };
-            return Result.Ok(next);
-        }
-        if (node.type === "equation") {
-            const trimmed = node.latex.slice(0, -1);
-            if (!trimmed.length)
-                next.splice(i, 1);
-            else
-                next[i] = { ...node, latex: trimmed };
-            return Result.Ok(next);
-        }
-    }
-    return Result.Err("Nothing to delete");
-}
-// ─── deleteRange ───────────────────────────────────────────────────────────────
-/**
- * Delete content across a selection.
- * After deletion, left and right boundaries are merged if formats match.
- *
- * For code/equation blocks: deletes within the single tuple node's text/latex.
- */
-export function deleteRange(block, startNodeIndex, startOffset, endNodeIndex, endOffset) {
-    // ── code block ────────────────────────────────────────────────────────────
-    if (block.type === "code") {
-        const node = block.content[0];
-        if (startOffset < 0 || endOffset > node.text.length || startOffset > endOffset)
-            return Result.Err(`invalid range [${startOffset}, ${endOffset}] for code node`);
-        const text = node.text.slice(0, startOffset) + node.text.slice(endOffset);
-        return Result.Ok([{ ...node, text }]);
-    }
-    // ── equation block ────────────────────────────────────────────────────────
-    if (block.type === "equation") {
-        const node = block.content[0];
-        if (startOffset < 0 || endOffset > node.latex.length || startOffset > endOffset)
-            return Result.Err(`invalid range [${startOffset}, ${endOffset}] for equation node`);
-        const latex = node.latex.slice(0, startOffset) + node.latex.slice(endOffset);
-        return Result.Ok([{ ...node, latex }]);
-    }
-    // ── rich blocks ───────────────────────────────────────────────────────────
-    const nodes = block.content;
-    if (startNodeIndex < 0 || endNodeIndex >= nodes.length)
-        return Result.Err(`node indices [${startNodeIndex}, ${endNodeIndex}] out of bounds`);
-    if (startNodeIndex > endNodeIndex)
-        return Result.Err(`startNodeIndex (${startNodeIndex}) > endNodeIndex (${endNodeIndex})`);
-    const startNode = nodes[startNodeIndex];
-    const endNode = nodes[endNodeIndex];
-    if (startOffset < 0 || startOffset > getTextLength(startNode))
-        return Result.Err(`startOffset (${startOffset}) out of bounds`);
-    if (endOffset < 0 || endOffset > getTextLength(endNode))
-        return Result.Err(`endOffset (${endOffset}) out of bounds`);
-    const before = nodes.slice(0, startNodeIndex);
-    const after = nodes.slice(endNodeIndex + 1);
-    const middle = [];
-    // Keep left part of start node
-    const left = sliceNode(startNode, 0, startOffset);
-    if (left)
-        middle.push(left);
-    // Keep right part of end node
-    const right = sliceNode(endNode, endOffset, getTextLength(endNode));
-    if (right) {
-        const merged = middle.length > 0 ? tryMerge(middle[middle.length - 1], right) : null;
-        if (merged)
-            middle[middle.length - 1] = merged;
-        else
-            middle.push(right);
-    }
-    // Merge all boundaries
-    const result = [];
-    for (const node of [...before, ...middle, ...after]) {
-        const prev = result[result.length - 1];
-        const merged = prev ? tryMerge(prev, node) : null;
-        if (merged)
-            result[result.length - 1] = merged;
-        else
-            result.push(node);
-    }
-    return Result.Ok(result);
-}
-// ─── splitBlock ────────────────────────────────────────────────────────────────
-/**
- * Split a block at a given position into two blocks.
- * The original block keeps content before the cursor.
- * A new block gets content after the cursor — always of type "paragraph".
- *
- * Not supported for code/equation blocks — returns Err.
- */
-export function splitBlock(block, nodeIndex, offset) {
-    var _a;
-    if (block.type === "code" || block.type === "equation")
-        return Result.Err(`splitBlock is not supported for "${block.type}" blocks`);
-    const nodes = block.content;
-    if (nodes.length > 0 && (nodeIndex < 0 || nodeIndex >= nodes.length))
-        return Result.Err(`nodeIndex (${nodeIndex}) out of bounds`);
-    const target = (_a = nodes[nodeIndex]) !== null && _a !== void 0 ? _a : null;
-    const targetLen = target ? getTextLength(target) : 0;
-    if (offset < 0 || offset > targetLen)
-        return Result.Err(`offset (${offset}) out of bounds`);
-    // Content before cursor stays in original block
-    const beforeNodes = [
-        ...nodes.slice(0, nodeIndex),
-        ...(target && offset > 0 ? [sliceNode(target, 0, offset)].filter(Boolean) : []),
-    ];
-    // Content after cursor goes to new block
-    const afterNodes = [
-        ...(target && offset < targetLen ? [sliceNode(target, offset, targetLen)].filter(Boolean) : []),
-        ...nodes.slice(nodeIndex + 1),
-    ];
-    const original = {
-        ...block,
-        content: beforeNodes,
-    };
-    const newBlock = {
-        id: generateId(),
-        type: "paragraph",
-        content: afterNodes,
-        meta: {},
-    };
-    return Result.Ok([original, newBlock]);
-}
-// ─── mergeBlocks ───────────────────────────────────────────────────────────────
-/**
- * Merge blockB into blockA — blockB's content is appended to blockA's content.
- * blockA's type and meta are preserved.
- *
- * Not supported if either block is code or equation — returns Err.
- */
-export function mergeBlocks(blockA, blockB) {
-    if (blockA.type === "code" || blockA.type === "equation")
-        return Result.Err(`mergeBlocks: blockA cannot be of type "${blockA.type}"`);
-    if (blockB.type === "code" || blockB.type === "equation")
-        return Result.Err(`mergeBlocks: blockB cannot be of type "${blockB.type}"`);
-    const nodesA = blockA.content;
-    const nodesB = blockB.content;
-    // Merge boundaries between the two arrays
-    const result = [...nodesA];
-    for (const node of nodesB) {
-        const prev = result[result.length - 1];
-        const merged = prev ? tryMerge(prev, node) : null;
-        if (merged)
-            result[result.length - 1] = merged;
-        else
-            result.push(node);
-    }
-    return Result.Ok({
-        ...blockA,
-        content: result,
-    });
-}
-// ─── replaceRange ──────────────────────────────────────────────────────────────
-/**
- * Replace a selected range with an incoming Node — atomic deleteRange + insertAt.
- * This is what fires when the user has a selection and types a character.
- *
- * Internally chains:
- *   1. deleteRange  — remove selected content
- *   2. insertAt     — insert incoming at the start of the deleted range
- */
-export function replaceRange(block, startNodeIndex, startOffset, endNodeIndex, endOffset, incoming) {
-    return deleteRange(block, startNodeIndex, startOffset, endNodeIndex, endOffset)
-        .andThen((content) => insertAt({ ...block, content }, startNodeIndex, startOffset, incoming));
-}
-//# sourceMappingURL=content.js.map

package/dist/engine/content.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"content.js","sourceRoot":"","sources":["../../src/engine/content.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAC1C,OAAO,EAAc,YAAY,EAAE,MAAM,UAAU,CAAC;AASpD,kFAAkF;AAElF,SAAS,OAAO,CAAC,IAAsC;IACrD,OAAO,CACL,IAAI,CAAC,IAAI,KAAc,SAAS;QAChC,IAAI,CAAC,MAAM,KAAY,SAAS;QAChC,IAAI,CAAC,SAAS,KAAS,SAAS;QAChC,IAAI,CAAC,aAAa,KAAK,SAAS;QAChC,IAAI,CAAC,WAAW,KAAO,SAAS;QAChC,IAAI,CAAC,KAAK,KAAa,SAAS;QAChC,IAAI,CAAC,IAAI,KAAc,SAAS,CACjC,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,IAAU;IAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1E,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;QAAE,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IACvD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,QAAQ,CAAC,CAAO,EAAE,CAAO;IAChC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACnC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAQ,CAAC,CAAC,IAAI,KAAK,MAAM;QAAM,OAAO,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC3F,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU;QAAE,OAAO,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;IAC9F,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAQ,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC/C,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC;YAClD,OAAO,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC3C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,SAAS,CAAC,IAAU,EAAE,KAAa,EAAE,GAAW;IACvD,IAAI,KAAK,IAAI,GAAG;QAAE,OAAO,IAAI,CAAC;IAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAM,CAAC;QAAC,MAAM,IAAI,GAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC,MAAM,CAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,CAAE,CAAC,CAAC,IAAI,CAAC;IAAC,CAAC;IAC9H,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAM,CAAC;QAAC,MAAM,IAAI,GAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC,MAAM,CAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,CAAE,CAAC,CAAC,IAAI,CAAC;IAAC,CAAC;IAC9H,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAAC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAAC,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAAC,CAAC;IAC9H,OAAO,IAAI,CAAC;AACd,CAAC;AAED,kFAAkF;AAElF;;;;;;;;;GASG;AACH,MAAM,UAAU,QAAQ,CACtB,KAAe,EACf,SAAiB,EACjB,MAAc,EACd,QAAc;IAGd,6EAA6E;IAC7E,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC1B,IAAI,QAAQ,CAAC,IAAI,KAAK,MAAM;YAC1B,OAAO,MAAM,CAAC,GAAG,CAAC,6CAA6C,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC;QACnF,MAAM,IAAI,GAAI,KAAK,CAAC,OAAsB,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM;YACzC,OAAO,MAAM,CAAC,GAAG,CAAC,WAAW,MAAM,+BAA+B,CAAC,CAAC;QACtE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAClF,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,CAA+B,CAAC,CAAC;IACtE,CAAC;IAED,6EAA6E;IAC7E,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC9B,IAAI,QAAQ,CAAC,IAAI,KAAK,UAAU;YAC9B,OAAO,MAAM,CAAC,GAAG,CAAC,sDAAsD,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC;QAC5F,MAAM,IAAI,GAAI,KAAK,CAAC,OAA0B,CAAC,CAAC,CAAC,CAAC;QAClD,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;YAC1C,OAAO,MAAM,CAAC,GAAG,CAAC,WAAW,MAAM,mCAAmC,CAAC,CAAC;QAC1E,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACtF,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,CAA+B,CAAC,CAAC;IACvE,CAAC;IAED,6EAA6E;IAC7E,MAAM,OAAO,GAAG,KAAK,CAAC,OAAiB,CAAC;IAExC,4BAA4B;IAC5B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC,QAAQ,CAA+B,CAAC,CAAC;IAC7D,CAAC;IAED,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,OAAO,CAAC,MAAM;QAC9C,OAAO,MAAM,CAAC,GAAG,CAAC,cAAc,SAAS,2BAA2B,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;IAEzF,MAAM,MAAM,GAAM,OAAO,CAAC,SAAS,CAAC,CAAC;IACrC,MAAM,SAAS,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IAExC,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,SAAS;QAClC,OAAO,MAAM,CAAC,GAAG,CAAC,WAAW,MAAM,qCAAqC,SAAS,EAAE,CAAC,CAAC;IAEvF,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAI,OAAO,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;IAC5C,MAAM,MAAM,GAAW,EAAE,CAAC;IAE1B,2CAA2C;IAC3C,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;IAC1C,IAAI,IAAI;QAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAE5B,sCAAsC;IACtC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC7D,IAAI,MAAM;YAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;;YAC1C,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC7B,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACxB,CAAC;IAED,0EAA0E;IAC1E,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IACnD,IAAI,KAAK,EAAE,CAAC;QACV,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC1D,IAAI,MAAM;YAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;;YAC1C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,8BAA8B;IAC9B,MAAM,MAAM,GAAW,EAAE,CAAC;IAC1B,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;QACpD,MAAM,IAAI,GAAK,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAClD,IAAI,MAAM;YAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;;YAC1C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,OAAO,MAAM,CAAC,EAAE,CAAC,MAAoC,CAAC,CAAC;AACzD,CAAC;AAED,kFAAkF;AAElF,MAAM,UAAU,cAAc,CAAC,KAAe;IAC5C,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAI,KAAK,CAAC,OAAsB,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO,MAAM,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;QAC9D,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAuC,CAAC,CAAC;IACtG,CAAC;IAED,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAI,KAAK,CAAC,OAA0B,CAAC,CAAC,CAAC,CAAC;QAClD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,OAAO,MAAM,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;QAC/D,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAuC,CAAC,CAAC;IACxG,CAAC;IAED,MAAM,IAAI,GAAG,CAAC,GAAI,KAAK,CAAC,OAAkB,CAAC,CAAC;IAE5C,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACjD,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,MAAM;gBAAE,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;;gBAClC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;YAC1C,OAAO,MAAM,CAAC,EAAE,CAAC,IAA0C,CAAC,CAAC;QAC/D,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACxC,IAAI,CAAC,OAAO,CAAC,MAAM;gBAAE,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;;gBAClC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;YAC3C,OAAO,MAAM,CAAC,EAAE,CAAC,IAA0C,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;AACzC,CAAC;AAGD,kFAAkF;AAElF;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CACzB,KAAe,EACf,cAAsB,EACtB,WAAmB,EACnB,YAAoB,EACpB,SAAiB;IAGjB,6EAA6E;IAC7E,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAI,KAAK,CAAC,OAAsB,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,WAAW,GAAG,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,WAAW,GAAG,SAAS;YAC5E,OAAO,MAAM,CAAC,GAAG,CAAC,kBAAkB,WAAW,KAAK,SAAS,iBAAiB,CAAC,CAAC;QAClF,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC1E,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,CAAqB,CAAC,CAAC;IAC5D,CAAC;IAED,6EAA6E;IAC7E,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAI,KAAK,CAAC,OAA0B,CAAC,CAAC,CAAC,CAAC;QAClD,IAAI,WAAW,GAAG,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,WAAW,GAAG,SAAS;YAC7E,OAAO,MAAM,CAAC,GAAG,CAAC,kBAAkB,WAAW,KAAK,SAAS,qBAAqB,CAAC,CAAC;QACtF,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC7E,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,CAAoB,CAAC,CAAC;IAC5D,CAAC;IAED,6EAA6E;IAC7E,MAAM,KAAK,GAAG,KAAK,CAAC,OAAiB,CAAC;IAEtC,IAAI,cAAc,GAAG,CAAC,IAAI,YAAY,IAAI,KAAK,CAAC,MAAM;QACpD,OAAO,MAAM,CAAC,GAAG,CAAC,iBAAiB,cAAc,KAAK,YAAY,iBAAiB,CAAC,CAAC;IACvF,IAAI,cAAc,GAAG,YAAY;QAC/B,OAAO,MAAM,CAAC,GAAG,CAAC,mBAAmB,cAAc,qBAAqB,YAAY,GAAG,CAAC,CAAC;IAE3F,MAAM,SAAS,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC;IACxC,MAAM,OAAO,GAAK,KAAK,CAAC,YAAY,CAAC,CAAC;IAEtC,IAAI,WAAW,GAAG,CAAC,IAAI,WAAW,GAAG,aAAa,CAAC,SAAS,CAAC;QAC3D,OAAO,MAAM,CAAC,GAAG,CAAC,gBAAgB,WAAW,iBAAiB,CAAC,CAAC;IAClE,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,aAAa,CAAC,OAAO,CAAC;QACrD,OAAO,MAAM,CAAC,GAAG,CAAC,cAAc,SAAS,iBAAiB,CAAC,CAAC;IAE9D,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IAC9C,MAAM,KAAK,GAAI,KAAK,CAAC,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAW,EAAE,CAAC;IAE1B,+BAA+B;IAC/B,MAAM,IAAI,GAAG,SAAS,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;IAClD,IAAI,IAAI;QAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAE5B,8BAA8B;IAC9B,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,EAAE,SAAS,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;IACpE,IAAI,KAAK,EAAE,CAAC;QACV,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACrF,IAAI,MAAM;YAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;;YAC1C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,uBAAuB;IACvB,MAAM,MAAM,GAAW,EAAE,CAAC;IAC1B,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;QACpD,MAAM,IAAI,GAAK,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAClD,IAAI,MAAM;YAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;;YAC1C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,OAAO,MAAM,CAAC,EAAE,CAAC,MAA0B,CAAC,CAAC;AAC/C,CAAC;AAED,kFAAkF;AAElF;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CACxB,KAAe,EACf,SAAiB,EACjB,MAAc;;IAEd,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU;QACpD,OAAO,MAAM,CAAC,GAAG,CAAC,oCAAoC,KAAK,CAAC,IAAI,UAAU,CAAC,CAAC;IAE9E,MAAM,KAAK,GAAG,KAAK,CAAC,OAAiB,CAAC;IAEtC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,MAAM,CAAC;QAClE,OAAO,MAAM,CAAC,GAAG,CAAC,cAAc,SAAS,iBAAiB,CAAC,CAAC;IAE9D,MAAM,MAAM,GAAM,MAAA,KAAK,CAAC,SAAS,CAAC,mCAAI,IAAI,CAAC;IAC3C,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAErD,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,SAAS;QAClC,OAAO,MAAM,CAAC,GAAG,CAAC,WAAW,MAAM,iBAAiB,CAAC,CAAC;IAExD,gDAAgD;IAChD,MAAM,WAAW,GAAW;QAC1B,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC;QAC5B,GAAG,CAAE,MAAM,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAE;KACnF,CAAC;IAEF,yCAAyC;IACzC,MAAM,UAAU,GAAW;QACzB,GAAG,CAAE,MAAM,IAAI,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,CAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAE;QAClG,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;KAC9B,CAAC;IAEF,MAAM,QAAQ,GAAa;QACzB,GAAG,KAAK;QACR,OAAO,EAAE,WAAW;KACT,CAAC;IAEd,MAAM,QAAQ,GAAa;QACzB,EAAE,EAAE,UAAU,EAAE;QAChB,IAAI,EAAE,WAAW;QACjB,OAAO,EAAE,UAAU;QACnB,IAAI,EAAE,EAAE;KACG,CAAC;IAEd,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,kFAAkF;AAElF;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CACzB,MAAgB,EAChB,MAAgB;IAEhB,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU;QACtD,OAAO,MAAM,CAAC,GAAG,CAAC,0CAA0C,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IAC9E,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU;QACtD,OAAO,MAAM,CAAC,GAAG,CAAC,0CAA0C,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IAE9E,MAAM,MAAM,GAAG,MAAM,CAAC,OAAiB,CAAC;IACxC,MAAM,MAAM,GAAG,MAAM,CAAC,OAAiB,CAAC;IAExC,0CAA0C;IAC1C,MAAM,MAAM,GAAW,CAAC,GAAG,MAAM,CAAC,CAAC;IACnC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAK,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAClD,IAAI,MAAM;YAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;;YAC1C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,OAAO,MAAM,CAAC,EAAE,CAAC;QACf,GAAG,MAAM;QACT,OAAO,EAAE,MAAM;KACJ,CAAC,CAAC;AACjB,CAAC;AAGD,kFAAkF;AAElF;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAe,EACf,cAAsB,EACtB,WAAmB,EACnB,YAAoB,EACpB,SAAiB,EACjB,QAAc;IAEd,OAAO,WAAW,CAAI,KAAK,EAAE,cAAc,EAAE,WAAW,EAAE,YAAY,EAAE,SAAS,CAAC;SAC/E,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CACnB,QAAQ,CACN,EAAE,GAAG,KAAK,EAAE,OAAO,EAAc,EACjC,cAAc,EACd,WAAW,EACX,QAAQ,CACT,CACF,CAAC;AACN,CAAC"}

package/dist/engine/cursor.d.ts

@@ -1,38 +0,0 @@
-import type { AnyBlock } from '../types/block';
-import type { NodeSelection } from './format';
-import { Result } from '@reiwuzen/result';
-export type CursorPosition = {
-    nodeIndex: number;
-    offset: number;
-};
-/**
- * Convert a flat UI cursor offset to { nodeIndex, offset }.
- *
- * The browser gives a single number representing position in the
- * concatenated text of the block. This function walks the node array
- * and finds which node that position falls in and where within it.
- *
- * e.g. nodes = ["Hello"(5), " World"(6)]
- *   flatOffset=0  → { nodeIndex: 0, offset: 0 }
- *   flatOffset=5  → { nodeIndex: 0, offset: 5 }  (end of first node)
- *   flatOffset=6  → { nodeIndex: 1, offset: 1 }
- *   flatOffset=11 → { nodeIndex: 1, offset: 6 }  (end of last node)
- */
-export declare function flatToPosition(block: AnyBlock, flatOffset: number): Result<CursorPosition, string>;
-/**
- * Convert a flat UI selection { start, end } to NodeSelection.
- *
- * The browser gives two flat offsets from window.getSelection().
- * This calls flatToPosition twice and returns a NodeSelection
- * ready to pass to toggleBold, formatNodes, deleteRange, etc.
- *
- * e.g. nodes = ["Hello"(bold), " World"]
- *   { start: 3, end: 8 } → { startIndex:0, startOffset:3, endIndex:1, endOffset:3 }
- */
-export declare function flatToSelection(block: AnyBlock, start: number, end: number): Result<NodeSelection, string>;
-/**
- * Inverse — convert { nodeIndex, offset } back to a flat offset.
- * Useful after engine operations to restore cursor position in the DOM.
- */
-export declare function positionToFlat(block: AnyBlock, nodeIndex: number, offset: number): Result<number, string>;
-//# sourceMappingURL=cursor.d.ts.map

package/dist/engine/cursor.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"cursor.d.ts","sourceRoot":"","sources":["../../src/engine/cursor.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAQ,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AACrD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAC9C,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAI1C,MAAM,MAAM,cAAc,GAAG;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAYF;;;;;;;;;;;;GAYG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,QAAQ,EACf,UAAU,EAAE,MAAM,GACjB,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,CAqChC;AAID;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,QAAQ,EACf,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,GACV,MAAM,CAAC,aAAa,EAAE,MAAM,CAAC,CAY/B;AAID;;;GAGG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,QAAQ,EACf,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,GACb,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAexB"}

package/dist/engine/cursor.js

@@ -1,90 +0,0 @@
-import { Result } from '@reiwuzen/result';
-// ─── Helpers ───────────────────────────────────────────────────────────────────
-function getTextLength(node) {
-    if (node.type === "text" || node.type === "code")
-        return node.text.length;
-    if (node.type === "equation")
-        return node.latex.length;
-    return 0;
-}
-// ─── flatToPosition ────────────────────────────────────────────────────────────
-/**
- * Convert a flat UI cursor offset to { nodeIndex, offset }.
- *
- * The browser gives a single number representing position in the
- * concatenated text of the block. This function walks the node array
- * and finds which node that position falls in and where within it.
- *
- * e.g. nodes = ["Hello"(5), " World"(6)]
- *   flatOffset=0  → { nodeIndex: 0, offset: 0 }
- *   flatOffset=5  → { nodeIndex: 0, offset: 5 }  (end of first node)
- *   flatOffset=6  → { nodeIndex: 1, offset: 1 }
- *   flatOffset=11 → { nodeIndex: 1, offset: 6 }  (end of last node)
- */
-export function flatToPosition(block, flatOffset) {
-    // code/equation blocks are always a single node — offset maps directly
-    if (block.type === "code" || block.type === "equation") {
-        const node = block.content[0];
-        const len = getTextLength(node);
-        if (flatOffset < 0 || flatOffset > len)
-            return Result.Err(`flatOffset (${flatOffset}) out of bounds (length=${len})`);
-        return Result.Ok({ nodeIndex: 0, offset: flatOffset });
-    }
-    const nodes = block.content;
-    if (flatOffset < 0)
-        return Result.Err(`flatOffset (${flatOffset}) cannot be negative`);
-    let accumulated = 0;
-    for (let i = 0; i < nodes.length; i++) {
-        const len = getTextLength(nodes[i]);
-        // offset lands within this node OR at its end (but not the last node)
-        if (flatOffset <= accumulated + len) {
-            return Result.Ok({ nodeIndex: i, offset: flatOffset - accumulated });
-        }
-        accumulated += len;
-    }
-    // flatOffset is exactly at the end of the last node
-    if (flatOffset === accumulated) {
-        const last = nodes.length - 1;
-        return Result.Ok({ nodeIndex: Math.max(0, last), offset: getTextLength(nodes[last]) });
-    }
-    return Result.Err(`flatOffset (${flatOffset}) out of bounds (total length=${accumulated})`);
-}
-// ─── flatToSelection ───────────────────────────────────────────────────────────
-/**
- * Convert a flat UI selection { start, end } to NodeSelection.
- *
- * The browser gives two flat offsets from window.getSelection().
- * This calls flatToPosition twice and returns a NodeSelection
- * ready to pass to toggleBold, formatNodes, deleteRange, etc.
- *
- * e.g. nodes = ["Hello"(bold), " World"]
- *   { start: 3, end: 8 } → { startIndex:0, startOffset:3, endIndex:1, endOffset:3 }
- */
-export function flatToSelection(block, start, end) {
-    if (start > end)
-        return Result.Err(`start (${start}) cannot be greater than end (${end})`);
-    return flatToPosition(block, start).andThen((startPos) => flatToPosition(block, end).map((endPos) => ({
-        startIndex: startPos.nodeIndex,
-        startOffset: startPos.offset,
-        endIndex: endPos.nodeIndex,
-        endOffset: endPos.offset,
-    })));
-}
-// ─── positionToFlat ────────────────────────────────────────────────────────────
-/**
- * Inverse — convert { nodeIndex, offset } back to a flat offset.
- * Useful after engine operations to restore cursor position in the DOM.
- */
-export function positionToFlat(block, nodeIndex, offset) {
-    if (block.type === "code" || block.type === "equation")
-        return Result.Ok(offset);
-    const nodes = block.content;
-    if (nodeIndex < 0 || nodeIndex >= nodes.length)
-        return Result.Err(`nodeIndex (${nodeIndex}) out of bounds`);
-    let flat = 0;
-    for (let i = 0; i < nodeIndex; i++) {
-        flat += getTextLength(nodes[i]);
-    }
-    return Result.Ok(flat + offset);
-}
-//# sourceMappingURL=cursor.js.map