@portabletext/editor 7.8.2 → 7.9.0

package/lib/_chunks-dts/behavior.types.action.d.ts

@@ -1,8 +1,8 @@
-import * as _portabletext_schema5 from "@portabletext/schema";
+import * as _portabletext_schema6 from "@portabletext/schema";
 import { AnnotationDefinition, AnnotationSchemaType, AnnotationSchemaType as AnnotationSchemaType$1, BaseDefinition, BlockObjectDefinition, BlockObjectSchemaType, BlockObjectSchemaType as BlockObjectSchemaType$1, DecoratorDefinition, DecoratorSchemaType, DecoratorSchemaType as DecoratorSchemaType$1, FieldDefinition, FieldDefinition as FieldDefinition$1, InlineObjectDefinition, InlineObjectSchemaType, InlineObjectSchemaType as InlineObjectSchemaType$1, ListDefinition, ListSchemaType, ListSchemaType as ListSchemaType$1, OfDefinition, PortableTextBlock, PortableTextBlock as PortableTextBlock$1, PortableTextChild, PortableTextChild as PortableTextChild$1, PortableTextObject, PortableTextObject as PortableTextObject$1, PortableTextSpan, PortableTextSpan as PortableTextSpan$1, PortableTextTextBlock, PortableTextTextBlock as PortableTextTextBlock$1, Schema, SchemaDefinition, SchemaDefinition as SchemaDefinition$1, StyleDefinition, StyleSchemaType, StyleSchemaType as StyleSchemaType$1, TypedObject, defineSchema } from "@portabletext/schema";
 import * as xstate31 from "xstate";
 import { ActorRefFrom } from "xstate";
-import * as react4 from "react";
+import * as react7 from "react";
 import React$1, { BaseSyntheticEvent, ClipboardEvent as ClipboardEvent$1, FocusEvent, JSX, PropsWithChildren, ReactElement, RefObject, TextareaHTMLAttributes } from "react";
 import { Patch, Patch as Patch$1 } from "@portabletext/patches";
 type MIMEType = `${string}/${string}`;
