@moda-editor/core 0.1.3 → 0.1.5
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/dist/collab.d.ts +61 -0
- package/dist/collab.d.ts.map +1 -0
- package/dist/collab.js +67 -0
- package/dist/collab.js.map +1 -0
- package/dist/commands.d.ts +11 -0
- package/dist/commands.d.ts.map +1 -1
- package/dist/commands.js +48 -4
- package/dist/commands.js.map +1 -1
- package/dist/conformance/editor-base.d.ts +7 -0
- package/dist/conformance/editor-base.d.ts.map +1 -0
- package/dist/conformance/editor-base.js +280 -0
- package/dist/conformance/editor-base.js.map +1 -0
- package/dist/conformance/editor-codeblock.d.ts +8 -0
- package/dist/conformance/editor-codeblock.d.ts.map +1 -0
- package/dist/conformance/editor-codeblock.js +402 -0
- package/dist/conformance/editor-codeblock.js.map +1 -0
- package/dist/conformance/editor-ime.d.ts +7 -0
- package/dist/conformance/editor-ime.d.ts.map +1 -0
- package/dist/conformance/editor-ime.js +166 -0
- package/dist/conformance/editor-ime.js.map +1 -0
- package/dist/conformance/editor-input.d.ts +8 -0
- package/dist/conformance/editor-input.d.ts.map +1 -0
- package/dist/conformance/editor-input.js +676 -0
- package/dist/conformance/editor-input.js.map +1 -0
- package/dist/conformance/editor-nodeview.d.ts +7 -0
- package/dist/conformance/editor-nodeview.d.ts.map +1 -0
- package/dist/conformance/editor-nodeview.js +120 -0
- package/dist/conformance/editor-nodeview.js.map +1 -0
- package/dist/conformance/editor-overlay.d.ts +8 -0
- package/dist/conformance/editor-overlay.d.ts.map +1 -0
- package/dist/conformance/editor-overlay.js +323 -0
- package/dist/conformance/editor-overlay.js.map +1 -0
- package/dist/conformance/fixtures.d.ts +4 -0
- package/dist/conformance/fixtures.d.ts.map +1 -0
- package/dist/conformance/fixtures.js +15 -0
- package/dist/conformance/fixtures.js.map +1 -0
- package/dist/conformance/index.d.ts +14 -0
- package/dist/conformance/index.d.ts.map +1 -0
- package/dist/conformance/index.js +28 -0
- package/dist/conformance/index.js.map +1 -0
- package/dist/conformance/types.d.ts +51 -0
- package/dist/conformance/types.d.ts.map +1 -0
- package/dist/conformance/types.js +2 -0
- package/dist/conformance/types.js.map +1 -0
- package/dist/conformance/widget.d.ts +3 -0
- package/dist/conformance/widget.d.ts.map +1 -0
- package/dist/conformance/widget.js +49 -0
- package/dist/conformance/widget.js.map +1 -0
- package/dist/conformance.d.ts +1 -58
- package/dist/conformance.d.ts.map +1 -1
- package/dist/conformance.js +3 -1748
- package/dist/conformance.js.map +1 -1
- package/dist/editor/extension.d.ts +47 -3
- package/dist/editor/extension.d.ts.map +1 -1
- package/dist/features/ace.d.ts +4 -0
- package/dist/features/ace.d.ts.map +1 -1
- package/dist/features/ace.js +34 -13
- package/dist/features/ace.js.map +1 -1
- package/dist/features/block-dnd.d.ts +7 -0
- package/dist/features/block-dnd.d.ts.map +1 -0
- package/dist/features/block-dnd.js +207 -0
- package/dist/features/block-dnd.js.map +1 -0
- package/dist/features/code-block.d.ts +9 -84
- package/dist/features/code-block.d.ts.map +1 -1
- package/dist/features/code-block.js +37 -1027
- package/dist/features/code-block.js.map +1 -1
- package/dist/features/code-context.d.ts +81 -0
- package/dist/features/code-context.d.ts.map +1 -0
- package/dist/features/code-context.js +322 -0
- package/dist/features/code-context.js.map +1 -0
- package/dist/features/code-edit.d.ts +50 -0
- package/dist/features/code-edit.d.ts.map +1 -0
- package/dist/features/code-edit.js +412 -0
- package/dist/features/code-edit.js.map +1 -0
- package/dist/features/code-format.d.ts +21 -0
- package/dist/features/code-format.d.ts.map +1 -0
- package/dist/features/code-format.js +410 -0
- package/dist/features/code-format.js.map +1 -0
- package/dist/features/doc.d.ts.map +1 -1
- package/dist/features/doc.js +1 -1
- package/dist/features/doc.js.map +1 -1
- package/dist/features/heading.d.ts.map +1 -1
- package/dist/features/heading.js.map +1 -1
- package/dist/features/image.d.ts.map +1 -1
- package/dist/features/image.js +11 -2
- package/dist/features/image.js.map +1 -1
- package/dist/features/index.d.ts +7 -0
- package/dist/features/index.d.ts.map +1 -1
- package/dist/features/index.js +16 -0
- package/dist/features/index.js.map +1 -1
- package/dist/features/inline-style.d.ts.map +1 -1
- package/dist/features/inline-style.js +4 -1
- package/dist/features/inline-style.js.map +1 -1
- package/dist/features/link.d.ts.map +1 -1
- package/dist/features/link.js +1 -1
- package/dist/features/link.js.map +1 -1
- package/dist/features/markdown.d.ts +15 -0
- package/dist/features/markdown.d.ts.map +1 -0
- package/dist/features/markdown.js +80 -0
- package/dist/features/markdown.js.map +1 -0
- package/dist/features/marks.d.ts.map +1 -1
- package/dist/features/marks.js +49 -4
- package/dist/features/marks.js.map +1 -1
- package/dist/features/mention.d.ts +30 -0
- package/dist/features/mention.d.ts.map +1 -0
- package/dist/features/mention.js +89 -0
- package/dist/features/mention.js.map +1 -0
- package/dist/features/script.d.ts.map +1 -1
- package/dist/features/script.js.map +1 -1
- package/dist/features/search.d.ts +73 -0
- package/dist/features/search.d.ts.map +1 -0
- package/dist/features/search.js +252 -0
- package/dist/features/search.js.map +1 -0
- package/dist/features/shared.d.ts +69 -0
- package/dist/features/shared.d.ts.map +1 -0
- package/dist/features/shared.js +272 -0
- package/dist/features/shared.js.map +1 -0
- package/dist/features/table.d.ts.map +1 -1
- package/dist/features/table.js +17 -3
- package/dist/features/table.js.map +1 -1
- package/dist/features/testkit.d.ts.map +1 -1
- package/dist/features/testkit.js +1 -1
- package/dist/features/testkit.js.map +1 -1
- package/dist/history.d.ts.map +1 -1
- package/dist/history.js +65 -20
- package/dist/history.js.map +1 -1
- package/dist/index.d.ts +19 -7
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +16 -6
- package/dist/index.js.map +1 -1
- package/dist/model/schema.d.ts.map +1 -1
- package/dist/model/schema.js +2 -1
- package/dist/model/schema.js.map +1 -1
- package/dist/parse/html.d.ts.map +1 -1
- package/dist/parse/html.js +38 -6
- package/dist/parse/html.js.map +1 -1
- package/dist/parse/sanitize.d.ts.map +1 -1
- package/dist/parse/sanitize.js +4 -1
- package/dist/parse/sanitize.js.map +1 -1
- package/dist/presets/highlight.d.ts.map +1 -1
- package/dist/presets/highlight.js +1 -4
- package/dist/presets/highlight.js.map +1 -1
- package/dist/presets/markdown-parse.d.ts +13 -0
- package/dist/presets/markdown-parse.d.ts.map +1 -0
- package/dist/presets/markdown-parse.js +398 -0
- package/dist/presets/markdown-parse.js.map +1 -0
- package/dist/presets/markdown.d.ts +45 -0
- package/dist/presets/markdown.d.ts.map +1 -0
- package/dist/presets/markdown.js +195 -0
- package/dist/presets/markdown.js.map +1 -0
- package/dist/state/apply.d.ts.map +1 -1
- package/dist/state/apply.js +19 -11
- package/dist/state/apply.js.map +1 -1
- package/dist/state/delete-ops.d.ts +34 -0
- package/dist/state/delete-ops.d.ts.map +1 -0
- package/dist/state/delete-ops.js +204 -0
- package/dist/state/delete-ops.js.map +1 -0
- package/dist/state/input-rules.d.ts +30 -0
- package/dist/state/input-rules.d.ts.map +1 -0
- package/dist/state/input-rules.js +70 -0
- package/dist/state/input-rules.js.map +1 -0
- package/dist/state/insert-ops.d.ts +54 -0
- package/dist/state/insert-ops.d.ts.map +1 -0
- package/dist/state/insert-ops.js +186 -0
- package/dist/state/insert-ops.js.map +1 -0
- package/dist/state/list-ops.d.ts +46 -0
- package/dist/state/list-ops.d.ts.map +1 -0
- package/dist/state/list-ops.js +231 -0
- package/dist/state/list-ops.js.map +1 -0
- package/dist/state/navigate.d.ts.map +1 -1
- package/dist/state/navigate.js +3 -1
- package/dist/state/navigate.js.map +1 -1
- package/dist/state/resolve-insert.d.ts +55 -0
- package/dist/state/resolve-insert.d.ts.map +1 -0
- package/dist/state/resolve-insert.js +118 -0
- package/dist/state/resolve-insert.js.map +1 -0
- package/dist/state/slice-ops.d.ts +46 -0
- package/dist/state/slice-ops.d.ts.map +1 -0
- package/dist/state/slice-ops.js +150 -0
- package/dist/state/slice-ops.js.map +1 -0
- package/dist/state/state.d.ts +6 -1
- package/dist/state/state.d.ts.map +1 -1
- package/dist/state/state.js +10 -0
- package/dist/state/state.js.map +1 -1
- package/dist/state/transaction.d.ts +43 -49
- package/dist/state/transaction.d.ts.map +1 -1
- package/dist/state/transaction.js +62 -858
- package/dist/state/transaction.js.map +1 -1
- package/dist/styles.css +160 -29
- package/dist/view/adapter.d.ts +84 -0
- package/dist/view/adapter.d.ts.map +1 -0
- package/dist/view/adapter.js +76 -0
- package/dist/view/adapter.js.map +1 -0
- package/dist/view/caret.d.ts +25 -0
- package/dist/view/caret.d.ts.map +1 -0
- package/dist/view/caret.js +43 -0
- package/dist/view/caret.js.map +1 -0
- package/dist/view/decoration.d.ts +9 -0
- package/dist/view/decoration.d.ts.map +1 -0
- package/dist/view/decoration.js +214 -0
- package/dist/view/decoration.js.map +1 -0
- package/dist/view/dirty-keys.d.ts +18 -0
- package/dist/view/dirty-keys.d.ts.map +1 -0
- package/dist/view/dirty-keys.js +31 -0
- package/dist/view/dirty-keys.js.map +1 -0
- package/dist/view/dom.d.ts.map +1 -1
- package/dist/view/dom.js +7 -5
- package/dist/view/dom.js.map +1 -1
- package/dist/view/hook-ctx.d.ts +32 -0
- package/dist/view/hook-ctx.d.ts.map +1 -0
- package/dist/view/hook-ctx.js +64 -0
- package/dist/view/hook-ctx.js.map +1 -0
- package/dist/view/ime.d.ts +72 -0
- package/dist/view/ime.d.ts.map +1 -0
- package/dist/view/ime.js +185 -0
- package/dist/view/ime.js.map +1 -0
- package/dist/view/input.d.ts +12 -12
- package/dist/view/input.d.ts.map +1 -1
- package/dist/view/input.js +83 -534
- package/dist/view/input.js.map +1 -1
- package/dist/view/keys.d.ts +25 -0
- package/dist/view/keys.d.ts.map +1 -0
- package/dist/view/keys.js +106 -0
- package/dist/view/keys.js.map +1 -0
- package/dist/view/line-nav.d.ts +13 -0
- package/dist/view/line-nav.d.ts.map +1 -0
- package/dist/view/line-nav.js +114 -0
- package/dist/view/line-nav.js.map +1 -0
- package/dist/view/mount.d.ts.map +1 -1
- package/dist/view/mount.js +43 -39
- package/dist/view/mount.js.map +1 -1
- package/dist/view/node-selection.d.ts +33 -0
- package/dist/view/node-selection.d.ts.map +1 -0
- package/dist/view/node-selection.js +107 -0
- package/dist/view/node-selection.js.map +1 -0
- package/dist/view/render.d.ts +4 -1
- package/dist/view/render.d.ts.map +1 -1
- package/dist/view/render.js +13 -3
- package/dist/view/render.js.map +1 -1
- package/dist/view/serialize.d.ts.map +1 -1
- package/dist/view/serialize.js +14 -5
- package/dist/view/serialize.js.map +1 -1
- package/package.json +1 -1
|
@@ -0,0 +1,204 @@
|
|
|
1
|
+
import { nodeAt } from "../model/traverse.js";
|
|
2
|
+
import { pathEq } from "./apply.js";
|
|
3
|
+
import { isContainer } from "./resolve-insert.js";
|
|
4
|
+
import { pointEq, textSelection } from "./selection.js";
|
|
5
|
+
/**
|
|
6
|
+
* 문서 순서 비교 — pointCmp와 다른 점: 컨테이너 경계 포인트를
|
|
7
|
+
* "자식 offset 앞"으로 해석한다. pointCmp는 [i]/k < [i,j]/m이지만
|
|
8
|
+
* 실제 문서 순서에선 [i]/k 는 k>j 이면 [i,j] 안쪽 "뒤"다 —
|
|
9
|
+
* DOM 셀렉션이 만드는 (블록엘리먼트, 자식인덱스) 포인트를 정렬할 때
|
|
10
|
+
* pointCmp를 쓰면 범위가 뒤집힌다.
|
|
11
|
+
*/
|
|
12
|
+
function docOrderCmp(a, b) {
|
|
13
|
+
const d = Math.min(a.path.length, b.path.length);
|
|
14
|
+
for (let i = 0; i < d; i++) {
|
|
15
|
+
if (a.path[i] !== b.path[i])
|
|
16
|
+
return a.path[i] - b.path[i];
|
|
17
|
+
}
|
|
18
|
+
if (a.path.length === b.path.length)
|
|
19
|
+
return a.offset - b.offset;
|
|
20
|
+
if (a.path.length < b.path.length) {
|
|
21
|
+
return b.path[a.path.length] < a.offset ? 1 : -1;
|
|
22
|
+
}
|
|
23
|
+
return a.path[b.path.length] < b.offset ? -1 : 1;
|
|
24
|
+
}
|
|
25
|
+
/** atom 리프 안 포인트를 부모 경계로 올린다 — dir>0이면 노드 "뒤" 경계 */
|
|
26
|
+
function resolveBoundary(state, doc, p, dir) {
|
|
27
|
+
const node = nodeAt(doc, p.path);
|
|
28
|
+
if (!node || node.type === "text" || isContainer(state, node))
|
|
29
|
+
return p;
|
|
30
|
+
const idx = p.path[p.path.length - 1];
|
|
31
|
+
if (idx == null)
|
|
32
|
+
return p;
|
|
33
|
+
return {
|
|
34
|
+
path: p.path.slice(0, -1),
|
|
35
|
+
offset: idx + (dir > 0 ? 1 : 0),
|
|
36
|
+
};
|
|
37
|
+
}
|
|
38
|
+
/**
|
|
39
|
+
* 범위 삭제 — anchor/focus 순서와 atom 경계를 정규화한 뒤
|
|
40
|
+
* deleteOrdered에 위임한다.
|
|
41
|
+
*/
|
|
42
|
+
export function deleteRange(host, range) {
|
|
43
|
+
const doc = host.docNow();
|
|
44
|
+
const fwd = docOrderCmp(range.anchor, range.focus) <= 0;
|
|
45
|
+
const a = resolveBoundary(host.state, doc, fwd ? range.anchor : range.focus, -1);
|
|
46
|
+
const f = resolveBoundary(host.state, doc, fwd ? range.focus : range.anchor, 1);
|
|
47
|
+
deleteOrdered(host, doc, a, f);
|
|
48
|
+
}
|
|
49
|
+
function pushRemove(host, at, node) {
|
|
50
|
+
host.addStep({ op: "remove", at, node });
|
|
51
|
+
}
|
|
52
|
+
/** a<f로 정렬 + atom 경계 해석이 끝난 범위 삭제 — 재귀용 내부 구현 */
|
|
53
|
+
function deleteOrdered(host, doc, a, f) {
|
|
54
|
+
if (pointEq(a, f))
|
|
55
|
+
return;
|
|
56
|
+
const aNode = nodeAt(doc, a.path);
|
|
57
|
+
const fNode = nodeAt(doc, f.path);
|
|
58
|
+
// 같은 노드 안
|
|
59
|
+
if (pathEq(a.path, f.path)) {
|
|
60
|
+
if (aNode?.type === "text") {
|
|
61
|
+
pushRemove(host, a, {
|
|
62
|
+
type: "text",
|
|
63
|
+
text: (aNode.text ?? "").slice(a.offset, f.offset),
|
|
64
|
+
...(aNode.marks && { marks: aNode.marks }),
|
|
65
|
+
});
|
|
66
|
+
}
|
|
67
|
+
else if (aNode?.content) {
|
|
68
|
+
for (let j = f.offset - 1; j >= a.offset; j--) {
|
|
69
|
+
const child = aNode.content[j];
|
|
70
|
+
if (child)
|
|
71
|
+
pushRemove(host, { path: a.path, offset: j }, child);
|
|
72
|
+
}
|
|
73
|
+
}
|
|
74
|
+
host.selection = textSelection(a);
|
|
75
|
+
return;
|
|
76
|
+
}
|
|
77
|
+
const aParent = a.path.slice(0, -1);
|
|
78
|
+
const fParent = f.path.slice(0, -1);
|
|
79
|
+
// 같은 부모 안 형제 사이
|
|
80
|
+
if (pathEq(aParent, fParent)) {
|
|
81
|
+
if (fNode?.type === "text" && f.offset > 0) {
|
|
82
|
+
pushRemove(host, { path: f.path, offset: 0 }, {
|
|
83
|
+
type: "text",
|
|
84
|
+
text: fNode.text.slice(0, f.offset),
|
|
85
|
+
...(fNode.marks && { marks: fNode.marks }),
|
|
86
|
+
});
|
|
87
|
+
}
|
|
88
|
+
const ai = a.path[a.path.length - 1];
|
|
89
|
+
const fi = f.path[f.path.length - 1];
|
|
90
|
+
for (let j = fi - 1; j > ai; j--) {
|
|
91
|
+
const child = nodeAt(doc, [...aParent, j]);
|
|
92
|
+
if (child)
|
|
93
|
+
pushRemove(host, { path: aParent, offset: j }, child);
|
|
94
|
+
}
|
|
95
|
+
if (aNode?.type === "text") {
|
|
96
|
+
const tail = (aNode.text ?? "").slice(a.offset);
|
|
97
|
+
if (tail) {
|
|
98
|
+
pushRemove(host, a, {
|
|
99
|
+
type: "text",
|
|
100
|
+
text: tail,
|
|
101
|
+
...(aNode.marks && { marks: aNode.marks }),
|
|
102
|
+
});
|
|
103
|
+
}
|
|
104
|
+
}
|
|
105
|
+
host.selection = textSelection(a);
|
|
106
|
+
return;
|
|
107
|
+
}
|
|
108
|
+
// 다른 블록 — 같은 grandparent 아래 텍스트블록 사이면 join한다
|
|
109
|
+
const aGrand = aParent.slice(0, -1);
|
|
110
|
+
const fGrand = fParent.slice(0, -1);
|
|
111
|
+
const joinable = pathEq(aGrand, fGrand) &&
|
|
112
|
+
aParent.length === fParent.length &&
|
|
113
|
+
aNode?.type === "text" &&
|
|
114
|
+
fNode?.type === "text";
|
|
115
|
+
if (joinable) {
|
|
116
|
+
const ai = aParent[aParent.length - 1];
|
|
117
|
+
const fi = fParent[fParent.length - 1];
|
|
118
|
+
const ti = a.path[a.path.length - 1];
|
|
119
|
+
const tj = f.path[f.path.length - 1];
|
|
120
|
+
const aBlock = nodeAt(doc, aParent);
|
|
121
|
+
const fBlock = nodeAt(doc, fParent);
|
|
122
|
+
// anchor 텍스트 tail 제거
|
|
123
|
+
const aTail = aNode.text.slice(a.offset);
|
|
124
|
+
if (aTail) {
|
|
125
|
+
pushRemove(host, a, {
|
|
126
|
+
type: "text",
|
|
127
|
+
text: aTail,
|
|
128
|
+
...(aNode.marks && { marks: aNode.marks }),
|
|
129
|
+
});
|
|
130
|
+
}
|
|
131
|
+
// anchor 블록의 뒤쪽 형제 제거 (desc)
|
|
132
|
+
const aSibs = aBlock.content ?? [];
|
|
133
|
+
for (let j = aSibs.length - 1; j > ti; j--) {
|
|
134
|
+
pushRemove(host, { path: aParent, offset: j }, aSibs[j]);
|
|
135
|
+
}
|
|
136
|
+
// focus 잔여분을 anchor 블록에 join
|
|
137
|
+
const fTail = fNode.text.slice(f.offset);
|
|
138
|
+
let insAt = ti + 1;
|
|
139
|
+
if (fTail) {
|
|
140
|
+
host.addStep({
|
|
141
|
+
op: "insert",
|
|
142
|
+
at: { path: aParent, offset: insAt++ },
|
|
143
|
+
node: {
|
|
144
|
+
type: "text",
|
|
145
|
+
text: fTail,
|
|
146
|
+
...(fNode.marks && { marks: fNode.marks }),
|
|
147
|
+
},
|
|
148
|
+
});
|
|
149
|
+
}
|
|
150
|
+
const fSibs = fBlock.content ?? [];
|
|
151
|
+
for (let j = tj + 1; j < fSibs.length; j++) {
|
|
152
|
+
host.addStep({
|
|
153
|
+
op: "insert",
|
|
154
|
+
at: { path: aParent, offset: insAt++ },
|
|
155
|
+
node: fSibs[j],
|
|
156
|
+
});
|
|
157
|
+
}
|
|
158
|
+
// focus 블록 + 중간 블록 제거 (desc index — anchor는 항상 앞)
|
|
159
|
+
for (let j = fi; j > ai; j--) {
|
|
160
|
+
const blk = nodeAt(doc, [...aGrand, j]);
|
|
161
|
+
if (blk)
|
|
162
|
+
pushRemove(host, { path: aGrand, offset: j }, blk);
|
|
163
|
+
}
|
|
164
|
+
host.selection = textSelection(a);
|
|
165
|
+
return;
|
|
166
|
+
}
|
|
167
|
+
// 일반화 — LCA 레벨에서 완전히 선택된 자식을 제거하고, 양 끝은
|
|
168
|
+
// 각각 "자식 끝까지"/"자식 처음부터" 범위로 재귀 trim한다.
|
|
169
|
+
// DOM 셀렉션이 만드는 경계↔내부 혼합 범위(전체 선택, atom 걸침)를 커버.
|
|
170
|
+
let l = 0;
|
|
171
|
+
const minLen = Math.min(a.path.length, f.path.length);
|
|
172
|
+
while (l < minLen && a.path[l] === f.path[l])
|
|
173
|
+
l++;
|
|
174
|
+
const lca = a.path.slice(0, l);
|
|
175
|
+
const aIn = a.path.length > l;
|
|
176
|
+
const fIn = f.path.length > l;
|
|
177
|
+
const aChild = aIn ? a.path[l] : a.offset;
|
|
178
|
+
const fChild = fIn ? f.path[l] : f.offset;
|
|
179
|
+
const remStart = aIn ? aChild + 1 : a.offset;
|
|
180
|
+
const remEnd = fIn ? fChild : f.offset;
|
|
181
|
+
// 끝쪽 부분 삭제 — f가 담긴 자식의 처음부터 f까지
|
|
182
|
+
if (fIn) {
|
|
183
|
+
deleteOrdered(host, doc, { path: [...lca, fChild], offset: 0 }, f);
|
|
184
|
+
}
|
|
185
|
+
// 시작쪽 부분 삭제 — a부터 a가 담긴 자식의 끝까지
|
|
186
|
+
// (텍스트 자식의 끝은 문자 길이, 컨테이너는 자식 수)
|
|
187
|
+
if (aIn) {
|
|
188
|
+
const aChildPath = [...lca, aChild];
|
|
189
|
+
const aChildNode = nodeAt(doc, aChildPath);
|
|
190
|
+
const endOffset = aChildNode?.type === "text"
|
|
191
|
+
? (aChildNode.text?.length ?? 0)
|
|
192
|
+
: (aChildNode?.content?.length ?? 0);
|
|
193
|
+
deleteOrdered(host, doc, a, { path: aChildPath, offset: endOffset });
|
|
194
|
+
}
|
|
195
|
+
// 완전 삭제 구간 — LCA의 자식 [remStart, remEnd)을 역순으로
|
|
196
|
+
const lcaNode = nodeAt(doc, lca);
|
|
197
|
+
for (let j = remEnd - 1; j >= remStart; j--) {
|
|
198
|
+
const child = lcaNode?.content?.[j];
|
|
199
|
+
if (child)
|
|
200
|
+
pushRemove(host, { path: lca, offset: j }, child);
|
|
201
|
+
}
|
|
202
|
+
host.selection = textSelection(a);
|
|
203
|
+
}
|
|
204
|
+
//# sourceMappingURL=delete-ops.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"delete-ops.js","sourceRoot":"","sources":["../../src/state/delete-ops.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAC9C,OAAO,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AACpC,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AA+BxD;;;;;;GAMG;AACH,SAAS,WAAW,CAAC,CAAQ,EAAE,CAAQ;IACrC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;IAC9D,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;IAChE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QAClC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAE,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC;IACD,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAE,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC;AAED,oDAAoD;AACpD,SAAS,eAAe,CACtB,KAAkB,EAClB,GAAY,EACZ,CAAQ,EACR,GAAW;IAEX,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IACxE,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtC,IAAI,GAAG,IAAI,IAAI;QAAE,OAAO,CAAC,CAAC;IAC1B,OAAO;QACL,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzB,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAChC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,IAAmB,EAAE,KAAY;IAC3D,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC1B,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACxD,MAAM,CAAC,GAAG,eAAe,CACvB,IAAI,CAAC,KAAK,EACV,GAAG,EACH,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,EAChC,CAAC,CAAC,CACH,CAAC;IACF,MAAM,CAAC,GAAG,eAAe,CACvB,IAAI,CAAC,KAAK,EACV,GAAG,EACH,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,EAChC,CAAC,CACF,CAAC;IACF,aAAa,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACjC,CAAC;AAED,SAAS,UAAU,CAAC,IAAmB,EAAE,EAAS,EAAE,IAAgB;IAClE,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;AAC3C,CAAC;AAED,iDAAiD;AACjD,SAAS,aAAa,CACpB,IAAmB,EACnB,GAAY,EACZ,CAAQ,EACR,CAAQ;IAER,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;QAAE,OAAO;IAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAElC,UAAU;IACV,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3B,IAAI,KAAK,EAAE,IAAI,KAAK,MAAM,EAAE,CAAC;YAC3B,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE;gBAClB,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;gBAClD,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;aAC3C,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,KAAK,EAAE,OAAO,EAAE,CAAC;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC/B,IAAI,KAAK;oBAAE,UAAU,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAClE,CAAC;QACH,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAClC,OAAO;IACT,CAAC;IAED,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACpC,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAEpC,gBAAgB;IAChB,IAAI,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;QAC7B,IAAI,KAAK,EAAE,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,UAAU,CACR,IAAI,EACJ,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,EAC3B;gBACE,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,KAAK,CAAC,IAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;gBACpC,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;aAC3C,CACF,CAAC;QACJ,CAAC;QACD,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;QACtC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,KAAK;gBAAE,UAAU,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACnE,CAAC;QACD,IAAI,KAAK,EAAE,IAAI,KAAK,MAAM,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAChD,IAAI,IAAI,EAAE,CAAC;gBACT,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE;oBAClB,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,IAAI;oBACV,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;iBAC3C,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAClC,OAAO;IACT,CAAC;IAED,6CAA6C;IAC7C,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACpC,MAAM,QAAQ,GACZ,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;QACtB,OAAO,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM;QACjC,KAAK,EAAE,IAAI,KAAK,MAAM;QACtB,KAAK,EAAE,IAAI,KAAK,MAAM,CAAC;IAEzB,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;QACxC,MAAM,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;QACxC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;QACtC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;QACtC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,EAAE,OAAO,CAAE,CAAC;QACrC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,EAAE,OAAO,CAAE,CAAC;QAErC,qBAAqB;QACrB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAK,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,KAAK,EAAE,CAAC;YACV,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE;gBAClB,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,KAAK;gBACX,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;aAC3C,CAAC,CAAC;QACL,CAAC;QACD,6BAA6B;QAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,UAAU,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC;QAC5D,CAAC;QACD,6BAA6B;QAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,IAAK,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,KAAK,GAAG,EAAE,GAAG,CAAC,CAAC;QACnB,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,OAAO,CAAC;gBACX,EAAE,EAAE,QAAQ;gBACZ,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE;gBACtC,IAAI,EAAE;oBACJ,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,KAAK;oBACX,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;iBAC3C;aACF,CAAC,CAAC;QACL,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,CAAC,OAAO,CAAC;gBACX,EAAE,EAAE,QAAQ;gBACZ,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE;gBACtC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAE;aAChB,CAAC,CAAC;QACL,CAAC;QACD,kDAAkD;QAClD,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;YACxC,IAAI,GAAG;gBAAE,UAAU,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAC9D,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAClC,OAAO;IACT,CAAC;IAED,wCAAwC;IACxC,uCAAuC;IACvC,gDAAgD;IAChD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtD,OAAO,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAAE,CAAC,EAAE,CAAC;IAClD,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9B,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC3C,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC3C,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC7C,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAEvC,gCAAgC;IAChC,IAAI,GAAG,EAAE,CAAC;QACR,aAAa,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,GAAG,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACrE,CAAC;IACD,gCAAgC;IAChC,iCAAiC;IACjC,IAAI,GAAG,EAAE,CAAC;QACR,MAAM,UAAU,GAAG,CAAC,GAAG,GAAG,EAAE,MAAM,CAAC,CAAC;QACpC,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QAC3C,MAAM,SAAS,GACb,UAAU,EAAE,IAAI,KAAK,MAAM;YACzB,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC;YAChC,CAAC,CAAC,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC;QACzC,aAAa,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;IACvE,CAAC;IACD,8CAA8C;IAC9C,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,KAAK,GAAG,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,KAAK;YAAE,UAAU,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC/D,CAAC;IACD,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC"}
|
|
@@ -0,0 +1,30 @@
|
|
|
1
|
+
import type { InputRule } from "../editor/extension.js";
|
|
2
|
+
import type { DocNode } from "../model/node.js";
|
|
3
|
+
import type { Transaction } from "./transaction.js";
|
|
4
|
+
import type { EditorState } from "./state.js";
|
|
5
|
+
/**
|
|
6
|
+
* 입력 규칙 적용 — TransactionBuilder에서 분리한 모듈.
|
|
7
|
+
* 마크다운식 변환(`# `→heading, `**x**`→bold)을 커서 위치 기준으로
|
|
8
|
+
* 평가하는 로직을 담는다. delete-ops/list-ops와 같은 호스트 계약
|
|
9
|
+
* 패턴 — 규칙 핸들러가 같은 tr 위에 스텝을 쌓으려면 호스트가
|
|
10
|
+
* Transaction이어야 한다.
|
|
11
|
+
*/
|
|
12
|
+
/**
|
|
13
|
+
* 입력 규칙이 요구하는 빌더 계약 — TransactionBuilder가 만족한다.
|
|
14
|
+
* 규칙 핸들러에 넘길 tr 자신이 Transaction이어야 하므로 host를
|
|
15
|
+
* 그대로 tr로 쓴다 (변환 스텝이 입력과 같은 undo 단위에 쌓인다).
|
|
16
|
+
*/
|
|
17
|
+
export interface InputRulesHost extends Transaction {
|
|
18
|
+
readonly state: EditorState;
|
|
19
|
+
/** 빌더 좌표계의 현재 문서 — 쌓인 스텝까지 적용된 결과 */
|
|
20
|
+
docNow(): DocNode;
|
|
21
|
+
}
|
|
22
|
+
/**
|
|
23
|
+
* 입력 규칙 — 마크다운식 변환(`# `→heading, `**x**`→bold).
|
|
24
|
+
* 캐럿이 속한 인라인 블록의 블록 시작~커서 텍스트를 만들어 각
|
|
25
|
+
* 규칙의 pattern에 매칭한다. 매치가 커서에서 끝나는 첫 규칙이
|
|
26
|
+
* 이 tr 위에 변환 스텝을 쌓는다 — 위치는 docNow 좌표라 규칙
|
|
27
|
+
* 핸들러가 쌓은 스텝도 직전 스텝 기준으로 해석된다.
|
|
28
|
+
*/
|
|
29
|
+
export declare function applyInputRulesTo(host: InputRulesHost, rules: readonly InputRule[]): void;
|
|
30
|
+
//# sourceMappingURL=input-rules.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"input-rules.d.ts","sourceRoot":"","sources":["../../src/state/input-rules.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAKhD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C;;;;;;GAMG;AAEH;;;;GAIG;AACH,MAAM,WAAW,cAAe,SAAQ,WAAW;IACjD,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,qCAAqC;IACrC,MAAM,IAAI,OAAO,CAAC;CACnB;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,cAAc,EACpB,KAAK,EAAE,SAAS,SAAS,EAAE,GAC1B,IAAI,CAqDN"}
|
|
@@ -0,0 +1,70 @@
|
|
|
1
|
+
import { nodeAt } from "../model/traverse.js";
|
|
2
|
+
import { acceptsInline } from "./resolve-insert.js";
|
|
3
|
+
import { pointEq } from "./selection.js";
|
|
4
|
+
/**
|
|
5
|
+
* 입력 규칙 — 마크다운식 변환(`# `→heading, `**x**`→bold).
|
|
6
|
+
* 캐럿이 속한 인라인 블록의 블록 시작~커서 텍스트를 만들어 각
|
|
7
|
+
* 규칙의 pattern에 매칭한다. 매치가 커서에서 끝나는 첫 규칙이
|
|
8
|
+
* 이 tr 위에 변환 스텝을 쌓는다 — 위치는 docNow 좌표라 규칙
|
|
9
|
+
* 핸들러가 쌓은 스텝도 직전 스텝 기준으로 해석된다.
|
|
10
|
+
*/
|
|
11
|
+
export function applyInputRulesTo(host, rules) {
|
|
12
|
+
if (!rules.length)
|
|
13
|
+
return;
|
|
14
|
+
const sel = host.selection ?? host.state.selection;
|
|
15
|
+
if (sel.type !== "text" || !pointEq(sel.anchor, sel.focus))
|
|
16
|
+
return;
|
|
17
|
+
const doc = host.docNow();
|
|
18
|
+
const caret = sel.anchor;
|
|
19
|
+
const node = nodeAt(doc, caret.path);
|
|
20
|
+
if (node?.type !== "text")
|
|
21
|
+
return;
|
|
22
|
+
const blockPath = caret.path.slice(0, -1);
|
|
23
|
+
const block = nodeAt(doc, blockPath);
|
|
24
|
+
if (!block?.content || !acceptsInline(host.state, block))
|
|
25
|
+
return;
|
|
26
|
+
// 코드 블록 안에서는 마크다운 변환을 하지 않는다
|
|
27
|
+
if (host.state.schema.nodeSpec(block.type)?.code)
|
|
28
|
+
return;
|
|
29
|
+
const kids = block.content;
|
|
30
|
+
const ci = caret.path[caret.path.length - 1];
|
|
31
|
+
// 블록 시작~커서의 인라인 텍스트 + 각 세그먼트의 절대 오프셋
|
|
32
|
+
let textBefore = "";
|
|
33
|
+
const segs = [];
|
|
34
|
+
for (let i = 0; i <= ci && i < kids.length; i++) {
|
|
35
|
+
const t = kids[i]?.text ?? "";
|
|
36
|
+
const take = i === ci ? Math.min(caret.offset, t.length) : t.length;
|
|
37
|
+
segs.push({
|
|
38
|
+
path: [...blockPath, i],
|
|
39
|
+
start: textBefore.length,
|
|
40
|
+
len: take,
|
|
41
|
+
});
|
|
42
|
+
textBefore += t.slice(0, take);
|
|
43
|
+
}
|
|
44
|
+
if (!textBefore)
|
|
45
|
+
return;
|
|
46
|
+
// textBefore 절대 오프셋 → Point (끝은 항상 캐럿)
|
|
47
|
+
const toPoint = (pos) => {
|
|
48
|
+
for (const s of segs) {
|
|
49
|
+
if (!s.len)
|
|
50
|
+
continue;
|
|
51
|
+
if (pos < s.start + s.len || pos === s.start) {
|
|
52
|
+
return { path: s.path, offset: pos - s.start };
|
|
53
|
+
}
|
|
54
|
+
}
|
|
55
|
+
return caret;
|
|
56
|
+
};
|
|
57
|
+
for (const rule of rules) {
|
|
58
|
+
const m = rule.pattern.exec(textBefore);
|
|
59
|
+
if (!m)
|
|
60
|
+
continue;
|
|
61
|
+
const start = m.index;
|
|
62
|
+
const end = start + m[0].length;
|
|
63
|
+
if (end !== textBefore.length)
|
|
64
|
+
continue; // 커서에서 끝나는 매치만
|
|
65
|
+
const handled = rule.handler({ state: host.state, tr: host, dispatch: () => { } }, m, { anchor: toPoint(start), focus: caret }, doc);
|
|
66
|
+
if (handled !== false)
|
|
67
|
+
break;
|
|
68
|
+
}
|
|
69
|
+
}
|
|
70
|
+
//# sourceMappingURL=input-rules.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"input-rules.js","sourceRoot":"","sources":["../../src/state/input-rules.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAC9C,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAwBzC;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,IAAoB,EACpB,KAA2B;IAE3B,IAAI,CAAC,KAAK,CAAC,MAAM;QAAE,OAAO;IAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;IACnD,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO;IACnE,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC1B,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC;IACzB,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,IAAI,EAAE,IAAI,KAAK,MAAM;QAAE,OAAO;IAClC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;IACrC,IAAI,CAAC,KAAK,EAAE,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;QAAE,OAAO;IACjE,6BAA6B;IAC7B,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI;QAAE,OAAO;IACzD,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC;IAC3B,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;IAC9C,qCAAqC;IACrC,IAAI,UAAU,GAAG,EAAE,CAAC;IACpB,MAAM,IAAI,GAAqD,EAAE,CAAC;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChD,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACpE,IAAI,CAAC,IAAI,CAAC;YACR,IAAI,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,CAAC;YACvB,KAAK,EAAE,UAAU,CAAC,MAAM;YACxB,GAAG,EAAE,IAAI;SACV,CAAC,CAAC;QACH,UAAU,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACjC,CAAC;IACD,IAAI,CAAC,UAAU;QAAE,OAAO;IACxB,uCAAuC;IACvC,MAAM,OAAO,GAAG,CAAC,GAAW,EAAS,EAAE;QACrC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,CAAC,CAAC,GAAG;gBAAE,SAAS;YACrB,IAAI,GAAG,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;gBAC7C,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;YACjD,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACxC,IAAI,CAAC,CAAC;YAAE,SAAS;QACjB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QACtB,MAAM,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAChC,IAAI,GAAG,KAAK,UAAU,CAAC,MAAM;YAAE,SAAS,CAAC,eAAe;QACxD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAC1B,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAE,CAAC,EAAE,EACnD,CAAC,EACD,EAAE,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,EACxC,GAAG,CACJ,CAAC;QACF,IAAI,OAAO,KAAK,KAAK;YAAE,MAAM;IAC/B,CAAC;AACH,CAAC"}
|
|
@@ -0,0 +1,54 @@
|
|
|
1
|
+
import type { DocNode, EditorNode, Mark } from "../model/node.js";
|
|
2
|
+
import type { Point, Range, Selection } from "./selection.js";
|
|
3
|
+
import type { Step } from "./transaction.js";
|
|
4
|
+
import type { EditorState } from "./state.js";
|
|
5
|
+
/**
|
|
6
|
+
* 삽입/분할 트랜잭션 연산 — TransactionBuilder에서 분리한 모듈.
|
|
7
|
+
* insertText·insertNode·split은 임의 포인트 정규화(resolve-insert.ts),
|
|
8
|
+
* 대기 마크(storedMarks), splitExit 스키마 규칙이 얽혀 있어
|
|
9
|
+
* 전용 모듈로 둔다 — list-ops/slice-ops/delete-ops와 같은 패턴이다.
|
|
10
|
+
*/
|
|
11
|
+
/**
|
|
12
|
+
* 삽입/분할 연산이 요구하는 빌더 계약 — TransactionBuilder가 만족한다.
|
|
13
|
+
* 스텝 큐·셀렉션·대기 마크와 문서 해석만 건드리는 최소 표면이다.
|
|
14
|
+
*/
|
|
15
|
+
export interface InsertOpsHost {
|
|
16
|
+
readonly state: EditorState;
|
|
17
|
+
/** 적용 후 셀렉션 — 삽입이 커서를 직접 배치할 때 쓴다 */
|
|
18
|
+
selection: Selection | null;
|
|
19
|
+
/** 이번 tr에서 명시한 대기 마크 — 없으면 state.storedMarks가 읽힌다 */
|
|
20
|
+
readonly storedMarks: Mark[] | null;
|
|
21
|
+
/** 이미 쌓인 스텝까지 적용된 doc — 빌더 좌표계의 현재 문서 */
|
|
22
|
+
docNow(): DocNode;
|
|
23
|
+
/** 원시 스텝 추가 — 좌표를 이미 계산한 삽입은 정규화를 거치지 않는다 */
|
|
24
|
+
addStep(step: Step): unknown;
|
|
25
|
+
/** 범위 삭제 — 비축소 셀렉션 위의 입력은 먼저 지운다 */
|
|
26
|
+
delete(range: Range): unknown;
|
|
27
|
+
}
|
|
28
|
+
/** 텍스트를 담는 새 블록 — 스키마에 paragraph가 없으면 inline 블록을 찾는다 */
|
|
29
|
+
export declare function newTextBlock(state: EditorState, children: readonly EditorNode[]): EditorNode;
|
|
30
|
+
/**
|
|
31
|
+
* 텍스트 삽입 — at이 없으면 현재 셀렉션(비축소면 먼저 삭제).
|
|
32
|
+
* 마크 우선순위: 이 tr에서 명시한 storedMarks → 이전 tr이 남긴
|
|
33
|
+
* state.storedMarks(툴바 토글 등) → 커서 위치 텍스트 마크.
|
|
34
|
+
* code 블록은 마크를 받지 않는다 — 대기 서식이 켜진 채 들어와도,
|
|
35
|
+
* 앞쪽 텍스트에 마크가 남아 있어도 순수 텍스트로 넣는다.
|
|
36
|
+
*/
|
|
37
|
+
export declare function insertTextInto(host: InsertOpsHost, text: string, at?: Point): void;
|
|
38
|
+
/**
|
|
39
|
+
* 노드 삽입 — at에 그대로 넣고 캐럿은 삽입물 뒤에 둔다.
|
|
40
|
+
*/
|
|
41
|
+
export declare function insertNodeInto(host: InsertOpsHost, at: Point, node: EditorNode): void;
|
|
42
|
+
/**
|
|
43
|
+
* at 위치에서 노드를 분할한다 (Enter). 생략하면 현재 셀렉션 —
|
|
44
|
+
* 비어있지 않은 셀렉션이면 먼저 지운 뒤 분할한다.
|
|
45
|
+
* 셀렉션은 분할된 "오른쪽" 부분의 시작으로 옮긴다.
|
|
46
|
+
*
|
|
47
|
+
* 비텍스트 포인트 Enter는 인라인 컨테이너 경계면 가장 가까운 텍스트
|
|
48
|
+
* 위치로 환원해 정상 분할하고, 그 외(블록 컨테이너 경계, atom 안,
|
|
49
|
+
* 빈 블록)에는 그 자리에 새 빈 블록을 만든다. 블록 "끝"에서의 Enter는
|
|
50
|
+
* splitExit 타입의 블록을 새로 만든다 — PM 관례(heading 끝 Enter →
|
|
51
|
+
* paragraph. 중간 분할은 타입 유지). splitExit 미지정이면 기본 블록.
|
|
52
|
+
*/
|
|
53
|
+
export declare function splitAt(host: InsertOpsHost, at?: Point, depth?: number): void;
|
|
54
|
+
//# sourceMappingURL=insert-ops.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"insert-ops.d.ts","sourceRoot":"","sources":["../../src/state/insert-ops.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAYlE,OAAO,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAC9D,OAAO,KAAK,EAAa,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACxD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C;;;;;GAKG;AAEH;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,qCAAqC;IACrC,SAAS,EAAE,SAAS,GAAG,IAAI,CAAC;IAC5B,qDAAqD;IACrD,QAAQ,CAAC,WAAW,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;IACpC,yCAAyC;IACzC,MAAM,IAAI,OAAO,CAAC;IAClB,6CAA6C;IAC7C,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC;IAC7B,oCAAoC;IACpC,MAAM,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAAC;CAC/B;AAED,wDAAwD;AACxD,wBAAgB,YAAY,CAC1B,KAAK,EAAE,WAAW,EAClB,QAAQ,EAAE,SAAS,UAAU,EAAE,GAC9B,UAAU,CAEZ;AAmBD;;;;;;GAMG;AACH,wBAAgB,cAAc,CAC5B,IAAI,EAAE,aAAa,EACnB,IAAI,EAAE,MAAM,EACZ,EAAE,CAAC,EAAE,KAAK,GACT,IAAI,CAsDN;AAED;;GAEG;AACH,wBAAgB,cAAc,CAC5B,IAAI,EAAE,aAAa,EACnB,EAAE,EAAE,KAAK,EACT,IAAI,EAAE,UAAU,GACf,IAAI,CAON;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,OAAO,CAAC,IAAI,EAAE,aAAa,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,SAAI,GAAG,IAAI,CAoFxE"}
|
|
@@ -0,0 +1,186 @@
|
|
|
1
|
+
import { nodeAt } from "../model/traverse.js";
|
|
2
|
+
import { computeSplitOps, mapThroughSplitOp } from "./apply.js";
|
|
3
|
+
import { defaultBlockTypeOf } from "./list-ops.js";
|
|
4
|
+
import { acceptsInline, isContainer, marksForInsert, resolveInsert, selectionAfterInsert, } from "./resolve-insert.js";
|
|
5
|
+
import { normalizeRange, pointEq, textSelection } from "./selection.js";
|
|
6
|
+
/** 텍스트를 담는 새 블록 — 스키마에 paragraph가 없으면 inline 블록을 찾는다 */
|
|
7
|
+
export function newTextBlock(state, children) {
|
|
8
|
+
return { type: defaultBlockTypeOf(state), content: [...children] };
|
|
9
|
+
}
|
|
10
|
+
/** 블록 경계에 새 빈 블록을 넣고 캐럿을 그 안에 둔다 */
|
|
11
|
+
function insertEmptyBlock(host, insertAt, type) {
|
|
12
|
+
host.addStep({
|
|
13
|
+
op: "insert",
|
|
14
|
+
at: insertAt,
|
|
15
|
+
node: type ? { type, content: [] } : newTextBlock(host.state, []),
|
|
16
|
+
});
|
|
17
|
+
host.selection = textSelection({
|
|
18
|
+
path: [...insertAt.path, insertAt.offset],
|
|
19
|
+
offset: 0,
|
|
20
|
+
});
|
|
21
|
+
}
|
|
22
|
+
/**
|
|
23
|
+
* 텍스트 삽입 — at이 없으면 현재 셀렉션(비축소면 먼저 삭제).
|
|
24
|
+
* 마크 우선순위: 이 tr에서 명시한 storedMarks → 이전 tr이 남긴
|
|
25
|
+
* state.storedMarks(툴바 토글 등) → 커서 위치 텍스트 마크.
|
|
26
|
+
* code 블록은 마크를 받지 않는다 — 대기 서식이 켜진 채 들어와도,
|
|
27
|
+
* 앞쪽 텍스트에 마크가 남아 있어도 순수 텍스트로 넣는다.
|
|
28
|
+
*/
|
|
29
|
+
export function insertTextInto(host, text, at) {
|
|
30
|
+
if (!text)
|
|
31
|
+
return;
|
|
32
|
+
let target = at;
|
|
33
|
+
if (!target) {
|
|
34
|
+
const sel = host.selection ?? host.state.selection;
|
|
35
|
+
if (sel.type !== "text")
|
|
36
|
+
return;
|
|
37
|
+
const r = normalizeRange(sel);
|
|
38
|
+
if (!pointEq(r.anchor, r.focus))
|
|
39
|
+
host.delete(r);
|
|
40
|
+
target = r.anchor;
|
|
41
|
+
}
|
|
42
|
+
const doc = host.docNow();
|
|
43
|
+
const t = resolveInsert(host.state, doc, target);
|
|
44
|
+
const blockPath = t.kind === "text" ? t.point.path.slice(0, -1) : t.path;
|
|
45
|
+
const inCode = host.state.schema.nodeSpec(nodeAt(doc, blockPath)?.type ?? "")?.code ===
|
|
46
|
+
true;
|
|
47
|
+
const marks = inCode
|
|
48
|
+
? undefined
|
|
49
|
+
: (host.storedMarks ??
|
|
50
|
+
host.state.storedMarks ??
|
|
51
|
+
(t.kind === "text"
|
|
52
|
+
? marksForInsert(host.state, doc, t.point)
|
|
53
|
+
: undefined));
|
|
54
|
+
const node = {
|
|
55
|
+
type: "text",
|
|
56
|
+
text,
|
|
57
|
+
...(marks?.length ? { marks } : {}),
|
|
58
|
+
};
|
|
59
|
+
if (t.kind === "text") {
|
|
60
|
+
host.addStep({ op: "insert", at: t.point, node });
|
|
61
|
+
host.selection = selectionAfterInsert(t.point, node, nodeAt(doc, t.point.path));
|
|
62
|
+
return;
|
|
63
|
+
}
|
|
64
|
+
if (t.kind === "inside") {
|
|
65
|
+
const at2 = { path: t.path, offset: t.offset };
|
|
66
|
+
host.addStep({ op: "insert", at: at2, node });
|
|
67
|
+
host.selection = textSelection({
|
|
68
|
+
path: [...t.path, t.offset],
|
|
69
|
+
offset: text.length,
|
|
70
|
+
});
|
|
71
|
+
return;
|
|
72
|
+
}
|
|
73
|
+
// 블록 경계 — paragraph로 감싸 삽입 (전체 선택 후 타이핑 등)
|
|
74
|
+
const block = newTextBlock(host.state, [node]);
|
|
75
|
+
const at2 = { path: t.path, offset: t.offset };
|
|
76
|
+
host.addStep({ op: "insert", at: at2, node: block });
|
|
77
|
+
host.selection = textSelection({
|
|
78
|
+
path: [...t.path, t.offset, 0],
|
|
79
|
+
offset: text.length,
|
|
80
|
+
});
|
|
81
|
+
}
|
|
82
|
+
/**
|
|
83
|
+
* 노드 삽입 — at에 그대로 넣고 캐럿은 삽입물 뒤에 둔다.
|
|
84
|
+
*/
|
|
85
|
+
export function insertNodeInto(host, at, node) {
|
|
86
|
+
host.addStep({ op: "insert", at, node });
|
|
87
|
+
host.selection = selectionAfterInsert(at, node, nodeAt(host.docNow(), at.path));
|
|
88
|
+
}
|
|
89
|
+
/**
|
|
90
|
+
* at 위치에서 노드를 분할한다 (Enter). 생략하면 현재 셀렉션 —
|
|
91
|
+
* 비어있지 않은 셀렉션이면 먼저 지운 뒤 분할한다.
|
|
92
|
+
* 셀렉션은 분할된 "오른쪽" 부분의 시작으로 옮긴다.
|
|
93
|
+
*
|
|
94
|
+
* 비텍스트 포인트 Enter는 인라인 컨테이너 경계면 가장 가까운 텍스트
|
|
95
|
+
* 위치로 환원해 정상 분할하고, 그 외(블록 컨테이너 경계, atom 안,
|
|
96
|
+
* 빈 블록)에는 그 자리에 새 빈 블록을 만든다. 블록 "끝"에서의 Enter는
|
|
97
|
+
* splitExit 타입의 블록을 새로 만든다 — PM 관례(heading 끝 Enter →
|
|
98
|
+
* paragraph. 중간 분할은 타입 유지). splitExit 미지정이면 기본 블록.
|
|
99
|
+
*/
|
|
100
|
+
export function splitAt(host, at, depth = 1) {
|
|
101
|
+
let p = at;
|
|
102
|
+
if (!p) {
|
|
103
|
+
const sel = host.selection ?? host.state.selection;
|
|
104
|
+
if (sel.type !== "text")
|
|
105
|
+
return;
|
|
106
|
+
const r = normalizeRange(sel);
|
|
107
|
+
if (!pointEq(r.anchor, r.focus))
|
|
108
|
+
host.delete(r);
|
|
109
|
+
p = r.anchor;
|
|
110
|
+
}
|
|
111
|
+
const doc = host.docNow();
|
|
112
|
+
if (nodeAt(doc, p.path)?.type !== "text") {
|
|
113
|
+
const node = nodeAt(doc, p.path);
|
|
114
|
+
let insertAt = null;
|
|
115
|
+
if (node &&
|
|
116
|
+
isContainer(host.state, node) &&
|
|
117
|
+
acceptsInline(host.state, node)) {
|
|
118
|
+
const res = resolveInsert(host.state, doc, p);
|
|
119
|
+
if (res.kind === "text") {
|
|
120
|
+
p = res.point;
|
|
121
|
+
}
|
|
122
|
+
else {
|
|
123
|
+
// 빈 인라인 블록 — 뒤에 새 블록
|
|
124
|
+
insertAt = {
|
|
125
|
+
path: p.path.slice(0, -1),
|
|
126
|
+
offset: p.path[p.path.length - 1] + 1,
|
|
127
|
+
};
|
|
128
|
+
}
|
|
129
|
+
}
|
|
130
|
+
else if (node && isContainer(host.state, node)) {
|
|
131
|
+
// 블록 전용 컨테이너(doc 등) 경계 — 그 위치 그대로
|
|
132
|
+
insertAt = p;
|
|
133
|
+
}
|
|
134
|
+
else {
|
|
135
|
+
// atom/리프 안 — 노드 뒤 부모 경계
|
|
136
|
+
const idx = p.path[p.path.length - 1];
|
|
137
|
+
insertAt =
|
|
138
|
+
idx == null ? p : { path: p.path.slice(0, -1), offset: idx + 1 };
|
|
139
|
+
}
|
|
140
|
+
if (insertAt) {
|
|
141
|
+
insertEmptyBlock(host, insertAt);
|
|
142
|
+
return;
|
|
143
|
+
}
|
|
144
|
+
}
|
|
145
|
+
// 블록 "끝" Enter → splitExit 타입 블록으로 탈출
|
|
146
|
+
const target = nodeAt(doc, p.path);
|
|
147
|
+
if (target?.type === "text" && p.path.length >= 2) {
|
|
148
|
+
const blockPath = p.path.slice(0, -1);
|
|
149
|
+
const block = nodeAt(doc, blockPath);
|
|
150
|
+
const lastIdx = (block?.content?.length ?? 0) - 1;
|
|
151
|
+
const atEnd = p.offset === (target.text ?? "").length &&
|
|
152
|
+
p.path[p.path.length - 1] === lastIdx;
|
|
153
|
+
const exitType = block
|
|
154
|
+
? (host.state.schema.nodeSpec(block.type)?.splitExit ??
|
|
155
|
+
defaultBlockTypeOf(host.state))
|
|
156
|
+
: undefined;
|
|
157
|
+
if (atEnd && block && exitType && exitType !== block.type) {
|
|
158
|
+
insertEmptyBlock(host, {
|
|
159
|
+
path: blockPath.slice(0, -1),
|
|
160
|
+
offset: blockPath[blockPath.length - 1] + 1,
|
|
161
|
+
}, exitType);
|
|
162
|
+
return;
|
|
163
|
+
}
|
|
164
|
+
}
|
|
165
|
+
const step = { op: "split", at: p, depth };
|
|
166
|
+
host.addStep(step);
|
|
167
|
+
const ops = computeSplitOps(doc, step);
|
|
168
|
+
let caret = null;
|
|
169
|
+
if (target?.type === "text") {
|
|
170
|
+
// 텍스트 분할 뒤 경계(= 오른쪽 텍스트 시작)를 만들어 나머지
|
|
171
|
+
// nodeSplit op들로 매핑 — 오른쪽 편향
|
|
172
|
+
caret = {
|
|
173
|
+
path: p.path.slice(0, -1),
|
|
174
|
+
offset: p.path[p.path.length - 1] + 1,
|
|
175
|
+
};
|
|
176
|
+
for (const op of ops.slice(1))
|
|
177
|
+
caret = mapThroughSplitOp(caret, op);
|
|
178
|
+
}
|
|
179
|
+
else {
|
|
180
|
+
caret = p;
|
|
181
|
+
for (const op of ops)
|
|
182
|
+
caret = mapThroughSplitOp(caret, op);
|
|
183
|
+
}
|
|
184
|
+
host.selection = textSelection(caret);
|
|
185
|
+
}
|
|
186
|
+
//# sourceMappingURL=insert-ops.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"insert-ops.js","sourceRoot":"","sources":["../../src/state/insert-ops.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAChE,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,EACL,aAAa,EACb,WAAW,EACX,cAAc,EACd,aAAa,EACb,oBAAoB,GACrB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AA8BxE,wDAAwD;AACxD,MAAM,UAAU,YAAY,CAC1B,KAAkB,EAClB,QAA+B;IAE/B,OAAO,EAAE,IAAI,EAAE,kBAAkB,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC;AACrE,CAAC;AAED,oCAAoC;AACpC,SAAS,gBAAgB,CACvB,IAAmB,EACnB,QAAe,EACf,IAAa;IAEb,IAAI,CAAC,OAAO,CAAC;QACX,EAAE,EAAE,QAAQ;QACZ,EAAE,EAAE,QAAQ;QACZ,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;KAClE,CAAC,CAAC;IACH,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC;QAC7B,IAAI,EAAE,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC;QACzC,MAAM,EAAE,CAAC;KACV,CAAC,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAC5B,IAAmB,EACnB,IAAY,EACZ,EAAU;IAEV,IAAI,CAAC,IAAI;QAAE,OAAO;IAClB,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;QACnD,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM;YAAE,OAAO;QAChC,MAAM,CAAC,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;IACpB,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC1B,MAAM,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;IACjD,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACzE,MAAM,MAAM,GACV,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,EAAE,IAAI,IAAI,EAAE,CAAC,EAAE,IAAI;QACpE,IAAI,CAAC;IACP,MAAM,KAAK,GAAG,MAAM;QAClB,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW;YACjB,IAAI,CAAC,KAAK,CAAC,WAAW;YACtB,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM;gBAChB,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC;gBAC1C,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACpB,MAAM,IAAI,GAAe;QACvB,IAAI,EAAE,MAAM;QACZ,IAAI;QACJ,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACpC,CAAC;IACF,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACtB,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QAClD,IAAI,CAAC,SAAS,GAAG,oBAAoB,CACnC,CAAC,CAAC,KAAK,EACP,IAAI,EACJ,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAC1B,CAAC;QACF,OAAO;IACT,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;QAC/C,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;QAC9C,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC;YAC7B,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;YAC3B,MAAM,EAAE,IAAI,CAAC,MAAM;SACpB,CAAC,CAAC;QACH,OAAO;IACT,CAAC;IACD,2CAA2C;IAC3C,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/C,MAAM,GAAG,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;IAC/C,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IACrD,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC;QAC7B,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9B,MAAM,EAAE,IAAI,CAAC,MAAM;KACpB,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAC5B,IAAmB,EACnB,EAAS,EACT,IAAgB;IAEhB,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;IACzC,IAAI,CAAC,SAAS,GAAG,oBAAoB,CACnC,EAAE,EACF,IAAI,EACJ,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAC/B,CAAC;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,OAAO,CAAC,IAAmB,EAAE,EAAU,EAAE,KAAK,GAAG,CAAC;IAChE,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,IAAI,CAAC,CAAC,EAAE,CAAC;QACP,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;QACnD,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM;YAAE,OAAO;QAChC,MAAM,CAAC,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACf,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC1B,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,KAAK,MAAM,EAAE,CAAC;QACzC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,QAAQ,GAAiB,IAAI,CAAC;QAClC,IACE,IAAI;YACJ,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC;YAC7B,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,EAC/B,CAAC;YACD,MAAM,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC9C,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACxB,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC;YAChB,CAAC;iBAAM,CAAC;gBACN,qBAAqB;gBACrB,QAAQ,GAAG;oBACT,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACzB,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,GAAG,CAAC;iBACvC,CAAC;YACJ,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;YACjD,kCAAkC;YAClC,QAAQ,GAAG,CAAC,CAAC;QACf,CAAC;aAAM,CAAC;YACN,yBAAyB;YACzB,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACtC,QAAQ;gBACN,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC;QACrE,CAAC;QACD,IAAI,QAAQ,EAAE,CAAC;YACb,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACjC,OAAO;QACT,CAAC;IACH,CAAC;IACD,sCAAsC;IACtC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,MAAM,EAAE,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAClD,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAClD,MAAM,KAAK,GACT,CAAC,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,MAAM;YACvC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,OAAO,CAAC;QACxC,MAAM,QAAQ,GAAG,KAAK;YACpB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,SAAS;gBAClD,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,CAAC,CAAC,SAAS,CAAC;QACd,IAAI,KAAK,IAAI,KAAK,IAAI,QAAQ,IAAI,QAAQ,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;YAC1D,gBAAgB,CACd,IAAI,EACJ;gBACE,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC5B,MAAM,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAE,GAAG,CAAC;aAC7C,EACD,QAAQ,CACT,CAAC;YACF,OAAO;QACT,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAc,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;IACtD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACnB,MAAM,GAAG,GAAG,eAAe,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACvC,IAAI,KAAK,GAAiB,IAAI,CAAC;IAC/B,IAAI,MAAM,EAAE,IAAI,KAAK,MAAM,EAAE,CAAC;QAC5B,qCAAqC;QACrC,6BAA6B;QAC7B,KAAK,GAAG;YACN,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACzB,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,GAAG,CAAC;SACvC,CAAC;QACF,KAAK,MAAM,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;YAAE,KAAK,GAAG,iBAAiB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACtE,CAAC;SAAM,CAAC;QACN,KAAK,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,EAAE,IAAI,GAAG;YAAE,KAAK,GAAG,iBAAiB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAC7D,CAAC;IACD,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;AACxC,CAAC"}
|
|
@@ -0,0 +1,46 @@
|
|
|
1
|
+
import type { DocNode, EditorNode } from "../model/node.js";
|
|
2
|
+
import type { EditorState } from "./state.js";
|
|
3
|
+
import type { Point, Range, Selection } from "./selection.js";
|
|
4
|
+
/**
|
|
5
|
+
* 리스트 전용 트랜잭션 연산 — splitItem/liftItem/sinkItem.
|
|
6
|
+
* TransactionBuilder에서 분리한 모듈: 리스트 구조 변경은 같은 타입
|
|
7
|
+
* 아이템 분할·중첩·탈출 규칙이 얽혀 있어 전용 모듈로 둔다.
|
|
8
|
+
*
|
|
9
|
+
* 함수들은 ListOpsHost(= TransactionBuilder의 구조적 뷰)에 스텝을
|
|
10
|
+
* 쌓는다 — 인터페이스 경유라 순환 import 없이 빌더를 재사용한다.
|
|
11
|
+
*/
|
|
12
|
+
/**
|
|
13
|
+
* 리스트 연산이 요구하는 빌더 계약 — TransactionBuilder가 만족한다.
|
|
14
|
+
* 스텝 큐와 셀렉션만 건드리는 최소 표면으로 제한한다.
|
|
15
|
+
*/
|
|
16
|
+
export interface ListOpsHost {
|
|
17
|
+
readonly state: EditorState;
|
|
18
|
+
/** 적용 후 셀렉션 — 연산이 커서를 직접 배치할 때 쓴다 */
|
|
19
|
+
selection: Selection | null;
|
|
20
|
+
delete(range: Range): unknown;
|
|
21
|
+
insertNode(at: Point, node: EditorNode): unknown;
|
|
22
|
+
replaceNode(path: readonly number[], node: EditorNode): unknown;
|
|
23
|
+
}
|
|
24
|
+
/** 기본 텍스트블록 타입 — paragraph, 없으면 inline을 받는 첫 block */
|
|
25
|
+
export declare function defaultBlockTypeOf(state: EditorState): string;
|
|
26
|
+
/** 블록 시작 셀렉션 — 텍스트 자식이 있으면 첫 텍스트 앞, 없으면 블록 안 */
|
|
27
|
+
export declare function selStartOfBlock(blockPath: readonly number[], block: EditorNode): Selection;
|
|
28
|
+
/**
|
|
29
|
+
* 리스트 아이템 분할 — caret이 가리키는 인라인 블록을 캐럿에서 자르고
|
|
30
|
+
* 꼬리(블록 꼬리 + 이후 아이템 자식들)를 새 아이템으로 만든다.
|
|
31
|
+
* caret은 아이템 안의 텍스트 포인트여야 한다.
|
|
32
|
+
*/
|
|
33
|
+
export declare function splitItemInto(host: ListOpsHost, doc: DocNode, itemPath: readonly number[], caret: Point): void;
|
|
34
|
+
/**
|
|
35
|
+
* 리스트 아이템을 리스트 밖으로 꺼낸다 — 아이템의 블록들이 리스트의
|
|
36
|
+
* 형제가 된다. 리스트가 아이템 하나뿐이면 리스트 통째 교체, 머리/꼬리
|
|
37
|
+
* 아이템이면 리스트 앞/뒤에 삽입, 중간이면 리스트를 둘로 나눠 사이에
|
|
38
|
+
* 끼운다 (PM liftListItem 관례).
|
|
39
|
+
*/
|
|
40
|
+
export declare function liftItemOut(host: ListOpsHost, doc: DocNode, itemPath: readonly number[]): void;
|
|
41
|
+
/**
|
|
42
|
+
* 리스트 아이템을 이전 형제 아래로 넣는다 (Tab 인덴트) — 형제의 마지막
|
|
43
|
+
* 자식이 같은 타입 리스트면 그 끝에, 아니면 새 리스트를 만들어 넣는다.
|
|
44
|
+
*/
|
|
45
|
+
export declare function sinkItemUnder(host: ListOpsHost, doc: DocNode, itemPath: readonly number[]): void;
|
|
46
|
+
//# sourceMappingURL=list-ops.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"list-ops.d.ts","sourceRoot":"","sources":["../../src/state/list-ops.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAE5D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C,OAAO,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAE9D;;;;;;;GAOG;AAEH;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,qCAAqC;IACrC,SAAS,EAAE,SAAS,GAAG,IAAI,CAAC;IAC5B,MAAM,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAAC;IAC9B,UAAU,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC;IACjD,WAAW,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,EAAE,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC;CACjE;AAED,sDAAsD;AACtD,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,CAS7D;AAED,gDAAgD;AAChD,wBAAgB,eAAe,CAC7B,SAAS,EAAE,SAAS,MAAM,EAAE,EAC5B,KAAK,EAAE,UAAU,GAChB,SAAS,CAOX;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAC3B,IAAI,EAAE,WAAW,EACjB,GAAG,EAAE,OAAO,EACZ,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,KAAK,EAAE,KAAK,GACX,IAAI,CAwEN;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,IAAI,EAAE,WAAW,EACjB,GAAG,EAAE,OAAO,EACZ,QAAQ,EAAE,SAAS,MAAM,EAAE,GAC1B,IAAI,CAuFN;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAC3B,IAAI,EAAE,WAAW,EACjB,GAAG,EAAE,OAAO,EACZ,QAAQ,EAAE,SAAS,MAAM,EAAE,GAC1B,IAAI,CA0CN"}
|