| Server IP : 167.235.224.122 / Your IP : 216.73.216.110 Web Server : Apache/2.4.58 (Ubuntu) System : Linux newplayground 6.8.0-136-generic #136-Ubuntu SMP PREEMPT_DYNAMIC Wed Jul 1 21:33:11 UTC 2026 aarch64 User : deploy ( 1000) PHP Version : 8.4.23 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : ON | Pkexec : OFF Directory : /var/www/html/jungly/node_modules/prosemirror-model/src/ |
Upload File : |
import {findDiffStart, findDiffEnd} from "./diff"
import {Node, TextNode} from "./node"
import {Schema} from "./schema"
/// A fragment represents a node's collection of child nodes.
///
/// Like nodes, fragments are persistent data structures, and you
/// should not mutate them or their content. Rather, you create new
/// instances whenever needed. The API tries to make this easy.
export class Fragment {
/// The size of the fragment, which is the total of the size of
/// its content nodes.
readonly size: number
/// @internal
constructor(
/// The child nodes in this fragment.
readonly content: readonly Node[],
size?: number
) {
this.size = size || 0
if (size == null) for (let i = 0; i < content.length; i++)
this.size += content[i].nodeSize
}
/// Invoke a callback for all descendant nodes between the given two
/// positions (relative to start of this fragment). Doesn't descend
/// into a node when the callback returns `false`.
nodesBetween(from: number, to: number,
f: (node: Node, start: number, parent: Node | null, index: number) => boolean | void,
nodeStart = 0,
parent?: Node) {
for (let i = 0, pos = 0; pos < to; i++) {
let child = this.content[i], end = pos + child.nodeSize
if (end > from && f(child, nodeStart + pos, parent || null, i) !== false && child.content.size) {
let start = pos + 1
child.nodesBetween(Math.max(0, from - start),
Math.min(child.content.size, to - start),
f, nodeStart + start)
}
pos = end
}
}
/// Call the given callback for every descendant node. `pos` will be
/// relative to the start of the fragment. The callback may return
/// `false` to prevent traversal of a given node's children.
descendants(f: (node: Node, pos: number, parent: Node | null, index: number) => boolean | void) {
this.nodesBetween(0, this.size, f)
}
/// Extract the text between `from` and `to`. See the same method on
/// [`Node`](#model.Node.textBetween).
textBetween(from: number, to: number, blockSeparator?: string | null, leafText?: string | null | ((leafNode: Node) => string)) {
let text = "", first = true
this.nodesBetween(from, to, (node, pos) => {
let nodeText = node.isText ? node.text!.slice(Math.max(from, pos) - pos, to - pos)
: !node.isLeaf ? ""
: leafText ? (typeof leafText === "function" ? leafText(node) : leafText)
: node.type.spec.leafText ? node.type.spec.leafText(node)
: ""
if (node.isBlock && (node.isLeaf && nodeText || node.isTextblock) && blockSeparator) {
if (first) first = false
else text += blockSeparator
}
text += nodeText
}, 0)
return text
}
/// Create a new fragment containing the combined content of this
/// fragment and the other.
append(other: Fragment) {
if (!other.size) return this
if (!this.size) return other
let last = this.lastChild!, first = other.firstChild!, content = this.content.slice(), i = 0
if (last.isText && last.sameMarkup(first)) {
content[content.length - 1] = (last as TextNode).withText(last.text! + first.text!)
i = 1
}
for (; i < other.content.length; i++) content.push(other.content[i])
return new Fragment(content, this.size + other.size)
}
/// Cut out the sub-fragment between the two given positions.
cut(from: number, to = this.size) {
if (from == 0 && to == this.size) return this
let result: Node[] = [], size = 0
if (to > from) for (let i = 0, pos = 0; pos < to; i++) {
let child = this.content[i], end = pos + child.nodeSize
if (end > from) {
if (pos < from || end > to) {
if (child.isText)
child = child.cut(Math.max(0, from - pos), Math.min(child.text!.length, to - pos))
else
child = child.cut(Math.max(0, from - pos - 1), Math.min(child.content.size, to - pos - 1))
}
result.push(child)
size += child.nodeSize
}
pos = end
}
return new Fragment(result, size)
}
/// @internal
cutByIndex(from: number, to: number) {
if (from == to) return Fragment.empty
if (from == 0 && to == this.content.length) return this
return new Fragment(this.content.slice(from, to))
}
/// Create a new fragment in which the node at the given index is
/// replaced by the given node.
replaceChild(index: number, node: Node) {
let current = this.content[index]
if (current == node) return this
let copy = this.content.slice()
let size = this.size + node.nodeSize - current.nodeSize
copy[index] = node
return new Fragment(copy, size)
}
/// Create a new fragment by prepending the given node to this
/// fragment.
addToStart(node: Node) {
return new Fragment([node].concat(this.content), this.size + node.nodeSize)
}
/// Create a new fragment by appending the given node to this
/// fragment.
addToEnd(node: Node) {
return new Fragment(this.content.concat(node), this.size + node.nodeSize)
}
/// Compare this fragment to another one.
eq(other: Fragment): boolean {
if (this.content.length != other.content.length) return false
for (let i = 0; i < this.content.length; i++)
if (!this.content[i].eq(other.content[i])) return false
return true
}
/// The first child of the fragment, or `null` if it is empty.
get firstChild(): Node | null { return this.content.length ? this.content[0] : null }
/// The last child of the fragment, or `null` if it is empty.
get lastChild(): Node | null { return this.content.length ? this.content[this.content.length - 1] : null }
/// The number of child nodes in this fragment.
get childCount() { return this.content.length }
/// Get the child node at the given index. Raise an error when the
/// index is out of range.
child(index: number) {
let found = this.content[index]
if (!found) throw new RangeError("Index " + index + " out of range for " + this)
return found
}
/// Get the child node at the given index, if it exists.
maybeChild(index: number): Node | null {
return this.content[index] || null
}
/// Call `f` for every child node, passing the node, its offset
/// into this parent node, and its index.
forEach(f: (node: Node, offset: number, index: number) => void) {
for (let i = 0, p = 0; i < this.content.length; i++) {
let child = this.content[i]
f(child, p, i)
p += child.nodeSize
}
}
/// Find the first position at which this fragment and another
/// fragment differ, or `null` if they are the same.
findDiffStart(other: Fragment, pos = 0) {
return findDiffStart(this, other, pos)
}
/// Find the first position, searching from the end, at which this
/// fragment and the given fragment differ, or `null` if they are
/// the same. Since this position will not be the same in both
/// nodes, an object with two separate positions is returned.
findDiffEnd(other: Fragment, pos = this.size, otherPos = other.size) {
return findDiffEnd(this, other, pos, otherPos)
}
/// Find the index and inner offset corresponding to a given relative
/// position in this fragment. The result object will be reused
/// (overwritten) the next time the function is called. @internal
findIndex(pos: number): {index: number, offset: number} {
if (pos == 0) return retIndex(0, pos)
if (pos == this.size) return retIndex(this.content.length, pos)
if (pos > this.size || pos < 0) throw new RangeError(`Position ${pos} outside of fragment (${this})`)
for (let i = 0, curPos = 0;; i++) {
let cur = this.child(i), end = curPos + cur.nodeSize
if (end >= pos) {
if (end == pos) return retIndex(i + 1, end)
return retIndex(i, curPos)
}
curPos = end
}
}
/// Return a debugging string that describes this fragment.
toString(): string { return "<" + this.toStringInner() + ">" }
/// @internal
toStringInner() { return this.content.join(", ") }
/// Create a JSON-serializeable representation of this fragment.
toJSON(): any {
return this.content.length ? this.content.map(n => n.toJSON()) : null
}
/// Deserialize a fragment from its JSON representation.
static fromJSON(schema: Schema, value: any) {
if (!value) return Fragment.empty
if (!Array.isArray(value)) throw new RangeError("Invalid input for Fragment.fromJSON")
return new Fragment(value.map(schema.nodeFromJSON))
}
/// Build a fragment from an array of nodes. Ensures that adjacent
/// text nodes with the same marks are joined together.
static fromArray(array: readonly Node[]) {
if (!array.length) return Fragment.empty
let joined: Node[] | undefined, size = 0
for (let i = 0; i < array.length; i++) {
let node = array[i]
size += node.nodeSize
if (i && node.isText && array[i - 1].sameMarkup(node)) {
if (!joined) joined = array.slice(0, i)
joined[joined.length - 1] = (node as TextNode)
.withText((joined[joined.length - 1] as TextNode).text + (node as TextNode).text)
} else if (joined) {
joined.push(node)
}
}
return new Fragment(joined || array, size)
}
/// Create a fragment from something that can be interpreted as a
/// set of nodes. For `null`, it returns the empty fragment. For a
/// fragment, the fragment itself. For a node or array of nodes, a
/// fragment containing those nodes.
static from(nodes?: Fragment | Node | readonly Node[] | null) {
if (!nodes) return Fragment.empty
if (nodes instanceof Fragment) return nodes
if (Array.isArray(nodes)) return this.fromArray(nodes)
if ((nodes as Node).attrs) return new Fragment([nodes as Node], (nodes as Node).nodeSize)
throw new RangeError("Can not convert " + nodes + " to a Fragment" +
((nodes as any).nodesBetween ? " (looks like multiple versions of prosemirror-model were loaded)" : ""))
}
/// An empty fragment. Intended to be reused whenever a node doesn't
/// contain anything (rather than allocating a new empty fragment for
/// each leaf node).
static empty: Fragment = new Fragment([], 0)
}
const found = {index: 0, offset: 0}
function retIndex(index: number, offset: number) {
found.index = index
found.offset = offset
return found
}