@coze-editor/utils 0.1.0-alpha.687604 → 0.1.0-alpha.6b15c1

package/dist/esm/index.js

@@ -156,9 +156,122 @@ function singleton(id, instance) {
   }
   return globalThis[symbol];
 }
+
+// src/text.ts
+import { SourceMap } from "@volar/source-map";
+var Text = class {
+  source;
+  replacements = [];
+  constructor(text) {
+    this.source = text;
+  }
+  replaceRange(from, to, content) {
+    const rangeFrom = Math.min(from, to);
+    const rangeTo = Math.max(from, to);
+    const hasOverlap2 = this.replacements.some(
+      (replacement) => rangeFrom < replacement.to && rangeTo > replacement.from
+    );
+    if (hasOverlap2) {
+      return;
+    }
+    this.replacements.push({ from: rangeFrom, to: rangeTo, content });
+  }
+  #toMappings() {
+    const sortedReplacements = [...this.replacements].sort(
+      (a, b) => a.from - b.from
+    );
+    const mappings = [];
+    let originalOffset = 0;
+    let generatedOffset = 0;
+    for (const replacement of sortedReplacements) {
+      if (originalOffset < replacement.from) {
+        const length = replacement.from - originalOffset;
+        mappings.push({
+          sourceOffsets: [originalOffset],
+          generatedOffsets: [generatedOffset],
+          lengths: [length],
+          data: void 0
+        });
+        originalOffset = replacement.from;
+        generatedOffset += length;
+      }
+      originalOffset = replacement.to;
+      generatedOffset += replacement.content.length;
+    }
+    if (originalOffset < this.source.length) {
+      const length = this.source.length - originalOffset;
+      mappings.push({
+        sourceOffsets: [originalOffset],
+        generatedOffsets: [generatedOffset],
+        lengths: [length],
+        data: void 0
+      });
+    }
+    return mappings;
+  }
+  originalOffsetFor(offset) {
+    const sourceMap = new SourceMap(this.#toMappings());
+    const locations = Array.from(sourceMap.toSourceLocation(offset));
+    const first = locations[0];
+    if (Array.isArray(first) && typeof first[0] === "number") {
+      return first[0];
+    }
+    return offset;
+  }
+  generatedOffsetFor(offset) {
+    const sourceMap = new SourceMap(this.#toMappings());
+    const locations = Array.from(sourceMap.toGeneratedLocation(offset));
+    const first = locations[0];
+    if (Array.isArray(first) && typeof first[0] === "number") {
+      return first[0];
+    }
+    return offset;
+  }
+  originalRangeFor(range) {
+    const sourceMap = new SourceMap(this.#toMappings());
+    const ranges = Array.from(
+      sourceMap.toSourceRange(range.from, range.to, true)
+    );
+    const first = ranges[0];
+    if (Array.isArray(first) && typeof first[0] === "number" && typeof first[1] === "number") {
+      return { from: first[0], to: first[1] };
+    }
+    return range;
+  }
+  generatedRangeFor(range) {
+    const sourceMap = new SourceMap(this.#toMappings());
+    const ranges = Array.from(
+      sourceMap.toGeneratedRange(range.from, range.to, true)
+    );
+    const first = ranges[0];
+    if (Array.isArray(first) && typeof first[0] === "number" && typeof first[1] === "number") {
+      return { from: first[0], to: first[1] };
+    }
+    return range;
+  }
+  toString() {
+    const sortedReplacements = [...this.replacements].sort(
+      (a, b) => a.from - b.from
+    );
+    let cursor = 0;
+    let result = "";
+    for (const replacement of sortedReplacements) {
+      if (cursor < replacement.from) {
+        result += this.source.slice(cursor, replacement.from);
+      }
+      result += replacement.content;
+      cursor = replacement.to;
+    }
+    if (cursor < this.source.length) {
+      result += this.source.slice(cursor);
+    }
+    return result;
+  }
+};
 export {
   FacetCombineStrategy,
   SpanWidget,
+  Text,
   disposeAll,
   flatten,
   hasOverlap,

package/dist/esm/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/dispose-all.ts","../../src/flatten.ts","../../src/traverse.ts","../../src/overlap.ts","../../src/span.ts","../../src/facet.ts","../../src/field.ts","../../src/singleton.ts"],"sourcesContent":["//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nfunction disposeAll(disposes: unknown[]) {\n  return () => {\n    for (const dispose of disposes) {\n      if (typeof dispose === 'function') {\n        dispose();\n      }\n    }\n  };\n}\n\nexport { disposeAll };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nfunction flatten<T>(arrayOfArray: T[][]) {\n  return arrayOfArray.reduce((memo, current) => [...memo, ...current], []);\n}\n\nexport { flatten };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nimport { NodeProp, type TreeCursor } from '@lezer/common';\n\n// TODO: 优化对外 options\n// - cursor -> tree\n// - remove from, to\nfunction traverseAST(\n  cursor: TreeCursor,\n  from: number,\n  to: number,\n  callback: (cursor: TreeCursor) => void,\n  disableOverlayTraverse = false,\n) {\n  const { from: start, to: end } = cursor;\n  if (start >= to || end <= from) {\n    return;\n  }\n\n  callback(cursor);\n\n  const mounted = cursor.tree && cursor.tree.prop(NodeProp.mounted);\n  if (mounted && mounted.overlay && !disableOverlayTraverse) {\n    const inner = cursor.node.enter(mounted.overlay[0].from + start, 1)!;\n    const hasChild = cursor.firstChild();\n    for (let i = 0, pos = start; ; i++) {\n      const next = i < mounted.overlay.length ? mounted.overlay[i] : null;\n      const nextPos = next ? next.from + start : end;\n      const rangeFrom = Math.max(from, pos);\n      const rangeTo = Math.min(to, nextPos);\n      if (rangeFrom < rangeTo && hasChild) {\n        while (cursor.from < rangeTo) {\n          traverseAST(\n            cursor,\n            rangeFrom,\n            rangeTo,\n            callback,\n            disableOverlayTraverse,\n          );\n          if (cursor.to >= nextPos || !cursor.nextSibling()) {\n            break;\n          }\n        }\n      }\n      if (!next || nextPos > to) {\n        break;\n      }\n      pos = next.to + start;\n      if (pos > from) {\n        const overlayFrom = Math.max(from, next.from + start);\n        const overlayTo = Math.min(to, pos);\n\n        // walk overlay range in top tree\n        while (cursor.from < overlayTo) {\n          // disable overlay traverse to avoid infinite overlay traversion\n          traverseAST(\n            cursor,\n            Math.max(from, next.from + start),\n            Math.min(to, pos),\n            callback,\n            true,\n          );\n          if (cursor.to >= overlayTo || !cursor.nextSibling()) {\n            break;\n          }\n        }\n\n        traverseAST(\n          inner.cursor(),\n          overlayFrom,\n          overlayTo,\n          callback,\n          disableOverlayTraverse,\n        );\n      }\n    }\n    if (hasChild) {\n      cursor.parent();\n    }\n  } else if (cursor.firstChild()) {\n    do {\n      if (cursor.to <= from) {\n        continue;\n      }\n      if (cursor.from >= to) {\n        break;\n      }\n      traverseAST(cursor, from, to, callback, disableOverlayTraverse);\n    } while (cursor.nextSibling());\n    cursor.parent();\n  }\n}\n\nexport { traverseAST };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\ninterface Range {\n  from: number;\n  to: number;\n}\n\nfunction hasOverlap(a: Range, b: Range) {\n  if (a.from === a.to) {\n    return a.from > b.from && a.from < b.to;\n  }\n\n  return (\n    // exists common part or a contains b\n    (a.from <= b.from && a.to > b.from) ||\n    (a.to >= b.to && a.from < b.to) ||\n    // a inside b\n    (a.from >= b.from && a.to <= b.to)\n  );\n}\n\nexport { hasOverlap };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nimport { WidgetType } from '@codemirror/view';\n\ninterface SpanWidgetOptions {\n  text?: string;\n  className?: string;\n}\n\nclass SpanWidget extends WidgetType {\n  public text?: string;\n  public className?: string;\n\n  constructor(options: SpanWidgetOptions) {\n    super();\n\n    this.text = options.text;\n    this.className = options.className;\n  }\n\n  toDOM() {\n    const dom = document.createElement('span');\n    dom.innerText = this.text ?? '';\n    dom.classList.add(this.className ?? '');\n    return dom;\n  }\n\n  eq(other: SpanWidget) {\n    return this.text === other.text && this.className === other.className;\n  }\n\n  ignoreEvent(): boolean {\n    return false;\n  }\n}\n\nexport { SpanWidget };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nconst FacetCombineStrategy = {\n  Flatten<T>(values: readonly T[][]): T[] {\n    return values.reduce((memo, current) => [...memo, ...current], []);\n  },\n  First<T>(values: readonly T[]): T {\n    return values[0];\n  },\n  Last<T>(values: readonly T[]): T {\n    return values[values.length - 1];\n  },\n};\n\nexport { FacetCombineStrategy };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nimport { type StateField } from '@codemirror/state';\n\nfunction withDefaultValue<T, U>(field: StateField<T>, value: U) {\n  const { spec } = field as any;\n  if (typeof spec.fromJSON === 'function') {\n    return [field.init(state => spec.fromJSON(value, state)), field];\n  }\n\n  return field;\n}\n\nexport { withDefaultValue };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nfunction singleton<T>(id: string, instance: T): T {\n  const symbol = Symbol.for(id);\n\n  if (!(globalThis as any)[symbol]) {\n    (globalThis as any)[symbol] = instance;\n  }\n\n  return (globalThis as any)[symbol];\n}\n\nexport { singleton };\n"],"mappings":";AAGA,SAAS,WAAW,UAAqB;AACvC,SAAO,MAAM;AACX,eAAW,WAAW,UAAU;AAC9B,UAAI,OAAO,YAAY,YAAY;AACjC,gBAAQ;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACF;;;ACRA,SAAS,QAAW,cAAqB;AACvC,SAAO,aAAa,OAAO,CAAC,MAAM,YAAY,CAAC,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC;AACzE;;;ACFA,SAAS,gBAAiC;AAK1C,SAAS,YACP,QACA,MACA,IACA,UACA,yBAAyB,OACzB;AACA,QAAM,EAAE,MAAM,OAAO,IAAI,IAAI,IAAI;AACjC,MAAI,SAAS,MAAM,OAAO,MAAM;AAC9B;AAAA,EACF;AAEA,WAAS,MAAM;AAEf,QAAM,UAAU,OAAO,QAAQ,OAAO,KAAK,KAAK,SAAS,OAAO;AAChE,MAAI,WAAW,QAAQ,WAAW,CAAC,wBAAwB;AACzD,UAAM,QAAQ,OAAO,KAAK,MAAM,QAAQ,QAAQ,CAAC,EAAE,OAAO,OAAO,CAAC;AAClE,UAAM,WAAW,OAAO,WAAW;AACnC,aAAS,IAAI,GAAG,MAAM,SAAS,KAAK;AAClC,YAAM,OAAO,IAAI,QAAQ,QAAQ,SAAS,QAAQ,QAAQ,CAAC,IAAI;AAC/D,YAAM,UAAU,OAAO,KAAK,OAAO,QAAQ;AAC3C,YAAM,YAAY,KAAK,IAAI,MAAM,GAAG;AACpC,YAAM,UAAU,KAAK,IAAI,IAAI,OAAO;AACpC,UAAI,YAAY,WAAW,UAAU;AACnC,eAAO,OAAO,OAAO,SAAS;AAC5B;AAAA,YACE;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACF;AACA,cAAI,OAAO,MAAM,WAAW,CAAC,OAAO,YAAY,GAAG;AACjD;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,QAAQ,UAAU,IAAI;AACzB;AAAA,MACF;AACA,YAAM,KAAK,KAAK;AAChB,UAAI,MAAM,MAAM;AACd,cAAM,cAAc,KAAK,IAAI,MAAM,KAAK,OAAO,KAAK;AACpD,cAAM,YAAY,KAAK,IAAI,IAAI,GAAG;AAGlC,eAAO,OAAO,OAAO,WAAW;AAE9B;AAAA,YACE;AAAA,YACA,KAAK,IAAI,MAAM,KAAK,OAAO,KAAK;AAAA,YAChC,KAAK,IAAI,IAAI,GAAG;AAAA,YAChB;AAAA,YACA;AAAA,UACF;AACA,cAAI,OAAO,MAAM,aAAa,CAAC,OAAO,YAAY,GAAG;AACnD;AAAA,UACF;AAAA,QACF;AAEA;AAAA,UACE,MAAM,OAAO;AAAA,UACb;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,UAAU;AACZ,aAAO,OAAO;AAAA,IAChB;AAAA,EACF,WAAW,OAAO,WAAW,GAAG;AAC9B,OAAG;AACD,UAAI,OAAO,MAAM,MAAM;AACrB;AAAA,MACF;AACA,UAAI,OAAO,QAAQ,IAAI;AACrB;AAAA,MACF;AACA,kBAAY,QAAQ,MAAM,IAAI,UAAU,sBAAsB;AAAA,IAChE,SAAS,OAAO,YAAY;AAC5B,WAAO,OAAO;AAAA,EAChB;AACF;;;ACpFA,SAAS,WAAW,GAAU,GAAU;AACtC,MAAI,EAAE,SAAS,EAAE,IAAI;AACnB,WAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE;AAAA,EACvC;AAEA;AAAA;AAAA,IAEG,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,QAC7B,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE;AAAA,IAE3B,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE;AAAA;AAEnC;;;ACjBA,SAAS,kBAAkB;AAO3B,IAAM,aAAN,cAAyB,WAAW;AAAA,EAC3B;AAAA,EACA;AAAA,EAEP,YAAY,SAA4B;AACtC,UAAM;AAEN,SAAK,OAAO,QAAQ;AACpB,SAAK,YAAY,QAAQ;AAAA,EAC3B;AAAA,EAEA,QAAQ;AACN,UAAM,MAAM,SAAS,cAAc,MAAM;AACzC,QAAI,YAAY,KAAK,QAAQ;AAC7B,QAAI,UAAU,IAAI,KAAK,aAAa,EAAE;AACtC,WAAO;AAAA,EACT;AAAA,EAEA,GAAG,OAAmB;AACpB,WAAO,KAAK,SAAS,MAAM,QAAQ,KAAK,cAAc,MAAM;AAAA,EAC9D;AAAA,EAEA,cAAuB;AACrB,WAAO;AAAA,EACT;AACF;;;AChCA,IAAM,uBAAuB;AAAA,EAC3B,QAAW,QAA6B;AACtC,WAAO,OAAO,OAAO,CAAC,MAAM,YAAY,CAAC,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC;AAAA,EACnE;AAAA,EACA,MAAS,QAAyB;AAChC,WAAO,OAAO,CAAC;AAAA,EACjB;AAAA,EACA,KAAQ,QAAyB;AAC/B,WAAO,OAAO,OAAO,SAAS,CAAC;AAAA,EACjC;AACF;;;ACRA,SAAS,iBAAuB,OAAsB,OAAU;AAC9D,QAAM,EAAE,KAAK,IAAI;AACjB,MAAI,OAAO,KAAK,aAAa,YAAY;AACvC,WAAO,CAAC,MAAM,KAAK,WAAS,KAAK,SAAS,OAAO,KAAK,CAAC,GAAG,KAAK;AAAA,EACjE;AAEA,SAAO;AACT;;;ACTA,SAAS,UAAa,IAAY,UAAgB;AAChD,QAAM,SAAS,OAAO,IAAI,EAAE;AAE5B,MAAI,CAAE,WAAmB,MAAM,GAAG;AAChC,IAAC,WAAmB,MAAM,IAAI;AAAA,EAChC;AAEA,SAAQ,WAAmB,MAAM;AACnC;","names":[]}
+{"version":3,"sources":["../../src/dispose-all.ts","../../src/flatten.ts","../../src/traverse.ts","../../src/overlap.ts","../../src/span.ts","../../src/facet.ts","../../src/field.ts","../../src/singleton.ts","../../src/text.ts"],"sourcesContent":["//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nfunction disposeAll(disposes: unknown[]) {\n  return () => {\n    for (const dispose of disposes) {\n      if (typeof dispose === 'function') {\n        dispose();\n      }\n    }\n  };\n}\n\nexport { disposeAll };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nfunction flatten<T>(arrayOfArray: T[][]) {\n  return arrayOfArray.reduce((memo, current) => [...memo, ...current], []);\n}\n\nexport { flatten };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nimport { NodeProp, type TreeCursor } from '@lezer/common';\n\n// TODO: 优化对外 options\n// - cursor -> tree\n// - remove from, to\nfunction traverseAST(\n  cursor: TreeCursor,\n  from: number,\n  to: number,\n  callback: (cursor: TreeCursor) => void,\n  disableOverlayTraverse = false,\n) {\n  const { from: start, to: end } = cursor;\n  if (start >= to || end <= from) {\n    return;\n  }\n\n  callback(cursor);\n\n  const mounted = cursor.tree && cursor.tree.prop(NodeProp.mounted);\n  if (mounted && mounted.overlay && !disableOverlayTraverse) {\n    const inner = cursor.node.enter(mounted.overlay[0].from + start, 1)!;\n    const hasChild = cursor.firstChild();\n    for (let i = 0, pos = start; ; i++) {\n      const next = i < mounted.overlay.length ? mounted.overlay[i] : null;\n      const nextPos = next ? next.from + start : end;\n      const rangeFrom = Math.max(from, pos);\n      const rangeTo = Math.min(to, nextPos);\n      if (rangeFrom < rangeTo && hasChild) {\n        while (cursor.from < rangeTo) {\n          traverseAST(\n            cursor,\n            rangeFrom,\n            rangeTo,\n            callback,\n            disableOverlayTraverse,\n          );\n          if (cursor.to >= nextPos || !cursor.nextSibling()) {\n            break;\n          }\n        }\n      }\n      if (!next || nextPos > to) {\n        break;\n      }\n      pos = next.to + start;\n      if (pos > from) {\n        const overlayFrom = Math.max(from, next.from + start);\n        const overlayTo = Math.min(to, pos);\n\n        // walk overlay range in top tree\n        while (cursor.from < overlayTo) {\n          // disable overlay traverse to avoid infinite overlay traversion\n          traverseAST(\n            cursor,\n            Math.max(from, next.from + start),\n            Math.min(to, pos),\n            callback,\n            true,\n          );\n          if (cursor.to >= overlayTo || !cursor.nextSibling()) {\n            break;\n          }\n        }\n\n        traverseAST(\n          inner.cursor(),\n          overlayFrom,\n          overlayTo,\n          callback,\n          disableOverlayTraverse,\n        );\n      }\n    }\n    if (hasChild) {\n      cursor.parent();\n    }\n  } else if (cursor.firstChild()) {\n    do {\n      if (cursor.to <= from) {\n        continue;\n      }\n      if (cursor.from >= to) {\n        break;\n      }\n      traverseAST(cursor, from, to, callback, disableOverlayTraverse);\n    } while (cursor.nextSibling());\n    cursor.parent();\n  }\n}\n\nexport { traverseAST };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\ninterface Range {\n  from: number;\n  to: number;\n}\n\nfunction hasOverlap(a: Range, b: Range) {\n  if (a.from === a.to) {\n    return a.from > b.from && a.from < b.to;\n  }\n\n  return (\n    // exists common part or a contains b\n    (a.from <= b.from && a.to > b.from) ||\n    (a.to >= b.to && a.from < b.to) ||\n    // a inside b\n    (a.from >= b.from && a.to <= b.to)\n  );\n}\n\nexport { hasOverlap };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nimport { WidgetType } from '@codemirror/view';\n\ninterface SpanWidgetOptions {\n  text?: string;\n  className?: string;\n}\n\nclass SpanWidget extends WidgetType {\n  public text?: string;\n  public className?: string;\n\n  constructor(options: SpanWidgetOptions) {\n    super();\n\n    this.text = options.text;\n    this.className = options.className;\n  }\n\n  toDOM() {\n    const dom = document.createElement('span');\n    dom.innerText = this.text ?? '';\n    dom.classList.add(this.className ?? '');\n    return dom;\n  }\n\n  eq(other: SpanWidget) {\n    return this.text === other.text && this.className === other.className;\n  }\n\n  ignoreEvent(): boolean {\n    return false;\n  }\n}\n\nexport { SpanWidget };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nconst FacetCombineStrategy = {\n  Flatten<T>(values: readonly T[][]): T[] {\n    return values.reduce((memo, current) => [...memo, ...current], []);\n  },\n  First<T>(values: readonly T[]): T {\n    return values[0];\n  },\n  Last<T>(values: readonly T[]): T {\n    return values[values.length - 1];\n  },\n};\n\nexport { FacetCombineStrategy };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nimport { type StateField } from '@codemirror/state';\n\nfunction withDefaultValue<T, U>(field: StateField<T>, value: U) {\n  const { spec } = field as any;\n  if (typeof spec.fromJSON === 'function') {\n    return [field.init(state => spec.fromJSON(value, state)), field];\n  }\n\n  return field;\n}\n\nexport { withDefaultValue };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nfunction singleton<T>(id: string, instance: T): T {\n  const symbol = Symbol.for(id);\n\n  if (!(globalThis as any)[symbol]) {\n    (globalThis as any)[symbol] = instance;\n  }\n\n  return (globalThis as any)[symbol];\n}\n\nexport { singleton };\n","import { type Mapping, SourceMap } from '@volar/source-map';\n\ninterface Range {\n  from: number;\n  to: number;\n}\n\nclass Text {\n  private source: string;\n  private replacements: Array<{ from: number; to: number; content: string }> =\n    [];\n\n  constructor(text: string) {\n    this.source = text;\n  }\n\n  replaceRange(from: number, to: number, content: string) {\n    const rangeFrom = Math.min(from, to);\n    const rangeTo = Math.max(from, to);\n    const hasOverlap = this.replacements.some(\n      replacement => rangeFrom < replacement.to && rangeTo > replacement.from,\n    );\n    if (hasOverlap) {\n      return;\n    }\n    this.replacements.push({ from: rangeFrom, to: rangeTo, content });\n  }\n\n  #toMappings(): Mapping[] {\n    const sortedReplacements = [...this.replacements].sort(\n      (a, b) => a.from - b.from,\n    );\n    const mappings: Mapping[] = [];\n    let originalOffset = 0;\n    let generatedOffset = 0;\n    for (const replacement of sortedReplacements) {\n      if (originalOffset < replacement.from) {\n        const length = replacement.from - originalOffset;\n        mappings.push({\n          sourceOffsets: [originalOffset],\n          generatedOffsets: [generatedOffset],\n          lengths: [length],\n          data: undefined,\n        });\n        originalOffset = replacement.from;\n        generatedOffset += length;\n      }\n      originalOffset = replacement.to;\n      generatedOffset += replacement.content.length;\n    }\n    if (originalOffset < this.source.length) {\n      const length = this.source.length - originalOffset;\n      mappings.push({\n        sourceOffsets: [originalOffset],\n        generatedOffsets: [generatedOffset],\n        lengths: [length],\n        data: undefined,\n      });\n    }\n    return mappings;\n  }\n\n  originalOffsetFor(offset: number): number {\n    const sourceMap = new SourceMap(this.#toMappings());\n    const locations = Array.from(sourceMap.toSourceLocation(offset));\n    const first = locations[0];\n    if (Array.isArray(first) && typeof first[0] === 'number') {\n      return first[0];\n    }\n    return offset;\n  }\n\n  generatedOffsetFor(offset: number): number {\n    const sourceMap = new SourceMap(this.#toMappings());\n    const locations = Array.from(sourceMap.toGeneratedLocation(offset));\n    const first = locations[0];\n    if (Array.isArray(first) && typeof first[0] === 'number') {\n      return first[0];\n    }\n    return offset;\n  }\n\n  originalRangeFor(range: Range): Range {\n    const sourceMap = new SourceMap(this.#toMappings());\n    const ranges = Array.from(\n      sourceMap.toSourceRange(range.from, range.to, true),\n    );\n    const first = ranges[0];\n    if (\n      Array.isArray(first) &&\n      typeof first[0] === 'number' &&\n      typeof first[1] === 'number'\n    ) {\n      return { from: first[0], to: first[1] };\n    }\n    return range;\n  }\n\n  generatedRangeFor(range: Range): Range {\n    const sourceMap = new SourceMap(this.#toMappings());\n    const ranges = Array.from(\n      sourceMap.toGeneratedRange(range.from, range.to, true),\n    );\n    const first = ranges[0];\n    if (\n      Array.isArray(first) &&\n      typeof first[0] === 'number' &&\n      typeof first[1] === 'number'\n    ) {\n      return { from: first[0], to: first[1] };\n    }\n    return range;\n  }\n\n  toString(): string {\n    const sortedReplacements = [...this.replacements].sort(\n      (a, b) => a.from - b.from,\n    );\n    let cursor = 0;\n    let result = '';\n    for (const replacement of sortedReplacements) {\n      if (cursor < replacement.from) {\n        result += this.source.slice(cursor, replacement.from);\n      }\n      result += replacement.content;\n      cursor = replacement.to;\n    }\n    if (cursor < this.source.length) {\n      result += this.source.slice(cursor);\n    }\n    return result;\n  }\n}\n\nexport { Text };\n"],"mappings":";AAGA,SAAS,WAAW,UAAqB;AACvC,SAAO,MAAM;AACX,eAAW,WAAW,UAAU;AAC9B,UAAI,OAAO,YAAY,YAAY;AACjC,gBAAQ;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACF;;;ACRA,SAAS,QAAW,cAAqB;AACvC,SAAO,aAAa,OAAO,CAAC,MAAM,YAAY,CAAC,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC;AACzE;;;ACFA,SAAS,gBAAiC;AAK1C,SAAS,YACP,QACA,MACA,IACA,UACA,yBAAyB,OACzB;AACA,QAAM,EAAE,MAAM,OAAO,IAAI,IAAI,IAAI;AACjC,MAAI,SAAS,MAAM,OAAO,MAAM;AAC9B;AAAA,EACF;AAEA,WAAS,MAAM;AAEf,QAAM,UAAU,OAAO,QAAQ,OAAO,KAAK,KAAK,SAAS,OAAO;AAChE,MAAI,WAAW,QAAQ,WAAW,CAAC,wBAAwB;AACzD,UAAM,QAAQ,OAAO,KAAK,MAAM,QAAQ,QAAQ,CAAC,EAAE,OAAO,OAAO,CAAC;AAClE,UAAM,WAAW,OAAO,WAAW;AACnC,aAAS,IAAI,GAAG,MAAM,SAAS,KAAK;AAClC,YAAM,OAAO,IAAI,QAAQ,QAAQ,SAAS,QAAQ,QAAQ,CAAC,IAAI;AAC/D,YAAM,UAAU,OAAO,KAAK,OAAO,QAAQ;AAC3C,YAAM,YAAY,KAAK,IAAI,MAAM,GAAG;AACpC,YAAM,UAAU,KAAK,IAAI,IAAI,OAAO;AACpC,UAAI,YAAY,WAAW,UAAU;AACnC,eAAO,OAAO,OAAO,SAAS;AAC5B;AAAA,YACE;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACF;AACA,cAAI,OAAO,MAAM,WAAW,CAAC,OAAO,YAAY,GAAG;AACjD;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,QAAQ,UAAU,IAAI;AACzB;AAAA,MACF;AACA,YAAM,KAAK,KAAK;AAChB,UAAI,MAAM,MAAM;AACd,cAAM,cAAc,KAAK,IAAI,MAAM,KAAK,OAAO,KAAK;AACpD,cAAM,YAAY,KAAK,IAAI,IAAI,GAAG;AAGlC,eAAO,OAAO,OAAO,WAAW;AAE9B;AAAA,YACE;AAAA,YACA,KAAK,IAAI,MAAM,KAAK,OAAO,KAAK;AAAA,YAChC,KAAK,IAAI,IAAI,GAAG;AAAA,YAChB;AAAA,YACA;AAAA,UACF;AACA,cAAI,OAAO,MAAM,aAAa,CAAC,OAAO,YAAY,GAAG;AACnD;AAAA,UACF;AAAA,QACF;AAEA;AAAA,UACE,MAAM,OAAO;AAAA,UACb;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,UAAU;AACZ,aAAO,OAAO;AAAA,IAChB;AAAA,EACF,WAAW,OAAO,WAAW,GAAG;AAC9B,OAAG;AACD,UAAI,OAAO,MAAM,MAAM;AACrB;AAAA,MACF;AACA,UAAI,OAAO,QAAQ,IAAI;AACrB;AAAA,MACF;AACA,kBAAY,QAAQ,MAAM,IAAI,UAAU,sBAAsB;AAAA,IAChE,SAAS,OAAO,YAAY;AAC5B,WAAO,OAAO;AAAA,EAChB;AACF;;;ACpFA,SAAS,WAAW,GAAU,GAAU;AACtC,MAAI,EAAE,SAAS,EAAE,IAAI;AACnB,WAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE;AAAA,EACvC;AAEA;AAAA;AAAA,IAEG,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,QAC7B,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE;AAAA,IAE3B,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE;AAAA;AAEnC;;;ACjBA,SAAS,kBAAkB;AAO3B,IAAM,aAAN,cAAyB,WAAW;AAAA,EAC3B;AAAA,EACA;AAAA,EAEP,YAAY,SAA4B;AACtC,UAAM;AAEN,SAAK,OAAO,QAAQ;AACpB,SAAK,YAAY,QAAQ;AAAA,EAC3B;AAAA,EAEA,QAAQ;AACN,UAAM,MAAM,SAAS,cAAc,MAAM;AACzC,QAAI,YAAY,KAAK,QAAQ;AAC7B,QAAI,UAAU,IAAI,KAAK,aAAa,EAAE;AACtC,WAAO;AAAA,EACT;AAAA,EAEA,GAAG,OAAmB;AACpB,WAAO,KAAK,SAAS,MAAM,QAAQ,KAAK,cAAc,MAAM;AAAA,EAC9D;AAAA,EAEA,cAAuB;AACrB,WAAO;AAAA,EACT;AACF;;;AChCA,IAAM,uBAAuB;AAAA,EAC3B,QAAW,QAA6B;AACtC,WAAO,OAAO,OAAO,CAAC,MAAM,YAAY,CAAC,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC;AAAA,EACnE;AAAA,EACA,MAAS,QAAyB;AAChC,WAAO,OAAO,CAAC;AAAA,EACjB;AAAA,EACA,KAAQ,QAAyB;AAC/B,WAAO,OAAO,OAAO,SAAS,CAAC;AAAA,EACjC;AACF;;;ACRA,SAAS,iBAAuB,OAAsB,OAAU;AAC9D,QAAM,EAAE,KAAK,IAAI;AACjB,MAAI,OAAO,KAAK,aAAa,YAAY;AACvC,WAAO,CAAC,MAAM,KAAK,WAAS,KAAK,SAAS,OAAO,KAAK,CAAC,GAAG,KAAK;AAAA,EACjE;AAEA,SAAO;AACT;;;ACTA,SAAS,UAAa,IAAY,UAAgB;AAChD,QAAM,SAAS,OAAO,IAAI,EAAE;AAE5B,MAAI,CAAE,WAAmB,MAAM,GAAG;AAChC,IAAC,WAAmB,MAAM,IAAI;AAAA,EAChC;AAEA,SAAQ,WAAmB,MAAM;AACnC;;;ACXA,SAAuB,iBAAiB;AAOxC,IAAM,OAAN,MAAW;AAAA,EACD;AAAA,EACA,eACN,CAAC;AAAA,EAEH,YAAY,MAAc;AACxB,SAAK,SAAS;AAAA,EAChB;AAAA,EAEA,aAAa,MAAc,IAAY,SAAiB;AACtD,UAAM,YAAY,KAAK,IAAI,MAAM,EAAE;AACnC,UAAM,UAAU,KAAK,IAAI,MAAM,EAAE;AACjC,UAAMA,cAAa,KAAK,aAAa;AAAA,MACnC,iBAAe,YAAY,YAAY,MAAM,UAAU,YAAY;AAAA,IACrE;AACA,QAAIA,aAAY;AACd;AAAA,IACF;AACA,SAAK,aAAa,KAAK,EAAE,MAAM,WAAW,IAAI,SAAS,QAAQ,CAAC;AAAA,EAClE;AAAA,EAEA,cAAyB;AACvB,UAAM,qBAAqB,CAAC,GAAG,KAAK,YAAY,EAAE;AAAA,MAChD,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE;AAAA,IACvB;AACA,UAAM,WAAsB,CAAC;AAC7B,QAAI,iBAAiB;AACrB,QAAI,kBAAkB;AACtB,eAAW,eAAe,oBAAoB;AAC5C,UAAI,iBAAiB,YAAY,MAAM;AACrC,cAAM,SAAS,YAAY,OAAO;AAClC,iBAAS,KAAK;AAAA,UACZ,eAAe,CAAC,cAAc;AAAA,UAC9B,kBAAkB,CAAC,eAAe;AAAA,UAClC,SAAS,CAAC,MAAM;AAAA,UAChB,MAAM;AAAA,QACR,CAAC;AACD,yBAAiB,YAAY;AAC7B,2BAAmB;AAAA,MACrB;AACA,uBAAiB,YAAY;AAC7B,yBAAmB,YAAY,QAAQ;AAAA,IACzC;AACA,QAAI,iBAAiB,KAAK,OAAO,QAAQ;AACvC,YAAM,SAAS,KAAK,OAAO,SAAS;AACpC,eAAS,KAAK;AAAA,QACZ,eAAe,CAAC,cAAc;AAAA,QAC9B,kBAAkB,CAAC,eAAe;AAAA,QAClC,SAAS,CAAC,MAAM;AAAA,QAChB,MAAM;AAAA,MACR,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AAAA,EAEA,kBAAkB,QAAwB;AACxC,UAAM,YAAY,IAAI,UAAU,KAAK,YAAY,CAAC;AAClD,UAAM,YAAY,MAAM,KAAK,UAAU,iBAAiB,MAAM,CAAC;AAC/D,UAAM,QAAQ,UAAU,CAAC;AACzB,QAAI,MAAM,QAAQ,KAAK,KAAK,OAAO,MAAM,CAAC,MAAM,UAAU;AACxD,aAAO,MAAM,CAAC;AAAA,IAChB;AACA,WAAO;AAAA,EACT;AAAA,EAEA,mBAAmB,QAAwB;AACzC,UAAM,YAAY,IAAI,UAAU,KAAK,YAAY,CAAC;AAClD,UAAM,YAAY,MAAM,KAAK,UAAU,oBAAoB,MAAM,CAAC;AAClE,UAAM,QAAQ,UAAU,CAAC;AACzB,QAAI,MAAM,QAAQ,KAAK,KAAK,OAAO,MAAM,CAAC,MAAM,UAAU;AACxD,aAAO,MAAM,CAAC;AAAA,IAChB;AACA,WAAO;AAAA,EACT;AAAA,EAEA,iBAAiB,OAAqB;AACpC,UAAM,YAAY,IAAI,UAAU,KAAK,YAAY,CAAC;AAClD,UAAM,SAAS,MAAM;AAAA,MACnB,UAAU,cAAc,MAAM,MAAM,MAAM,IAAI,IAAI;AAAA,IACpD;AACA,UAAM,QAAQ,OAAO,CAAC;AACtB,QACE,MAAM,QAAQ,KAAK,KACnB,OAAO,MAAM,CAAC,MAAM,YACpB,OAAO,MAAM,CAAC,MAAM,UACpB;AACA,aAAO,EAAE,MAAM,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,EAAE;AAAA,IACxC;AACA,WAAO;AAAA,EACT;AAAA,EAEA,kBAAkB,OAAqB;AACrC,UAAM,YAAY,IAAI,UAAU,KAAK,YAAY,CAAC;AAClD,UAAM,SAAS,MAAM;AAAA,MACnB,UAAU,iBAAiB,MAAM,MAAM,MAAM,IAAI,IAAI;AAAA,IACvD;AACA,UAAM,QAAQ,OAAO,CAAC;AACtB,QACE,MAAM,QAAQ,KAAK,KACnB,OAAO,MAAM,CAAC,MAAM,YACpB,OAAO,MAAM,CAAC,MAAM,UACpB;AACA,aAAO,EAAE,MAAM,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,EAAE;AAAA,IACxC;AACA,WAAO;AAAA,EACT;AAAA,EAEA,WAAmB;AACjB,UAAM,qBAAqB,CAAC,GAAG,KAAK,YAAY,EAAE;AAAA,MAChD,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE;AAAA,IACvB;AACA,QAAI,SAAS;AACb,QAAI,SAAS;AACb,eAAW,eAAe,oBAAoB;AAC5C,UAAI,SAAS,YAAY,MAAM;AAC7B,kBAAU,KAAK,OAAO,MAAM,QAAQ,YAAY,IAAI;AAAA,MACtD;AACA,gBAAU,YAAY;AACtB,eAAS,YAAY;AAAA,IACvB;AACA,QAAI,SAAS,KAAK,OAAO,QAAQ;AAC/B,gBAAU,KAAK,OAAO,MAAM,MAAM;AAAA,IACpC;AACA,WAAO;AAAA,EACT;AACF;","names":["hasOverlap"]}

package/dist/index.d.mts

@@ -9,11 +9,11 @@ declare function flatten<T>(arrayOfArray: T[][]): T[];
 
 declare function traverseAST(cursor: TreeCursor, from: number, to: number, callback: (cursor: TreeCursor) => void, disableOverlayTraverse?: boolean): void;
 
-interface Range {
+interface Range$1 {
     from: number;
     to: number;
 }
-declare function hasOverlap(a: Range, b: Range): boolean;
+declare function hasOverlap(a: Range$1, b: Range$1): boolean;
 
 interface SpanWidgetOptions {
     text?: string;
@@ -38,4 +38,21 @@ declare function withDefaultValue<T, U>(field: StateField<T>, value: U): StateFi
 
 declare function singleton<T>(id: string, instance: T): T;
 
-export { FacetCombineStrategy, SpanWidget, disposeAll, flatten, hasOverlap, singleton, traverseAST, withDefaultValue };
+interface Range {
+    from: number;
+    to: number;
+}
+declare class Text {
+    #private;
+    private source;
+    private replacements;
+    constructor(text: string);
+    replaceRange(from: number, to: number, content: string): void;
+    originalOffsetFor(offset: number): number;
+    generatedOffsetFor(offset: number): number;
+    originalRangeFor(range: Range): Range;
+    generatedRangeFor(range: Range): Range;
+    toString(): string;
+}
+
+export { FacetCombineStrategy, SpanWidget, Text, disposeAll, flatten, hasOverlap, singleton, traverseAST, withDefaultValue };

package/dist/index.d.ts

@@ -9,11 +9,11 @@ declare function flatten<T>(arrayOfArray: T[][]): T[];
 
 declare function traverseAST(cursor: TreeCursor, from: number, to: number, callback: (cursor: TreeCursor) => void, disableOverlayTraverse?: boolean): void;
 
-interface Range {
+interface Range$1 {
     from: number;
     to: number;
 }
-declare function hasOverlap(a: Range, b: Range): boolean;
+declare function hasOverlap(a: Range$1, b: Range$1): boolean;
 
 interface SpanWidgetOptions {
     text?: string;
@@ -38,4 +38,21 @@ declare function withDefaultValue<T, U>(field: StateField<T>, value: U): StateFi
 
 declare function singleton<T>(id: string, instance: T): T;
 
-export { FacetCombineStrategy, SpanWidget, disposeAll, flatten, hasOverlap, singleton, traverseAST, withDefaultValue };
+interface Range {
+    from: number;
+    to: number;
+}
+declare class Text {
+    #private;
+    private source;
+    private replacements;
+    constructor(text: string);
+    replaceRange(from: number, to: number, content: string): void;
+    originalOffsetFor(offset: number): number;
+    generatedOffsetFor(offset: number): number;
+    originalRangeFor(range: Range): Range;
+    generatedRangeFor(range: Range): Range;
+    toString(): string;
+}
+
+export { FacetCombineStrategy, SpanWidget, Text, disposeAll, flatten, hasOverlap, singleton, traverseAST, withDefaultValue };

package/dist/index.js

@@ -21,6 +21,7 @@ var index_exports = {};
 __export(index_exports, {
   FacetCombineStrategy: () => FacetCombineStrategy,
   SpanWidget: () => SpanWidget,
+  Text: () => Text,
   disposeAll: () => disposeAll,
   flatten: () => flatten,
   hasOverlap: () => hasOverlap,
@@ -188,10 +189,123 @@ function singleton(id, instance) {
   }
   return globalThis[symbol];
 }
+
+// src/text.ts
+var import_source_map = require("@volar/source-map");
+var Text = class {
+  source;
+  replacements = [];
+  constructor(text) {
+    this.source = text;
+  }
+  replaceRange(from, to, content) {
+    const rangeFrom = Math.min(from, to);
+    const rangeTo = Math.max(from, to);
+    const hasOverlap2 = this.replacements.some(
+      (replacement) => rangeFrom < replacement.to && rangeTo > replacement.from
+    );
+    if (hasOverlap2) {
+      return;
+    }
+    this.replacements.push({ from: rangeFrom, to: rangeTo, content });
+  }
+  #toMappings() {
+    const sortedReplacements = [...this.replacements].sort(
+      (a, b) => a.from - b.from
+    );
+    const mappings = [];
+    let originalOffset = 0;
+    let generatedOffset = 0;
+    for (const replacement of sortedReplacements) {
+      if (originalOffset < replacement.from) {
+        const length = replacement.from - originalOffset;
+        mappings.push({
+          sourceOffsets: [originalOffset],
+          generatedOffsets: [generatedOffset],
+          lengths: [length],
+          data: void 0
+        });
+        originalOffset = replacement.from;
+        generatedOffset += length;
+      }
+      originalOffset = replacement.to;
+      generatedOffset += replacement.content.length;
+    }
+    if (originalOffset < this.source.length) {
+      const length = this.source.length - originalOffset;
+      mappings.push({
+        sourceOffsets: [originalOffset],
+        generatedOffsets: [generatedOffset],
+        lengths: [length],
+        data: void 0
+      });
+    }
+    return mappings;
+  }
+  originalOffsetFor(offset) {
+    const sourceMap = new import_source_map.SourceMap(this.#toMappings());
+    const locations = Array.from(sourceMap.toSourceLocation(offset));
+    const first = locations[0];
+    if (Array.isArray(first) && typeof first[0] === "number") {
+      return first[0];
+    }
+    return offset;
+  }
+  generatedOffsetFor(offset) {
+    const sourceMap = new import_source_map.SourceMap(this.#toMappings());
+    const locations = Array.from(sourceMap.toGeneratedLocation(offset));
+    const first = locations[0];
+    if (Array.isArray(first) && typeof first[0] === "number") {
+      return first[0];
+    }
+    return offset;
+  }
+  originalRangeFor(range) {
+    const sourceMap = new import_source_map.SourceMap(this.#toMappings());
+    const ranges = Array.from(
+      sourceMap.toSourceRange(range.from, range.to, true)
+    );
+    const first = ranges[0];
+    if (Array.isArray(first) && typeof first[0] === "number" && typeof first[1] === "number") {
+      return { from: first[0], to: first[1] };
+    }
+    return range;
+  }
+  generatedRangeFor(range) {
+    const sourceMap = new import_source_map.SourceMap(this.#toMappings());
+    const ranges = Array.from(
+      sourceMap.toGeneratedRange(range.from, range.to, true)
+    );
+    const first = ranges[0];
+    if (Array.isArray(first) && typeof first[0] === "number" && typeof first[1] === "number") {
+      return { from: first[0], to: first[1] };
+    }
+    return range;
+  }
+  toString() {
+    const sortedReplacements = [...this.replacements].sort(
+      (a, b) => a.from - b.from
+    );
+    let cursor = 0;
+    let result = "";
+    for (const replacement of sortedReplacements) {
+      if (cursor < replacement.from) {
+        result += this.source.slice(cursor, replacement.from);
+      }
+      result += replacement.content;
+      cursor = replacement.to;
+    }
+    if (cursor < this.source.length) {
+      result += this.source.slice(cursor);
+    }
+    return result;
+  }
+};
 // Annotate the CommonJS export names for ESM import in node:
 0 && (module.exports = {
   FacetCombineStrategy,
   SpanWidget,
+  Text,
   disposeAll,
   flatten,
   hasOverlap,

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/index.ts","../src/dispose-all.ts","../src/flatten.ts","../src/traverse.ts","../src/overlap.ts","../src/span.ts","../src/facet.ts","../src/field.ts","../src/singleton.ts"],"sourcesContent":["//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nexport { disposeAll } from './dispose-all';\n\nexport { flatten } from './flatten';\n\nexport { traverseAST } from './traverse';\n\nexport { hasOverlap } from './overlap';\n\nexport { SpanWidget } from './span';\n\nexport { FacetCombineStrategy } from './facet';\n\nexport { withDefaultValue } from './field';\n\nexport { singleton } from './singleton';\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nfunction disposeAll(disposes: unknown[]) {\n  return () => {\n    for (const dispose of disposes) {\n      if (typeof dispose === 'function') {\n        dispose();\n      }\n    }\n  };\n}\n\nexport { disposeAll };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nfunction flatten<T>(arrayOfArray: T[][]) {\n  return arrayOfArray.reduce((memo, current) => [...memo, ...current], []);\n}\n\nexport { flatten };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nimport { NodeProp, type TreeCursor } from '@lezer/common';\n\n// TODO: 优化对外 options\n// - cursor -> tree\n// - remove from, to\nfunction traverseAST(\n  cursor: TreeCursor,\n  from: number,\n  to: number,\n  callback: (cursor: TreeCursor) => void,\n  disableOverlayTraverse = false,\n) {\n  const { from: start, to: end } = cursor;\n  if (start >= to || end <= from) {\n    return;\n  }\n\n  callback(cursor);\n\n  const mounted = cursor.tree && cursor.tree.prop(NodeProp.mounted);\n  if (mounted && mounted.overlay && !disableOverlayTraverse) {\n    const inner = cursor.node.enter(mounted.overlay[0].from + start, 1)!;\n    const hasChild = cursor.firstChild();\n    for (let i = 0, pos = start; ; i++) {\n      const next = i < mounted.overlay.length ? mounted.overlay[i] : null;\n      const nextPos = next ? next.from + start : end;\n      const rangeFrom = Math.max(from, pos);\n      const rangeTo = Math.min(to, nextPos);\n      if (rangeFrom < rangeTo && hasChild) {\n        while (cursor.from < rangeTo) {\n          traverseAST(\n            cursor,\n            rangeFrom,\n            rangeTo,\n            callback,\n            disableOverlayTraverse,\n          );\n          if (cursor.to >= nextPos || !cursor.nextSibling()) {\n            break;\n          }\n        }\n      }\n      if (!next || nextPos > to) {\n        break;\n      }\n      pos = next.to + start;\n      if (pos > from) {\n        const overlayFrom = Math.max(from, next.from + start);\n        const overlayTo = Math.min(to, pos);\n\n        // walk overlay range in top tree\n        while (cursor.from < overlayTo) {\n          // disable overlay traverse to avoid infinite overlay traversion\n          traverseAST(\n            cursor,\n            Math.max(from, next.from + start),\n            Math.min(to, pos),\n            callback,\n            true,\n          );\n          if (cursor.to >= overlayTo || !cursor.nextSibling()) {\n            break;\n          }\n        }\n\n        traverseAST(\n          inner.cursor(),\n          overlayFrom,\n          overlayTo,\n          callback,\n          disableOverlayTraverse,\n        );\n      }\n    }\n    if (hasChild) {\n      cursor.parent();\n    }\n  } else if (cursor.firstChild()) {\n    do {\n      if (cursor.to <= from) {\n        continue;\n      }\n      if (cursor.from >= to) {\n        break;\n      }\n      traverseAST(cursor, from, to, callback, disableOverlayTraverse);\n    } while (cursor.nextSibling());\n    cursor.parent();\n  }\n}\n\nexport { traverseAST };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\ninterface Range {\n  from: number;\n  to: number;\n}\n\nfunction hasOverlap(a: Range, b: Range) {\n  if (a.from === a.to) {\n    return a.from > b.from && a.from < b.to;\n  }\n\n  return (\n    // exists common part or a contains b\n    (a.from <= b.from && a.to > b.from) ||\n    (a.to >= b.to && a.from < b.to) ||\n    // a inside b\n    (a.from >= b.from && a.to <= b.to)\n  );\n}\n\nexport { hasOverlap };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nimport { WidgetType } from '@codemirror/view';\n\ninterface SpanWidgetOptions {\n  text?: string;\n  className?: string;\n}\n\nclass SpanWidget extends WidgetType {\n  public text?: string;\n  public className?: string;\n\n  constructor(options: SpanWidgetOptions) {\n    super();\n\n    this.text = options.text;\n    this.className = options.className;\n  }\n\n  toDOM() {\n    const dom = document.createElement('span');\n    dom.innerText = this.text ?? '';\n    dom.classList.add(this.className ?? '');\n    return dom;\n  }\n\n  eq(other: SpanWidget) {\n    return this.text === other.text && this.className === other.className;\n  }\n\n  ignoreEvent(): boolean {\n    return false;\n  }\n}\n\nexport { SpanWidget };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nconst FacetCombineStrategy = {\n  Flatten<T>(values: readonly T[][]): T[] {\n    return values.reduce((memo, current) => [...memo, ...current], []);\n  },\n  First<T>(values: readonly T[]): T {\n    return values[0];\n  },\n  Last<T>(values: readonly T[]): T {\n    return values[values.length - 1];\n  },\n};\n\nexport { FacetCombineStrategy };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nimport { type StateField } from '@codemirror/state';\n\nfunction withDefaultValue<T, U>(field: StateField<T>, value: U) {\n  const { spec } = field as any;\n  if (typeof spec.fromJSON === 'function') {\n    return [field.init(state => spec.fromJSON(value, state)), field];\n  }\n\n  return field;\n}\n\nexport { withDefaultValue };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nfunction singleton<T>(id: string, instance: T): T {\n  const symbol = Symbol.for(id);\n\n  if (!(globalThis as any)[symbol]) {\n    (globalThis as any)[symbol] = instance;\n  }\n\n  return (globalThis as any)[symbol];\n}\n\nexport { singleton };\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACGA,SAAS,WAAW,UAAqB;AACvC,SAAO,MAAM;AACX,eAAW,WAAW,UAAU;AAC9B,UAAI,OAAO,YAAY,YAAY;AACjC,gBAAQ;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACF;;;ACRA,SAAS,QAAW,cAAqB;AACvC,SAAO,aAAa,OAAO,CAAC,MAAM,YAAY,CAAC,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC;AACzE;;;ACFA,oBAA0C;AAK1C,SAAS,YACP,QACA,MACA,IACA,UACA,yBAAyB,OACzB;AACA,QAAM,EAAE,MAAM,OAAO,IAAI,IAAI,IAAI;AACjC,MAAI,SAAS,MAAM,OAAO,MAAM;AAC9B;AAAA,EACF;AAEA,WAAS,MAAM;AAEf,QAAM,UAAU,OAAO,QAAQ,OAAO,KAAK,KAAK,uBAAS,OAAO;AAChE,MAAI,WAAW,QAAQ,WAAW,CAAC,wBAAwB;AACzD,UAAM,QAAQ,OAAO,KAAK,MAAM,QAAQ,QAAQ,CAAC,EAAE,OAAO,OAAO,CAAC;AAClE,UAAM,WAAW,OAAO,WAAW;AACnC,aAAS,IAAI,GAAG,MAAM,SAAS,KAAK;AAClC,YAAM,OAAO,IAAI,QAAQ,QAAQ,SAAS,QAAQ,QAAQ,CAAC,IAAI;AAC/D,YAAM,UAAU,OAAO,KAAK,OAAO,QAAQ;AAC3C,YAAM,YAAY,KAAK,IAAI,MAAM,GAAG;AACpC,YAAM,UAAU,KAAK,IAAI,IAAI,OAAO;AACpC,UAAI,YAAY,WAAW,UAAU;AACnC,eAAO,OAAO,OAAO,SAAS;AAC5B;AAAA,YACE;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACF;AACA,cAAI,OAAO,MAAM,WAAW,CAAC,OAAO,YAAY,GAAG;AACjD;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,QAAQ,UAAU,IAAI;AACzB;AAAA,MACF;AACA,YAAM,KAAK,KAAK;AAChB,UAAI,MAAM,MAAM;AACd,cAAM,cAAc,KAAK,IAAI,MAAM,KAAK,OAAO,KAAK;AACpD,cAAM,YAAY,KAAK,IAAI,IAAI,GAAG;AAGlC,eAAO,OAAO,OAAO,WAAW;AAE9B;AAAA,YACE;AAAA,YACA,KAAK,IAAI,MAAM,KAAK,OAAO,KAAK;AAAA,YAChC,KAAK,IAAI,IAAI,GAAG;AAAA,YAChB;AAAA,YACA;AAAA,UACF;AACA,cAAI,OAAO,MAAM,aAAa,CAAC,OAAO,YAAY,GAAG;AACnD;AAAA,UACF;AAAA,QACF;AAEA;AAAA,UACE,MAAM,OAAO;AAAA,UACb;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,UAAU;AACZ,aAAO,OAAO;AAAA,IAChB;AAAA,EACF,WAAW,OAAO,WAAW,GAAG;AAC9B,OAAG;AACD,UAAI,OAAO,MAAM,MAAM;AACrB;AAAA,MACF;AACA,UAAI,OAAO,QAAQ,IAAI;AACrB;AAAA,MACF;AACA,kBAAY,QAAQ,MAAM,IAAI,UAAU,sBAAsB;AAAA,IAChE,SAAS,OAAO,YAAY;AAC5B,WAAO,OAAO;AAAA,EAChB;AACF;;;ACpFA,SAAS,WAAW,GAAU,GAAU;AACtC,MAAI,EAAE,SAAS,EAAE,IAAI;AACnB,WAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE;AAAA,EACvC;AAEA;AAAA;AAAA,IAEG,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,QAC7B,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE;AAAA,IAE3B,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE;AAAA;AAEnC;;;ACjBA,kBAA2B;AAO3B,IAAM,aAAN,cAAyB,uBAAW;AAAA,EAC3B;AAAA,EACA;AAAA,EAEP,YAAY,SAA4B;AACtC,UAAM;AAEN,SAAK,OAAO,QAAQ;AACpB,SAAK,YAAY,QAAQ;AAAA,EAC3B;AAAA,EAEA,QAAQ;AACN,UAAM,MAAM,SAAS,cAAc,MAAM;AACzC,QAAI,YAAY,KAAK,QAAQ;AAC7B,QAAI,UAAU,IAAI,KAAK,aAAa,EAAE;AACtC,WAAO;AAAA,EACT;AAAA,EAEA,GAAG,OAAmB;AACpB,WAAO,KAAK,SAAS,MAAM,QAAQ,KAAK,cAAc,MAAM;AAAA,EAC9D;AAAA,EAEA,cAAuB;AACrB,WAAO;AAAA,EACT;AACF;;;AChCA,IAAM,uBAAuB;AAAA,EAC3B,QAAW,QAA6B;AACtC,WAAO,OAAO,OAAO,CAAC,MAAM,YAAY,CAAC,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC;AAAA,EACnE;AAAA,EACA,MAAS,QAAyB;AAChC,WAAO,OAAO,CAAC;AAAA,EACjB;AAAA,EACA,KAAQ,QAAyB;AAC/B,WAAO,OAAO,OAAO,SAAS,CAAC;AAAA,EACjC;AACF;;;ACRA,SAAS,iBAAuB,OAAsB,OAAU;AAC9D,QAAM,EAAE,KAAK,IAAI;AACjB,MAAI,OAAO,KAAK,aAAa,YAAY;AACvC,WAAO,CAAC,MAAM,KAAK,WAAS,KAAK,SAAS,OAAO,KAAK,CAAC,GAAG,KAAK;AAAA,EACjE;AAEA,SAAO;AACT;;;ACTA,SAAS,UAAa,IAAY,UAAgB;AAChD,QAAM,SAAS,OAAO,IAAI,EAAE;AAE5B,MAAI,CAAE,WAAmB,MAAM,GAAG;AAChC,IAAC,WAAmB,MAAM,IAAI;AAAA,EAChC;AAEA,SAAQ,WAAmB,MAAM;AACnC;","names":[]}
+{"version":3,"sources":["../src/index.ts","../src/dispose-all.ts","../src/flatten.ts","../src/traverse.ts","../src/overlap.ts","../src/span.ts","../src/facet.ts","../src/field.ts","../src/singleton.ts","../src/text.ts"],"sourcesContent":["//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nexport { disposeAll } from './dispose-all';\n\nexport { flatten } from './flatten';\n\nexport { traverseAST } from './traverse';\n\nexport { hasOverlap } from './overlap';\n\nexport { SpanWidget } from './span';\n\nexport { FacetCombineStrategy } from './facet';\n\nexport { withDefaultValue } from './field';\n\nexport { singleton } from './singleton';\n\nexport { Text } from './text';\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nfunction disposeAll(disposes: unknown[]) {\n  return () => {\n    for (const dispose of disposes) {\n      if (typeof dispose === 'function') {\n        dispose();\n      }\n    }\n  };\n}\n\nexport { disposeAll };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nfunction flatten<T>(arrayOfArray: T[][]) {\n  return arrayOfArray.reduce((memo, current) => [...memo, ...current], []);\n}\n\nexport { flatten };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nimport { NodeProp, type TreeCursor } from '@lezer/common';\n\n// TODO: 优化对外 options\n// - cursor -> tree\n// - remove from, to\nfunction traverseAST(\n  cursor: TreeCursor,\n  from: number,\n  to: number,\n  callback: (cursor: TreeCursor) => void,\n  disableOverlayTraverse = false,\n) {\n  const { from: start, to: end } = cursor;\n  if (start >= to || end <= from) {\n    return;\n  }\n\n  callback(cursor);\n\n  const mounted = cursor.tree && cursor.tree.prop(NodeProp.mounted);\n  if (mounted && mounted.overlay && !disableOverlayTraverse) {\n    const inner = cursor.node.enter(mounted.overlay[0].from + start, 1)!;\n    const hasChild = cursor.firstChild();\n    for (let i = 0, pos = start; ; i++) {\n      const next = i < mounted.overlay.length ? mounted.overlay[i] : null;\n      const nextPos = next ? next.from + start : end;\n      const rangeFrom = Math.max(from, pos);\n      const rangeTo = Math.min(to, nextPos);\n      if (rangeFrom < rangeTo && hasChild) {\n        while (cursor.from < rangeTo) {\n          traverseAST(\n            cursor,\n            rangeFrom,\n            rangeTo,\n            callback,\n            disableOverlayTraverse,\n          );\n          if (cursor.to >= nextPos || !cursor.nextSibling()) {\n            break;\n          }\n        }\n      }\n      if (!next || nextPos > to) {\n        break;\n      }\n      pos = next.to + start;\n      if (pos > from) {\n        const overlayFrom = Math.max(from, next.from + start);\n        const overlayTo = Math.min(to, pos);\n\n        // walk overlay range in top tree\n        while (cursor.from < overlayTo) {\n          // disable overlay traverse to avoid infinite overlay traversion\n          traverseAST(\n            cursor,\n            Math.max(from, next.from + start),\n            Math.min(to, pos),\n            callback,\n            true,\n          );\n          if (cursor.to >= overlayTo || !cursor.nextSibling()) {\n            break;\n          }\n        }\n\n        traverseAST(\n          inner.cursor(),\n          overlayFrom,\n          overlayTo,\n          callback,\n          disableOverlayTraverse,\n        );\n      }\n    }\n    if (hasChild) {\n      cursor.parent();\n    }\n  } else if (cursor.firstChild()) {\n    do {\n      if (cursor.to <= from) {\n        continue;\n      }\n      if (cursor.from >= to) {\n        break;\n      }\n      traverseAST(cursor, from, to, callback, disableOverlayTraverse);\n    } while (cursor.nextSibling());\n    cursor.parent();\n  }\n}\n\nexport { traverseAST };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\ninterface Range {\n  from: number;\n  to: number;\n}\n\nfunction hasOverlap(a: Range, b: Range) {\n  if (a.from === a.to) {\n    return a.from > b.from && a.from < b.to;\n  }\n\n  return (\n    // exists common part or a contains b\n    (a.from <= b.from && a.to > b.from) ||\n    (a.to >= b.to && a.from < b.to) ||\n    // a inside b\n    (a.from >= b.from && a.to <= b.to)\n  );\n}\n\nexport { hasOverlap };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nimport { WidgetType } from '@codemirror/view';\n\ninterface SpanWidgetOptions {\n  text?: string;\n  className?: string;\n}\n\nclass SpanWidget extends WidgetType {\n  public text?: string;\n  public className?: string;\n\n  constructor(options: SpanWidgetOptions) {\n    super();\n\n    this.text = options.text;\n    this.className = options.className;\n  }\n\n  toDOM() {\n    const dom = document.createElement('span');\n    dom.innerText = this.text ?? '';\n    dom.classList.add(this.className ?? '');\n    return dom;\n  }\n\n  eq(other: SpanWidget) {\n    return this.text === other.text && this.className === other.className;\n  }\n\n  ignoreEvent(): boolean {\n    return false;\n  }\n}\n\nexport { SpanWidget };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nconst FacetCombineStrategy = {\n  Flatten<T>(values: readonly T[][]): T[] {\n    return values.reduce((memo, current) => [...memo, ...current], []);\n  },\n  First<T>(values: readonly T[]): T {\n    return values[0];\n  },\n  Last<T>(values: readonly T[]): T {\n    return values[values.length - 1];\n  },\n};\n\nexport { FacetCombineStrategy };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nimport { type StateField } from '@codemirror/state';\n\nfunction withDefaultValue<T, U>(field: StateField<T>, value: U) {\n  const { spec } = field as any;\n  if (typeof spec.fromJSON === 'function') {\n    return [field.init(state => spec.fromJSON(value, state)), field];\n  }\n\n  return field;\n}\n\nexport { withDefaultValue };\n","//  Copyright (c) 2025 coze-dev\n//  SPDX-License-Identifier: MIT\n\nfunction singleton<T>(id: string, instance: T): T {\n  const symbol = Symbol.for(id);\n\n  if (!(globalThis as any)[symbol]) {\n    (globalThis as any)[symbol] = instance;\n  }\n\n  return (globalThis as any)[symbol];\n}\n\nexport { singleton };\n","import { type Mapping, SourceMap } from '@volar/source-map';\n\ninterface Range {\n  from: number;\n  to: number;\n}\n\nclass Text {\n  private source: string;\n  private replacements: Array<{ from: number; to: number; content: string }> =\n    [];\n\n  constructor(text: string) {\n    this.source = text;\n  }\n\n  replaceRange(from: number, to: number, content: string) {\n    const rangeFrom = Math.min(from, to);\n    const rangeTo = Math.max(from, to);\n    const hasOverlap = this.replacements.some(\n      replacement => rangeFrom < replacement.to && rangeTo > replacement.from,\n    );\n    if (hasOverlap) {\n      return;\n    }\n    this.replacements.push({ from: rangeFrom, to: rangeTo, content });\n  }\n\n  #toMappings(): Mapping[] {\n    const sortedReplacements = [...this.replacements].sort(\n      (a, b) => a.from - b.from,\n    );\n    const mappings: Mapping[] = [];\n    let originalOffset = 0;\n    let generatedOffset = 0;\n    for (const replacement of sortedReplacements) {\n      if (originalOffset < replacement.from) {\n        const length = replacement.from - originalOffset;\n        mappings.push({\n          sourceOffsets: [originalOffset],\n          generatedOffsets: [generatedOffset],\n          lengths: [length],\n          data: undefined,\n        });\n        originalOffset = replacement.from;\n        generatedOffset += length;\n      }\n      originalOffset = replacement.to;\n      generatedOffset += replacement.content.length;\n    }\n    if (originalOffset < this.source.length) {\n      const length = this.source.length - originalOffset;\n      mappings.push({\n        sourceOffsets: [originalOffset],\n        generatedOffsets: [generatedOffset],\n        lengths: [length],\n        data: undefined,\n      });\n    }\n    return mappings;\n  }\n\n  originalOffsetFor(offset: number): number {\n    const sourceMap = new SourceMap(this.#toMappings());\n    const locations = Array.from(sourceMap.toSourceLocation(offset));\n    const first = locations[0];\n    if (Array.isArray(first) && typeof first[0] === 'number') {\n      return first[0];\n    }\n    return offset;\n  }\n\n  generatedOffsetFor(offset: number): number {\n    const sourceMap = new SourceMap(this.#toMappings());\n    const locations = Array.from(sourceMap.toGeneratedLocation(offset));\n    const first = locations[0];\n    if (Array.isArray(first) && typeof first[0] === 'number') {\n      return first[0];\n    }\n    return offset;\n  }\n\n  originalRangeFor(range: Range): Range {\n    const sourceMap = new SourceMap(this.#toMappings());\n    const ranges = Array.from(\n      sourceMap.toSourceRange(range.from, range.to, true),\n    );\n    const first = ranges[0];\n    if (\n      Array.isArray(first) &&\n      typeof first[0] === 'number' &&\n      typeof first[1] === 'number'\n    ) {\n      return { from: first[0], to: first[1] };\n    }\n    return range;\n  }\n\n  generatedRangeFor(range: Range): Range {\n    const sourceMap = new SourceMap(this.#toMappings());\n    const ranges = Array.from(\n      sourceMap.toGeneratedRange(range.from, range.to, true),\n    );\n    const first = ranges[0];\n    if (\n      Array.isArray(first) &&\n      typeof first[0] === 'number' &&\n      typeof first[1] === 'number'\n    ) {\n      return { from: first[0], to: first[1] };\n    }\n    return range;\n  }\n\n  toString(): string {\n    const sortedReplacements = [...this.replacements].sort(\n      (a, b) => a.from - b.from,\n    );\n    let cursor = 0;\n    let result = '';\n    for (const replacement of sortedReplacements) {\n      if (cursor < replacement.from) {\n        result += this.source.slice(cursor, replacement.from);\n      }\n      result += replacement.content;\n      cursor = replacement.to;\n    }\n    if (cursor < this.source.length) {\n      result += this.source.slice(cursor);\n    }\n    return result;\n  }\n}\n\nexport { Text };\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACGA,SAAS,WAAW,UAAqB;AACvC,SAAO,MAAM;AACX,eAAW,WAAW,UAAU;AAC9B,UAAI,OAAO,YAAY,YAAY;AACjC,gBAAQ;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACF;;;ACRA,SAAS,QAAW,cAAqB;AACvC,SAAO,aAAa,OAAO,CAAC,MAAM,YAAY,CAAC,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC;AACzE;;;ACFA,oBAA0C;AAK1C,SAAS,YACP,QACA,MACA,IACA,UACA,yBAAyB,OACzB;AACA,QAAM,EAAE,MAAM,OAAO,IAAI,IAAI,IAAI;AACjC,MAAI,SAAS,MAAM,OAAO,MAAM;AAC9B;AAAA,EACF;AAEA,WAAS,MAAM;AAEf,QAAM,UAAU,OAAO,QAAQ,OAAO,KAAK,KAAK,uBAAS,OAAO;AAChE,MAAI,WAAW,QAAQ,WAAW,CAAC,wBAAwB;AACzD,UAAM,QAAQ,OAAO,KAAK,MAAM,QAAQ,QAAQ,CAAC,EAAE,OAAO,OAAO,CAAC;AAClE,UAAM,WAAW,OAAO,WAAW;AACnC,aAAS,IAAI,GAAG,MAAM,SAAS,KAAK;AAClC,YAAM,OAAO,IAAI,QAAQ,QAAQ,SAAS,QAAQ,QAAQ,CAAC,IAAI;AAC/D,YAAM,UAAU,OAAO,KAAK,OAAO,QAAQ;AAC3C,YAAM,YAAY,KAAK,IAAI,MAAM,GAAG;AACpC,YAAM,UAAU,KAAK,IAAI,IAAI,OAAO;AACpC,UAAI,YAAY,WAAW,UAAU;AACnC,eAAO,OAAO,OAAO,SAAS;AAC5B;AAAA,YACE;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACF;AACA,cAAI,OAAO,MAAM,WAAW,CAAC,OAAO,YAAY,GAAG;AACjD;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,QAAQ,UAAU,IAAI;AACzB;AAAA,MACF;AACA,YAAM,KAAK,KAAK;AAChB,UAAI,MAAM,MAAM;AACd,cAAM,cAAc,KAAK,IAAI,MAAM,KAAK,OAAO,KAAK;AACpD,cAAM,YAAY,KAAK,IAAI,IAAI,GAAG;AAGlC,eAAO,OAAO,OAAO,WAAW;AAE9B;AAAA,YACE;AAAA,YACA,KAAK,IAAI,MAAM,KAAK,OAAO,KAAK;AAAA,YAChC,KAAK,IAAI,IAAI,GAAG;AAAA,YAChB;AAAA,YACA;AAAA,UACF;AACA,cAAI,OAAO,MAAM,aAAa,CAAC,OAAO,YAAY,GAAG;AACnD;AAAA,UACF;AAAA,QACF;AAEA;AAAA,UACE,MAAM,OAAO;AAAA,UACb;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,UAAU;AACZ,aAAO,OAAO;AAAA,IAChB;AAAA,EACF,WAAW,OAAO,WAAW,GAAG;AAC9B,OAAG;AACD,UAAI,OAAO,MAAM,MAAM;AACrB;AAAA,MACF;AACA,UAAI,OAAO,QAAQ,IAAI;AACrB;AAAA,MACF;AACA,kBAAY,QAAQ,MAAM,IAAI,UAAU,sBAAsB;AAAA,IAChE,SAAS,OAAO,YAAY;AAC5B,WAAO,OAAO;AAAA,EAChB;AACF;;;ACpFA,SAAS,WAAW,GAAU,GAAU;AACtC,MAAI,EAAE,SAAS,EAAE,IAAI;AACnB,WAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE;AAAA,EACvC;AAEA;AAAA;AAAA,IAEG,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,QAC7B,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE;AAAA,IAE3B,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE;AAAA;AAEnC;;;ACjBA,kBAA2B;AAO3B,IAAM,aAAN,cAAyB,uBAAW;AAAA,EAC3B;AAAA,EACA;AAAA,EAEP,YAAY,SAA4B;AACtC,UAAM;AAEN,SAAK,OAAO,QAAQ;AACpB,SAAK,YAAY,QAAQ;AAAA,EAC3B;AAAA,EAEA,QAAQ;AACN,UAAM,MAAM,SAAS,cAAc,MAAM;AACzC,QAAI,YAAY,KAAK,QAAQ;AAC7B,QAAI,UAAU,IAAI,KAAK,aAAa,EAAE;AACtC,WAAO;AAAA,EACT;AAAA,EAEA,GAAG,OAAmB;AACpB,WAAO,KAAK,SAAS,MAAM,QAAQ,KAAK,cAAc,MAAM;AAAA,EAC9D;AAAA,EAEA,cAAuB;AACrB,WAAO;AAAA,EACT;AACF;;;AChCA,IAAM,uBAAuB;AAAA,EAC3B,QAAW,QAA6B;AACtC,WAAO,OAAO,OAAO,CAAC,MAAM,YAAY,CAAC,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC;AAAA,EACnE;AAAA,EACA,MAAS,QAAyB;AAChC,WAAO,OAAO,CAAC;AAAA,EACjB;AAAA,EACA,KAAQ,QAAyB;AAC/B,WAAO,OAAO,OAAO,SAAS,CAAC;AAAA,EACjC;AACF;;;ACRA,SAAS,iBAAuB,OAAsB,OAAU;AAC9D,QAAM,EAAE,KAAK,IAAI;AACjB,MAAI,OAAO,KAAK,aAAa,YAAY;AACvC,WAAO,CAAC,MAAM,KAAK,WAAS,KAAK,SAAS,OAAO,KAAK,CAAC,GAAG,KAAK;AAAA,EACjE;AAEA,SAAO;AACT;;;ACTA,SAAS,UAAa,IAAY,UAAgB;AAChD,QAAM,SAAS,OAAO,IAAI,EAAE;AAE5B,MAAI,CAAE,WAAmB,MAAM,GAAG;AAChC,IAAC,WAAmB,MAAM,IAAI;AAAA,EAChC;AAEA,SAAQ,WAAmB,MAAM;AACnC;;;ACXA,wBAAwC;AAOxC,IAAM,OAAN,MAAW;AAAA,EACD;AAAA,EACA,eACN,CAAC;AAAA,EAEH,YAAY,MAAc;AACxB,SAAK,SAAS;AAAA,EAChB;AAAA,EAEA,aAAa,MAAc,IAAY,SAAiB;AACtD,UAAM,YAAY,KAAK,IAAI,MAAM,EAAE;AACnC,UAAM,UAAU,KAAK,IAAI,MAAM,EAAE;AACjC,UAAMA,cAAa,KAAK,aAAa;AAAA,MACnC,iBAAe,YAAY,YAAY,MAAM,UAAU,YAAY;AAAA,IACrE;AACA,QAAIA,aAAY;AACd;AAAA,IACF;AACA,SAAK,aAAa,KAAK,EAAE,MAAM,WAAW,IAAI,SAAS,QAAQ,CAAC;AAAA,EAClE;AAAA,EAEA,cAAyB;AACvB,UAAM,qBAAqB,CAAC,GAAG,KAAK,YAAY,EAAE;AAAA,MAChD,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE;AAAA,IACvB;AACA,UAAM,WAAsB,CAAC;AAC7B,QAAI,iBAAiB;AACrB,QAAI,kBAAkB;AACtB,eAAW,eAAe,oBAAoB;AAC5C,UAAI,iBAAiB,YAAY,MAAM;AACrC,cAAM,SAAS,YAAY,OAAO;AAClC,iBAAS,KAAK;AAAA,UACZ,eAAe,CAAC,cAAc;AAAA,UAC9B,kBAAkB,CAAC,eAAe;AAAA,UAClC,SAAS,CAAC,MAAM;AAAA,UAChB,MAAM;AAAA,QACR,CAAC;AACD,yBAAiB,YAAY;AAC7B,2BAAmB;AAAA,MACrB;AACA,uBAAiB,YAAY;AAC7B,yBAAmB,YAAY,QAAQ;AAAA,IACzC;AACA,QAAI,iBAAiB,KAAK,OAAO,QAAQ;AACvC,YAAM,SAAS,KAAK,OAAO,SAAS;AACpC,eAAS,KAAK;AAAA,QACZ,eAAe,CAAC,cAAc;AAAA,QAC9B,kBAAkB,CAAC,eAAe;AAAA,QAClC,SAAS,CAAC,MAAM;AAAA,QAChB,MAAM;AAAA,MACR,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AAAA,EAEA,kBAAkB,QAAwB;AACxC,UAAM,YAAY,IAAI,4BAAU,KAAK,YAAY,CAAC;AAClD,UAAM,YAAY,MAAM,KAAK,UAAU,iBAAiB,MAAM,CAAC;AAC/D,UAAM,QAAQ,UAAU,CAAC;AACzB,QAAI,MAAM,QAAQ,KAAK,KAAK,OAAO,MAAM,CAAC,MAAM,UAAU;AACxD,aAAO,MAAM,CAAC;AAAA,IAChB;AACA,WAAO;AAAA,EACT;AAAA,EAEA,mBAAmB,QAAwB;AACzC,UAAM,YAAY,IAAI,4BAAU,KAAK,YAAY,CAAC;AAClD,UAAM,YAAY,MAAM,KAAK,UAAU,oBAAoB,MAAM,CAAC;AAClE,UAAM,QAAQ,UAAU,CAAC;AACzB,QAAI,MAAM,QAAQ,KAAK,KAAK,OAAO,MAAM,CAAC,MAAM,UAAU;AACxD,aAAO,MAAM,CAAC;AAAA,IAChB;AACA,WAAO;AAAA,EACT;AAAA,EAEA,iBAAiB,OAAqB;AACpC,UAAM,YAAY,IAAI,4BAAU,KAAK,YAAY,CAAC;AAClD,UAAM,SAAS,MAAM;AAAA,MACnB,UAAU,cAAc,MAAM,MAAM,MAAM,IAAI,IAAI;AAAA,IACpD;AACA,UAAM,QAAQ,OAAO,CAAC;AACtB,QACE,MAAM,QAAQ,KAAK,KACnB,OAAO,MAAM,CAAC,MAAM,YACpB,OAAO,MAAM,CAAC,MAAM,UACpB;AACA,aAAO,EAAE,MAAM,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,EAAE;AAAA,IACxC;AACA,WAAO;AAAA,EACT;AAAA,EAEA,kBAAkB,OAAqB;AACrC,UAAM,YAAY,IAAI,4BAAU,KAAK,YAAY,CAAC;AAClD,UAAM,SAAS,MAAM;AAAA,MACnB,UAAU,iBAAiB,MAAM,MAAM,MAAM,IAAI,IAAI;AAAA,IACvD;AACA,UAAM,QAAQ,OAAO,CAAC;AACtB,QACE,MAAM,QAAQ,KAAK,KACnB,OAAO,MAAM,CAAC,MAAM,YACpB,OAAO,MAAM,CAAC,MAAM,UACpB;AACA,aAAO,EAAE,MAAM,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,EAAE;AAAA,IACxC;AACA,WAAO;AAAA,EACT;AAAA,EAEA,WAAmB;AACjB,UAAM,qBAAqB,CAAC,GAAG,KAAK,YAAY,EAAE;AAAA,MAChD,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE;AAAA,IACvB;AACA,QAAI,SAAS;AACb,QAAI,SAAS;AACb,eAAW,eAAe,oBAAoB;AAC5C,UAAI,SAAS,YAAY,MAAM;AAC7B,kBAAU,KAAK,OAAO,MAAM,QAAQ,YAAY,IAAI;AAAA,MACtD;AACA,gBAAU,YAAY;AACtB,eAAS,YAAY;AAAA,IACvB;AACA,QAAI,SAAS,KAAK,OAAO,QAAQ;AAC/B,gBAAU,KAAK,OAAO,MAAM,MAAM;AAAA,IACpC;AACA,WAAO;AAAA,EACT;AACF;","names":["hasOverlap"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@coze-editor/utils",
-  "version": "0.1.0-alpha.687604",
+  "version": "0.1.0-alpha.6b15c1",
   "description": "utils",
   "license": "MIT",
   "author": "fengzilong",
@@ -21,6 +21,9 @@
     "build": "tsup",
     "lint": "eslint && tsc --noEmit"
   },
+  "dependencies": {
+    "@volar/source-map": "^2.4.28"
+  },
   "devDependencies": {
     "@codemirror/state": "^6.4.1",
     "@codemirror/view": "^6.26.1",