1
0
mirror of https://github.com/ianstormtaylor/slate.git synced 2025-04-21 13:51:59 +02:00

Customize get dirty paths (#5069)

* Move getDirtyPaths to the Editor object to allow for customization

* Add changeset for getDirtyPaths customization

Co-authored-by: Tom Krenzke <tom@daybreakhealth.com>
This commit is contained in:
krenzke 2022-08-17 23:54:21 -07:00 committed by GitHub
parent 82a10a38e6
commit 46d113fe1e
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
5 changed files with 86 additions and 77 deletions

View File

@ -0,0 +1,5 @@
---
'slate': patch
---
Expose getDirtyPaths method on Editor object to allow for customization

View File

@ -71,7 +71,7 @@ export const createEditor = (): Editor => {
dirtyPathKeys = oldDirtyPathKeys
}
const newDirtyPaths = getDirtyPaths(op)
const newDirtyPaths = editor.getDirtyPaths(op)
for (const path of newDirtyPaths) {
add(path)
}
@ -296,83 +296,83 @@ export const createEditor = (): Editor => {
}
}
},
/**
* Get the "dirty" paths generated from an operation.
*/
getDirtyPaths: (op: Operation): Path[] => {
switch (op.type) {
case 'insert_text':
case 'remove_text':
case 'set_node': {
const { path } = op
return Path.levels(path)
}
case 'insert_node': {
const { node, path } = op
const levels = Path.levels(path)
const descendants = Text.isText(node)
? []
: Array.from(Node.nodes(node), ([, p]) => path.concat(p))
return [...levels, ...descendants]
}
case 'merge_node': {
const { path } = op
const ancestors = Path.ancestors(path)
const previousPath = Path.previous(path)
return [...ancestors, previousPath]
}
case 'move_node': {
const { path, newPath } = op
if (Path.equals(path, newPath)) {
return []
}
const oldAncestors: Path[] = []
const newAncestors: Path[] = []
for (const ancestor of Path.ancestors(path)) {
const p = Path.transform(ancestor, op)
oldAncestors.push(p!)
}
for (const ancestor of Path.ancestors(newPath)) {
const p = Path.transform(ancestor, op)
newAncestors.push(p!)
}
const newParent = newAncestors[newAncestors.length - 1]
const newIndex = newPath[newPath.length - 1]
const resultPath = newParent.concat(newIndex)
return [...oldAncestors, ...newAncestors, resultPath]
}
case 'remove_node': {
const { path } = op
const ancestors = Path.ancestors(path)
return [...ancestors]
}
case 'split_node': {
const { path } = op
const levels = Path.levels(path)
const nextPath = Path.next(path)
return [...levels, nextPath]
}
default: {
return []
}
}
},
}
return editor
}
/**
* Get the "dirty" paths generated from an operation.
*/
const getDirtyPaths = (op: Operation): Path[] => {
switch (op.type) {
case 'insert_text':
case 'remove_text':
case 'set_node': {
const { path } = op
return Path.levels(path)
}
case 'insert_node': {
const { node, path } = op
const levels = Path.levels(path)
const descendants = Text.isText(node)
? []
: Array.from(Node.nodes(node), ([, p]) => path.concat(p))
return [...levels, ...descendants]
}
case 'merge_node': {
const { path } = op
const ancestors = Path.ancestors(path)
const previousPath = Path.previous(path)
return [...ancestors, previousPath]
}
case 'move_node': {
const { path, newPath } = op
if (Path.equals(path, newPath)) {
return []
}
const oldAncestors: Path[] = []
const newAncestors: Path[] = []
for (const ancestor of Path.ancestors(path)) {
const p = Path.transform(ancestor, op)
oldAncestors.push(p!)
}
for (const ancestor of Path.ancestors(newPath)) {
const p = Path.transform(ancestor, op)
newAncestors.push(p!)
}
const newParent = newAncestors[newAncestors.length - 1]
const newIndex = newPath[newPath.length - 1]
const resultPath = newParent.concat(newIndex)
return [...oldAncestors, ...newAncestors, resultPath]
}
case 'remove_node': {
const { path } = op
const ancestors = Path.ancestors(path)
return [...ancestors]
}
case 'split_node': {
const { path } = op
const levels = Path.levels(path)
const nextPath = Path.next(path)
return [...levels, nextPath]
}
default: {
return []
}
}
}

View File

@ -77,6 +77,7 @@ export interface BaseEditor {
insertNode: (node: Node) => void
insertText: (text: string) => void
removeMark: (key: string) => void
getDirtyPaths: (op: Operation) => Path[]
}
export type Editor = ExtendedType<'Editor', BaseEditor>
@ -626,6 +627,7 @@ export const Editor: EditorInterface = {
typeof value.normalizeNode === 'function' &&
typeof value.onChange === 'function' &&
typeof value.removeMark === 'function' &&
typeof value.getDirtyPaths === 'function' &&
(value.marks === null || isPlainObject(value.marks)) &&
(value.selection === null || Range.isRange(value.selection)) &&
Node.isNodeList(value.children) &&

View File

@ -20,6 +20,7 @@ export const input = {
normalizeNode() {},
onChange() {},
removeMark() {},
getDirtyPaths() {},
}
export const test = value => {
return Element.isElement(value)

View File

@ -21,6 +21,7 @@ export const input = [
normalizeNode() {},
onChange() {},
removeMark() {},
getDirtyPaths() {},
},
]
export const test = value => {