@coze-editor/utils 0.1.0-alpha.0fd19e
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +21 -0
- package/dist/esm/index.js +169 -0
- package/dist/esm/index.js.map +1 -0
- package/dist/index.d.mts +41 -0
- package/dist/index.d.ts +41 -0
- package/dist/index.js +202 -0
- package/dist/index.js.map +1 -0
- package/package.json +45 -0
package/LICENSE
ADDED
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
MIT License
|
|
2
|
+
|
|
3
|
+
Copyright (c) 2025 coze-dev
|
|
4
|
+
|
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
|
7
|
+
in the Software without restriction, including without limitation the rights
|
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
|
10
|
+
furnished to do so, subject to the following conditions:
|
|
11
|
+
|
|
12
|
+
The above copyright notice and this permission notice shall be included in all
|
|
13
|
+
copies or substantial portions of the Software.
|
|
14
|
+
|
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
21
|
+
SOFTWARE.
|
|
@@ -0,0 +1,169 @@
|
|
|
1
|
+
// src/dispose-all.ts
|
|
2
|
+
function disposeAll(disposes) {
|
|
3
|
+
return () => {
|
|
4
|
+
for (const dispose of disposes) {
|
|
5
|
+
if (typeof dispose === "function") {
|
|
6
|
+
dispose();
|
|
7
|
+
}
|
|
8
|
+
}
|
|
9
|
+
};
|
|
10
|
+
}
|
|
11
|
+
|
|
12
|
+
// src/flatten.ts
|
|
13
|
+
function flatten(arrayOfArray) {
|
|
14
|
+
return arrayOfArray.reduce((memo, current) => [...memo, ...current], []);
|
|
15
|
+
}
|
|
16
|
+
|
|
17
|
+
// src/traverse.ts
|
|
18
|
+
import { NodeProp } from "@lezer/common";
|
|
19
|
+
function traverseAST(cursor, from, to, callback, disableOverlayTraverse = false) {
|
|
20
|
+
const { from: start, to: end } = cursor;
|
|
21
|
+
if (start >= to || end <= from) {
|
|
22
|
+
return;
|
|
23
|
+
}
|
|
24
|
+
callback(cursor);
|
|
25
|
+
const mounted = cursor.tree && cursor.tree.prop(NodeProp.mounted);
|
|
26
|
+
if (mounted && mounted.overlay && !disableOverlayTraverse) {
|
|
27
|
+
const inner = cursor.node.enter(mounted.overlay[0].from + start, 1);
|
|
28
|
+
const hasChild = cursor.firstChild();
|
|
29
|
+
for (let i = 0, pos = start; ; i++) {
|
|
30
|
+
const next = i < mounted.overlay.length ? mounted.overlay[i] : null;
|
|
31
|
+
const nextPos = next ? next.from + start : end;
|
|
32
|
+
const rangeFrom = Math.max(from, pos);
|
|
33
|
+
const rangeTo = Math.min(to, nextPos);
|
|
34
|
+
if (rangeFrom < rangeTo && hasChild) {
|
|
35
|
+
while (cursor.from < rangeTo) {
|
|
36
|
+
traverseAST(
|
|
37
|
+
cursor,
|
|
38
|
+
rangeFrom,
|
|
39
|
+
rangeTo,
|
|
40
|
+
callback,
|
|
41
|
+
disableOverlayTraverse
|
|
42
|
+
);
|
|
43
|
+
if (cursor.to >= nextPos || !cursor.nextSibling()) {
|
|
44
|
+
break;
|
|
45
|
+
}
|
|
46
|
+
}
|
|
47
|
+
}
|
|
48
|
+
if (!next || nextPos > to) {
|
|
49
|
+
break;
|
|
50
|
+
}
|
|
51
|
+
pos = next.to + start;
|
|
52
|
+
if (pos > from) {
|
|
53
|
+
const overlayFrom = Math.max(from, next.from + start);
|
|
54
|
+
const overlayTo = Math.min(to, pos);
|
|
55
|
+
while (cursor.from < overlayTo) {
|
|
56
|
+
traverseAST(
|
|
57
|
+
cursor,
|
|
58
|
+
Math.max(from, next.from + start),
|
|
59
|
+
Math.min(to, pos),
|
|
60
|
+
callback,
|
|
61
|
+
true
|
|
62
|
+
);
|
|
63
|
+
if (cursor.to >= overlayTo || !cursor.nextSibling()) {
|
|
64
|
+
break;
|
|
65
|
+
}
|
|
66
|
+
}
|
|
67
|
+
traverseAST(
|
|
68
|
+
inner.cursor(),
|
|
69
|
+
overlayFrom,
|
|
70
|
+
overlayTo,
|
|
71
|
+
callback,
|
|
72
|
+
disableOverlayTraverse
|
|
73
|
+
);
|
|
74
|
+
}
|
|
75
|
+
}
|
|
76
|
+
if (hasChild) {
|
|
77
|
+
cursor.parent();
|
|
78
|
+
}
|
|
79
|
+
} else if (cursor.firstChild()) {
|
|
80
|
+
do {
|
|
81
|
+
if (cursor.to <= from) {
|
|
82
|
+
continue;
|
|
83
|
+
}
|
|
84
|
+
if (cursor.from >= to) {
|
|
85
|
+
break;
|
|
86
|
+
}
|
|
87
|
+
traverseAST(cursor, from, to, callback, disableOverlayTraverse);
|
|
88
|
+
} while (cursor.nextSibling());
|
|
89
|
+
cursor.parent();
|
|
90
|
+
}
|
|
91
|
+
}
|
|
92
|
+
|
|
93
|
+
// src/overlap.ts
|
|
94
|
+
function hasOverlap(a, b) {
|
|
95
|
+
if (a.from === a.to) {
|
|
96
|
+
return a.from > b.from && a.from < b.to;
|
|
97
|
+
}
|
|
98
|
+
return (
|
|
99
|
+
// exists common part or a contains b
|
|
100
|
+
a.from <= b.from && a.to > b.from || a.to >= b.to && a.from < b.to || // a inside b
|
|
101
|
+
a.from >= b.from && a.to <= b.to
|
|
102
|
+
);
|
|
103
|
+
}
|
|
104
|
+
|
|
105
|
+
// src/span.ts
|
|
106
|
+
import { WidgetType } from "@codemirror/view";
|
|
107
|
+
var SpanWidget = class extends WidgetType {
|
|
108
|
+
text;
|
|
109
|
+
className;
|
|
110
|
+
constructor(options) {
|
|
111
|
+
super();
|
|
112
|
+
this.text = options.text;
|
|
113
|
+
this.className = options.className;
|
|
114
|
+
}
|
|
115
|
+
toDOM() {
|
|
116
|
+
const dom = document.createElement("span");
|
|
117
|
+
dom.innerText = this.text ?? "";
|
|
118
|
+
dom.classList.add(this.className ?? "");
|
|
119
|
+
return dom;
|
|
120
|
+
}
|
|
121
|
+
eq(other) {
|
|
122
|
+
return this.text === other.text && this.className === other.className;
|
|
123
|
+
}
|
|
124
|
+
ignoreEvent() {
|
|
125
|
+
return false;
|
|
126
|
+
}
|
|
127
|
+
};
|
|
128
|
+
|
|
129
|
+
// src/facet.ts
|
|
130
|
+
var FacetCombineStrategy = {
|
|
131
|
+
Flatten(values) {
|
|
132
|
+
return values.reduce((memo, current) => [...memo, ...current], []);
|
|
133
|
+
},
|
|
134
|
+
First(values) {
|
|
135
|
+
return values[0];
|
|
136
|
+
},
|
|
137
|
+
Last(values) {
|
|
138
|
+
return values[values.length - 1];
|
|
139
|
+
}
|
|
140
|
+
};
|
|
141
|
+
|
|
142
|
+
// src/field.ts
|
|
143
|
+
function withDefaultValue(field, value) {
|
|
144
|
+
const { spec } = field;
|
|
145
|
+
if (typeof spec.fromJSON === "function") {
|
|
146
|
+
return [field.init((state) => spec.fromJSON(value, state)), field];
|
|
147
|
+
}
|
|
148
|
+
return field;
|
|
149
|
+
}
|
|
150
|
+
|
|
151
|
+
// src/singleton.ts
|
|
152
|
+
function singleton(id, instance) {
|
|
153
|
+
const symbol = Symbol.for(id);
|
|
154
|
+
if (!globalThis[symbol]) {
|
|
155
|
+
globalThis[symbol] = instance;
|
|
156
|
+
}
|
|
157
|
+
return globalThis[symbol];
|
|
158
|
+
}
|
|
159
|
+
export {
|
|
160
|
+
FacetCombineStrategy,
|
|
161
|
+
SpanWidget,
|
|
162
|
+
disposeAll,
|
|
163
|
+
flatten,
|
|
164
|
+
hasOverlap,
|
|
165
|
+
singleton,
|
|
166
|
+
traverseAST,
|
|
167
|
+
withDefaultValue
|
|
168
|
+
};
|
|
169
|
+
//# sourceMappingURL=index.js.map
|
|
@@ -0,0 +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":[]}
|
package/dist/index.d.mts
ADDED
|
@@ -0,0 +1,41 @@
|
|
|
1
|
+
import { TreeCursor } from '@lezer/common';
|
|
2
|
+
import { WidgetType } from '@codemirror/view';
|
|
3
|
+
import * as _codemirror_state from '@codemirror/state';
|
|
4
|
+
import { StateField } from '@codemirror/state';
|
|
5
|
+
|
|
6
|
+
declare function disposeAll(disposes: unknown[]): () => void;
|
|
7
|
+
|
|
8
|
+
declare function flatten<T>(arrayOfArray: T[][]): T[];
|
|
9
|
+
|
|
10
|
+
declare function traverseAST(cursor: TreeCursor, from: number, to: number, callback: (cursor: TreeCursor) => void, disableOverlayTraverse?: boolean): void;
|
|
11
|
+
|
|
12
|
+
interface Range {
|
|
13
|
+
from: number;
|
|
14
|
+
to: number;
|
|
15
|
+
}
|
|
16
|
+
declare function hasOverlap(a: Range, b: Range): boolean;
|
|
17
|
+
|
|
18
|
+
interface SpanWidgetOptions {
|
|
19
|
+
text?: string;
|
|
20
|
+
className?: string;
|
|
21
|
+
}
|
|
22
|
+
declare class SpanWidget extends WidgetType {
|
|
23
|
+
text?: string;
|
|
24
|
+
className?: string;
|
|
25
|
+
constructor(options: SpanWidgetOptions);
|
|
26
|
+
toDOM(): HTMLSpanElement;
|
|
27
|
+
eq(other: SpanWidget): boolean;
|
|
28
|
+
ignoreEvent(): boolean;
|
|
29
|
+
}
|
|
30
|
+
|
|
31
|
+
declare const FacetCombineStrategy: {
|
|
32
|
+
Flatten<T>(values: readonly T[][]): T[];
|
|
33
|
+
First<T>(values: readonly T[]): T;
|
|
34
|
+
Last<T>(values: readonly T[]): T;
|
|
35
|
+
};
|
|
36
|
+
|
|
37
|
+
declare function withDefaultValue<T, U>(field: StateField<T>, value: U): StateField<T> | (StateField<T> | _codemirror_state.Extension)[];
|
|
38
|
+
|
|
39
|
+
declare function singleton<T>(id: string, instance: T): T;
|
|
40
|
+
|
|
41
|
+
export { FacetCombineStrategy, SpanWidget, disposeAll, flatten, hasOverlap, singleton, traverseAST, withDefaultValue };
|
package/dist/index.d.ts
ADDED
|
@@ -0,0 +1,41 @@
|
|
|
1
|
+
import { TreeCursor } from '@lezer/common';
|
|
2
|
+
import { WidgetType } from '@codemirror/view';
|
|
3
|
+
import * as _codemirror_state from '@codemirror/state';
|
|
4
|
+
import { StateField } from '@codemirror/state';
|
|
5
|
+
|
|
6
|
+
declare function disposeAll(disposes: unknown[]): () => void;
|
|
7
|
+
|
|
8
|
+
declare function flatten<T>(arrayOfArray: T[][]): T[];
|
|
9
|
+
|
|
10
|
+
declare function traverseAST(cursor: TreeCursor, from: number, to: number, callback: (cursor: TreeCursor) => void, disableOverlayTraverse?: boolean): void;
|
|
11
|
+
|
|
12
|
+
interface Range {
|
|
13
|
+
from: number;
|
|
14
|
+
to: number;
|
|
15
|
+
}
|
|
16
|
+
declare function hasOverlap(a: Range, b: Range): boolean;
|
|
17
|
+
|
|
18
|
+
interface SpanWidgetOptions {
|
|
19
|
+
text?: string;
|
|
20
|
+
className?: string;
|
|
21
|
+
}
|
|
22
|
+
declare class SpanWidget extends WidgetType {
|
|
23
|
+
text?: string;
|
|
24
|
+
className?: string;
|
|
25
|
+
constructor(options: SpanWidgetOptions);
|
|
26
|
+
toDOM(): HTMLSpanElement;
|
|
27
|
+
eq(other: SpanWidget): boolean;
|
|
28
|
+
ignoreEvent(): boolean;
|
|
29
|
+
}
|
|
30
|
+
|
|
31
|
+
declare const FacetCombineStrategy: {
|
|
32
|
+
Flatten<T>(values: readonly T[][]): T[];
|
|
33
|
+
First<T>(values: readonly T[]): T;
|
|
34
|
+
Last<T>(values: readonly T[]): T;
|
|
35
|
+
};
|
|
36
|
+
|
|
37
|
+
declare function withDefaultValue<T, U>(field: StateField<T>, value: U): StateField<T> | (StateField<T> | _codemirror_state.Extension)[];
|
|
38
|
+
|
|
39
|
+
declare function singleton<T>(id: string, instance: T): T;
|
|
40
|
+
|
|
41
|
+
export { FacetCombineStrategy, SpanWidget, disposeAll, flatten, hasOverlap, singleton, traverseAST, withDefaultValue };
|
package/dist/index.js
ADDED
|
@@ -0,0 +1,202 @@
|
|
|
1
|
+
var __defProp = Object.defineProperty;
|
|
2
|
+
var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
|
|
3
|
+
var __getOwnPropNames = Object.getOwnPropertyNames;
|
|
4
|
+
var __hasOwnProp = Object.prototype.hasOwnProperty;
|
|
5
|
+
var __export = (target, all) => {
|
|
6
|
+
for (var name in all)
|
|
7
|
+
__defProp(target, name, { get: all[name], enumerable: true });
|
|
8
|
+
};
|
|
9
|
+
var __copyProps = (to, from, except, desc) => {
|
|
10
|
+
if (from && typeof from === "object" || typeof from === "function") {
|
|
11
|
+
for (let key of __getOwnPropNames(from))
|
|
12
|
+
if (!__hasOwnProp.call(to, key) && key !== except)
|
|
13
|
+
__defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
|
|
14
|
+
}
|
|
15
|
+
return to;
|
|
16
|
+
};
|
|
17
|
+
var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
|
|
18
|
+
|
|
19
|
+
// src/index.ts
|
|
20
|
+
var index_exports = {};
|
|
21
|
+
__export(index_exports, {
|
|
22
|
+
FacetCombineStrategy: () => FacetCombineStrategy,
|
|
23
|
+
SpanWidget: () => SpanWidget,
|
|
24
|
+
disposeAll: () => disposeAll,
|
|
25
|
+
flatten: () => flatten,
|
|
26
|
+
hasOverlap: () => hasOverlap,
|
|
27
|
+
singleton: () => singleton,
|
|
28
|
+
traverseAST: () => traverseAST,
|
|
29
|
+
withDefaultValue: () => withDefaultValue
|
|
30
|
+
});
|
|
31
|
+
module.exports = __toCommonJS(index_exports);
|
|
32
|
+
|
|
33
|
+
// src/dispose-all.ts
|
|
34
|
+
function disposeAll(disposes) {
|
|
35
|
+
return () => {
|
|
36
|
+
for (const dispose of disposes) {
|
|
37
|
+
if (typeof dispose === "function") {
|
|
38
|
+
dispose();
|
|
39
|
+
}
|
|
40
|
+
}
|
|
41
|
+
};
|
|
42
|
+
}
|
|
43
|
+
|
|
44
|
+
// src/flatten.ts
|
|
45
|
+
function flatten(arrayOfArray) {
|
|
46
|
+
return arrayOfArray.reduce((memo, current) => [...memo, ...current], []);
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
// src/traverse.ts
|
|
50
|
+
var import_common = require("@lezer/common");
|
|
51
|
+
function traverseAST(cursor, from, to, callback, disableOverlayTraverse = false) {
|
|
52
|
+
const { from: start, to: end } = cursor;
|
|
53
|
+
if (start >= to || end <= from) {
|
|
54
|
+
return;
|
|
55
|
+
}
|
|
56
|
+
callback(cursor);
|
|
57
|
+
const mounted = cursor.tree && cursor.tree.prop(import_common.NodeProp.mounted);
|
|
58
|
+
if (mounted && mounted.overlay && !disableOverlayTraverse) {
|
|
59
|
+
const inner = cursor.node.enter(mounted.overlay[0].from + start, 1);
|
|
60
|
+
const hasChild = cursor.firstChild();
|
|
61
|
+
for (let i = 0, pos = start; ; i++) {
|
|
62
|
+
const next = i < mounted.overlay.length ? mounted.overlay[i] : null;
|
|
63
|
+
const nextPos = next ? next.from + start : end;
|
|
64
|
+
const rangeFrom = Math.max(from, pos);
|
|
65
|
+
const rangeTo = Math.min(to, nextPos);
|
|
66
|
+
if (rangeFrom < rangeTo && hasChild) {
|
|
67
|
+
while (cursor.from < rangeTo) {
|
|
68
|
+
traverseAST(
|
|
69
|
+
cursor,
|
|
70
|
+
rangeFrom,
|
|
71
|
+
rangeTo,
|
|
72
|
+
callback,
|
|
73
|
+
disableOverlayTraverse
|
|
74
|
+
);
|
|
75
|
+
if (cursor.to >= nextPos || !cursor.nextSibling()) {
|
|
76
|
+
break;
|
|
77
|
+
}
|
|
78
|
+
}
|
|
79
|
+
}
|
|
80
|
+
if (!next || nextPos > to) {
|
|
81
|
+
break;
|
|
82
|
+
}
|
|
83
|
+
pos = next.to + start;
|
|
84
|
+
if (pos > from) {
|
|
85
|
+
const overlayFrom = Math.max(from, next.from + start);
|
|
86
|
+
const overlayTo = Math.min(to, pos);
|
|
87
|
+
while (cursor.from < overlayTo) {
|
|
88
|
+
traverseAST(
|
|
89
|
+
cursor,
|
|
90
|
+
Math.max(from, next.from + start),
|
|
91
|
+
Math.min(to, pos),
|
|
92
|
+
callback,
|
|
93
|
+
true
|
|
94
|
+
);
|
|
95
|
+
if (cursor.to >= overlayTo || !cursor.nextSibling()) {
|
|
96
|
+
break;
|
|
97
|
+
}
|
|
98
|
+
}
|
|
99
|
+
traverseAST(
|
|
100
|
+
inner.cursor(),
|
|
101
|
+
overlayFrom,
|
|
102
|
+
overlayTo,
|
|
103
|
+
callback,
|
|
104
|
+
disableOverlayTraverse
|
|
105
|
+
);
|
|
106
|
+
}
|
|
107
|
+
}
|
|
108
|
+
if (hasChild) {
|
|
109
|
+
cursor.parent();
|
|
110
|
+
}
|
|
111
|
+
} else if (cursor.firstChild()) {
|
|
112
|
+
do {
|
|
113
|
+
if (cursor.to <= from) {
|
|
114
|
+
continue;
|
|
115
|
+
}
|
|
116
|
+
if (cursor.from >= to) {
|
|
117
|
+
break;
|
|
118
|
+
}
|
|
119
|
+
traverseAST(cursor, from, to, callback, disableOverlayTraverse);
|
|
120
|
+
} while (cursor.nextSibling());
|
|
121
|
+
cursor.parent();
|
|
122
|
+
}
|
|
123
|
+
}
|
|
124
|
+
|
|
125
|
+
// src/overlap.ts
|
|
126
|
+
function hasOverlap(a, b) {
|
|
127
|
+
if (a.from === a.to) {
|
|
128
|
+
return a.from > b.from && a.from < b.to;
|
|
129
|
+
}
|
|
130
|
+
return (
|
|
131
|
+
// exists common part or a contains b
|
|
132
|
+
a.from <= b.from && a.to > b.from || a.to >= b.to && a.from < b.to || // a inside b
|
|
133
|
+
a.from >= b.from && a.to <= b.to
|
|
134
|
+
);
|
|
135
|
+
}
|
|
136
|
+
|
|
137
|
+
// src/span.ts
|
|
138
|
+
var import_view = require("@codemirror/view");
|
|
139
|
+
var SpanWidget = class extends import_view.WidgetType {
|
|
140
|
+
text;
|
|
141
|
+
className;
|
|
142
|
+
constructor(options) {
|
|
143
|
+
super();
|
|
144
|
+
this.text = options.text;
|
|
145
|
+
this.className = options.className;
|
|
146
|
+
}
|
|
147
|
+
toDOM() {
|
|
148
|
+
const dom = document.createElement("span");
|
|
149
|
+
dom.innerText = this.text ?? "";
|
|
150
|
+
dom.classList.add(this.className ?? "");
|
|
151
|
+
return dom;
|
|
152
|
+
}
|
|
153
|
+
eq(other) {
|
|
154
|
+
return this.text === other.text && this.className === other.className;
|
|
155
|
+
}
|
|
156
|
+
ignoreEvent() {
|
|
157
|
+
return false;
|
|
158
|
+
}
|
|
159
|
+
};
|
|
160
|
+
|
|
161
|
+
// src/facet.ts
|
|
162
|
+
var FacetCombineStrategy = {
|
|
163
|
+
Flatten(values) {
|
|
164
|
+
return values.reduce((memo, current) => [...memo, ...current], []);
|
|
165
|
+
},
|
|
166
|
+
First(values) {
|
|
167
|
+
return values[0];
|
|
168
|
+
},
|
|
169
|
+
Last(values) {
|
|
170
|
+
return values[values.length - 1];
|
|
171
|
+
}
|
|
172
|
+
};
|
|
173
|
+
|
|
174
|
+
// src/field.ts
|
|
175
|
+
function withDefaultValue(field, value) {
|
|
176
|
+
const { spec } = field;
|
|
177
|
+
if (typeof spec.fromJSON === "function") {
|
|
178
|
+
return [field.init((state) => spec.fromJSON(value, state)), field];
|
|
179
|
+
}
|
|
180
|
+
return field;
|
|
181
|
+
}
|
|
182
|
+
|
|
183
|
+
// src/singleton.ts
|
|
184
|
+
function singleton(id, instance) {
|
|
185
|
+
const symbol = Symbol.for(id);
|
|
186
|
+
if (!globalThis[symbol]) {
|
|
187
|
+
globalThis[symbol] = instance;
|
|
188
|
+
}
|
|
189
|
+
return globalThis[symbol];
|
|
190
|
+
}
|
|
191
|
+
// Annotate the CommonJS export names for ESM import in node:
|
|
192
|
+
0 && (module.exports = {
|
|
193
|
+
FacetCombineStrategy,
|
|
194
|
+
SpanWidget,
|
|
195
|
+
disposeAll,
|
|
196
|
+
flatten,
|
|
197
|
+
hasOverlap,
|
|
198
|
+
singleton,
|
|
199
|
+
traverseAST,
|
|
200
|
+
withDefaultValue
|
|
201
|
+
});
|
|
202
|
+
//# sourceMappingURL=index.js.map
|
|
@@ -0,0 +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":[]}
|
package/package.json
ADDED
|
@@ -0,0 +1,45 @@
|
|
|
1
|
+
{
|
|
2
|
+
"name": "@coze-editor/utils",
|
|
3
|
+
"version": "0.1.0-alpha.0fd19e",
|
|
4
|
+
"description": "utils",
|
|
5
|
+
"license": "MIT",
|
|
6
|
+
"author": "fengzilong",
|
|
7
|
+
"maintainers": [],
|
|
8
|
+
"sideEffects": [
|
|
9
|
+
"**/*.css",
|
|
10
|
+
"**/*.less",
|
|
11
|
+
"**/*.sass",
|
|
12
|
+
"**/*.scss"
|
|
13
|
+
],
|
|
14
|
+
"main": "./dist/esm/index.js",
|
|
15
|
+
"module": "./dist/esm/index.js",
|
|
16
|
+
"types": "./dist/index.d.ts",
|
|
17
|
+
"files": [
|
|
18
|
+
"dist"
|
|
19
|
+
],
|
|
20
|
+
"scripts": {
|
|
21
|
+
"build": "tsup",
|
|
22
|
+
"lint": "eslint && tsc --noEmit"
|
|
23
|
+
},
|
|
24
|
+
"devDependencies": {
|
|
25
|
+
"@codemirror/state": "^6.4.1",
|
|
26
|
+
"@codemirror/view": "^6.26.1",
|
|
27
|
+
"@coze-arch/ts-config": "workspace:*",
|
|
28
|
+
"@coze-editor/eslint-config": "workspace:*",
|
|
29
|
+
"@lezer/common": "^1.2.2",
|
|
30
|
+
"@types/node": "^22",
|
|
31
|
+
"eslint": "9.14.0",
|
|
32
|
+
"tsup": "^8.0.1",
|
|
33
|
+
"typescript": "^5.8.2"
|
|
34
|
+
},
|
|
35
|
+
"peerDependencies": {
|
|
36
|
+
"@codemirror/state": "^6.4.1",
|
|
37
|
+
"@codemirror/view": "^6.26.1",
|
|
38
|
+
"@lezer/common": "^1.2.2"
|
|
39
|
+
},
|
|
40
|
+
"publishConfig": {
|
|
41
|
+
"access": "public",
|
|
42
|
+
"registry": "https://registry.npmjs.org"
|
|
43
|
+
},
|
|
44
|
+
"test:main": "./src/index.ts"
|
|
45
|
+
}
|