@portabletext/editor 7.10.1 → 7.10.3

package/lib/_chunks-es/get-container.js

@@ -125,6 +125,12 @@ function getTextBlock(snapshot, path) {
       path: entry.path
     };
 }
+function getFirstChild(snapshot, path) {
+  return getChildren(snapshot, path).at(0);
+}
+function getLastChild(snapshot, path) {
+  return getChildren(snapshot, path).at(-1);
+}
 function getUnionSchema(schema, containers) {
   const decorators = mergeByName(schema.decorators, []), annotations = mergeByName(schema.annotations, []), lists = mergeByName(schema.lists, []), styles = mergeByName(schema.styles, []), inlineObjects = mergeByName(schema.inlineObjects, []), blockObjects = mergeByName(schema.blockObjects, []);
   for (const container of containers.values()) {
@@ -151,9 +157,6 @@ function mergeByName(source, target) {
     target.some((existing) => existing.name === entry.name) || target.push(entry);
   return target;
 }
-function getFirstChild(snapshot, path) {
-  return getChildren(snapshot, path).at(0);
-}
 function getContainer(snapshot, path) {
   const entry = getNode(snapshot, path);
   if (entry && isEditableContainer(snapshot, entry.node, entry.path))
@@ -166,6 +169,7 @@ export {
   getAncestor,
   getContainer,
   getFirstChild,
+  getLastChild,
   getLeaf,
   getSpan,
   getText,

package/lib/_chunks-es/get-container.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-container.js","sources":["../../src/traversal/get-ancestor.ts","../../src/traversal/is-leaf-object.ts","../../src/traversal/get-leaf.ts","../../src/engine/path/is-path.ts","../../src/engine/utils/is-object.ts","../../src/engine/point/is-point.ts","../../src/engine/range/is-range.ts","../../src/traversal/get-text.ts","../../src/traversal/get-span.ts","../../src/traversal/path-contains.ts","../../src/engine/point/is-before-point.ts","../../src/traversal/range-intersects.ts","../../src/traversal/get-text-block.ts","../../src/traversal/get-union-schema.ts","../../src/traversal/get-first-child.ts","../../src/traversal/get-container.ts"],"sourcesContent":["import type {PortableTextBlock} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {getAncestors} from './get-ancestors'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Find an ancestor of the node at a given path that matches a predicate.\n * Does not check the node at the path itself, only its ancestors.\n *\n * `mode: 'lowest'` (default) returns the nearest matching ancestor.\n * `mode: 'highest'` returns the outermost matching ancestor.\n *\n * When `match` is a type predicate, the returned `node` narrows to that type.\n *\n * @beta\n */\nexport function getAncestor<TMatch extends PortableTextBlock>(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options: {\n    match: (node: PortableTextBlock, path: Path) => node is TMatch\n    mode?: 'lowest' | 'highest'\n  },\n): {node: TMatch; path: Path} | undefined\n/**\n * @beta\n */\nexport function getAncestor(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options: {\n    match: (node: PortableTextBlock, path: Path) => boolean\n    mode?: 'lowest' | 'highest'\n  },\n): {node: PortableTextBlock; path: Path} | undefined\nexport function getAncestor(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options: {\n    match: (node: PortableTextBlock, path: Path) => boolean\n    mode?: 'lowest' | 'highest'\n  },\n): {node: PortableTextBlock; path: Path} | undefined {\n  const {match, mode = 'lowest'} = options\n  const ancestors = getAncestors(snapshot, path)\n\n  if (mode === 'highest') {\n    for (const ancestor of [...ancestors].reverse()) {\n      if (match(ancestor.node, ancestor.path)) {\n        return ancestor\n      }\n    }\n    return undefined\n  }\n\n  for (const ancestor of ancestors) {\n    if (match(ancestor.node, ancestor.path)) {\n      return ancestor\n    }\n  }\n\n  return undefined\n}\n","import type {PortableTextObject} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {isEditableContainer} from '../schema/is-editable-container'\nimport {isObject} from './is-object'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Check if a node is a leaf object: an object node that has no editable\n * children (not a container).\n * Returns true for block objects and inline objects that don't have\n * registered editable content (containers).\n *\n * @beta\n */\nexport function isLeafObject(\n  snapshot: TraversalSnapshot,\n  node: unknown,\n  path: Path,\n): node is PortableTextObject {\n  return isObject(snapshot, node) && !isEditableContainer(snapshot, node, path)\n}\n","import type {Node} from '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport {getChildren} from './get-children'\nimport {getNode} from './get-node'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the deepest leaf node starting from a path, walking toward either the\n * start or end edge. A leaf is any node that has no children according to the\n * traversal context.\n *\n * @beta\n */\nexport function getLeaf(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options: {edge: 'start' | 'end'},\n): {node: Node; path: Path} | undefined {\n  const {edge} = options\n\n  let currentPath = path\n\n  // If starting from root (empty path), descend into first/last child\n  if (currentPath.length === 0) {\n    const children = getChildren(snapshot, [])\n    if (children.length === 0) {\n      return undefined\n    }\n    const firstOrLast = edge === 'end' ? children.at(-1)! : children.at(0)!\n    const nodeChildren = getChildren(snapshot, firstOrLast.path)\n    if (nodeChildren.length === 0) {\n      return firstOrLast\n    }\n    currentPath = firstOrLast.path\n  } else {\n    // Check if the node at path is already a leaf\n    const entry = getNode(snapshot, currentPath)\n    if (!entry) {\n      return undefined\n    }\n    const children = getChildren(snapshot, currentPath)\n    if (children.length === 0) {\n      return entry\n    }\n  }\n\n  // Descend to deepest leaf\n  while (true) {\n    const children = getChildren(snapshot, currentPath)\n    if (children.length === 0) {\n      const entry = getNode(snapshot, currentPath)\n      return entry ?? undefined\n    }\n    const child = edge === 'end' ? children.at(-1)! : children.at(0)!\n    currentPath = child.path\n  }\n}\n","import {isKeyedSegment} from '../../utils/util.is-keyed-segment'\nimport type {Path} from '../interfaces/path'\n\nexport function isPath(value: any): value is Path {\n  return (\n    Array.isArray(value) &&\n    (value.length === 0 ||\n      typeof value[0] === 'number' ||\n      typeof value[0] === 'string' ||\n      isKeyedSegment(value[0]))\n  )\n}\n","export const isObject = (value: any) =>\n  typeof value === 'object' && value !== null\n","import type {Point} from '../interfaces/point'\nimport {isPath} from '../path/is-path'\nimport {isObject} from '../utils/is-object'\n\nexport function isPoint(value: any): value is Point {\n  return (\n    isObject(value) && typeof value.offset === 'number' && isPath(value.path)\n  )\n}\n","import type {Range} from '../interfaces/range'\nimport {isPoint} from '../point/is-point'\nimport {isObject} from '../utils/is-object'\n\nexport function isRange(value: any): value is Range {\n  return isObject(value) && isPoint(value.anchor) && isPoint(value.focus)\n}\n","import {isSpan} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {getNode} from './get-node'\nimport {getNodes} from './get-nodes'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the concatenated text content of the node at a given path.\n *\n * @beta\n */\nexport function getText(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): string | undefined {\n  const entry = getNode(snapshot, path)\n\n  if (!entry) {\n    return undefined\n  }\n\n  if (isSpan({schema: snapshot.context.schema}, entry.node)) {\n    return entry.node.text\n  }\n\n  let text = ''\n\n  for (const descendant of getNodes(snapshot, {at: path})) {\n    if (isSpan({schema: snapshot.context.schema}, descendant.node)) {\n      text += descendant.node.text\n    }\n  }\n\n  return text\n}\n","import {isSpan, type PortableTextSpan} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {getNode} from './get-node'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the span node at a given path.\n *\n * @beta\n */\nexport function getSpan(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): {node: PortableTextSpan; path: Path} | undefined {\n  const entry = getNode(snapshot, path)\n\n  if (!entry) {\n    return undefined\n  }\n\n  if (!isSpan({schema: snapshot.context.schema}, entry.node)) {\n    return undefined\n  }\n\n  return {node: entry.node, path: entry.path}\n}\n","import type {Path} from '../types/paths'\nimport {isKeyedSegment} from '../utils/util.is-keyed-segment'\n\n/**\n * Returns true if `ancestor` is equal to `descendant`, or if `descendant`\n * lives anywhere inside `ancestor`'s subtree.\n *\n * @beta\n */\nexport function pathContains(ancestor: Path, descendant: Path): boolean {\n  if (ancestor.length > descendant.length) {\n    return false\n  }\n\n  for (let i = 0; i < ancestor.length; i++) {\n    const segment = ancestor[i]\n    const otherSegment = descendant[i]\n\n    if (isKeyedSegment(segment) && isKeyedSegment(otherSegment)) {\n      if (segment._key !== otherSegment._key) {\n        return false\n      }\n    } else if (segment !== otherSegment) {\n      return false\n    }\n  }\n\n  return true\n}\n","import type {Node} from '../interfaces/node'\nimport type {Point} from '../interfaces/point'\nimport {comparePoints} from './compare-points'\n\nexport function isBeforePoint(\n  point: Point,\n  another: Point,\n  root: {value: Array<Node>},\n): boolean {\n  return comparePoints(point, another, root) === -1\n}\n","import {comparePaths} from '../engine/path/compare-paths'\nimport {isAfterPoint} from '../engine/point/is-after-point'\nimport {isBeforePoint} from '../engine/point/is-before-point'\nimport {isPoint} from '../engine/point/is-point'\nimport {isRange} from '../engine/range/is-range'\nimport {rangeEdges} from '../engine/range/range-edges'\nimport type {EditorSelection, EditorSelectionPoint} from '../types/editor'\nimport type {Path} from '../types/paths'\nimport {comparePoints} from './compare-points'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Returns true if `range` and the supplied `target` intersect. The target\n * may be a `Path`, an `EditorSelectionPoint`, or another\n * `EditorSelection`.\n *\n * For a `Path` or `EditorSelectionPoint` target, \"intersect\" means the\n * target lies at or between `range`'s start and end edges (inclusive).\n *\n * For an `EditorSelection` target, \"intersect\" means either endpoint of\n * `target` lies inside `range`, or `range` strictly encloses `target`.\n *\n * Pass `snapshot.context.selection` as `range` to ask the question against\n * the editor's current selection.\n *\n * Returns `false` when either `range` or `target` is `null`.\n *\n * @beta\n */\nexport function rangeIntersects(\n  snapshot: TraversalSnapshot,\n  range: EditorSelection,\n  target: Path | EditorSelectionPoint | EditorSelection,\n): boolean {\n  if (!range || target === null) {\n    return false\n  }\n\n  const root = {value: snapshot.context.value}\n\n  if (isRange(target)) {\n    if (\n      rangeIntersects(snapshot, range, target.anchor) ||\n      rangeIntersects(snapshot, range, target.focus)\n    ) {\n      return true\n    }\n    const [rs, re] = rangeEdges(range, root)\n    const [ts, te] = rangeEdges(target, root)\n    return isBeforePoint(rs, ts, root) && isAfterPoint(re, te, root)\n  }\n\n  const [start, end] = rangeEdges(range, root)\n  let isAfterStart = false\n  let isBeforeEnd = false\n\n  if (isPoint(target)) {\n    isAfterStart = comparePoints(snapshot, target, start) >= 0\n    isBeforeEnd = comparePoints(snapshot, target, end) <= 0\n  } else {\n    isAfterStart = comparePaths(target, start.path, root) >= 0\n    isBeforeEnd = comparePaths(target, end.path, root) <= 0\n  }\n\n  return isAfterStart && isBeforeEnd\n}\n","import {isTextBlock, type PortableTextTextBlock} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {getNode} from './get-node'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the text block node at a given path.\n *\n * @beta\n */\nexport function getTextBlock(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): {node: PortableTextTextBlock; path: Path} | undefined {\n  const entry = getNode(snapshot, path)\n\n  if (!entry) {\n    return undefined\n  }\n\n  if (!isTextBlock({schema: snapshot.context.schema}, entry.node)) {\n    return undefined\n  }\n\n  return {node: entry.node, path: entry.path}\n}\n","import {getSubSchema, type Schema} from '@portabletext/schema'\nimport type {Containers} from '../schema/resolve-containers'\n\n/**\n * Return a `Schema` that contains every named member declared anywhere\n * in the editor's schema graph that is reachable from a position where text\n * is edited - the root schema merged with the sub-schema of every registered\n * container whose field accepts text blocks, deduped by name. Useful for\n * rendering a static toolbar whose buttons stay stable across selection\n * moves while still reflecting everything that could plausibly be edited or\n * inserted somewhere.\n *\n * Containers whose field does NOT accept text blocks (e.g. a `table`\n * container whose `rows` field only accepts `row` objects, or a `row`\n * container whose `cells` field only accepts `cell` objects) are\n * **structural**: their immediate `of` types are organizational, not\n * insertable user content. Those structural types are excluded from the\n * union. Their nested text-block-accepting descendants (e.g. a `cell`\n * that contains a `content` field of `{type: 'block'}`) are reached via\n * those descendants' own container registration.\n *\n * Pair with `getPathSubSchema` (or a path-based intersection across a\n * range) to determine which of the union's members are applicable at the\n * current selection.\n *\n * @beta\n */\nexport function getUnionSchema(schema: Schema, containers: Containers): Schema {\n  const decorators = mergeByName(schema.decorators, [])\n  const annotations = mergeByName(schema.annotations, [])\n  const lists = mergeByName(schema.lists, [])\n  const styles = mergeByName(schema.styles, [])\n  const inlineObjects = mergeByName(schema.inlineObjects, [])\n  const blockObjects = mergeByName(schema.blockObjects, [])\n\n  for (const container of containers.values()) {\n    if (!acceptsTextBlock(container.field.of, schema.block.name)) {\n      continue\n    }\n    const sub = getSubSchema(schema, container.field.of)\n    mergeByName(sub.decorators, decorators)\n    mergeByName(sub.annotations, annotations)\n    mergeByName(sub.lists, lists)\n    mergeByName(sub.styles, styles)\n    mergeByName(sub.inlineObjects, inlineObjects)\n    mergeByName(sub.blockObjects, blockObjects)\n  }\n\n  return {\n    ...schema,\n    decorators,\n    annotations,\n    lists,\n    styles,\n    inlineObjects,\n    blockObjects,\n  }\n}\n\nfunction acceptsTextBlock(\n  of: ReadonlyArray<{type: string}>,\n  blockName: string,\n): boolean {\n  return of.some(\n    (member) => member.type === 'block' || member.type === blockName,\n  )\n}\n\nfunction mergeByName<T extends {name: string}>(\n  source: ReadonlyArray<T>,\n  target: Array<T>,\n): Array<T> {\n  for (const entry of source) {\n    if (target.some((existing) => existing.name === entry.name)) {\n      continue\n    }\n    target.push(entry)\n  }\n  return target\n}\n","import type {Node} from '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport {getChildren} from './get-children'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the first child of a node at a given path.\n *\n * @beta\n */\nexport function getFirstChild(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): {node: Node; path: Path} | undefined {\n  return getChildren(snapshot, path).at(0)\n}\n","import type {Node} from '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport {isEditableContainer} from '../schema/is-editable-container'\nimport {getNode} from './get-node'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the registered editable container at a given path.\n *\n * @beta\n */\nexport function getContainer(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): {node: Node; path: Path} | undefined {\n  const entry = getNode(snapshot, path)\n\n  if (!entry) {\n    return undefined\n  }\n\n  if (!isEditableContainer(snapshot, entry.node, entry.path)) {\n    return undefined\n  }\n\n  return {node: entry.node, path: entry.path}\n}\n"],"names":["getAncestor","snapshot","path","options","match","mode","ancestors","getAncestors","ancestor","reverse","node","isLeafObject","isObject","isEditableContainer","getLeaf","edge","currentPath","length","children","getChildren","firstOrLast","at","entry","getNode","undefined","isPath","value","Array","isArray","isKeyedSegment","isPoint","offset","isRange","anchor","focus","getText","isSpan","schema","context","text","descendant","getNodes","getSpan","pathContains","i","segment","otherSegment","_key","isBeforePoint","point","another","root","comparePoints","rangeIntersects","range","target","rs","re","rangeEdges","ts","te","isAfterPoint","start","end","isAfterStart","isBeforeEnd","comparePaths","getTextBlock","isTextBlock","getUnionSchema","containers","decorators","mergeByName","annotations","lists","styles","inlineObjects","blockObjects","container","values","acceptsTextBlock","field","of","block","name","sub","getSubSchema","blockName","some","member","type","source","existing","push","getFirstChild","getContainer"],"mappings":";;;AAmCO,SAASA,YACdC,UACAC,MACAC,SAImD;AACnD,QAAM;AAAA,IAACC;AAAAA,IAAOC,OAAO;AAAA,EAAA,IAAYF,SAC3BG,YAAYC,aAAaN,UAAUC,IAAI;AAE7C,MAAIG,SAAS,WAAW;AACtB,eAAWG,YAAY,CAAC,GAAGF,SAAS,EAAEG,QAAAA;AACpC,UAAIL,MAAMI,SAASE,MAAMF,SAASN,IAAI;AACpC,eAAOM;AAGX;AAAA,EACF;AAEA,aAAWA,YAAYF;AACrB,QAAIF,MAAMI,SAASE,MAAMF,SAASN,IAAI;AACpC,aAAOM;AAKb;AChDO,SAASG,aACdV,UACAS,MACAR,MAC4B;AAC5B,SAAOU,WAASX,UAAUS,IAAI,KAAK,CAACG,oBAAoBZ,UAAUS,MAAMR,IAAI;AAC9E;ACPO,SAASY,QACdb,UACAC,MACAC,SACsC;AACtC,QAAM;AAAA,IAACY;AAAAA,EAAAA,IAAQZ;AAEf,MAAIa,cAAcd;AAGlB,MAAIc,YAAYC,WAAW,GAAG;AAC5B,UAAMC,WAAWC,YAAYlB,UAAU,EAAE;AACzC,QAAIiB,SAASD,WAAW;AACtB;AAEF,UAAMG,cAAcL,SAAS,QAAQG,SAASG,GAAG,EAAE,IAAKH,SAASG,GAAG,CAAC;AAErE,QADqBF,YAAYlB,UAAUmB,YAAYlB,IAAI,EAC1Ce,WAAW;AAC1B,aAAOG;AAETJ,kBAAcI,YAAYlB;AAAAA,EAC5B,OAAO;AAEL,UAAMoB,QAAQC,QAAQtB,UAAUe,WAAW;AAC3C,QAAI,CAACM;AACH;AAGF,QADiBH,YAAYlB,UAAUe,WAAW,EACrCC,WAAW;AACtB,aAAOK;AAAAA,EAEX;AAGA,aAAa;AACX,UAAMJ,WAAWC,YAAYlB,UAAUe,WAAW;AAClD,QAAIE,SAASD,WAAW;AAEtB,aADcM,QAAQtB,UAAUe,WAAW,KAC3BQ;AAGlBR,mBADcD,SAAS,QAAQG,SAASG,GAAG,EAAE,IAAKH,SAASG,GAAG,CAAC,GAC3CnB;AAAAA,EACtB;AACF;ACrDO,SAASuB,OAAOC,OAA2B;AAChD,SACEC,MAAMC,QAAQF,KAAK,MAClBA,MAAMT,WAAW,KAChB,OAAOS,MAAM,CAAC,KAAM,YACpB,OAAOA,MAAM,CAAC,KAAM,YACpBG,eAAeH,MAAM,CAAC,CAAC;AAE7B;ACXO,MAAMd,WAAYc,CAAAA,UACvB,OAAOA,SAAU,YAAYA,UAAU;ACGlC,SAASI,QAAQJ,OAA4B;AAClD,SACEd,SAASc,KAAK,KAAK,OAAOA,MAAMK,UAAW,YAAYN,OAAOC,MAAMxB,IAAI;AAE5E;ACJO,SAAS8B,QAAQN,OAA4B;AAClD,SAAOd,SAASc,KAAK,KAAKI,QAAQJ,MAAMO,MAAM,KAAKH,QAAQJ,MAAMQ,KAAK;AACxE;ACKO,SAASC,QACdlC,UACAC,MACoB;AACpB,QAAMoB,QAAQC,QAAQtB,UAAUC,IAAI;AAEpC,MAAI,CAACoB;AACH;AAGF,MAAIc,OAAO;AAAA,IAACC,QAAQpC,SAASqC,QAAQD;AAAAA,EAAAA,GAASf,MAAMZ,IAAI;AACtD,WAAOY,MAAMZ,KAAK6B;AAGpB,MAAIA,OAAO;AAEX,aAAWC,cAAcC,SAASxC,UAAU;AAAA,IAACoB,IAAInB;AAAAA,EAAAA,CAAK;AAChDkC,WAAO;AAAA,MAACC,QAAQpC,SAASqC,QAAQD;AAAAA,IAAAA,GAASG,WAAW9B,IAAI,MAC3D6B,QAAQC,WAAW9B,KAAK6B;AAI5B,SAAOA;AACT;ACxBO,SAASG,QACdzC,UACAC,MACkD;AAClD,QAAMoB,QAAQC,QAAQtB,UAAUC,IAAI;AAEpC,MAAKoB,SAIAc,OAAO;AAAA,IAACC,QAAQpC,SAASqC,QAAQD;AAAAA,EAAAA,GAASf,MAAMZ,IAAI;AAIzD,WAAO;AAAA,MAACA,MAAMY,MAAMZ;AAAAA,MAAMR,MAAMoB,MAAMpB;AAAAA,IAAAA;AACxC;AChBO,SAASyC,aAAanC,UAAgBgC,YAA2B;AACtE,MAAIhC,SAASS,SAASuB,WAAWvB;AAC/B,WAAO;AAGT,WAAS2B,IAAI,GAAGA,IAAIpC,SAASS,QAAQ2B,KAAK;AACxC,UAAMC,UAAUrC,SAASoC,CAAC,GACpBE,eAAeN,WAAWI,CAAC;AAEjC,QAAIf,eAAegB,OAAO,KAAKhB,eAAeiB,YAAY;AACxD,UAAID,QAAQE,SAASD,aAAaC;AAChC,eAAO;AAAA,eAEAF,YAAYC;AACrB,aAAO;AAAA,EAEX;AAEA,SAAO;AACT;ACxBO,SAASE,cACdC,OACAC,SACAC,MACS;AACT,SAAOC,cAAcH,OAAOC,SAASC,IAAI,MAAM;AACjD;ACmBO,SAASE,gBACdpD,UACAqD,OACAC,QACS;AACT,MAAI,CAACD,SAASC,WAAW;AACvB,WAAO;AAGT,QAAMJ,OAAO;AAAA,IAACzB,OAAOzB,SAASqC,QAAQZ;AAAAA,EAAAA;AAEtC,MAAIM,QAAQuB,MAAM,GAAG;AACnB,QACEF,gBAAgBpD,UAAUqD,OAAOC,OAAOtB,MAAM,KAC9CoB,gBAAgBpD,UAAUqD,OAAOC,OAAOrB,KAAK;AAE7C,aAAO;AAET,UAAM,CAACsB,IAAIC,EAAE,IAAIC,WAAWJ,OAAOH,IAAI,GACjC,CAACQ,IAAIC,EAAE,IAAIF,WAAWH,QAAQJ,IAAI;AACxC,WAAOH,cAAcQ,IAAIG,IAAIR,IAAI,KAAKU,aAAaJ,IAAIG,IAAIT,IAAI;AAAA,EACjE;AAEA,QAAM,CAACW,OAAOC,GAAG,IAAIL,WAAWJ,OAAOH,IAAI;AAC3C,MAAIa,eAAe,IACfC,cAAc;AAElB,SAAInC,QAAQyB,MAAM,KAChBS,eAAeZ,gBAAcnD,UAAUsD,QAAQO,KAAK,KAAK,GACzDG,cAAcb,gBAAcnD,UAAUsD,QAAQQ,GAAG,KAAK,MAEtDC,eAAeE,aAAaX,QAAQO,MAAM5D,MAAMiD,IAAI,KAAK,GACzDc,cAAcC,aAAaX,QAAQQ,IAAI7D,MAAMiD,IAAI,KAAK,IAGjDa,gBAAgBC;AACzB;ACvDO,SAASE,aACdlE,UACAC,MACuD;AACvD,QAAMoB,QAAQC,QAAQtB,UAAUC,IAAI;AAEpC,MAAKoB,SAIA8C,YAAY;AAAA,IAAC/B,QAAQpC,SAASqC,QAAQD;AAAAA,EAAAA,GAASf,MAAMZ,IAAI;AAI9D,WAAO;AAAA,MAACA,MAAMY,MAAMZ;AAAAA,MAAMR,MAAMoB,MAAMpB;AAAAA,IAAAA;AACxC;ACEO,SAASmE,eAAehC,QAAgBiC,YAAgC;AAC7E,QAAMC,aAAaC,YAAYnC,OAAOkC,YAAY,CAAA,CAAE,GAC9CE,cAAcD,YAAYnC,OAAOoC,aAAa,CAAA,CAAE,GAChDC,QAAQF,YAAYnC,OAAOqC,OAAO,CAAA,CAAE,GACpCC,SAASH,YAAYnC,OAAOsC,QAAQ,CAAA,CAAE,GACtCC,gBAAgBJ,YAAYnC,OAAOuC,eAAe,CAAA,CAAE,GACpDC,eAAeL,YAAYnC,OAAOwC,cAAc,EAAE;AAExD,aAAWC,aAAaR,WAAWS,UAAU;AAC3C,QAAI,CAACC,iBAAiBF,UAAUG,MAAMC,IAAI7C,OAAO8C,MAAMC,IAAI;AACzD;AAEF,UAAMC,MAAMC,aAAajD,QAAQyC,UAAUG,MAAMC,EAAE;AACnDV,gBAAYa,IAAId,YAAYA,UAAU,GACtCC,YAAYa,IAAIZ,aAAaA,WAAW,GACxCD,YAAYa,IAAIX,OAAOA,KAAK,GAC5BF,YAAYa,IAAIV,QAAQA,MAAM,GAC9BH,YAAYa,IAAIT,eAAeA,aAAa,GAC5CJ,YAAYa,IAAIR,cAAcA,YAAY;AAAA,EAC5C;AAEA,SAAO;AAAA,IACL,GAAGxC;AAAAA,IACHkC;AAAAA,IACAE;AAAAA,IACAC;AAAAA,IACAC;AAAAA,IACAC;AAAAA,IACAC;AAAAA,EAAAA;AAEJ;AAEA,SAASG,iBACPE,IACAK,WACS;AACT,SAAOL,GAAGM,KACPC,CAAAA,WAAWA,OAAOC,SAAS,WAAWD,OAAOC,SAASH,SACzD;AACF;AAEA,SAASf,YACPmB,QACApC,QACU;AACV,aAAWjC,SAASqE;AACdpC,WAAOiC,KAAMI,CAAAA,aAAaA,SAASR,SAAS9D,MAAM8D,IAAI,KAG1D7B,OAAOsC,KAAKvE,KAAK;AAEnB,SAAOiC;AACT;ACrEO,SAASuC,cACd7F,UACAC,MACsC;AACtC,SAAOiB,YAAYlB,UAAUC,IAAI,EAAEmB,GAAG,CAAC;AACzC;ACJO,SAAS0E,aACd9F,UACAC,MACsC;AACtC,QAAMoB,QAAQC,QAAQtB,UAAUC,IAAI;AAEpC,MAAKoB,SAIAT,oBAAoBZ,UAAUqB,MAAMZ,MAAMY,MAAMpB,IAAI;AAIzD,WAAO;AAAA,MAACQ,MAAMY,MAAMZ;AAAAA,MAAMR,MAAMoB,MAAMpB;AAAAA,IAAAA;AACxC;"}
+{"version":3,"file":"get-container.js","sources":["../../src/traversal/get-ancestor.ts","../../src/traversal/is-leaf-object.ts","../../src/traversal/get-leaf.ts","../../src/engine/path/is-path.ts","../../src/engine/utils/is-object.ts","../../src/engine/point/is-point.ts","../../src/engine/range/is-range.ts","../../src/traversal/get-text.ts","../../src/traversal/get-span.ts","../../src/traversal/path-contains.ts","../../src/engine/point/is-before-point.ts","../../src/traversal/range-intersects.ts","../../src/traversal/get-text-block.ts","../../src/traversal/get-first-child.ts","../../src/traversal/get-last-child.ts","../../src/traversal/get-union-schema.ts","../../src/traversal/get-container.ts"],"sourcesContent":["import type {PortableTextBlock} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {getAncestors} from './get-ancestors'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Find an ancestor of the node at a given path that matches a predicate.\n * Does not check the node at the path itself, only its ancestors.\n *\n * `mode: 'lowest'` (default) returns the nearest matching ancestor.\n * `mode: 'highest'` returns the outermost matching ancestor.\n *\n * When `match` is a type predicate, the returned `node` narrows to that type.\n *\n * @beta\n */\nexport function getAncestor<TMatch extends PortableTextBlock>(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options: {\n    match: (node: PortableTextBlock, path: Path) => node is TMatch\n    mode?: 'lowest' | 'highest'\n  },\n): {node: TMatch; path: Path} | undefined\n/**\n * @beta\n */\nexport function getAncestor(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options: {\n    match: (node: PortableTextBlock, path: Path) => boolean\n    mode?: 'lowest' | 'highest'\n  },\n): {node: PortableTextBlock; path: Path} | undefined\nexport function getAncestor(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options: {\n    match: (node: PortableTextBlock, path: Path) => boolean\n    mode?: 'lowest' | 'highest'\n  },\n): {node: PortableTextBlock; path: Path} | undefined {\n  const {match, mode = 'lowest'} = options\n  const ancestors = getAncestors(snapshot, path)\n\n  if (mode === 'highest') {\n    for (const ancestor of [...ancestors].reverse()) {\n      if (match(ancestor.node, ancestor.path)) {\n        return ancestor\n      }\n    }\n    return undefined\n  }\n\n  for (const ancestor of ancestors) {\n    if (match(ancestor.node, ancestor.path)) {\n      return ancestor\n    }\n  }\n\n  return undefined\n}\n","import type {PortableTextObject} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {isEditableContainer} from '../schema/is-editable-container'\nimport {isObject} from './is-object'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Check if a node is a leaf object: an object node that has no editable\n * children (not a container).\n * Returns true for block objects and inline objects that don't have\n * registered editable content (containers).\n *\n * @beta\n */\nexport function isLeafObject(\n  snapshot: TraversalSnapshot,\n  node: unknown,\n  path: Path,\n): node is PortableTextObject {\n  return isObject(snapshot, node) && !isEditableContainer(snapshot, node, path)\n}\n","import type {Node} from '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport {getChildren} from './get-children'\nimport {getNode} from './get-node'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the deepest leaf node starting from a path, walking toward either the\n * start or end edge. A leaf is any node that has no children according to the\n * traversal context.\n *\n * @beta\n */\nexport function getLeaf(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options: {edge: 'start' | 'end'},\n): {node: Node; path: Path} | undefined {\n  const {edge} = options\n\n  let currentPath = path\n\n  // If starting from root (empty path), descend into first/last child\n  if (currentPath.length === 0) {\n    const children = getChildren(snapshot, [])\n    if (children.length === 0) {\n      return undefined\n    }\n    const firstOrLast = edge === 'end' ? children.at(-1)! : children.at(0)!\n    const nodeChildren = getChildren(snapshot, firstOrLast.path)\n    if (nodeChildren.length === 0) {\n      return firstOrLast\n    }\n    currentPath = firstOrLast.path\n  } else {\n    // Check if the node at path is already a leaf\n    const entry = getNode(snapshot, currentPath)\n    if (!entry) {\n      return undefined\n    }\n    const children = getChildren(snapshot, currentPath)\n    if (children.length === 0) {\n      return entry\n    }\n  }\n\n  // Descend to deepest leaf\n  while (true) {\n    const children = getChildren(snapshot, currentPath)\n    if (children.length === 0) {\n      const entry = getNode(snapshot, currentPath)\n      return entry ?? undefined\n    }\n    const child = edge === 'end' ? children.at(-1)! : children.at(0)!\n    currentPath = child.path\n  }\n}\n","import {isKeyedSegment} from '../../utils/util.is-keyed-segment'\nimport type {Path} from '../interfaces/path'\n\nexport function isPath(value: any): value is Path {\n  return (\n    Array.isArray(value) &&\n    (value.length === 0 ||\n      typeof value[0] === 'number' ||\n      typeof value[0] === 'string' ||\n      isKeyedSegment(value[0]))\n  )\n}\n","export const isObject = (value: any) =>\n  typeof value === 'object' && value !== null\n","import type {Point} from '../interfaces/point'\nimport {isPath} from '../path/is-path'\nimport {isObject} from '../utils/is-object'\n\nexport function isPoint(value: any): value is Point {\n  return (\n    isObject(value) && typeof value.offset === 'number' && isPath(value.path)\n  )\n}\n","import type {Range} from '../interfaces/range'\nimport {isPoint} from '../point/is-point'\nimport {isObject} from '../utils/is-object'\n\nexport function isRange(value: any): value is Range {\n  return isObject(value) && isPoint(value.anchor) && isPoint(value.focus)\n}\n","import {isSpan} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {getNode} from './get-node'\nimport {getNodes} from './get-nodes'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the concatenated text content of the node at a given path.\n *\n * @beta\n */\nexport function getText(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): string | undefined {\n  const entry = getNode(snapshot, path)\n\n  if (!entry) {\n    return undefined\n  }\n\n  if (isSpan({schema: snapshot.context.schema}, entry.node)) {\n    return entry.node.text\n  }\n\n  let text = ''\n\n  for (const descendant of getNodes(snapshot, {at: path})) {\n    if (isSpan({schema: snapshot.context.schema}, descendant.node)) {\n      text += descendant.node.text\n    }\n  }\n\n  return text\n}\n","import {isSpan, type PortableTextSpan} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {getNode} from './get-node'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the span node at a given path.\n *\n * @beta\n */\nexport function getSpan(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): {node: PortableTextSpan; path: Path} | undefined {\n  const entry = getNode(snapshot, path)\n\n  if (!entry) {\n    return undefined\n  }\n\n  if (!isSpan({schema: snapshot.context.schema}, entry.node)) {\n    return undefined\n  }\n\n  return {node: entry.node, path: entry.path}\n}\n","import type {Path} from '../types/paths'\nimport {isKeyedSegment} from '../utils/util.is-keyed-segment'\n\n/**\n * Returns true if `ancestor` is equal to `descendant`, or if `descendant`\n * lives anywhere inside `ancestor`'s subtree.\n *\n * @beta\n */\nexport function pathContains(ancestor: Path, descendant: Path): boolean {\n  if (ancestor.length > descendant.length) {\n    return false\n  }\n\n  for (let i = 0; i < ancestor.length; i++) {\n    const segment = ancestor[i]\n    const otherSegment = descendant[i]\n\n    if (isKeyedSegment(segment) && isKeyedSegment(otherSegment)) {\n      if (segment._key !== otherSegment._key) {\n        return false\n      }\n    } else if (segment !== otherSegment) {\n      return false\n    }\n  }\n\n  return true\n}\n","import type {Node} from '../interfaces/node'\nimport type {Point} from '../interfaces/point'\nimport {comparePoints} from './compare-points'\n\nexport function isBeforePoint(\n  point: Point,\n  another: Point,\n  root: {value: Array<Node>},\n): boolean {\n  return comparePoints(point, another, root) === -1\n}\n","import {comparePaths} from '../engine/path/compare-paths'\nimport {isAfterPoint} from '../engine/point/is-after-point'\nimport {isBeforePoint} from '../engine/point/is-before-point'\nimport {isPoint} from '../engine/point/is-point'\nimport {isRange} from '../engine/range/is-range'\nimport {rangeEdges} from '../engine/range/range-edges'\nimport type {EditorSelection, EditorSelectionPoint} from '../types/editor'\nimport type {Path} from '../types/paths'\nimport {comparePoints} from './compare-points'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Returns true if `range` and the supplied `target` intersect. The target\n * may be a `Path`, an `EditorSelectionPoint`, or another\n * `EditorSelection`.\n *\n * For a `Path` or `EditorSelectionPoint` target, \"intersect\" means the\n * target lies at or between `range`'s start and end edges (inclusive).\n *\n * For an `EditorSelection` target, \"intersect\" means either endpoint of\n * `target` lies inside `range`, or `range` strictly encloses `target`.\n *\n * Pass `snapshot.context.selection` as `range` to ask the question against\n * the editor's current selection.\n *\n * Returns `false` when either `range` or `target` is `null`.\n *\n * @beta\n */\nexport function rangeIntersects(\n  snapshot: TraversalSnapshot,\n  range: EditorSelection,\n  target: Path | EditorSelectionPoint | EditorSelection,\n): boolean {\n  if (!range || target === null) {\n    return false\n  }\n\n  const root = {value: snapshot.context.value}\n\n  if (isRange(target)) {\n    if (\n      rangeIntersects(snapshot, range, target.anchor) ||\n      rangeIntersects(snapshot, range, target.focus)\n    ) {\n      return true\n    }\n    const [rs, re] = rangeEdges(range, root)\n    const [ts, te] = rangeEdges(target, root)\n    return isBeforePoint(rs, ts, root) && isAfterPoint(re, te, root)\n  }\n\n  const [start, end] = rangeEdges(range, root)\n  let isAfterStart = false\n  let isBeforeEnd = false\n\n  if (isPoint(target)) {\n    isAfterStart = comparePoints(snapshot, target, start) >= 0\n    isBeforeEnd = comparePoints(snapshot, target, end) <= 0\n  } else {\n    isAfterStart = comparePaths(target, start.path, root) >= 0\n    isBeforeEnd = comparePaths(target, end.path, root) <= 0\n  }\n\n  return isAfterStart && isBeforeEnd\n}\n","import {isTextBlock, type PortableTextTextBlock} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {getNode} from './get-node'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the text block node at a given path.\n *\n * @beta\n */\nexport function getTextBlock(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): {node: PortableTextTextBlock; path: Path} | undefined {\n  const entry = getNode(snapshot, path)\n\n  if (!entry) {\n    return undefined\n  }\n\n  if (!isTextBlock({schema: snapshot.context.schema}, entry.node)) {\n    return undefined\n  }\n\n  return {node: entry.node, path: entry.path}\n}\n","import type {Node} from '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport {getChildren} from './get-children'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the first child of a node at a given path.\n *\n * @beta\n */\nexport function getFirstChild(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): {node: Node; path: Path} | undefined {\n  return getChildren(snapshot, path).at(0)\n}\n","import type {Node} from '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport {getChildren} from './get-children'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the last child of a node at a given path.\n *\n * @beta\n */\nexport function getLastChild(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): {node: Node; path: Path} | undefined {\n  const children = getChildren(snapshot, path)\n\n  return children.at(-1)\n}\n","import {getSubSchema, type Schema} from '@portabletext/schema'\nimport type {Containers} from '../schema/resolve-containers'\n\n/**\n * Return a `Schema` that contains every named member declared anywhere\n * in the editor's schema graph that is reachable from a position where text\n * is edited - the root schema merged with the sub-schema of every registered\n * container whose field accepts text blocks, deduped by name. Useful for\n * rendering a static toolbar whose buttons stay stable across selection\n * moves while still reflecting everything that could plausibly be edited or\n * inserted somewhere.\n *\n * Containers whose field does NOT accept text blocks (e.g. a `table`\n * container whose `rows` field only accepts `row` objects, or a `row`\n * container whose `cells` field only accepts `cell` objects) are\n * **structural**: their immediate `of` types are organizational, not\n * insertable user content. Those structural types are excluded from the\n * union. Their nested text-block-accepting descendants (e.g. a `cell`\n * that contains a `content` field of `{type: 'block'}`) are reached via\n * those descendants' own container registration.\n *\n * Pair with `getPathSubSchema` (or a path-based intersection across a\n * range) to determine which of the union's members are applicable at the\n * current selection.\n *\n * @beta\n */\nexport function getUnionSchema(schema: Schema, containers: Containers): Schema {\n  const decorators = mergeByName(schema.decorators, [])\n  const annotations = mergeByName(schema.annotations, [])\n  const lists = mergeByName(schema.lists, [])\n  const styles = mergeByName(schema.styles, [])\n  const inlineObjects = mergeByName(schema.inlineObjects, [])\n  const blockObjects = mergeByName(schema.blockObjects, [])\n\n  for (const container of containers.values()) {\n    if (!acceptsTextBlock(container.field.of, schema.block.name)) {\n      continue\n    }\n    const sub = getSubSchema(schema, container.field.of)\n    mergeByName(sub.decorators, decorators)\n    mergeByName(sub.annotations, annotations)\n    mergeByName(sub.lists, lists)\n    mergeByName(sub.styles, styles)\n    mergeByName(sub.inlineObjects, inlineObjects)\n    mergeByName(sub.blockObjects, blockObjects)\n  }\n\n  return {\n    ...schema,\n    decorators,\n    annotations,\n    lists,\n    styles,\n    inlineObjects,\n    blockObjects,\n  }\n}\n\nfunction acceptsTextBlock(\n  of: ReadonlyArray<{type: string}>,\n  blockName: string,\n): boolean {\n  return of.some(\n    (member) => member.type === 'block' || member.type === blockName,\n  )\n}\n\nfunction mergeByName<T extends {name: string}>(\n  source: ReadonlyArray<T>,\n  target: Array<T>,\n): Array<T> {\n  for (const entry of source) {\n    if (target.some((existing) => existing.name === entry.name)) {\n      continue\n    }\n    target.push(entry)\n  }\n  return target\n}\n","import type {Node} from '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport {isEditableContainer} from '../schema/is-editable-container'\nimport {getNode} from './get-node'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the registered editable container at a given path.\n *\n * @beta\n */\nexport function getContainer(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): {node: Node; path: Path} | undefined {\n  const entry = getNode(snapshot, path)\n\n  if (!entry) {\n    return undefined\n  }\n\n  if (!isEditableContainer(snapshot, entry.node, entry.path)) {\n    return undefined\n  }\n\n  return {node: entry.node, path: entry.path}\n}\n"],"names":["getAncestor","snapshot","path","options","match","mode","ancestors","getAncestors","ancestor","reverse","node","isLeafObject","isObject","isEditableContainer","getLeaf","edge","currentPath","length","children","getChildren","firstOrLast","at","entry","getNode","undefined","isPath","value","Array","isArray","isKeyedSegment","isPoint","offset","isRange","anchor","focus","getText","isSpan","schema","context","text","descendant","getNodes","getSpan","pathContains","i","segment","otherSegment","_key","isBeforePoint","point","another","root","comparePoints","rangeIntersects","range","target","rs","re","rangeEdges","ts","te","isAfterPoint","start","end","isAfterStart","isBeforeEnd","comparePaths","getTextBlock","isTextBlock","getFirstChild","getLastChild","getUnionSchema","containers","decorators","mergeByName","annotations","lists","styles","inlineObjects","blockObjects","container","values","acceptsTextBlock","field","of","block","name","sub","getSubSchema","blockName","some","member","type","source","existing","push","getContainer"],"mappings":";;;AAmCO,SAASA,YACdC,UACAC,MACAC,SAImD;AACnD,QAAM;AAAA,IAACC;AAAAA,IAAOC,OAAO;AAAA,EAAA,IAAYF,SAC3BG,YAAYC,aAAaN,UAAUC,IAAI;AAE7C,MAAIG,SAAS,WAAW;AACtB,eAAWG,YAAY,CAAC,GAAGF,SAAS,EAAEG,QAAAA;AACpC,UAAIL,MAAMI,SAASE,MAAMF,SAASN,IAAI;AACpC,eAAOM;AAGX;AAAA,EACF;AAEA,aAAWA,YAAYF;AACrB,QAAIF,MAAMI,SAASE,MAAMF,SAASN,IAAI;AACpC,aAAOM;AAKb;AChDO,SAASG,aACdV,UACAS,MACAR,MAC4B;AAC5B,SAAOU,WAASX,UAAUS,IAAI,KAAK,CAACG,oBAAoBZ,UAAUS,MAAMR,IAAI;AAC9E;ACPO,SAASY,QACdb,UACAC,MACAC,SACsC;AACtC,QAAM;AAAA,IAACY;AAAAA,EAAAA,IAAQZ;AAEf,MAAIa,cAAcd;AAGlB,MAAIc,YAAYC,WAAW,GAAG;AAC5B,UAAMC,WAAWC,YAAYlB,UAAU,EAAE;AACzC,QAAIiB,SAASD,WAAW;AACtB;AAEF,UAAMG,cAAcL,SAAS,QAAQG,SAASG,GAAG,EAAE,IAAKH,SAASG,GAAG,CAAC;AAErE,QADqBF,YAAYlB,UAAUmB,YAAYlB,IAAI,EAC1Ce,WAAW;AAC1B,aAAOG;AAETJ,kBAAcI,YAAYlB;AAAAA,EAC5B,OAAO;AAEL,UAAMoB,QAAQC,QAAQtB,UAAUe,WAAW;AAC3C,QAAI,CAACM;AACH;AAGF,QADiBH,YAAYlB,UAAUe,WAAW,EACrCC,WAAW;AACtB,aAAOK;AAAAA,EAEX;AAGA,aAAa;AACX,UAAMJ,WAAWC,YAAYlB,UAAUe,WAAW;AAClD,QAAIE,SAASD,WAAW;AAEtB,aADcM,QAAQtB,UAAUe,WAAW,KAC3BQ;AAGlBR,mBADcD,SAAS,QAAQG,SAASG,GAAG,EAAE,IAAKH,SAASG,GAAG,CAAC,GAC3CnB;AAAAA,EACtB;AACF;ACrDO,SAASuB,OAAOC,OAA2B;AAChD,SACEC,MAAMC,QAAQF,KAAK,MAClBA,MAAMT,WAAW,KAChB,OAAOS,MAAM,CAAC,KAAM,YACpB,OAAOA,MAAM,CAAC,KAAM,YACpBG,eAAeH,MAAM,CAAC,CAAC;AAE7B;ACXO,MAAMd,WAAYc,CAAAA,UACvB,OAAOA,SAAU,YAAYA,UAAU;ACGlC,SAASI,QAAQJ,OAA4B;AAClD,SACEd,SAASc,KAAK,KAAK,OAAOA,MAAMK,UAAW,YAAYN,OAAOC,MAAMxB,IAAI;AAE5E;ACJO,SAAS8B,QAAQN,OAA4B;AAClD,SAAOd,SAASc,KAAK,KAAKI,QAAQJ,MAAMO,MAAM,KAAKH,QAAQJ,MAAMQ,KAAK;AACxE;ACKO,SAASC,QACdlC,UACAC,MACoB;AACpB,QAAMoB,QAAQC,QAAQtB,UAAUC,IAAI;AAEpC,MAAI,CAACoB;AACH;AAGF,MAAIc,OAAO;AAAA,IAACC,QAAQpC,SAASqC,QAAQD;AAAAA,EAAAA,GAASf,MAAMZ,IAAI;AACtD,WAAOY,MAAMZ,KAAK6B;AAGpB,MAAIA,OAAO;AAEX,aAAWC,cAAcC,SAASxC,UAAU;AAAA,IAACoB,IAAInB;AAAAA,EAAAA,CAAK;AAChDkC,WAAO;AAAA,MAACC,QAAQpC,SAASqC,QAAQD;AAAAA,IAAAA,GAASG,WAAW9B,IAAI,MAC3D6B,QAAQC,WAAW9B,KAAK6B;AAI5B,SAAOA;AACT;ACxBO,SAASG,QACdzC,UACAC,MACkD;AAClD,QAAMoB,QAAQC,QAAQtB,UAAUC,IAAI;AAEpC,MAAKoB,SAIAc,OAAO;AAAA,IAACC,QAAQpC,SAASqC,QAAQD;AAAAA,EAAAA,GAASf,MAAMZ,IAAI;AAIzD,WAAO;AAAA,MAACA,MAAMY,MAAMZ;AAAAA,MAAMR,MAAMoB,MAAMpB;AAAAA,IAAAA;AACxC;AChBO,SAASyC,aAAanC,UAAgBgC,YAA2B;AACtE,MAAIhC,SAASS,SAASuB,WAAWvB;AAC/B,WAAO;AAGT,WAAS2B,IAAI,GAAGA,IAAIpC,SAASS,QAAQ2B,KAAK;AACxC,UAAMC,UAAUrC,SAASoC,CAAC,GACpBE,eAAeN,WAAWI,CAAC;AAEjC,QAAIf,eAAegB,OAAO,KAAKhB,eAAeiB,YAAY;AACxD,UAAID,QAAQE,SAASD,aAAaC;AAChC,eAAO;AAAA,eAEAF,YAAYC;AACrB,aAAO;AAAA,EAEX;AAEA,SAAO;AACT;ACxBO,SAASE,cACdC,OACAC,SACAC,MACS;AACT,SAAOC,cAAcH,OAAOC,SAASC,IAAI,MAAM;AACjD;ACmBO,SAASE,gBACdpD,UACAqD,OACAC,QACS;AACT,MAAI,CAACD,SAASC,WAAW;AACvB,WAAO;AAGT,QAAMJ,OAAO;AAAA,IAACzB,OAAOzB,SAASqC,QAAQZ;AAAAA,EAAAA;AAEtC,MAAIM,QAAQuB,MAAM,GAAG;AACnB,QACEF,gBAAgBpD,UAAUqD,OAAOC,OAAOtB,MAAM,KAC9CoB,gBAAgBpD,UAAUqD,OAAOC,OAAOrB,KAAK;AAE7C,aAAO;AAET,UAAM,CAACsB,IAAIC,EAAE,IAAIC,WAAWJ,OAAOH,IAAI,GACjC,CAACQ,IAAIC,EAAE,IAAIF,WAAWH,QAAQJ,IAAI;AACxC,WAAOH,cAAcQ,IAAIG,IAAIR,IAAI,KAAKU,aAAaJ,IAAIG,IAAIT,IAAI;AAAA,EACjE;AAEA,QAAM,CAACW,OAAOC,GAAG,IAAIL,WAAWJ,OAAOH,IAAI;AAC3C,MAAIa,eAAe,IACfC,cAAc;AAElB,SAAInC,QAAQyB,MAAM,KAChBS,eAAeZ,gBAAcnD,UAAUsD,QAAQO,KAAK,KAAK,GACzDG,cAAcb,gBAAcnD,UAAUsD,QAAQQ,GAAG,KAAK,MAEtDC,eAAeE,aAAaX,QAAQO,MAAM5D,MAAMiD,IAAI,KAAK,GACzDc,cAAcC,aAAaX,QAAQQ,IAAI7D,MAAMiD,IAAI,KAAK,IAGjDa,gBAAgBC;AACzB;ACvDO,SAASE,aACdlE,UACAC,MACuD;AACvD,QAAMoB,QAAQC,QAAQtB,UAAUC,IAAI;AAEpC,MAAKoB,SAIA8C,YAAY;AAAA,IAAC/B,QAAQpC,SAASqC,QAAQD;AAAAA,EAAAA,GAASf,MAAMZ,IAAI;AAI9D,WAAO;AAAA,MAACA,MAAMY,MAAMZ;AAAAA,MAAMR,MAAMoB,MAAMpB;AAAAA,IAAAA;AACxC;ACfO,SAASmE,cACdpE,UACAC,MACsC;AACtC,SAAOiB,YAAYlB,UAAUC,IAAI,EAAEmB,GAAG,CAAC;AACzC;ACLO,SAASiD,aACdrE,UACAC,MACsC;AAGtC,SAFiBiB,YAAYlB,UAAUC,IAAI,EAE3BmB,GAAG,EAAE;AACvB;ACUO,SAASkD,eAAelC,QAAgBmC,YAAgC;AAC7E,QAAMC,aAAaC,YAAYrC,OAAOoC,YAAY,CAAA,CAAE,GAC9CE,cAAcD,YAAYrC,OAAOsC,aAAa,CAAA,CAAE,GAChDC,QAAQF,YAAYrC,OAAOuC,OAAO,CAAA,CAAE,GACpCC,SAASH,YAAYrC,OAAOwC,QAAQ,CAAA,CAAE,GACtCC,gBAAgBJ,YAAYrC,OAAOyC,eAAe,CAAA,CAAE,GACpDC,eAAeL,YAAYrC,OAAO0C,cAAc,EAAE;AAExD,aAAWC,aAAaR,WAAWS,UAAU;AAC3C,QAAI,CAACC,iBAAiBF,UAAUG,MAAMC,IAAI/C,OAAOgD,MAAMC,IAAI;AACzD;AAEF,UAAMC,MAAMC,aAAanD,QAAQ2C,UAAUG,MAAMC,EAAE;AACnDV,gBAAYa,IAAId,YAAYA,UAAU,GACtCC,YAAYa,IAAIZ,aAAaA,WAAW,GACxCD,YAAYa,IAAIX,OAAOA,KAAK,GAC5BF,YAAYa,IAAIV,QAAQA,MAAM,GAC9BH,YAAYa,IAAIT,eAAeA,aAAa,GAC5CJ,YAAYa,IAAIR,cAAcA,YAAY;AAAA,EAC5C;AAEA,SAAO;AAAA,IACL,GAAG1C;AAAAA,IACHoC;AAAAA,IACAE;AAAAA,IACAC;AAAAA,IACAC;AAAAA,IACAC;AAAAA,IACAC;AAAAA,EAAAA;AAEJ;AAEA,SAASG,iBACPE,IACAK,WACS;AACT,SAAOL,GAAGM,KACPC,CAAAA,WAAWA,OAAOC,SAAS,WAAWD,OAAOC,SAASH,SACzD;AACF;AAEA,SAASf,YACPmB,QACAtC,QACU;AACV,aAAWjC,SAASuE;AACdtC,WAAOmC,KAAMI,CAAAA,aAAaA,SAASR,SAAShE,MAAMgE,IAAI,KAG1D/B,OAAOwC,KAAKzE,KAAK;AAEnB,SAAOiC;AACT;ACpEO,SAASyC,aACd/F,UACAC,MACsC;AACtC,QAAMoB,QAAQC,QAAQtB,UAAUC,IAAI;AAEpC,MAAKoB,SAIAT,oBAAoBZ,UAAUqB,MAAMZ,MAAMY,MAAMpB,IAAI;AAIzD,WAAO;AAAA,MAACQ,MAAMY,MAAMZ;AAAAA,MAAMR,MAAMoB,MAAMpB;AAAAA,IAAAA;AACxC;"}

package/lib/_chunks-es/selector.is-at-the-start-of-block.js

@@ -775,20 +775,6 @@ const getCaretWordSelection = (snapshot) => {
       selection: caretWordSelection
     }
   }) ? caretWordSelection : null;
-}, getFirstBlock = (snapshot) => {
-  const focusBlock = getFocusBlock(snapshot);
-  if (focusBlock) {
-    const first = getChildren(snapshot, parentPath(focusBlock.path)).at(0);
-    if (first)
-      return getBlock(snapshot, first.path);
-  }
-  const node = snapshot.context.value[0];
-  return node ? {
-    node,
-    path: [{
-      _key: node._key
-    }]
-  } : void 0;
 }, getFocusBlockObject = (snapshot) => {
   const focusBlock = getFocusBlock(snapshot);
   if (focusBlock && !isTextBlockNode(snapshot.context, focusBlock.node) && !isEditableContainer(snapshot, focusBlock.node, focusBlock.path))
@@ -907,7 +893,6 @@ export {
   getActiveStyle,
   getApplicableSchema,
   getCaretWordSelection,
-  getFirstBlock,
   getFocusBlock,
   getFocusBlockObject,
   getFocusChild,