?HAMA

Edit File Size: 3.62 KB

/home/byroehnu/easepay.easetack.com/node_modules/prosemirror-model/src/mark.ts

Text Base64

import {compareDeep} from "./comparedeep"
import {Attrs, MarkType, Schema} from "./schema"

/// A mark is a piece of information that can be attached to a node,
/// such as it being emphasized, in code font, or a link. It has a
/// type and optionally a set of attributes that provide further
/// information (such as the target of the link). Marks are created
/// through a `Schema`, which controls which types exist and which
/// attributes they have.
export class Mark {
  /// @internal
  constructor(
    /// The type of this mark.
    readonly type: MarkType,
    /// The attributes associated with this mark.
    readonly attrs: Attrs
  ) {}

/// Given a set of marks, create a new set which contains this one as
  /// well, in the right position. If this mark is already in the set,
  /// the set itself is returned. If any marks that are set to be
  /// [exclusive](#model.MarkSpec.excludes) with this mark are present,
  /// those are replaced by this one.
  addToSet(set: readonly Mark[]): readonly Mark[] {
    let copy, placed = false
    for (let i = 0; i < set.length; i++) {
      let other = set[i]
      if (this.eq(other)) return set
      if (this.type.excludes(other.type)) {
        if (!copy) copy = set.slice(0, i)
      } else if (other.type.excludes(this.type)) {
        return set
      } else {
        if (!placed && other.type.rank > this.type.rank) {
          if (!copy) copy = set.slice(0, i)
          copy.push(this)
          placed = true
        }
        if (copy) copy.push(other)
      }
    }
    if (!copy) copy = set.slice()
    if (!placed) copy.push(this)
    return copy
  }

/// Remove this mark from the given set, returning a new set. If this
  /// mark is not in the set, the set itself is returned.
  removeFromSet(set: readonly Mark[]): readonly Mark[] {
    for (let i = 0; i < set.length; i++)
      if (this.eq(set[i]))
        return set.slice(0, i).concat(set.slice(i + 1))
    return set
  }

/// Test whether this mark is in the given set of marks.
  isInSet(set: readonly Mark[]) {
    for (let i = 0; i < set.length; i++)
      if (this.eq(set[i])) return true
    return false
  }

/// Test whether this mark has the same type and attributes as
  /// another mark.
  eq(other: Mark) {
    return this == other ||
      (this.type == other.type && compareDeep(this.attrs, other.attrs))
  }

/// Convert this mark to a JSON-serializeable representation.
  toJSON(): any {
    let obj: any = {type: this.type.name}
    for (let _ in this.attrs) {
      obj.attrs = this.attrs
      break
    }
    return obj
  }

/// Deserialize a mark from JSON.
  static fromJSON(schema: Schema, json: any) {
    if (!json) throw new RangeError("Invalid input for Mark.fromJSON")
    let type = schema.marks[json.type]
    if (!type) throw new RangeError(`There is no mark type ${json.type} in this schema`)
    let mark = type.create(json.attrs)
    type.checkAttrs(mark.attrs)
    return mark
  }

/// Test whether two sets of marks are identical.
  static sameSet(a: readonly Mark[], b: readonly Mark[]) {
    if (a == b) return true
    if (a.length != b.length) return false
    for (let i = 0; i < a.length; i++)
      if (!a[i].eq(b[i])) return false
    return true
  }

/// Create a properly sorted mark set from null, a single mark, or an
  /// unsorted array of marks.
  static setFrom(marks?: Mark | readonly Mark[] | null): readonly Mark[] {
    if (!marks || Array.isArray(marks) && marks.length == 0) return Mark.none
    if (marks instanceof Mark) return [marks]
    let copy = marks.slice()
    copy.sort((a, b) => a.type.rank - b.type.rank)
    return copy
  }

/// The empty set of marks.
  static none: readonly Mark[] = []
}

Exit & Reset Text mode: syntax highlighting auto-detects file type.

Name	Size	Perms	Modified	Actions
.htaccess	127 B	lr--r--r--	2026-03-14 01:49:20	Edit Download recursive recursive
comparedeep.ts	534 B	lrw-r--r--	2026-02-28 00:28:22	Edit Download recursive recursive
content.ts	13.78 KB	lrw-r--r--	2026-02-28 00:28:24	Edit Download recursive recursive
diff.ts	1.75 KB	lrw-r--r--	2026-02-28 00:28:26	Edit Download recursive recursive
dom.ts	55 B	lrw-r--r--	2026-02-28 00:28:28	Edit Download recursive recursive
fragment.ts	10.20 KB	lrw-r--r--	2026-02-28 00:28:28	Edit Download recursive recursive
from_dom.ts	32.67 KB	lrw-r--r--	2026-02-28 00:28:30	Edit Download recursive recursive
index.ts	502 B	lrw-r--r--	2026-02-28 00:28:36	Edit Download recursive recursive
mark.ts	3.62 KB	lrw-r--r--	2026-02-28 00:28:38	Edit Download recursive recursive
node.ts	15.52 KB	lrw-r--r--	2026-02-28 00:28:38	Edit Download recursive recursive
README.md	1.33 KB	lrw-r--r--	2026-02-28 00:28:18	Edit Download recursive recursive
replace.ts	8.93 KB	lrw-r--r--	2026-02-28 00:28:40	Edit Download recursive recursive
resolvedpos.ts	11.34 KB	lrw-r--r--	2026-02-28 00:28:42	Edit Download recursive recursive
schema.ts	26.94 KB	lrw-r--r--	2026-02-28 00:28:44	Edit Download recursive recursive
to_dom.ts	9.63 KB	lrw-r--r--	2026-02-28 00:28:46	Edit Download recursive recursive

Directory Contents