@@ -839,7 +839,7 @@ declare class PortableTextEditor {
    */
   static delete: (editor: PortableTextEditor, selection: EditorSelection, options?: EditableAPIDeleteOptions) => void;
   static findDOMNode: (editor: PortableTextEditor, element: PortableTextBlock | PortableTextChild) => Node | undefined;
-  static findByPath: (editor: PortableTextEditor, path: Path) => [_portabletext_schema5.PortableTextTextBlock<PortableTextObject | _portabletext_schema5.PortableTextSpan> | PortableTextObject | _portabletext_schema5.PortableTextSpan | undefined, Path | undefined];
+  static findByPath: (editor: PortableTextEditor, path: Path) => [_portabletext_schema6.PortableTextTextBlock<PortableTextObject | _portabletext_schema6.PortableTextSpan> | PortableTextObject | _portabletext_schema6.PortableTextSpan | undefined, Path | undefined];
   /**
    * @deprecated
    * Use `editor.send(...)` instead
@@ -1177,7 +1177,7 @@ type PortableTextEditableProps = Omit<TextareaHTMLAttributes<HTMLDivElement>, 'o
  * ```
  * @group Components
  */
-declare const PortableTextEditable: react4.ForwardRefExoticComponent<Omit<PortableTextEditableProps, "ref"> & react4.RefAttributes<Omit<HTMLDivElement, "as" | "onPaste" | "onBeforeInput">>>;
+declare const PortableTextEditable: react7.ForwardRefExoticComponent<Omit<PortableTextEditableProps, "ref"> & react7.RefAttributes<Omit<HTMLDivElement, "as" | "onPaste" | "onBeforeInput">>>;
 /** @beta */
 interface EditableAPIDeleteOptions {
   mode?: 'blocks' | 'children' | 'selected';
@@ -2506,7 +2506,7 @@ declare const editorMachine: xstate31.StateMachine<{
   initialValue?: Array<PortableTextBlock>;
 }, xstate31.NonReducibleUnknown, InternalPatchEvent | MutationEvent | PatchesEvent | {
   type: "blurred";
-  event: react4.FocusEvent<HTMLDivElement, Element>;
+  event: react7.FocusEvent<HTMLDivElement, Element>;
 } | {
   type: "done loading";
 } | {
@@ -2518,7 +2518,7 @@ declare const editorMachine: xstate31.StateMachine<{
   data: unknown;
 } | {
   type: "focused";
-  event: react4.FocusEvent<HTMLDivElement, Element>;
+  event: react7.FocusEvent<HTMLDivElement, Element>;
 } | {
   type: "invalid value";
   resolution: InvalidValueResolution | null;

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

@@ -95,13 +95,21 @@ function getNode(snapshot, path) {
     context,
     blockIndexMap
   } = snapshot;
-  let currentChildren = context.value, node, currentParent;
+  let currentChildren = context.value, currentFieldName, node, currentParent;
   const resolvedPath = [];
   for (let i = 0; i < path.length; i++) {
     const segment = path[i];
     if (typeof segment == "string") {
-      resolvedPath.push(segment);
-      continue;
+      if (currentFieldName !== void 0 && segment === currentFieldName) {
+        resolvedPath.push(segment);
+        continue;
+      }
+      for (let j = i + 1; j < path.length; j++) {
+        const s = path[j];
+        if (isKeyedSegment(s) || typeof s == "number")
+          return;
+      }
+      break;
     }
     if (isKeyedSegment(segment)) {
       resolvedPath.push(segment);
@@ -129,14 +137,18 @@ function getNode(snapshot, path) {
       const next = getNodeChildren(context, node, currentParent);
       if (!next)
         return;
-      currentChildren = next.children, currentParent = next.parent;
-    }
+      currentChildren = next.children, currentFieldName = next.fieldName, currentParent = next.parent;
+    } else
+      currentFieldName = void 0;
   }
-  if (node)
+  if (node) {
+    for (; resolvedPath.length > 0 && typeof resolvedPath[resolvedPath.length - 1] == "string"; )
+      resolvedPath.pop();
     return {
       node,
       path: resolvedPath
     };
+  }
 }
 function parentPath(path) {
   if (path.length === 0)

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

@@ -1 +1 @@
-{"version":3,"file":"get-parent.js","sources":["../../src/utils/util.is-keyed-segment.ts","../../src/paths/serialize-path.ts","../../src/utils/asserters.ts","../../src/traversal/get-container-children.ts","../../src/traversal/get-children.ts","../../src/traversal/get-node.ts","../../src/engine/path/parent-path.ts","../../src/traversal/get-parent.ts"],"sourcesContent":["import type {KeyedSegment} from '../types/paths'\n\n/**\n * @public\n */\nexport function isKeyedSegment(segment: unknown): segment is KeyedSegment {\n  return typeof segment === 'object' && segment !== null && '_key' in segment\n}\n","import type {Path} from '../types/paths'\nimport {isKeyedSegment} from '../utils/util.is-keyed-segment'\n\n/**\n * Serialize a keyed path to a string using Sanity's bracket notation.\n *\n * - `[{_key: 'k0'}]` -> `[_key==\"k0\"]`\n * - `[{_key: 'k0'}, 'children', {_key: 's0'}]` -> `[_key==\"k0\"].children[_key==\"s0\"]`\n * - `[{_key: 't0'}, 'rows', {_key: 'r0'}, 'cells', {_key: 'c0'}, 'content', {_key: 'b0'}, 'children', {_key: 's0'}]` -> `[_key==\"t0\"].rows[_key==\"r0\"].cells[_key==\"c0\"].content[_key==\"b0\"].children[_key==\"s0\"]`\n */\nexport function serializePath(path: Path): string {\n  return path.reduce<string>((result, segment, index) => {\n    if (isKeyedSegment(segment)) {\n      return `${result}[_key==\"${segment._key}\"]`\n    }\n\n    const separator = index === 0 ? '' : '.'\n    return `${result}${separator}${segment}`\n  }, '')\n}\n","import type {TypedObject} from '@portabletext/schema'\n\nexport function isTypedObject(object: unknown): object is TypedObject {\n  return isRecord(object) && typeof object['_type'] === 'string'\n}\n\nexport function isRecord(value: unknown): value is Record<string, unknown> {\n  return !!value && (typeof value === 'object' || typeof value === 'function')\n}\n","import type {Node} from '../engine/interfaces/node'\nimport type {\n  Containers,\n  RegisteredContainer,\n} from '../schema/resolve-containers'\n\n/**\n * Resolve a container node's editable child array.\n *\n * Returns `{children, container}` for a node registered as a container:\n * `children` is the node's editable child array, and `container` is the\n * node's own container registration. Read `container.field.name` for the\n * path segment that reaches `children`, and thread `container` back in as\n * `parent` when descending into them.\n *\n * Returns `undefined` for anything that is not a container: text blocks,\n * spans, leaves, and unregistered objects. It is node-based and resolves\n * in one step with no path re-walk, so recursive descent over containers\n * is linear in nesting depth. The caller seeds the document root from\n * `context.value` itself.\n *\n * @beta\n */\nexport function getContainerChildren(\n  containers: Containers,\n  node: Node,\n  parent?: RegisteredContainer,\n):\n  | {\n      children: Array<Node>\n      container: RegisteredContainer\n    }\n  | undefined {\n  const resolved = resolveNodeContainer(containers, parent, node)\n\n  if (!resolved) {\n    return undefined\n  }\n\n  const fieldValue = (node as Record<string, unknown>)[resolved.field.name]\n\n  if (!Array.isArray(fieldValue)) {\n    return undefined\n  }\n\n  return {\n    children: fieldValue as Array<Node>,\n    container: resolved,\n  }\n}\n\n/**\n * Pick the positional override from `parent.of` if present; fall back\n * to the top-level entry. Returns only `RegisteredContainer` entries\n * since leaves do not have editable children.\n */\nfunction resolveNodeContainer(\n  containers: Containers,\n  parent: RegisteredContainer | undefined,\n  node: Node,\n): RegisteredContainer | undefined {\n  if (parent?.of) {\n    for (const entry of parent.of) {\n      if (entry.type === node._type) {\n        // Only return container entries; leaves have no editable children.\n        if ('field' in entry) {\n          return entry\n        }\n        return undefined\n      }\n    }\n  }\n  return containers.get(node._type)\n}\n","import {isTextBlock} from '@portabletext/schema'\nimport type {EditorSchema} from '../editor/editor-schema'\nimport type {Node} from '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport {serializePath} from '../paths/serialize-path'\nimport type {\n  Containers,\n  RegisteredContainer,\n} from '../schema/resolve-containers'\nimport {isTypedObject} from '../utils/asserters'\nimport {isKeyedSegment} from '../utils/util.is-keyed-segment'\nimport {getContainerChildren} from './get-container-children'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the children of a node at a given path.\n *\n * @beta\n */\nexport function getChildren(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): Array<{node: Node; path: Path}> {\n  let currentChildren: Array<Node> = snapshot.context.value\n  let currentFieldName = 'value'\n  let currentPath: Path = []\n  let isRoot = true\n  let currentParent: RegisteredContainer | undefined\n\n  for (const segment of path) {\n    if (typeof segment === 'string') {\n      continue\n    }\n\n    let node: Node | undefined\n    if (isKeyedSegment(segment)) {\n      // Resolve via `blockIndexMap` (O(1)) and fall back to a linear scan on a\n      // miss or when the snapshot's map disagrees with the value, mirroring\n      // `getNode`. The candidate path is this segment's full keyed path.\n      const candidatePath: Path = isRoot\n        ? [{_key: segment._key}]\n        : [...currentPath, currentFieldName, {_key: segment._key}]\n      const index = snapshot.blockIndexMap.get(serializePath(candidatePath))\n      node =\n        index !== undefined && currentChildren[index]?._key === segment._key\n          ? currentChildren[index]\n          : currentChildren.find((child) => child._key === segment._key)\n    } else if (typeof segment === 'number') {\n      node = currentChildren.at(segment)\n    }\n\n    if (!node) {\n      return []\n    }\n\n    currentPath = isRoot\n      ? [{_key: node._key}]\n      : [...currentPath, currentFieldName, {_key: node._key}]\n    isRoot = false\n\n    const next = getNodeChildren(snapshot.context, node, currentParent)\n\n    if (!next) {\n      return []\n    }\n\n    currentChildren = next.children\n    currentFieldName = next.fieldName\n    currentParent = next.parent\n  }\n\n  return currentChildren.map((child) => ({\n    node: child,\n    path: isRoot\n      ? [{_key: child._key}]\n      : [...currentPath, currentFieldName, {_key: child._key}],\n  }))\n}\n\n/**\n * Resolve a node's editable child array.\n *\n * When `parent` is provided and its `of` declares a positional entry\n * matching `node._type`, that positional entry's `field` is used.\n * Otherwise the top-level `containers.get(node._type)` provides the\n * fallback.\n *\n * The returned `parent` is the resolved container entry for `node`\n * itself (used by the caller to thread further descent).\n *\n * Internal descent kernel shared by the positional traversal utilities\n * (`getChildren`, `getNode`, `getNodes`, `getAncestors`); it folds the\n * text-block, container, and root-document cases. Public consumers that\n * only need to descend containers use {@link getContainerChildren}.\n */\nexport function getNodeChildren(\n  context: {\n    schema: EditorSchema\n    containers: Containers\n  },\n  node: Node | {value: Array<Node>},\n  parent?: RegisteredContainer,\n):\n  | {\n      children: Array<Node>\n      fieldName: string\n      parent: RegisteredContainer | undefined\n    }\n  | undefined {\n  // Text blocks store children in .children\n  if (isTextBlock(context, node)) {\n    return {\n      children: node.children,\n      fieldName: 'children',\n      parent: undefined,\n    }\n  }\n\n  if (isTypedObject(node)) {\n    const result = getContainerChildren(context.containers, node, parent)\n\n    if (result) {\n      return {\n        children: result.children,\n        fieldName: result.container.field.name,\n        parent: result.container,\n      }\n    }\n  }\n\n  // Root context: has .value array but no _key or _type\n  if (\n    'value' in node &&\n    Array.isArray(node['value']) &&\n    !('_key' in node) &&\n    !('_type' in node)\n  ) {\n    return {\n      children: node['value'] as Array<Node>,\n      fieldName: 'value',\n      parent: undefined,\n    }\n  }\n\n  return undefined\n}\n","import type {Node} from '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport {serializePath} from '../paths/serialize-path'\nimport type {RegisteredContainer} from '../schema/resolve-containers'\nimport {isKeyedSegment} from '../utils/util.is-keyed-segment'\nimport {getNodeChildren} from './get-children'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the node at a given path.\n *\n * The path can be either keyed (KeyedSegment + field name strings) or\n * indexed (numbers). Keyed segments are resolved by matching `_key`,\n * field name strings are skipped (they're structural), and numbers\n * are resolved by index.\n *\n * The returned path is always fully keyed, even if the input path\n * contained numeric indices.\n *\n * @beta\n */\nexport function getNode(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): {node: Node; path: Path} | undefined {\n  if (path.length === 0) {\n    return undefined\n  }\n\n  const {context, blockIndexMap} = snapshot\n  let currentChildren: Array<Node> = context.value\n  let node: Node | undefined\n  let currentParent: RegisteredContainer | undefined\n  const resolvedPath: Path = []\n\n  for (let i = 0; i < path.length; i++) {\n    const segment = path[i]\n\n    if (typeof segment === 'string') {\n      resolvedPath.push(segment)\n      continue\n    }\n\n    if (isKeyedSegment(segment)) {\n      resolvedPath.push(segment)\n      const index = blockIndexMap.get(serializePath(resolvedPath))\n      if (\n        index !== undefined &&\n        currentChildren[index]?._key === segment._key\n      ) {\n        node = currentChildren[index]\n      } else {\n        // The map can miss (unkeyed transient nodes, e.g. `{_type:'table'}`\n        // inserted by a remote patch before normalize mints a key) or\n        // disagree with the traversed value (snapshots that pair the live\n        // map with a pre-apply value, e.g. `textPatch`). Fall back to a\n        // linear scan in both cases.\n        node = currentChildren.find((child) => child._key === segment._key)\n        if (node && node._key !== undefined) {\n          resolvedPath[resolvedPath.length - 1] = {_key: node._key}\n        }\n      }\n    } else if (typeof segment === 'number') {\n      node = currentChildren.at(segment)\n      if (node) {\n        resolvedPath.push({_key: node._key})\n      }\n    } else {\n      return undefined\n    }\n\n    if (!node) {\n      return undefined\n    }\n\n    let hasMoreSegments = false\n    for (let j = i + 1; j < path.length; j++) {\n      const s = path[j]\n      if (isKeyedSegment(s) || typeof s === 'number') {\n        hasMoreSegments = true\n        break\n      }\n    }\n\n    if (hasMoreSegments) {\n      const next = getNodeChildren(context, node, currentParent)\n\n      if (!next) {\n        return undefined\n      }\n\n      currentChildren = next.children\n      currentParent = next.parent\n    }\n  }\n\n  if (!node) {\n    return undefined\n  }\n\n  return {node, path: resolvedPath}\n}\n","import {isKeyedSegment} from '../../utils/util.is-keyed-segment'\nimport type {Path} from '../interfaces/path'\n\n/**\n * Get the parent path of a path.\n *\n * Drops the last node segment (keyed or numeric) and the preceding field\n * name string.\n *\n * [{_key:'b1'}, 'children', {_key:'s1'}] → [{_key:'b1'}]\n * [{_key:'b1'}, 'children', 0]           → [{_key:'b1'}]\n * [{_key:'b1'}]                           → []\n */\nexport function parentPath(path: Path): Path {\n  if (path.length === 0) {\n    throw new Error(`Cannot get the parent path of the root path [${path}].`)\n  }\n\n  let lastNodeIndex = -1\n  for (let i = path.length - 1; i >= 0; i--) {\n    if (isKeyedSegment(path[i]) || typeof path[i] === 'number') {\n      lastNodeIndex = i\n      break\n    }\n  }\n\n  if (lastNodeIndex === -1) {\n    return []\n  }\n\n  const result = path.slice(0, lastNodeIndex)\n\n  if (result.length > 0 && typeof result[result.length - 1] === 'string') {\n    return result.slice(0, -1)\n  }\n\n  return result\n}\n","import type {PortableTextBlock} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {parentPath} from '../engine/path/parent-path'\nimport {getNode} from './get-node'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the parent of a node at a given path.\n *\n * A parent has children, so it is always a `PortableTextBlock` (text block\n * or object node).\n *\n * When `match` is provided and the parent does not satisfy it, returns\n * `undefined`.\n *\n * @beta\n */\nexport function getParent<TMatch extends PortableTextBlock>(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options: {\n    match: (node: PortableTextBlock, path: Path) => node is TMatch\n  },\n): {node: TMatch; path: Path} | undefined\n/**\n * @beta\n */\nexport function getParent(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options?: {\n    match?: (node: PortableTextBlock, path: Path) => boolean\n  },\n): {node: PortableTextBlock; path: Path} | undefined\nexport function getParent(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options?: {\n    match?: (node: PortableTextBlock, path: Path) => boolean\n  },\n): {node: PortableTextBlock; path: Path} | undefined {\n  if (path.length === 0) {\n    return undefined\n  }\n\n  const parent = parentPath(path)\n\n  if (parent.length === 0) {\n    return undefined\n  }\n\n  const entry = getNode(snapshot, parent)\n\n  if (!entry) {\n    return undefined\n  }\n\n  const result = {node: entry.node as PortableTextBlock, path: entry.path}\n\n  if (options?.match && !options.match(result.node, result.path)) {\n    return undefined\n  }\n\n  return result\n}\n"],"names":["isKeyedSegment","segment","serializePath","path","reduce","result","index","_key","isTypedObject","object","isRecord","value","getContainerChildren","containers","node","parent","resolved","resolveNodeContainer","fieldValue","field","name","Array","isArray","children","container","of","entry","type","_type","get","getChildren","snapshot","currentChildren","context","currentFieldName","currentPath","isRoot","currentParent","candidatePath","blockIndexMap","undefined","find","child","at","next","getNodeChildren","fieldName","map","isTextBlock","getNode","length","resolvedPath","i","push","hasMoreSegments","j","s","parentPath","Error","lastNodeIndex","slice","getParent","options","match"],"mappings":";AAKO,SAASA,eAAeC,SAA2C;AACxE,SAAO,OAAOA,WAAY,YAAYA,YAAY,QAAQ,UAAUA;AACtE;ACGO,SAASC,cAAcC,MAAoB;AAChD,SAAOA,KAAKC,OAAe,CAACC,QAAQJ,SAASK,UACvCN,eAAeC,OAAO,IACjB,GAAGI,MAAM,WAAWJ,QAAQM,IAAI,OAIlC,GAAGF,MAAM,GADEC,UAAU,IAAI,KAAK,GACT,GAAGL,OAAO,IACrC,EAAE;AACP;ACjBO,SAASO,cAAcC,QAAwC;AACpE,SAAOC,SAASD,MAAM,KAAK,OAAOA,OAAO,SAAa;AACxD;AAEO,SAASC,SAASC,OAAkD;AACzE,SAAO,CAAC,CAACA,UAAU,OAAOA,SAAU,YAAY,OAAOA,SAAU;AACnE;ACeO,SAASC,qBACdC,YACAC,MACAC,QAMY;AACZ,QAAMC,WAAWC,qBAAqBJ,YAAYE,QAAQD,IAAI;AAE9D,MAAI,CAACE;AACH;AAGF,QAAME,aAAcJ,KAAiCE,SAASG,MAAMC,IAAI;AAExE,MAAKC,MAAMC,QAAQJ,UAAU;AAI7B,WAAO;AAAA,MACLK,UAAUL;AAAAA,MACVM,WAAWR;AAAAA,IAAAA;AAEf;AAOA,SAASC,qBACPJ,YACAE,QACAD,MACiC;AACjC,MAAIC,QAAQU;AACV,eAAWC,SAASX,OAAOU;AACzB,UAAIC,MAAMC,SAASb,KAAKc;AAEtB,eAAI,WAAWF,QACNA,QAET;AAAA;AAIN,SAAOb,WAAWgB,IAAIf,KAAKc,KAAK;AAClC;ACtDO,SAASE,YACdC,UACA5B,MACiC;AACjC,MAAI6B,kBAA+BD,SAASE,QAAQtB,OAChDuB,mBAAmB,SACnBC,cAAoB,CAAA,GACpBC,SAAS,IACTC;AAEJ,aAAWpC,WAAWE,MAAM;AAC1B,QAAI,OAAOF,WAAY;AACrB;AAGF,QAAIa;AACJ,QAAId,eAAeC,OAAO,GAAG;AAI3B,YAAMqC,gBAAsBF,SACxB,CAAC;AAAA,QAAC7B,MAAMN,QAAQM;AAAAA,MAAAA,CAAK,IACrB,CAAC,GAAG4B,aAAaD,kBAAkB;AAAA,QAAC3B,MAAMN,QAAQM;AAAAA,MAAAA,CAAK,GACrDD,QAAQyB,SAASQ,cAAcV,IAAI3B,cAAcoC,aAAa,CAAC;AACrExB,aACER,UAAUkC,UAAaR,gBAAgB1B,KAAK,GAAGC,SAASN,QAAQM,OAC5DyB,gBAAgB1B,KAAK,IACrB0B,gBAAgBS,KAAMC,WAAUA,MAAMnC,SAASN,QAAQM,IAAI;AAAA,IACnE,MAAW,QAAON,WAAY,aAC5Ba,OAAOkB,gBAAgBW,GAAG1C,OAAO;AAGnC,QAAI,CAACa;AACH,aAAO,CAAA;AAGTqB,kBAAcC,SACV,CAAC;AAAA,MAAC7B,MAAMO,KAAKP;AAAAA,IAAAA,CAAK,IAClB,CAAC,GAAG4B,aAAaD,kBAAkB;AAAA,MAAC3B,MAAMO,KAAKP;AAAAA,IAAAA,CAAK,GACxD6B,SAAS;AAET,UAAMQ,OAAOC,gBAAgBd,SAASE,SAASnB,MAAMuB,aAAa;AAElE,QAAI,CAACO;AACH,aAAO,CAAA;AAGTZ,sBAAkBY,KAAKrB,UACvBW,mBAAmBU,KAAKE,WACxBT,gBAAgBO,KAAK7B;AAAAA,EACvB;AAEA,SAAOiB,gBAAgBe,IAAKL,CAAAA,WAAW;AAAA,IACrC5B,MAAM4B;AAAAA,IACNvC,MAAMiC,SACF,CAAC;AAAA,MAAC7B,MAAMmC,MAAMnC;AAAAA,IAAAA,CAAK,IACnB,CAAC,GAAG4B,aAAaD,kBAAkB;AAAA,MAAC3B,MAAMmC,MAAMnC;AAAAA,IAAAA,CAAK;AAAA,EAAA,EACzD;AACJ;AAkBO,SAASsC,gBACdZ,SAIAnB,MACAC,QAOY;AAEZ,MAAIiC,YAAYf,SAASnB,IAAI;AAC3B,WAAO;AAAA,MACLS,UAAUT,KAAKS;AAAAA,MACfuB,WAAW;AAAA,MACX/B,QAAQyB;AAAAA,IAAAA;AAIZ,MAAIhC,cAAcM,IAAI,GAAG;AACvB,UAAMT,SAASO,qBAAqBqB,QAAQpB,YAAYC,MAAMC,MAAM;AAEpE,QAAIV;AACF,aAAO;AAAA,QACLkB,UAAUlB,OAAOkB;AAAAA,QACjBuB,WAAWzC,OAAOmB,UAAUL,MAAMC;AAAAA,QAClCL,QAAQV,OAAOmB;AAAAA,MAAAA;AAAAA,EAGrB;AAGA,MACE,WAAWV,QACXO,MAAMC,QAAQR,KAAK,KAAQ,KAC3B,EAAE,UAAUA,SACZ,EAAE,WAAWA;AAEb,WAAO;AAAA,MACLS,UAAUT,KAAK;AAAA,MACfgC,WAAW;AAAA,MACX/B,QAAQyB;AAAAA,IAAAA;AAKd;AC5HO,SAASS,QACdlB,UACA5B,MACsC;AACtC,MAAIA,KAAK+C,WAAW;AAClB;AAGF,QAAM;AAAA,IAACjB;AAAAA,IAASM;AAAAA,EAAAA,IAAiBR;AACjC,MAAIC,kBAA+BC,QAAQtB,OACvCG,MACAuB;AACJ,QAAMc,eAAqB,CAAA;AAE3B,WAASC,IAAI,GAAGA,IAAIjD,KAAK+C,QAAQE,KAAK;AACpC,UAAMnD,UAAUE,KAAKiD,CAAC;AAEtB,QAAI,OAAOnD,WAAY,UAAU;AAC/BkD,mBAAaE,KAAKpD,OAAO;AACzB;AAAA,IACF;AAEA,QAAID,eAAeC,OAAO,GAAG;AAC3BkD,mBAAaE,KAAKpD,OAAO;AACzB,YAAMK,QAAQiC,cAAcV,IAAI3B,cAAciD,YAAY,CAAC;AAEzD7C,gBAAUkC,UACVR,gBAAgB1B,KAAK,GAAGC,SAASN,QAAQM,OAEzCO,OAAOkB,gBAAgB1B,KAAK,KAO5BQ,OAAOkB,gBAAgBS,KAAMC,CAAAA,UAAUA,MAAMnC,SAASN,QAAQM,IAAI,GAC9DO,QAAQA,KAAKP,SAASiC,WACxBW,aAAaA,aAAaD,SAAS,CAAC,IAAI;AAAA,QAAC3C,MAAMO,KAAKP;AAAAA,MAAAA;AAAAA,IAG1D,WAAW,OAAON,WAAY;AAC5Ba,aAAOkB,gBAAgBW,GAAG1C,OAAO,GAC7Ba,QACFqC,aAAaE,KAAK;AAAA,QAAC9C,MAAMO,KAAKP;AAAAA,MAAAA,CAAK;AAAA;AAGrC;AAGF,QAAI,CAACO;AACH;AAGF,QAAIwC,kBAAkB;AACtB,aAASC,IAAIH,IAAI,GAAGG,IAAIpD,KAAK+C,QAAQK,KAAK;AACxC,YAAMC,IAAIrD,KAAKoD,CAAC;AAChB,UAAIvD,eAAewD,CAAC,KAAK,OAAOA,KAAM,UAAU;AAC9CF,0BAAkB;AAClB;AAAA,MACF;AAAA,IACF;AAEA,QAAIA,iBAAiB;AACnB,YAAMV,OAAOC,gBAAgBZ,SAASnB,MAAMuB,aAAa;AAEzD,UAAI,CAACO;AACH;AAGFZ,wBAAkBY,KAAKrB,UACvBc,gBAAgBO,KAAK7B;AAAAA,IACvB;AAAA,EACF;AAEA,MAAKD;AAIL,WAAO;AAAA,MAACA;AAAAA,MAAMX,MAAMgD;AAAAA,IAAAA;AACtB;ACxFO,SAASM,WAAWtD,MAAkB;AAC3C,MAAIA,KAAK+C,WAAW;AAClB,UAAM,IAAIQ,MAAM,gDAAgDvD,IAAI,IAAI;AAG1E,MAAIwD,gBAAgB;AACpB,WAASP,IAAIjD,KAAK+C,SAAS,GAAGE,KAAK,GAAGA;AACpC,QAAIpD,eAAeG,KAAKiD,CAAC,CAAC,KAAK,OAAOjD,KAAKiD,CAAC,KAAM,UAAU;AAC1DO,sBAAgBP;AAChB;AAAA,IACF;AAGF,MAAIO,kBAAkB;AACpB,WAAO,CAAA;AAGT,QAAMtD,SAASF,KAAKyD,MAAM,GAAGD,aAAa;AAE1C,SAAItD,OAAO6C,SAAS,KAAK,OAAO7C,OAAOA,OAAO6C,SAAS,CAAC,KAAM,WACrD7C,OAAOuD,MAAM,GAAG,EAAE,IAGpBvD;AACT;ACHO,SAASwD,UACd9B,UACA5B,MACA2D,SAGmD;AACnD,MAAI3D,KAAK+C,WAAW;AAClB;AAGF,QAAMnC,SAAS0C,WAAWtD,IAAI;AAE9B,MAAIY,OAAOmC,WAAW;AACpB;AAGF,QAAMxB,QAAQuB,QAAQlB,UAAUhB,MAAM;AAEtC,MAAI,CAACW;AACH;AAGF,QAAMrB,SAAS;AAAA,IAACS,MAAMY,MAAMZ;AAAAA,IAA2BX,MAAMuB,MAAMvB;AAAAA,EAAAA;AAEnE,MAAI2D,EAAAA,SAASC,SAAS,CAACD,QAAQC,MAAM1D,OAAOS,MAAMT,OAAOF,IAAI;AAI7D,WAAOE;AACT;"}
+{"version":3,"file":"get-parent.js","sources":["../../src/utils/util.is-keyed-segment.ts","../../src/paths/serialize-path.ts","../../src/utils/asserters.ts","../../src/traversal/get-container-children.ts","../../src/traversal/get-children.ts","../../src/traversal/get-node.ts","../../src/engine/path/parent-path.ts","../../src/traversal/get-parent.ts"],"sourcesContent":["import type {KeyedSegment} from '../types/paths'\n\n/**\n * @public\n */\nexport function isKeyedSegment(segment: unknown): segment is KeyedSegment {\n  return typeof segment === 'object' && segment !== null && '_key' in segment\n}\n","import type {Path} from '../types/paths'\nimport {isKeyedSegment} from '../utils/util.is-keyed-segment'\n\n/**\n * Serialize a keyed path to a string using Sanity's bracket notation.\n *\n * - `[{_key: 'k0'}]` -> `[_key==\"k0\"]`\n * - `[{_key: 'k0'}, 'children', {_key: 's0'}]` -> `[_key==\"k0\"].children[_key==\"s0\"]`\n * - `[{_key: 't0'}, 'rows', {_key: 'r0'}, 'cells', {_key: 'c0'}, 'content', {_key: 'b0'}, 'children', {_key: 's0'}]` -> `[_key==\"t0\"].rows[_key==\"r0\"].cells[_key==\"c0\"].content[_key==\"b0\"].children[_key==\"s0\"]`\n */\nexport function serializePath(path: Path): string {\n  return path.reduce<string>((result, segment, index) => {\n    if (isKeyedSegment(segment)) {\n      return `${result}[_key==\"${segment._key}\"]`\n    }\n\n    const separator = index === 0 ? '' : '.'\n    return `${result}${separator}${segment}`\n  }, '')\n}\n","import type {TypedObject} from '@portabletext/schema'\n\nexport function isTypedObject(object: unknown): object is TypedObject {\n  return isRecord(object) && typeof object['_type'] === 'string'\n}\n\nexport function isRecord(value: unknown): value is Record<string, unknown> {\n  return !!value && (typeof value === 'object' || typeof value === 'function')\n}\n","import type {Node} from '../engine/interfaces/node'\nimport type {\n  Containers,\n  RegisteredContainer,\n} from '../schema/resolve-containers'\n\n/**\n * Resolve a container node's editable child array.\n *\n * Returns `{children, container}` for a node registered as a container:\n * `children` is the node's editable child array, and `container` is the\n * node's own container registration. Read `container.field.name` for the\n * path segment that reaches `children`, and thread `container` back in as\n * `parent` when descending into them.\n *\n * Returns `undefined` for anything that is not a container: text blocks,\n * spans, leaves, and unregistered objects. It is node-based and resolves\n * in one step with no path re-walk, so recursive descent over containers\n * is linear in nesting depth. The caller seeds the document root from\n * `context.value` itself.\n *\n * @beta\n */\nexport function getContainerChildren(\n  containers: Containers,\n  node: Node,\n  parent?: RegisteredContainer,\n):\n  | {\n      children: Array<Node>\n      container: RegisteredContainer\n    }\n  | undefined {\n  const resolved = resolveNodeContainer(containers, parent, node)\n\n  if (!resolved) {\n    return undefined\n  }\n\n  const fieldValue = (node as Record<string, unknown>)[resolved.field.name]\n\n  if (!Array.isArray(fieldValue)) {\n    return undefined\n  }\n\n  return {\n    children: fieldValue as Array<Node>,\n    container: resolved,\n  }\n}\n\n/**\n * Pick the positional override from `parent.of` if present; fall back\n * to the top-level entry. Returns only `RegisteredContainer` entries\n * since leaves do not have editable children.\n */\nfunction resolveNodeContainer(\n  containers: Containers,\n  parent: RegisteredContainer | undefined,\n  node: Node,\n): RegisteredContainer | undefined {\n  if (parent?.of) {\n    for (const entry of parent.of) {\n      if (entry.type === node._type) {\n        // Only return container entries; leaves have no editable children.\n        if ('field' in entry) {\n          return entry\n        }\n        return undefined\n      }\n    }\n  }\n  return containers.get(node._type)\n}\n","import {isTextBlock} from '@portabletext/schema'\nimport type {EditorSchema} from '../editor/editor-schema'\nimport type {Node} from '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport {serializePath} from '../paths/serialize-path'\nimport type {\n  Containers,\n  RegisteredContainer,\n} from '../schema/resolve-containers'\nimport {isTypedObject} from '../utils/asserters'\nimport {isKeyedSegment} from '../utils/util.is-keyed-segment'\nimport {getContainerChildren} from './get-container-children'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the children of a node at a given path.\n *\n * @beta\n */\nexport function getChildren(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): Array<{node: Node; path: Path}> {\n  let currentChildren: Array<Node> = snapshot.context.value\n  let currentFieldName = 'value'\n  let currentPath: Path = []\n  let isRoot = true\n  let currentParent: RegisteredContainer | undefined\n\n  for (const segment of path) {\n    if (typeof segment === 'string') {\n      continue\n    }\n\n    let node: Node | undefined\n    if (isKeyedSegment(segment)) {\n      // Resolve via `blockIndexMap` (O(1)) and fall back to a linear scan on a\n      // miss or when the snapshot's map disagrees with the value, mirroring\n      // `getNode`. The candidate path is this segment's full keyed path.\n      const candidatePath: Path = isRoot\n        ? [{_key: segment._key}]\n        : [...currentPath, currentFieldName, {_key: segment._key}]\n      const index = snapshot.blockIndexMap.get(serializePath(candidatePath))\n      node =\n        index !== undefined && currentChildren[index]?._key === segment._key\n          ? currentChildren[index]\n          : currentChildren.find((child) => child._key === segment._key)\n    } else if (typeof segment === 'number') {\n      node = currentChildren.at(segment)\n    }\n\n    if (!node) {\n      return []\n    }\n\n    currentPath = isRoot\n      ? [{_key: node._key}]\n      : [...currentPath, currentFieldName, {_key: node._key}]\n    isRoot = false\n\n    const next = getNodeChildren(snapshot.context, node, currentParent)\n\n    if (!next) {\n      return []\n    }\n\n    currentChildren = next.children\n    currentFieldName = next.fieldName\n    currentParent = next.parent\n  }\n\n  return currentChildren.map((child) => ({\n    node: child,\n    path: isRoot\n      ? [{_key: child._key}]\n      : [...currentPath, currentFieldName, {_key: child._key}],\n  }))\n}\n\n/**\n * Resolve a node's editable child array.\n *\n * When `parent` is provided and its `of` declares a positional entry\n * matching `node._type`, that positional entry's `field` is used.\n * Otherwise the top-level `containers.get(node._type)` provides the\n * fallback.\n *\n * The returned `parent` is the resolved container entry for `node`\n * itself (used by the caller to thread further descent).\n *\n * Internal descent kernel shared by the positional traversal utilities\n * (`getChildren`, `getNode`, `getNodes`, `getAncestors`); it folds the\n * text-block, container, and root-document cases. Public consumers that\n * only need to descend containers use {@link getContainerChildren}.\n */\nexport function getNodeChildren(\n  context: {\n    schema: EditorSchema\n    containers: Containers\n  },\n  node: Node | {value: Array<Node>},\n  parent?: RegisteredContainer,\n):\n  | {\n      children: Array<Node>\n      fieldName: string\n      parent: RegisteredContainer | undefined\n    }\n  | undefined {\n  // Text blocks store children in .children\n  if (isTextBlock(context, node)) {\n    return {\n      children: node.children,\n      fieldName: 'children',\n      parent: undefined,\n    }\n  }\n\n  if (isTypedObject(node)) {\n    const result = getContainerChildren(context.containers, node, parent)\n\n    if (result) {\n      return {\n        children: result.children,\n        fieldName: result.container.field.name,\n        parent: result.container,\n      }\n    }\n  }\n\n  // Root context: has .value array but no _key or _type\n  if (\n    'value' in node &&\n    Array.isArray(node['value']) &&\n    !('_key' in node) &&\n    !('_type' in node)\n  ) {\n    return {\n      children: node['value'] as Array<Node>,\n      fieldName: 'value',\n      parent: undefined,\n    }\n  }\n\n  return undefined\n}\n","import type {Node} from '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport {serializePath} from '../paths/serialize-path'\nimport type {RegisteredContainer} from '../schema/resolve-containers'\nimport {isKeyedSegment} from '../utils/util.is-keyed-segment'\nimport {getNodeChildren} from './get-children'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the node at a given path.\n *\n * The path can be either keyed (KeyedSegment + field name strings) or\n * indexed (numbers). Keyed segments are resolved by matching `_key`,\n * field name strings name a structural descent into the previous\n * node's children, and numbers are resolved by index.\n *\n * The returned `path` always identifies the returned node: it's fully\n * keyed (numeric indices are converted to `KeyedSegment`s) and any\n * trailing segments in the input that point outside the value tree —\n * e.g. an object node's primitive field, or an annotation reached via\n * `'markDefs'` on a text block — are stripped so that\n * `getNode(snapshot, entry.path).node === entry.node`.\n *\n * The walk stops when a string segment names a field that isn't the\n * current node's structural child array. Annotations live in\n * `markDefs` on a text block, alongside `children` rather than inside\n * it, so `getNode` resolves an annotation path to the enclosing text\n * block. Use `getAnnotation` to resolve the annotation itself.\n *\n * @beta\n */\nexport function getNode(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): {node: Node; path: Path} | undefined {\n  if (path.length === 0) {\n    return undefined\n  }\n\n  const {context, blockIndexMap} = snapshot\n  let currentChildren: Array<Node> = context.value\n  let currentFieldName: string | undefined\n  let node: Node | undefined\n  let currentParent: RegisteredContainer | undefined\n  const resolvedPath: Path = []\n\n  for (let i = 0; i < path.length; i++) {\n    const segment = path[i]\n\n    if (typeof segment === 'string') {\n      // A string segment names a structural descent. If it matches the\n      // field name produced by the previous node's `getNodeChildren`,\n      // it's part of the value-tree descent — push it and continue.\n      // Otherwise the string names a sidecar field (markDefs on a text\n      // block, a primitive field on an object). If the input keeps\n      // digging past it with more keyed/numeric segments, the caller\n      // wanted a node inside the sidecar and `getNode` can't reach it\n      // (use `getAnnotation` for annotations); return undefined.\n      // Otherwise the rest is just trailing field names — let the loop\n      // exit and the post-loop strip remove them.\n      if (currentFieldName !== undefined && segment === currentFieldName) {\n        resolvedPath.push(segment)\n        continue\n      }\n      for (let j = i + 1; j < path.length; j++) {\n        const s = path[j]\n        if (isKeyedSegment(s) || typeof s === 'number') {\n          return undefined\n        }\n      }\n      break\n    }\n\n    if (isKeyedSegment(segment)) {\n      resolvedPath.push(segment)\n      const index = blockIndexMap.get(serializePath(resolvedPath))\n      if (\n        index !== undefined &&\n        currentChildren[index]?._key === segment._key\n      ) {\n        node = currentChildren[index]\n      } else {\n        // The map can miss (unkeyed transient nodes, e.g. `{_type:'table'}`\n        // inserted by a remote patch before normalize mints a key) or\n        // disagree with the traversed value (snapshots that pair the live\n        // map with a pre-apply value, e.g. `textPatch`). Fall back to a\n        // linear scan in both cases.\n        node = currentChildren.find((child) => child._key === segment._key)\n        if (node && node._key !== undefined) {\n          resolvedPath[resolvedPath.length - 1] = {_key: node._key}\n        }\n      }\n    } else if (typeof segment === 'number') {\n      node = currentChildren.at(segment)\n      if (node) {\n        resolvedPath.push({_key: node._key})\n      }\n    } else {\n      return undefined\n    }\n\n    if (!node) {\n      return undefined\n    }\n\n    let hasMoreSegments = false\n    for (let j = i + 1; j < path.length; j++) {\n      const s = path[j]\n      if (isKeyedSegment(s) || typeof s === 'number') {\n        hasMoreSegments = true\n        break\n      }\n    }\n\n    if (hasMoreSegments) {\n      const next = getNodeChildren(context, node, currentParent)\n\n      if (!next) {\n        return undefined\n      }\n\n      currentChildren = next.children\n      currentFieldName = next.fieldName\n      currentParent = next.parent\n    } else {\n      currentFieldName = undefined\n    }\n  }\n\n  if (!node) {\n    return undefined\n  }\n\n  // Strip trailing field-name segments. The walker may have pushed\n  // matching field names during structural descent; if the deepest\n  // reached keyed segment was the last keyed segment in the input,\n  // any further field names that followed are part of the input but\n  // don't identify the returned node.\n  while (\n    resolvedPath.length > 0 &&\n    typeof resolvedPath[resolvedPath.length - 1] === 'string'\n  ) {\n    resolvedPath.pop()\n  }\n\n  return {node, path: resolvedPath}\n}\n","import {isKeyedSegment} from '../../utils/util.is-keyed-segment'\nimport type {Path} from '../interfaces/path'\n\n/**\n * Get the parent path of a path.\n *\n * Drops the last node segment (keyed or numeric) and the preceding field\n * name string.\n *\n * [{_key:'b1'}, 'children', {_key:'s1'}] → [{_key:'b1'}]\n * [{_key:'b1'}, 'children', 0]           → [{_key:'b1'}]\n * [{_key:'b1'}]                           → []\n */\nexport function parentPath(path: Path): Path {\n  if (path.length === 0) {\n    throw new Error(`Cannot get the parent path of the root path [${path}].`)\n  }\n\n  let lastNodeIndex = -1\n  for (let i = path.length - 1; i >= 0; i--) {\n    if (isKeyedSegment(path[i]) || typeof path[i] === 'number') {\n      lastNodeIndex = i\n      break\n    }\n  }\n\n  if (lastNodeIndex === -1) {\n    return []\n  }\n\n  const result = path.slice(0, lastNodeIndex)\n\n  if (result.length > 0 && typeof result[result.length - 1] === 'string') {\n    return result.slice(0, -1)\n  }\n\n  return result\n}\n","import type {PortableTextBlock} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {parentPath} from '../engine/path/parent-path'\nimport {getNode} from './get-node'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the parent of a node at a given path.\n *\n * A parent has children, so it is always a `PortableTextBlock` (text block\n * or object node).\n *\n * When `match` is provided and the parent does not satisfy it, returns\n * `undefined`.\n *\n * @beta\n */\nexport function getParent<TMatch extends PortableTextBlock>(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options: {\n    match: (node: PortableTextBlock, path: Path) => node is TMatch\n  },\n): {node: TMatch; path: Path} | undefined\n/**\n * @beta\n */\nexport function getParent(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options?: {\n    match?: (node: PortableTextBlock, path: Path) => boolean\n  },\n): {node: PortableTextBlock; path: Path} | undefined\nexport function getParent(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options?: {\n    match?: (node: PortableTextBlock, path: Path) => boolean\n  },\n): {node: PortableTextBlock; path: Path} | undefined {\n  if (path.length === 0) {\n    return undefined\n  }\n\n  const parent = parentPath(path)\n\n  if (parent.length === 0) {\n    return undefined\n  }\n\n  const entry = getNode(snapshot, parent)\n\n  if (!entry) {\n    return undefined\n  }\n\n  const result = {node: entry.node as PortableTextBlock, path: entry.path}\n\n  if (options?.match && !options.match(result.node, result.path)) {\n    return undefined\n  }\n\n  return result\n}\n"],"names":["isKeyedSegment","segment","serializePath","path","reduce","result","index","_key","isTypedObject","object","isRecord","value","getContainerChildren","containers","node","parent","resolved","resolveNodeContainer","fieldValue","field","name","Array","isArray","children","container","of","entry","type","_type","get","getChildren","snapshot","currentChildren","context","currentFieldName","currentPath","isRoot","currentParent","candidatePath","blockIndexMap","undefined","find","child","at","next","getNodeChildren","fieldName","map","isTextBlock","getNode","length","resolvedPath","i","push","j","s","hasMoreSegments","pop","parentPath","Error","lastNodeIndex","slice","getParent","options","match"],"mappings":";AAKO,SAASA,eAAeC,SAA2C;AACxE,SAAO,OAAOA,WAAY,YAAYA,YAAY,QAAQ,UAAUA;AACtE;ACGO,SAASC,cAAcC,MAAoB;AAChD,SAAOA,KAAKC,OAAe,CAACC,QAAQJ,SAASK,UACvCN,eAAeC,OAAO,IACjB,GAAGI,MAAM,WAAWJ,QAAQM,IAAI,OAIlC,GAAGF,MAAM,GADEC,UAAU,IAAI,KAAK,GACT,GAAGL,OAAO,IACrC,EAAE;AACP;ACjBO,SAASO,cAAcC,QAAwC;AACpE,SAAOC,SAASD,MAAM,KAAK,OAAOA,OAAO,SAAa;AACxD;AAEO,SAASC,SAASC,OAAkD;AACzE,SAAO,CAAC,CAACA,UAAU,OAAOA,SAAU,YAAY,OAAOA,SAAU;AACnE;ACeO,SAASC,qBACdC,YACAC,MACAC,QAMY;AACZ,QAAMC,WAAWC,qBAAqBJ,YAAYE,QAAQD,IAAI;AAE9D,MAAI,CAACE;AACH;AAGF,QAAME,aAAcJ,KAAiCE,SAASG,MAAMC,IAAI;AAExE,MAAKC,MAAMC,QAAQJ,UAAU;AAI7B,WAAO;AAAA,MACLK,UAAUL;AAAAA,MACVM,WAAWR;AAAAA,IAAAA;AAEf;AAOA,SAASC,qBACPJ,YACAE,QACAD,MACiC;AACjC,MAAIC,QAAQU;AACV,eAAWC,SAASX,OAAOU;AACzB,UAAIC,MAAMC,SAASb,KAAKc;AAEtB,eAAI,WAAWF,QACNA,QAET;AAAA;AAIN,SAAOb,WAAWgB,IAAIf,KAAKc,KAAK;AAClC;ACtDO,SAASE,YACdC,UACA5B,MACiC;AACjC,MAAI6B,kBAA+BD,SAASE,QAAQtB,OAChDuB,mBAAmB,SACnBC,cAAoB,CAAA,GACpBC,SAAS,IACTC;AAEJ,aAAWpC,WAAWE,MAAM;AAC1B,QAAI,OAAOF,WAAY;AACrB;AAGF,QAAIa;AACJ,QAAId,eAAeC,OAAO,GAAG;AAI3B,YAAMqC,gBAAsBF,SACxB,CAAC;AAAA,QAAC7B,MAAMN,QAAQM;AAAAA,MAAAA,CAAK,IACrB,CAAC,GAAG4B,aAAaD,kBAAkB;AAAA,QAAC3B,MAAMN,QAAQM;AAAAA,MAAAA,CAAK,GACrDD,QAAQyB,SAASQ,cAAcV,IAAI3B,cAAcoC,aAAa,CAAC;AACrExB,aACER,UAAUkC,UAAaR,gBAAgB1B,KAAK,GAAGC,SAASN,QAAQM,OAC5DyB,gBAAgB1B,KAAK,IACrB0B,gBAAgBS,KAAMC,WAAUA,MAAMnC,SAASN,QAAQM,IAAI;AAAA,IACnE,MAAW,QAAON,WAAY,aAC5Ba,OAAOkB,gBAAgBW,GAAG1C,OAAO;AAGnC,QAAI,CAACa;AACH,aAAO,CAAA;AAGTqB,kBAAcC,SACV,CAAC;AAAA,MAAC7B,MAAMO,KAAKP;AAAAA,IAAAA,CAAK,IAClB,CAAC,GAAG4B,aAAaD,kBAAkB;AAAA,MAAC3B,MAAMO,KAAKP;AAAAA,IAAAA,CAAK,GACxD6B,SAAS;AAET,UAAMQ,OAAOC,gBAAgBd,SAASE,SAASnB,MAAMuB,aAAa;AAElE,QAAI,CAACO;AACH,aAAO,CAAA;AAGTZ,sBAAkBY,KAAKrB,UACvBW,mBAAmBU,KAAKE,WACxBT,gBAAgBO,KAAK7B;AAAAA,EACvB;AAEA,SAAOiB,gBAAgBe,IAAKL,CAAAA,WAAW;AAAA,IACrC5B,MAAM4B;AAAAA,IACNvC,MAAMiC,SACF,CAAC;AAAA,MAAC7B,MAAMmC,MAAMnC;AAAAA,IAAAA,CAAK,IACnB,CAAC,GAAG4B,aAAaD,kBAAkB;AAAA,MAAC3B,MAAMmC,MAAMnC;AAAAA,IAAAA,CAAK;AAAA,EAAA,EACzD;AACJ;AAkBO,SAASsC,gBACdZ,SAIAnB,MACAC,QAOY;AAEZ,MAAIiC,YAAYf,SAASnB,IAAI;AAC3B,WAAO;AAAA,MACLS,UAAUT,KAAKS;AAAAA,MACfuB,WAAW;AAAA,MACX/B,QAAQyB;AAAAA,IAAAA;AAIZ,MAAIhC,cAAcM,IAAI,GAAG;AACvB,UAAMT,SAASO,qBAAqBqB,QAAQpB,YAAYC,MAAMC,MAAM;AAEpE,QAAIV;AACF,aAAO;AAAA,QACLkB,UAAUlB,OAAOkB;AAAAA,QACjBuB,WAAWzC,OAAOmB,UAAUL,MAAMC;AAAAA,QAClCL,QAAQV,OAAOmB;AAAAA,MAAAA;AAAAA,EAGrB;AAGA,MACE,WAAWV,QACXO,MAAMC,QAAQR,KAAK,KAAQ,KAC3B,EAAE,UAAUA,SACZ,EAAE,WAAWA;AAEb,WAAO;AAAA,MACLS,UAAUT,KAAK;AAAA,MACfgC,WAAW;AAAA,MACX/B,QAAQyB;AAAAA,IAAAA;AAKd;AClHO,SAASS,QACdlB,UACA5B,MACsC;AACtC,MAAIA,KAAK+C,WAAW;AAClB;AAGF,QAAM;AAAA,IAACjB;AAAAA,IAASM;AAAAA,EAAAA,IAAiBR;AACjC,MAAIC,kBAA+BC,QAAQtB,OACvCuB,kBACApB,MACAuB;AACJ,QAAMc,eAAqB,CAAA;AAE3B,WAASC,IAAI,GAAGA,IAAIjD,KAAK+C,QAAQE,KAAK;AACpC,UAAMnD,UAAUE,KAAKiD,CAAC;AAEtB,QAAI,OAAOnD,WAAY,UAAU;AAW/B,UAAIiC,qBAAqBM,UAAavC,YAAYiC,kBAAkB;AAClEiB,qBAAaE,KAAKpD,OAAO;AACzB;AAAA,MACF;AACA,eAASqD,IAAIF,IAAI,GAAGE,IAAInD,KAAK+C,QAAQI,KAAK;AACxC,cAAMC,IAAIpD,KAAKmD,CAAC;AAChB,YAAItD,eAAeuD,CAAC,KAAK,OAAOA,KAAM;AACpC;AAAA,MAEJ;AACA;AAAA,IACF;AAEA,QAAIvD,eAAeC,OAAO,GAAG;AAC3BkD,mBAAaE,KAAKpD,OAAO;AACzB,YAAMK,QAAQiC,cAAcV,IAAI3B,cAAciD,YAAY,CAAC;AAEzD7C,gBAAUkC,UACVR,gBAAgB1B,KAAK,GAAGC,SAASN,QAAQM,OAEzCO,OAAOkB,gBAAgB1B,KAAK,KAO5BQ,OAAOkB,gBAAgBS,KAAMC,CAAAA,UAAUA,MAAMnC,SAASN,QAAQM,IAAI,GAC9DO,QAAQA,KAAKP,SAASiC,WACxBW,aAAaA,aAAaD,SAAS,CAAC,IAAI;AAAA,QAAC3C,MAAMO,KAAKP;AAAAA,MAAAA;AAAAA,IAG1D,WAAW,OAAON,WAAY;AAC5Ba,aAAOkB,gBAAgBW,GAAG1C,OAAO,GAC7Ba,QACFqC,aAAaE,KAAK;AAAA,QAAC9C,MAAMO,KAAKP;AAAAA,MAAAA,CAAK;AAAA;AAGrC;AAGF,QAAI,CAACO;AACH;AAGF,QAAI0C,kBAAkB;AACtB,aAASF,IAAIF,IAAI,GAAGE,IAAInD,KAAK+C,QAAQI,KAAK;AACxC,YAAMC,IAAIpD,KAAKmD,CAAC;AAChB,UAAItD,eAAeuD,CAAC,KAAK,OAAOA,KAAM,UAAU;AAC9CC,0BAAkB;AAClB;AAAA,MACF;AAAA,IACF;AAEA,QAAIA,iBAAiB;AACnB,YAAMZ,OAAOC,gBAAgBZ,SAASnB,MAAMuB,aAAa;AAEzD,UAAI,CAACO;AACH;AAGFZ,wBAAkBY,KAAKrB,UACvBW,mBAAmBU,KAAKE,WACxBT,gBAAgBO,KAAK7B;AAAAA,IACvB;AACEmB,yBAAmBM;AAAAA,EAEvB;AAEA,MAAK1B,MASL;AAAA,WACEqC,aAAaD,SAAS,KACtB,OAAOC,aAAaA,aAAaD,SAAS,CAAC,KAAM;AAEjDC,mBAAaM,IAAAA;AAGf,WAAO;AAAA,MAAC3C;AAAAA,MAAMX,MAAMgD;AAAAA,IAAAA;AAAAA,EAAY;AAClC;ACrIO,SAASO,WAAWvD,MAAkB;AAC3C,MAAIA,KAAK+C,WAAW;AAClB,UAAM,IAAIS,MAAM,gDAAgDxD,IAAI,IAAI;AAG1E,MAAIyD,gBAAgB;AACpB,WAASR,IAAIjD,KAAK+C,SAAS,GAAGE,KAAK,GAAGA;AACpC,QAAIpD,eAAeG,KAAKiD,CAAC,CAAC,KAAK,OAAOjD,KAAKiD,CAAC,KAAM,UAAU;AAC1DQ,sBAAgBR;AAChB;AAAA,IACF;AAGF,MAAIQ,kBAAkB;AACpB,WAAO,CAAA;AAGT,QAAMvD,SAASF,KAAK0D,MAAM,GAAGD,aAAa;AAE1C,SAAIvD,OAAO6C,SAAS,KAAK,OAAO7C,OAAOA,OAAO6C,SAAS,CAAC,KAAM,WACrD7C,OAAOwD,MAAM,GAAG,EAAE,IAGpBxD;AACT;ACHO,SAASyD,UACd/B,UACA5B,MACA4D,SAGmD;AACnD,MAAI5D,KAAK+C,WAAW;AAClB;AAGF,QAAMnC,SAAS2C,WAAWvD,IAAI;AAE9B,MAAIY,OAAOmC,WAAW;AACpB;AAGF,QAAMxB,QAAQuB,QAAQlB,UAAUhB,MAAM;AAEtC,MAAI,CAACW;AACH;AAGF,QAAMrB,SAAS;AAAA,IAACS,MAAMY,MAAMZ;AAAAA,IAA2BX,MAAMuB,MAAMvB;AAAAA,EAAAA;AAEnE,MAAI4D,EAAAA,SAASC,SAAS,CAACD,QAAQC,MAAM3D,OAAOS,MAAMT,OAAOF,IAAI;AAI7D,WAAOE;AACT;"}

package/lib/traversal/index.d.ts

@@ -48,6 +48,21 @@ declare function getAncestors(snapshot: TraversalSnapshot, path: Path): Array<{
   node: PortableTextBlock;
   path: Path;
 }>;
+/**
+ * Get the annotation at a given path.
+ *
+ * Annotations live in `markDefs` on a text block, alongside `children`
+ * rather than inside it, so they aren't reachable through `getNode`.
+ * `getAnnotation` resolves a path of the shape
+ * `[..., {_key: block}, 'markDefs', {_key: annotation}, ...]` to the
+ * annotation node on the enclosing text block.
+ *
+ * @beta
+ */
+declare function getAnnotation(snapshot: TraversalSnapshot, path: Path): {
+  node: PortableTextObject;
+  path: Path;
+} | undefined;
 /**
  * Determine if a node at the given path is a block.
  *
@@ -172,11 +187,21 @@ declare function getLeaf(snapshot: TraversalSnapshot, path: Path, options: {
  *
  * The path can be either keyed (KeyedSegment + field name strings) or
  * indexed (numbers). Keyed segments are resolved by matching `_key`,
- * field name strings are skipped (they're structural), and numbers
- * are resolved by index.
- *
- * The returned path is always fully keyed, even if the input path
- * contained numeric indices.
+ * field name strings name a structural descent into the previous
+ * node's children, and numbers are resolved by index.
+ *
+ * The returned `path` always identifies the returned node: it's fully
+ * keyed (numeric indices are converted to `KeyedSegment`s) and any
+ * trailing segments in the input that point outside the value tree —
+ * e.g. an object node's primitive field, or an annotation reached via
+ * `'markDefs'` on a text block — are stripped so that
+ * `getNode(snapshot, entry.path).node === entry.node`.
+ *
+ * The walk stops when a string segment names a field that isn't the
+ * current node's structural child array. Annotations live in
+ * `markDefs` on a text block, alongside `children` rather than inside
+ * it, so `getNode` resolves an annotation path to the enclosing text
+ * block. Use `getAnnotation` to resolve the annotation itself.
  *
  * @beta
  */
@@ -367,5 +392,5 @@ declare function isLeafObject(snapshot: TraversalSnapshot, node: unknown, path:
  * @beta
  */
 declare function isObject(snapshot: TraversalSnapshot, node: unknown): node is PortableTextObject;
-export { comparePoints, getAncestor, getAncestors, getBlock, getChildren, getContainerChildren, getEnclosingBlock, getFirstChild, getLastChild, getLeaf, getNode, getParent, getPathSubSchema, getSibling, getSpan, getText, getTextBlock, getUnionSchema, hasNode, isBlock, isInline, isLeafObject, isObject, pathContains, rangeIntersects };
+export { comparePoints, getAncestor, getAncestors, getAnnotation, getBlock, getChildren, getContainerChildren, getEnclosingBlock, getFirstChild, getLastChild, getLeaf, getNode, getParent, getPathSubSchema, getSibling, getSpan, getText, getTextBlock, getUnionSchema, hasNode, isBlock, isInline, isLeafObject, isObject, pathContains, rangeIntersects };
 //# sourceMappingURL=index.d.ts.map

package/lib/traversal/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","names":[],"sources":["../../src/traversal/get-ancestor.ts","../../src/traversal/get-ancestors.ts","../../src/traversal/is-block.ts","../../src/traversal/get-children.ts","../../src/traversal/get-container-children.ts","../../src/traversal/get-enclosing-block.ts","../../src/traversal/get-first-child.ts","../../src/traversal/get-last-child.ts","../../src/traversal/get-leaf.ts","../../src/traversal/get-node.ts","../../src/traversal/get-parent.ts","../../src/traversal/get-path-sub-schema.ts","../../src/traversal/get-sibling.ts","../../src/traversal/compare-points.ts","../../src/traversal/path-contains.ts","../../src/traversal/range-intersects.ts","../../src/traversal/get-span.ts","../../src/traversal/get-text.ts","../../src/traversal/get-text-block.ts","../../src/traversal/get-union-schema.ts","../../src/traversal/has-node.ts","../../src/traversal/is-inline.ts","../../src/traversal/is-leaf-object.ts","../../src/traversal/is-object.ts"],"sourcesContent":[],"mappings":";;AAgBA;;;;;;;;;;AAWA;AACY,iBAZI,WAYJ,CAAA,eAZ+B,iBAY/B,CAAA,CAAA,QAAA,EAXA,iBAWA,EAAA,IAAA,EAVJ,IAUI,EAAA,OAAA,EAAA;EACJ,KAAA,EAAA,CAAA,IAAA,EATU,iBASV,EAAA,IAAA,EATmC,IASnC,EAAA,GAAA,IAAA,IAToD,MASpD;EAEU,IAAA,CAAA,EAAA,QAAA,GAAA,SAAA;CAAyB,CAAA,EAAA;EAGjC,IAAA,EAXA,MAWA;EAAyB,IAAA,EAXX,IAWW;CAAI,GAAA,SAAA;;ACTvC;;AAEQ,iBDAQ,WAAA,CCAR,QAAA,EDCI,iBCDJ,EAAA,IAAA,EDEA,ICFA,EAAA,OAAA,EAAA;EACQ,KAAA,EAAA,CAAA,IAAA,EDGE,iBCHF,EAAA,IAAA,EDG2B,ICH3B,EAAA,GAAA,OAAA;EAAyB,IAAA,CAAA,EAAA,QAAA,GAAA,SAAA;CAAtC,CAAA,EAAA;EAAK,IAAA,EDME,iBCNF;QDM2B;AEhBnC,CAAA,GAAgB,SAAA;AFFhB;;;;;;;;;;AAWA;;;;;;AAOmC,iBCTnB,YAAA,CDSmB,QAAA,ECRvB,iBDQuB,EAAA,IAAA,ECP3B,IDO2B,CAAA,ECNhC,KDMgC,CAAA;EAAI,IAAA,ECNvB,iBDMuB;QCNE;AAHzC,CAAA,CAAA;ADTA;;;;;;;;;;AAWgB,iBETA,OAAA,CFSW,QAAA,EETO,iBFSP,EAAA,IAAA,EETgC,IFShC,CAAA,EAAA,OAAA;;;;;;;;;ACFX,iBCWA,QAAA,CDXY,QAAA,ECYhB,iBDZgB,EAAA,IAAA,ECapB,IDboB,CAAA,EAAA;EAChB,IAAA,ECaF,iBDbE;EACJ,IAAA,ECY2B,IDZ3B;CACQ,GAAA,SAAA;;;;;;ADLN,iBGJM,WAAA,CHIN,QAAA,EGHE,iBHGF,EAAA,IAAA,EGFF,IHEE,CAAA,EGDP,KHCO,CAAA;EAAc,IAAA,EGDR,IHCQ;EAAI,IAAA,EGDA,IHCA;AAI5B,CAAA,CAAA;;AAXA;;;;;;;;;;AAWA;;;;;;AAOmC,iBIXnB,oBAAA,CJWmB,UAAA,EIVrB,UJUqB,EAAA,IAAA,EIT3B,IJS2B,EAAA,MAAA,CAAA,EIRxB,mBJQwB,CAAA,EAAA;EAAI,QAAA,EILvB,KJKuB,CILjB,IJKiB,CAAA;aIJtB;AHLjB,CAAA,GAAgB,SAAA;ADThB;;;;;;;;;;AAWA;;;;;;;;iBKHgB,iCAAiC,6BACrC,yBACJ;EJDQ,KAAA,EAAA,CAAA,IAAA,EIGE,iBJHU,EAAA,IAAA,EIGe,IJHf,EAAA,GAAA,IAAA,IIGgC,MJHhC;EAChB,IAAA,CAAA,EAAA,QAAA,GAAA,SAAA;CACJ,CAAA,EAAA;EACQ,IAAA,EIGN,MJHM;EAAyB,IAAA,EIGjB,IJHiB;CAAtC,GAAA,SAAA;;;ACVH;AAkBgB,iBGDA,iBAAA,CHCQ,QAAA,EGAZ,iBHAY,EAAA,IAAA,EGChB,IHDgB,EAAA,OAGd,CAHc,EAAA;EACZ,KAAA,CAAA,EAAA,CAAA,IAAA,EGEO,iBHFP,EAAA,IAAA,EGEgC,IHFhC,EAAA,GAAA,OAAA;EACJ,IAAA,CAAA,EAAA,QAAA,GAAA,SAAA;CACE,CAAA,EAAA;EAAyB,IAAA,EGGzB,iBHHyB;EAAI,IAAA,EGGJ,IHHI;;AFvBvC;;;;;AAI2C,iBMV3B,aAAA,CNU2B,QAAA,EMT/B,iBNS+B,EAAA,IAAA,EMRnC,INQmC,CAAA,EAAA;EAAiB,IAAA,EMPlD,INOkD;EAGlD,IAAA,EMVY,INUZ;CAAc,GAAA,SAAA;AAPxB;;;;;AAI2C,iBOV3B,YAAA,CPU2B,QAAA,EOT/B,iBPS+B,EAAA,IAAA,EORnC,IPQmC,CAAA,EAAA;EAAiB,IAAA,EOPlD,IPOkD;EAGlD,IAAA,EOVY,IPUZ;CAAc,GAAA,SAAA;AAPxB;;;;;;;AAOU,iBQVM,OAAA,CRUN,QAAA,EQTE,iBRSF,EAAA,IAAA,EQRF,IRQE,EAAA,OAAA,EAAA;EAAc,IAAA,EAAA,OAAA,GAAA,KAAA;CAAI,CAAA,EAAA;EAIZ,IAAA,EQVN,IRUM;EACJ,IAAA,EQXU,IRWV;CACJ,GAAA,SAAA;AAbR;;;;;;;;;;AAWA;;;AAIkB,iBSVF,OAAA,CTUE,QAAA,ESTN,iBTSM,EAAA,IAAA,ESRV,ITQU,CAAA,EAAA;EAAyB,IAAA,ESPjC,ITOiC;EAGjC,IAAA,ESVY,ITUZ;CAAyB,GAAA,SAAA;AAlBnC;;;;;;;;;;AAWA;AACY,iBUXI,SVWJ,CAAA,eUX6B,iBVW7B,CAAA,CAAA,QAAA,EUVA,iBVUA,EAAA,IAAA,EUTJ,IVSI,EAAA,OAAA,EAAA;EACJ,KAAA,EAAA,CAAA,IAAA,EURU,iBVQV,EAAA,IAAA,EURmC,IVQnC,EAAA,GAAA,IAAA,IURoD,MVQpD;CAEU,CAAA,EAAA;EAAyB,IAAA,EURjC,MVQiC;EAGjC,IAAA,EUXc,IVWd;CAAyB,GAAA,SAAA;;;ACTnC;AACY,iBSCI,SAAA,CTDJ,QAAA,ESEA,iBTFA,EAAA,IAAA,ESGJ,ITHI,EAAA,OAEI,CAFJ,EAAA;EACJ,KAAA,CAAA,EAAA,CAAA,IAAA,ESIW,iBTJX,EAAA,IAAA,ESIoC,ITJpC,EAAA,GAAA,OAAA;CACQ,CAAA,EAAA;EAAyB,IAAA,ESK/B,iBTL+B;EAAtC,IAAA,ESKgC,ITLhC;CAAK,GAAA,SAAA;ADZR;;;;;;;;;;AAWgB,iBWZA,gBAAA,CXYW,QAAA,EWXf,iBXWe,EAAA,IAAA,EWVnB,IXUmB,CAAA,EWTxB,MXSwB;AAX3B;;;;;;;;;;AAWA;AACY,iBYTI,UZSJ,CAAA,eYT8B,IZS9B,CAAA,CAAA,QAAA,EYRA,iBZQA,EAAA,IAAA,EYPJ,IZOI,EAAA,OAAA,EAAA;EACJ,SAAA,EAAA,MAAA,GAAA,UAAA;EAEU,KAAA,EAAA,CAAA,IAAA,EYPA,IZOA,EAAA,IAAA,EYPY,IZOZ,EAAA,GAAA,IAAA,IYP6B,MZO7B;CAAyB,CAAA,EAAA;EAGjC,IAAA,EYRA,MZQA;EAAyB,IAAA,EYRX,IZQW;CAAI,GAAA,SAAA;;ACTvC;;AAEQ,iBWGQ,UAAA,CXHR,QAAA,EWII,iBXJJ,EAAA,IAAA,EWKA,IXLA,EAAA,OAAA,EAAA;EACQ,SAAA,EAAA,MAAA,GAAA,UAAA;EAAyB,KAAA,CAAA,EAAA,CAAA,IAAA,EWOtB,IXPsB,EAAA,IAAA,EWOV,IXPU,EAAA,GAAA,OAAA;CAAtC,CAAA,EAAA;EAAK,IAAA,EWSE,IXTF;QWSc;AVnBtB,CAAA,GAAgB,SAAA;;AFFhB;;;;;;;;;;AAWA;AACY,iBaZI,aAAA,CbYJ,QAAA,EaXA,iBbWA,EAAA,MAAA,EaVF,oBbUE,EAAA,MAAA,EaTF,oBbSE,CAAA,EAAA,CAAA,CAAA,GAAA,CAAA,GAAA,CAAA;;;AAZZ;;;;AAIkB,iBcXF,YAAA,CdWE,QAAA,EcXqB,IdWrB,EAAA,UAAA,EcXuC,IdWvC,CAAA,EAAA,OAAA;AAJlB;;;;;;;;;;AAWA;;;;;;;;iBeEgB,eAAA,WACJ,0BACH,yBACC,OAAO,uBAAuB;AfhBxC;;;;;AAI2C,iBgBV3B,OAAA,ChBU2B,QAAA,EgBT/B,iBhBS+B,EAAA,IAAA,EgBRnC,IhBQmC,CAAA,EAAA;EAAiB,IAAA,EgBPlD,gBhBOkD;EAGlD,IAAA,EgBVwB,IhBUxB;CAAc,GAAA,SAAA;;AAPxB;;;;AAIkB,iBiBTF,OAAA,CjBSE,QAAA,EiBRN,iBjBQM,EAAA,IAAA,EiBPV,IjBOU,CAAA,EAAA,MAAA,GAAA,SAAA;AAJlB;;;;;AAI2C,iBkBV3B,YAAA,ClBU2B,QAAA,EkBT/B,iBlBS+B,EAAA,IAAA,EkBRnC,IlBQmC,CAAA,EAAA;EAAiB,IAAA,EkBPlD,qBlBOkD;EAGlD,IAAA,EkBV6B,IlBU7B;CAAc,GAAA,SAAA;;AAPxB;;;;;;;;;;AAWA;;;;;;;;;ACFA;;;;AAGyC,iBkBDzB,cAAA,ClBCyB,MAAA,EkBDF,MlBCE,EAAA,UAAA,EkBDkB,UlBClB,CAAA,EkBD+B,MlBC/B;;ADZzC;;;;AAIkB,iBoBXF,OAAA,CpBWE,QAAA,EoBXgB,iBpBWhB,EAAA,IAAA,EoBXyC,IpBWzC,CAAA,EAAA,OAAA;;AAJlB;;;;;;;AAOU,iBqBXM,QAAA,CrBWN,QAAA,EqBXyB,iBrBWzB,EAAA,IAAA,EqBXkD,IrBWlD,CAAA,EAAA,OAAA;AAPV;;;;;;;;AAOwB,iBsBTR,YAAA,CtBSQ,QAAA,EsBRZ,iBtBQY,EAAA,IAAA,EAAA,OAAA,EAAA,IAAA,EsBNhB,ItBMgB,CAAA,EAAA,IAAA,IsBLb,kBtBKa;;AAPxB;;;;AAIkB,iBuBXF,QAAA,CvBWE,QAAA,EuBVN,iBvBUM,EAAA,IAAA,EAAA,OAAA,CAAA,EAAA,IAAA,IuBRP,kBvBQO"}
+{"version":3,"file":"index.d.ts","names":[],"sources":["../../src/traversal/get-ancestor.ts","../../src/traversal/get-ancestors.ts","../../src/traversal/get-annotation.ts","../../src/traversal/is-block.ts","../../src/traversal/get-children.ts","../../src/traversal/get-container-children.ts","../../src/traversal/get-enclosing-block.ts","../../src/traversal/get-first-child.ts","../../src/traversal/get-last-child.ts","../../src/traversal/get-leaf.ts","../../src/traversal/get-node.ts","../../src/traversal/get-parent.ts","../../src/traversal/get-path-sub-schema.ts","../../src/traversal/get-sibling.ts","../../src/traversal/compare-points.ts","../../src/traversal/path-contains.ts","../../src/traversal/range-intersects.ts","../../src/traversal/get-span.ts","../../src/traversal/get-text.ts","../../src/traversal/get-text-block.ts","../../src/traversal/get-union-schema.ts","../../src/traversal/has-node.ts","../../src/traversal/is-inline.ts","../../src/traversal/is-leaf-object.ts","../../src/traversal/is-object.ts"],"sourcesContent":[],"mappings":";;AAgBA;;;;;;;;;;AAWA;AACY,iBAZI,WAYJ,CAAA,eAZ+B,iBAY/B,CAAA,CAAA,QAAA,EAXA,iBAWA,EAAA,IAAA,EAVJ,IAUI,EAAA,OAAA,EAAA;EACJ,KAAA,EAAA,CAAA,IAAA,EATU,iBASV,EAAA,IAAA,EATmC,IASnC,EAAA,GAAA,IAAA,IAToD,MASpD;EAEU,IAAA,CAAA,EAAA,QAAA,GAAA,SAAA;CAAyB,CAAA,EAAA;EAGjC,IAAA,EAXA,MAWA;EAAyB,IAAA,EAXX,IAWW;CAAI,GAAA,SAAA;;ACTvC;;AAEQ,iBDAQ,WAAA,CCAR,QAAA,EDCI,iBCDJ,EAAA,IAAA,EDEA,ICFA,EAAA,OAAA,EAAA;EACQ,KAAA,EAAA,CAAA,IAAA,EDGE,iBCHF,EAAA,IAAA,EDG2B,ICH3B,EAAA,GAAA,OAAA;EAAyB,IAAA,CAAA,EAAA,QAAA,GAAA,SAAA;CAAtC,CAAA,EAAA;EAAK,IAAA,EDME,iBCNF;QDM2B;AEjBnC,CAAA,GAAgB,SAAA;AFDhB;;;;;;;;;;AAWA;;;;;;AAOmC,iBCTnB,YAAA,CDSmB,QAAA,ECRvB,iBDQuB,EAAA,IAAA,ECP3B,IDO2B,CAAA,ECNhC,KDMgC,CAAA;EAAI,IAAA,ECNvB,iBDMuB;QCNE;AAHzC,CAAA,CAAA;ADTA;;;;;;;;;;AAWA;AACY,iBEXI,aAAA,CFWJ,QAAA,EEVA,iBFUA,EAAA,IAAA,EETJ,IFSI,CAAA,EAAA;EACJ,IAAA,EETE,kBFSF;EAEU,IAAA,EEXkB,IFWlB;CAAyB,GAAA,SAAA;AAf3C;;;;;;;;;;AAWgB,iBGTA,OAAA,CHSW,QAAA,EGTO,iBHSP,EAAA,IAAA,EGTgC,IHShC,CAAA,EAAA,OAAA;;;;;;;;;ACFX,iBEWA,QAAA,CFXY,QAAA,EEYhB,iBFZgB,EAAA,IAAA,EEapB,IFboB,CAAA,EAAA;EAChB,IAAA,EEaF,iBFbE;EACJ,IAAA,EEY2B,IFZ3B;CACQ,GAAA,SAAA;;;;;;ADLN,iBIJM,WAAA,CJIN,QAAA,EIHE,iBJGF,EAAA,IAAA,EIFF,IJEE,CAAA,EIDP,KJCO,CAAA;EAAc,IAAA,EIDR,IJCQ;EAAI,IAAA,EIDA,IJCA;AAI5B,CAAA,CAAA;;AAXA;;;;;;;;;;AAWA;;;;;;AAOmC,iBKXnB,oBAAA,CLWmB,UAAA,EKVrB,ULUqB,EAAA,IAAA,EKT3B,ILS2B,EAAA,MAAA,CAAA,EKRxB,mBLQwB,CAAA,EAAA;EAAI,QAAA,EKLvB,KLKuB,CKLjB,ILKiB,CAAA;aKJtB;AJLjB,CAAA,GAAgB,SAAA;ADThB;;;;;;;;;;AAWA;;;;;;;;iBMHgB,iCAAiC,6BACrC,yBACJ;ELDQ,KAAA,EAAA,CAAA,IAAA,EKGE,iBLHU,EAAA,IAAA,EKGe,ILHf,EAAA,GAAA,IAAA,IKGgC,MLHhC;EAChB,IAAA,CAAA,EAAA,QAAA,GAAA,SAAA;CACJ,CAAA,EAAA;EACQ,IAAA,EKGN,MLHM;EAAyB,IAAA,EKGjB,ILHiB;CAAtC,GAAA,SAAA;;;ACXH;AACY,iBIiBI,iBAAA,CJjBJ,QAAA,EIkBA,iBJlBA,EAAA,IAAA,EImBJ,IJnBI,EAAA,OAEwB,CAFxB,EAAA;EACJ,KAAA,CAAA,EAAA,CAAA,IAAA,EIoBW,iBJpBX,EAAA,IAAA,EIoBoC,IJpBpC,EAAA,GAAA,OAAA;EACE,IAAA,CAAA,EAAA,QAAA,GAAA,SAAA;CAA0B,CAAA,EAAA;EAAI,IAAA,EIsB9B,iBJtB8B;QIsBL;AHxBnC,CAAA,GAAgB,SAAA;AHFhB;;;;;AAI2C,iBOV3B,aAAA,CPU2B,QAAA,EOT/B,iBPS+B,EAAA,IAAA,EORnC,IPQmC,CAAA,EAAA;EAAiB,IAAA,EOPlD,IPOkD;EAGlD,IAAA,EOVY,IPUZ;CAAc,GAAA,SAAA;AAPxB;;;;;AAI2C,iBQV3B,YAAA,CRU2B,QAAA,EQT/B,iBRS+B,EAAA,IAAA,EQRnC,IRQmC,CAAA,EAAA;EAAiB,IAAA,EQPlD,IROkD;EAGlD,IAAA,EQVY,IRUZ;CAAc,GAAA,SAAA;AAPxB;;;;;;;AAOU,iBSVM,OAAA,CTUN,QAAA,ESTE,iBTSF,EAAA,IAAA,ESRF,ITQE,EAAA,OAAA,EAAA;EAAc,IAAA,EAAA,OAAA,GAAA,KAAA;CAAI,CAAA,EAAA;EAIZ,IAAA,ESVN,ITUM;EACJ,IAAA,ESXU,ITWV;CACJ,GAAA,SAAA;AAbR;;;;;;;;;;AAWA;;;;;;;;;ACFA;;;;AAGyC,iBSGzB,OAAA,CTHyB,QAAA,ESI7B,iBTJ6B,EAAA,IAAA,ESKjC,ITLiC,CAAA,EAAA;EAAtC,IAAA,ESMO,ITNP;EAAK,IAAA,ESMc,ITNd;;ADZR;;;;;;;;;;AAWA;AACY,iBWXI,SXWJ,CAAA,eWX6B,iBXW7B,CAAA,CAAA,QAAA,EWVA,iBXUA,EAAA,IAAA,EWTJ,IXSI,EAAA,OAAA,EAAA;EACJ,KAAA,EAAA,CAAA,IAAA,EWRU,iBXQV,EAAA,IAAA,EWRmC,IXQnC,EAAA,GAAA,IAAA,IWRoD,MXQpD;CAEU,CAAA,EAAA;EAAyB,IAAA,EWRjC,MXQiC;EAGjC,IAAA,EWXc,IXWd;CAAyB,GAAA,SAAA;;;ACTnC;AACY,iBUCI,SAAA,CVDJ,QAAA,EUEA,iBVFA,EAAA,IAAA,EUGJ,IVHI,EAAA,OAEI,CAFJ,EAAA;EACJ,KAAA,CAAA,EAAA,CAAA,IAAA,EUIW,iBVJX,EAAA,IAAA,EUIoC,IVJpC,EAAA,GAAA,OAAA;CACQ,CAAA,EAAA;EAAyB,IAAA,EUK/B,iBVL+B;EAAtC,IAAA,EUKgC,IVLhC;CAAK,GAAA,SAAA;ADZR;;;;;;;;;;AAWgB,iBYZA,gBAAA,CZYW,QAAA,EYXf,iBZWe,EAAA,IAAA,EYVnB,IZUmB,CAAA,EYTxB,MZSwB;AAX3B;;;;;;;;;;AAWA;AACY,iBaTI,UbSJ,CAAA,eaT8B,IbS9B,CAAA,CAAA,QAAA,EaRA,iBbQA,EAAA,IAAA,EaPJ,IbOI,EAAA,OAAA,EAAA;EACJ,SAAA,EAAA,MAAA,GAAA,UAAA;EAEU,KAAA,EAAA,CAAA,IAAA,EaPA,IbOA,EAAA,IAAA,EaPY,IbOZ,EAAA,GAAA,IAAA,IaP6B,MbO7B;CAAyB,CAAA,EAAA;EAGjC,IAAA,EaRA,MbQA;EAAyB,IAAA,EaRX,IbQW;CAAI,GAAA,SAAA;;ACTvC;;AAEQ,iBYGQ,UAAA,CZHR,QAAA,EYII,iBZJJ,EAAA,IAAA,EYKA,IZLA,EAAA,OAAA,EAAA;EACQ,SAAA,EAAA,MAAA,GAAA,UAAA;EAAyB,KAAA,CAAA,EAAA,CAAA,IAAA,EYOtB,IZPsB,EAAA,IAAA,EYOV,IZPU,EAAA,GAAA,OAAA;CAAtC,CAAA,EAAA;EAAK,IAAA,EYSE,IZTF;QYSc;AXpBtB,CAAA,GAAgB,SAAA;;AFDhB;;;;;;;;;;AAWA;AACY,iBcZI,aAAA,CdYJ,QAAA,EcXA,iBdWA,EAAA,MAAA,EcVF,oBdUE,EAAA,MAAA,EcTF,oBdSE,CAAA,EAAA,CAAA,CAAA,GAAA,CAAA,GAAA,CAAA;;;AAZZ;;;;AAIkB,iBeXF,YAAA,CfWE,QAAA,EeXqB,IfWrB,EAAA,UAAA,EeXuC,IfWvC,CAAA,EAAA,OAAA;AAJlB;;;;;;;;;;AAWA;;;;;;;;iBgBEgB,eAAA,WACJ,0BACH,yBACC,OAAO,uBAAuB;AhBhBxC;;;;;AAI2C,iBiBV3B,OAAA,CjBU2B,QAAA,EiBT/B,iBjBS+B,EAAA,IAAA,EiBRnC,IjBQmC,CAAA,EAAA;EAAiB,IAAA,EiBPlD,gBjBOkD;EAGlD,IAAA,EiBVwB,IjBUxB;CAAc,GAAA,SAAA;;AAPxB;;;;AAIkB,iBkBTF,OAAA,ClBSE,QAAA,EkBRN,iBlBQM,EAAA,IAAA,EkBPV,IlBOU,CAAA,EAAA,MAAA,GAAA,SAAA;AAJlB;;;;;AAI2C,iBmBV3B,YAAA,CnBU2B,QAAA,EmBT/B,iBnBS+B,EAAA,IAAA,EmBRnC,InBQmC,CAAA,EAAA;EAAiB,IAAA,EmBPlD,qBnBOkD;EAGlD,IAAA,EmBV6B,InBU7B;CAAc,GAAA,SAAA;;AAPxB;;;;;;;;;;AAWA;;;;;;;;;ACFA;;;;AAGyC,iBmBDzB,cAAA,CnBCyB,MAAA,EmBDF,MnBCE,EAAA,UAAA,EmBDkB,UnBClB,CAAA,EmBD+B,MnBC/B;;ADZzC;;;;AAIkB,iBqBXF,OAAA,CrBWE,QAAA,EqBXgB,iBrBWhB,EAAA,IAAA,EqBXyC,IrBWzC,CAAA,EAAA,OAAA;;AAJlB;;;;;;;AAOU,iBsBXM,QAAA,CtBWN,QAAA,EsBXyB,iBtBWzB,EAAA,IAAA,EsBXkD,ItBWlD,CAAA,EAAA,OAAA;AAPV;;;;;;;;AAOwB,iBuBTR,YAAA,CvBSQ,QAAA,EuBRZ,iBvBQY,EAAA,IAAA,EAAA,OAAA,EAAA,IAAA,EuBNhB,IvBMgB,CAAA,EAAA,IAAA,IuBLb,kBvBKa;;AAPxB;;;;AAIkB,iBwBXF,QAAA,CxBWE,QAAA,EwBVN,iBxBUM,EAAA,IAAA,EAAA,OAAA,CAAA,EAAA,IAAA,IwBRP,kBxBQO"}

package/lib/traversal/index.js

@@ -1,7 +1,27 @@
-import { getAncestor, getFirstChild, getLeaf, getSpan, getText, getTextBlock, getUnionSchema, isLeafObject, pathContains, rangeIntersects } from "../_chunks-es/get-first-child.js";
+import { getTextBlock } from "../_chunks-es/get-first-child.js";
+import { getAncestor, getFirstChild, getLeaf, getSpan, getText, getUnionSchema, isLeafObject, pathContains, rangeIntersects } from "../_chunks-es/get-first-child.js";
 import { comparePoints, getAncestors, getBlock, getEnclosingBlock, getPathSubSchema, getSibling, hasNode, isBlock, isInline, isObject } from "../_chunks-es/get-path-sub-schema.js";
-import { getChildren } from "../_chunks-es/get-parent.js";
+import { isKeyedSegment, getChildren } from "../_chunks-es/get-parent.js";
 import { getContainerChildren, getNode, getParent } from "../_chunks-es/get-parent.js";
+function getAnnotation(snapshot, path) {
+  for (let i = 0; i < path.length - 1; i++) {
+    if (path[i] !== "markDefs")
+      continue;
+    const annotationSegment = path[i + 1];
+    if (!isKeyedSegment(annotationSegment))
+      continue;
+    const block = getTextBlock(snapshot, path.slice(0, i));
+    if (!block)
+      continue;
+    const annotation = block.node.markDefs?.find((markDef) => markDef._key === annotationSegment._key);
+    return annotation ? {
+      node: annotation,
+      path: [...block.path, "markDefs", {
+        _key: annotation._key
+      }]
+    } : void 0;
+  }
+}
 function getLastChild(snapshot, path) {
   return getChildren(snapshot, path).at(-1);
 }
@@ -9,6 +29,7 @@ export {
   comparePoints,
   getAncestor,
   getAncestors,
+  getAnnotation,
   getBlock,
   getChildren,
   getContainerChildren,

package/lib/traversal/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":["../../src/traversal/get-last-child.ts"],"sourcesContent":["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"],"names":["getLastChild","snapshot","path","getChildren","at"],"mappings":";;;;AAUO,SAASA,aACdC,UACAC,MACsC;AAGtC,SAFiBC,YAAYF,UAAUC,IAAI,EAE3BE,GAAG,EAAE;AACvB;"}
+{"version":3,"file":"index.js","sources":["../../src/traversal/get-annotation.ts","../../src/traversal/get-last-child.ts"],"sourcesContent":["import type {PortableTextObject} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {isKeyedSegment} from '../utils/util.is-keyed-segment'\nimport {getTextBlock} from './get-text-block'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the annotation at a given path.\n *\n * Annotations live in `markDefs` on a text block, alongside `children`\n * rather than inside it, so they aren't reachable through `getNode`.\n * `getAnnotation` resolves a path of the shape\n * `[..., {_key: block}, 'markDefs', {_key: annotation}, ...]` to the\n * annotation node on the enclosing text block.\n *\n * @beta\n */\nexport function getAnnotation(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): {node: PortableTextObject; path: Path} | undefined {\n  // A path may cross multiple `'markDefs'` segments if a consumer\n  // registers a container whose array field is named `markDefs`. Try\n  // each position and pick the one whose prefix resolves to a text\n  // block.\n  for (let i = 0; i < path.length - 1; i++) {\n    if (path[i] !== 'markDefs') {\n      continue\n    }\n\n    const annotationSegment = path[i + 1]\n\n    if (!isKeyedSegment(annotationSegment)) {\n      continue\n    }\n\n    const block = getTextBlock(snapshot, path.slice(0, i))\n\n    if (!block) {\n      continue\n    }\n\n    const annotation = block.node.markDefs?.find(\n      (markDef) => markDef._key === annotationSegment._key,\n    )\n\n    if (!annotation) {\n      return undefined\n    }\n\n    return {\n      node: annotation,\n      path: [...block.path, 'markDefs', {_key: annotation._key}],\n    }\n  }\n\n  return undefined\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"],"names":["getAnnotation","snapshot","path","i","length","annotationSegment","isKeyedSegment","block","getTextBlock","slice","annotation","node","markDefs","find","markDef","_key","getLastChild","getChildren","at"],"mappings":";;;;;AAiBO,SAASA,cACdC,UACAC,MACoD;AAKpD,WAASC,IAAI,GAAGA,IAAID,KAAKE,SAAS,GAAGD,KAAK;AACxC,QAAID,KAAKC,CAAC,MAAM;AACd;AAGF,UAAME,oBAAoBH,KAAKC,IAAI,CAAC;AAEpC,QAAI,CAACG,eAAeD,iBAAiB;AACnC;AAGF,UAAME,QAAQC,aAAaP,UAAUC,KAAKO,MAAM,GAAGN,CAAC,CAAC;AAErD,QAAI,CAACI;AACH;AAGF,UAAMG,aAAaH,MAAMI,KAAKC,UAAUC,KACrCC,CAAAA,YAAYA,QAAQC,SAASV,kBAAkBU,IAClD;AAEA,WAAKL,aAIE;AAAA,MACLC,MAAMD;AAAAA,MACNR,MAAM,CAAC,GAAGK,MAAML,MAAM,YAAY;AAAA,QAACa,MAAML,WAAWK;AAAAA,MAAAA,CAAK;AAAA,IAAA,IALzD;AAAA,EAOJ;AAGF;AC/CO,SAASC,aACdf,UACAC,MACsC;AAGtC,SAFiBe,YAAYhB,UAAUC,IAAI,EAE3BgB,GAAG,EAAE;AACvB;"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@portabletext/editor",
-  "version": "7.8.2",
+  "version": "7.9.0",
   "description": "Portable Text Editor made in React",
   "keywords": [
     "sanity",