@portabletext/editor 8.1.1 → 8.1.3

package/lib/util.slice-blocks-B-iKFEG7.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.slice-blocks-B-iKFEG7.js","names":[],"sources":["../src/utils/util.child-text-offset.ts","../src/utils/util.block-offset.ts","../src/utils/util.is-equal-path-segments.ts","../src/utils/util.is-equal-paths.ts","../src/utils/util.is-equal-selection-points.ts","../src/utils/util.selection-point.ts","../src/utils/util.get-block-end-point.ts","../src/utils/util.get-block-start-point.ts","../src/utils/util.is-selection-collapsed.ts","../src/utils/util.get-selection-end-point.ts","../src/utils/util.get-selection-start-point.ts","../src/utils/key-generator.ts","../src/utils/parse-blocks.ts","../src/utils/util.slice-blocks.ts"],"sourcesContent":["/**\n * Pure text-offset arithmetic over a node's children array, shared by\n * the snapshot-aware block-offset utils (`util.block-offset.ts`) and\n * the schema-free point transform (`engine/point/transform-point.ts`).\n * Span-ness is the caller's concern, expressed as an accessor that\n * returns the child's text when the child occupies text offsets and\n * `undefined` when it does not (inline objects, blocks).\n */\n\n/**\n * The text offset of `(childKey, offsetInChild)` within `children`:\n * the total text of the children before that child, plus the offset\n * into it. `undefined` when the child is missing or carries no text.\n */\nexport function textOffsetOfChild(\n  children: ReadonlyArray<unknown>,\n  getSpanText: (child: unknown) => string | undefined,\n  childKey: string,\n  offsetInChild: number,\n): number | undefined {\n  let precedingTextLength = 0\n\n  for (const child of children) {\n    const text = getSpanText(child)\n    if (keyOf(child) === childKey) {\n      return text === undefined\n        ? undefined\n        : precedingTextLength + offsetInChild\n    }\n    if (text !== undefined) {\n      precedingTextLength += text.length\n    }\n  }\n\n  return undefined\n}\n\n/**\n * The child and child-local offset at `textOffset` within `children`.\n * Forward-boundary convention: an offset landing exactly on a span\n * boundary stays at the end of the earlier span. `undefined` when the\n * offset lies beyond the children's total text.\n */\nexport function childAtTextOffset(\n  children: ReadonlyArray<unknown>,\n  getSpanText: (child: unknown) => string | undefined,\n  textOffset: number,\n): {key: string; offset: number} | undefined {\n  let remainingOffset = textOffset\n\n  for (const child of children) {\n    const text = getSpanText(child)\n    if (text === undefined) {\n      continue\n    }\n    if (remainingOffset <= text.length) {\n      const key = keyOf(child)\n      return key === undefined ? undefined : {key, offset: remainingOffset}\n    }\n    remainingOffset -= text.length\n  }\n\n  return undefined\n}\n\nfunction keyOf(child: unknown): string | undefined {\n  if (child !== null && typeof child === 'object' && '_key' in child) {\n    const key = (child as {_key: unknown})._key\n    return typeof key === 'string' ? key : undefined\n  }\n  return undefined\n}\n","import {isSpan, isTextBlock} from '@portabletext/schema'\nimport {getNode} from '../traversal/get-node'\nimport {getParent} from '../traversal/get-parent'\nimport type {TraversalSnapshot} from '../traversal/traversal-snapshot'\nimport type {BlockOffset} from '../types/block-offset'\nimport type {EditorSelectionPoint} from '../types/editor'\nimport type {ChildPath} from '../types/paths'\nimport {childAtTextOffset, textOffsetOfChild} from './util.child-text-offset'\nimport {isKeyedSegment} from './util.is-keyed-segment'\n\n/**\n * @public\n */\nexport function blockOffsetToSpanSelectionPoint({\n  snapshot,\n  blockOffset,\n  direction,\n}: {\n  snapshot: TraversalSnapshot\n  blockOffset: BlockOffset\n  direction: 'forward' | 'backward'\n}) {\n  const blockEntry = getNode(snapshot, blockOffset.path)\n\n  if (!blockEntry || !isTextBlock(snapshot.context, blockEntry.node)) {\n    return undefined\n  }\n\n  const block = blockEntry.node\n  const blockPath = blockEntry.path\n\n  if (direction === 'forward') {\n    const placed = childAtTextOffset(\n      block.children,\n      (child) =>\n        isSpan(snapshot.context, child as (typeof block.children)[number])\n          ? (child as {text: string}).text\n          : undefined,\n      blockOffset.offset,\n    )\n    return placed\n      ? {\n          path: [\n            ...blockPath,\n            'children',\n            {_key: placed.key},\n          ] satisfies ChildPath,\n          offset: placed.offset,\n        }\n      : undefined\n  }\n\n  let offsetLeft = blockOffset.offset\n  let selectionPoint: {path: ChildPath; offset: number} | undefined\n  let skippedInlineObject = false\n\n  for (const child of block.children) {\n    if (!isSpan(snapshot.context, child)) {\n      skippedInlineObject = true\n      continue\n    }\n\n    if (offsetLeft === 0 && selectionPoint && !skippedInlineObject) {\n      // A boundary offset stays at the end of the previous span unless an\n      // inline object was skipped, in which case falling through to the\n      // `offsetLeft <= child.text.length` branch lands the point at the\n      // start of this span instead.\n      break\n    }\n\n    if (offsetLeft > child.text.length) {\n      offsetLeft -= child.text.length\n      continue\n    }\n\n    if (offsetLeft <= child.text.length) {\n      selectionPoint = {\n        path: [...blockPath, 'children', {_key: child._key}],\n        offset: offsetLeft,\n      }\n\n      offsetLeft -= child.text.length\n\n      if (offsetLeft !== 0) {\n        break\n      }\n    }\n  }\n\n  return selectionPoint\n}\n\n/**\n * @public\n */\nexport function spanSelectionPointToBlockOffset({\n  snapshot,\n  selectionPoint,\n}: {\n  snapshot: TraversalSnapshot\n  selectionPoint: EditorSelectionPoint\n}): BlockOffset | undefined {\n  const spanSegment = selectionPoint.path.at(-1)\n\n  if (!isKeyedSegment(spanSegment)) {\n    return undefined\n  }\n\n  const textBlock = getParent(snapshot, selectionPoint.path, {\n    match: (node) => isTextBlock({schema: snapshot.context.schema}, node),\n  })\n\n  if (!textBlock) {\n    return undefined\n  }\n\n  const offset = textOffsetOfChild(\n    textBlock.node.children,\n    (child) =>\n      isSpan(\n        snapshot.context,\n        child as (typeof textBlock.node.children)[number],\n      )\n        ? (child as {text: string}).text\n        : undefined,\n    spanSegment._key,\n    selectionPoint.offset,\n  )\n\n  return offset === undefined ? undefined : {path: textBlock.path, offset}\n}\n","import type {PathSegment} from '../types/paths'\nimport {isKeyedSegment} from './util.is-keyed-segment'\n\nexport function isEqualPathSegments(\n  segA: PathSegment | undefined,\n  segB: PathSegment | undefined,\n): boolean {\n  if (segA === segB) {\n    return true\n  }\n\n  if (segA === undefined || segB === undefined) {\n    return false\n  }\n\n  if (\n    (typeof segA === 'string' || typeof segA === 'number') &&\n    (typeof segB === 'string' || typeof segB === 'number')\n  ) {\n    return segA === segB\n  }\n\n  if (isKeyedSegment(segA) && isKeyedSegment(segB)) {\n    return segA._key === segB._key\n  }\n\n  if (Array.isArray(segA) && Array.isArray(segB)) {\n    return segA[0] === segB[0] && segA[1] === segB[1]\n  }\n\n  return false\n}\n","import type {Path} from '../types/paths'\nimport {isEqualPathSegments} from './util.is-equal-path-segments'\n\n/**\n * @public\n */\nexport function isEqualPaths(a: Path, b: Path): boolean {\n  if (a.length !== b.length) {\n    return false\n  }\n\n  for (let i = 0; i < a.length; i++) {\n    if (!isEqualPathSegments(a[i], b[i])) {\n      return false\n    }\n  }\n\n  return true\n}\n","import type {EditorSelectionPoint} from '../types/editor'\nimport {isEqualPaths} from './util.is-equal-paths'\n\n/**\n * @public\n */\nexport function isEqualSelectionPoints(\n  a: EditorSelectionPoint,\n  b: EditorSelectionPoint,\n) {\n  return a.offset === b.offset && isEqualPaths(a.path, b.path)\n}\n","import type {EditorSelectionPoint} from '../types/editor'\nimport {isKeyedSegment} from './util.is-keyed-segment'\n\nexport function getBlockKeyFromSelectionPoint(point: EditorSelectionPoint) {\n  const blockPathSegment = point.path.at(0)\n\n  if (isKeyedSegment(blockPathSegment)) {\n    return blockPathSegment._key\n  }\n\n  return undefined\n}\n\nexport function getChildKeyFromSelectionPoint(point: EditorSelectionPoint) {\n  const childPathSegment = point.path.at(2)\n\n  if (isKeyedSegment(childPathSegment)) {\n    return childPathSegment._key\n  }\n\n  return undefined\n}\n","import {isSpan, isTextBlock, type PortableTextBlock} from '@portabletext/schema'\nimport type {EditorContext} from '../editor/editor-snapshot'\nimport type {EditorSelectionPoint} from '../types/editor'\nimport type {BlockPath} from '../types/paths'\n\n/**\n * @public\n */\nexport function getBlockEndPoint({\n  context,\n  block,\n}: {\n  context: Pick<EditorContext, 'schema'>\n  block: {\n    node: PortableTextBlock\n    path: BlockPath\n  }\n}): EditorSelectionPoint {\n  if (isTextBlock(context, block.node)) {\n    const lastChild = block.node.children[block.node.children.length - 1]\n\n    if (lastChild) {\n      return {\n        path: [...block.path, 'children', {_key: lastChild._key}],\n        offset: isSpan(context, lastChild) ? lastChild.text.length : 0,\n      }\n    }\n  }\n\n  return {\n    path: block.path,\n    offset: 0,\n  }\n}\n","import {isTextBlock, type PortableTextBlock} from '@portabletext/schema'\nimport type {EditorContext} from '../editor/editor-snapshot'\nimport type {EditorSelectionPoint} from '../types/editor'\nimport type {BlockPath} from '../types/paths'\n\n/**\n * @public\n */\nexport function getBlockStartPoint({\n  context,\n  block,\n}: {\n  context: Pick<EditorContext, 'schema'>\n  block: {\n    node: PortableTextBlock\n    path: BlockPath\n  }\n}): EditorSelectionPoint {\n  if (isTextBlock(context, block.node)) {\n    const firstChild = block.node.children[0]\n    return {\n      path: [...block.path, 'children', {_key: firstChild?._key ?? ''}],\n      offset: 0,\n    }\n  }\n\n  return {\n    path: block.path,\n    offset: 0,\n  }\n}\n","import type {EditorSelection} from '../types/editor'\nimport {isEqualPaths} from './util.is-equal-paths'\n\n/**\n * @public\n */\nexport function isSelectionCollapsed(selection: EditorSelection) {\n  if (!selection) {\n    return false\n  }\n\n  return (\n    isEqualPaths(selection.anchor.path, selection.focus.path) &&\n    selection.anchor.offset === selection.focus.offset\n  )\n}\n","import type {EditorSelection, EditorSelectionPoint} from '../types/editor'\n\n/**\n * @public\n */\nexport function getSelectionEndPoint<\n  TEditorSelection extends NonNullable<EditorSelection> | null,\n  TEditorSelectionPoint extends EditorSelectionPoint | null =\n    TEditorSelection extends NonNullable<EditorSelection>\n      ? EditorSelectionPoint\n      : null,\n>(selection: TEditorSelection): TEditorSelectionPoint {\n  if (!selection) {\n    return null as TEditorSelectionPoint\n  }\n\n  return (\n    selection.backward ? selection.anchor : selection.focus\n  ) as TEditorSelectionPoint\n}\n","import type {EditorSelection, EditorSelectionPoint} from '../types/editor'\n\n/**\n * @public\n */\nexport function getSelectionStartPoint<\n  TEditorSelection extends NonNullable<EditorSelection> | null,\n  TEditorSelectionPoint extends EditorSelectionPoint | null =\n    TEditorSelection extends NonNullable<EditorSelection>\n      ? EditorSelectionPoint\n      : null,\n>(selection: TEditorSelection): TEditorSelectionPoint {\n  if (!selection) {\n    return null as TEditorSelectionPoint\n  }\n\n  return (\n    selection.backward ? selection.focus : selection.anchor\n  ) as TEditorSelectionPoint\n}\n","/**\n * @public\n */\nexport const defaultKeyGenerator = (): string => randomKey(12)\n\nconst getByteHexTable = (() => {\n  let table: any[]\n  return () => {\n    if (table) {\n      return table\n    }\n\n    table = []\n    for (let i = 0; i < 256; ++i) {\n      table[i] = (i + 0x100).toString(16).slice(1)\n    }\n    return table\n  }\n})()\n\n// WHATWG crypto RNG - https://w3c.github.io/webcrypto/Overview.html\nfunction whatwgRNG(length = 16) {\n  const rnds8 = new Uint8Array(length)\n  crypto.getRandomValues(rnds8)\n  return rnds8\n}\n\nfunction randomKey(length?: number): string {\n  const table = getByteHexTable()\n  return whatwgRNG(length)\n    .reduce((str, n) => str + table[n], '')\n    .slice(0, length)\n}\n","import {\n  getSubSchema,\n  isSpan,\n  type FieldDefinition,\n  type OfDefinition,\n  type PortableTextBlock,\n  type PortableTextObject,\n  type PortableTextSpan,\n  type PortableTextTextBlock,\n  type Schema,\n  type TypedObject,\n} from '@portabletext/schema'\nimport {isRecord, isTypedObject} from './asserters'\n\n/**\n * `strict` validates and normalizes against the schema; use it at the\n * operation gate. `lenient` trusts the shape and defers validation to that\n * gate; use it at deserialization boundaries (converters, splitting,\n * slicing, merging).\n */\nexport type ParseProfile = 'strict' | 'lenient'\n\nconst blockProfiles: Record<\n  ParseProfile,\n  {normalize: boolean; removeUnusedMarkDefs: boolean; validateFields: boolean}\n> = {\n  strict: {normalize: true, removeUnusedMarkDefs: true, validateFields: true},\n  lenient: {\n    normalize: false,\n    removeUnusedMarkDefs: true,\n    validateFields: false,\n  },\n}\n\nconst fieldProfiles: Record<ParseProfile, {validateFields: boolean}> = {\n  strict: {validateFields: true},\n  lenient: {validateFields: false},\n}\n\nexport function parseBlocks({\n  schema,\n  keyGenerator,\n  blocks,\n  profile,\n}: {\n  schema: Schema\n  keyGenerator: () => string\n  blocks: unknown\n  profile: ParseProfile\n}): Array<PortableTextBlock> {\n  if (!Array.isArray(blocks)) {\n    return []\n  }\n\n  const options = blockProfiles[profile]\n\n  return blocks.flatMap((block) => {\n    const parsedBlock = parseBlockInternal({\n      schema,\n      keyGenerator,\n      block,\n      options,\n    })\n\n    return parsedBlock ? [parsedBlock] : []\n  })\n}\n\nexport function parseBlock({\n  schema,\n  keyGenerator,\n  block,\n  profile,\n}: {\n  schema: Schema\n  keyGenerator: () => string\n  block: unknown\n  profile: ParseProfile\n}): PortableTextBlock | undefined {\n  return parseBlockInternal({\n    schema,\n    keyGenerator,\n    block,\n    options: blockProfiles[profile],\n  })\n}\n\nexport function parseSpan({\n  span,\n  schema,\n  keyGenerator,\n  markDefKeys,\n  profile,\n}: {\n  span: unknown\n  schema: Schema\n  keyGenerator: () => string\n  markDefKeys: Set<string>\n  profile: ParseProfile\n}): PortableTextSpan | undefined {\n  return parseSpanInternal({\n    span,\n    schema,\n    keyGenerator,\n    markDefKeys,\n    options: fieldProfiles[profile],\n  })\n}\n\nexport function parseInlineObject({\n  inlineObject,\n  schema,\n  keyGenerator,\n  profile,\n}: {\n  inlineObject: unknown\n  schema: Schema\n  keyGenerator: () => string\n  profile: ParseProfile\n}): PortableTextObject | undefined {\n  return parseInlineObjectInternal({\n    inlineObject,\n    schema,\n    keyGenerator,\n    options: fieldProfiles[profile],\n  })\n}\n\nexport function parseChild({\n  child,\n  schema,\n  keyGenerator,\n  markDefKeys,\n  profile,\n}: {\n  child: unknown\n  schema: Schema\n  keyGenerator: () => string\n  markDefKeys: Set<string>\n  profile: ParseProfile\n}): PortableTextSpan | PortableTextObject | undefined {\n  return parseChildInternal({\n    child,\n    schema,\n    keyGenerator,\n    markDefKeys,\n    options: fieldProfiles[profile],\n  })\n}\n\nexport function parseMarkDefs({\n  schema,\n  keyGenerator,\n  markDefs,\n  profile,\n}: {\n  schema: Schema\n  keyGenerator: () => string\n  markDefs: unknown\n  profile: ParseProfile\n}): {\n  markDefs: Array<PortableTextObject>\n  markDefKeys: Set<string>\n} {\n  return parseMarkDefsInternal({\n    schema,\n    keyGenerator,\n    markDefs,\n    options: fieldProfiles[profile],\n  })\n}\n\nfunction parseBlockInternal({\n  schema,\n  keyGenerator,\n  block,\n  options,\n}: {\n  schema: Schema\n  keyGenerator: () => string\n  block: unknown\n  options: {\n    normalize: boolean\n    removeUnusedMarkDefs: boolean\n    validateFields: boolean\n  }\n}): PortableTextBlock | undefined {\n  return (\n    parseTextBlock({block, schema, keyGenerator, options}) ??\n    parseBlockObject({blockObject: block, schema, keyGenerator, options})\n  )\n}\n\nfunction parseBlockObject({\n  blockObject,\n  schema,\n  keyGenerator,\n  options,\n}: {\n  blockObject: unknown\n  schema: Schema\n  keyGenerator: () => string\n  options: {validateFields: boolean}\n}): PortableTextObject | undefined {\n  if (!isTypedObject(blockObject)) {\n    return undefined\n  }\n\n  const schemaType = schema.blockObjects.find(\n    ({name}) => name === blockObject._type,\n  )\n\n  if (!schemaType) {\n    return undefined\n  }\n\n  return parseObject({\n    object: blockObject,\n    schema,\n    keyGenerator,\n    schemaType,\n    options,\n  })\n}\n\nfunction parseTextBlock({\n  block,\n  schema,\n  keyGenerator,\n  options,\n}: {\n  block: unknown\n  schema: Schema\n  keyGenerator: () => string\n  options: {\n    normalize: boolean\n    removeUnusedMarkDefs: boolean\n    validateFields: boolean\n  }\n}): PortableTextTextBlock | undefined {\n  if (!isTypedObject(block)) {\n    return undefined\n  }\n\n  if (block._type !== schema.block.name) {\n    return undefined\n  }\n\n  const customFields: Record<string, unknown> = {}\n\n  for (const key of Object.keys(block)) {\n    if (\n      key === '_type' ||\n      key === '_key' ||\n      key === 'children' ||\n      key === 'markDefs' ||\n      key === 'style' ||\n      key === 'listItem' ||\n      key === 'level'\n    ) {\n      continue\n    }\n\n    if (options.validateFields) {\n      if ((schema.block.fields ?? []).some((f) => f.name === key)) {\n        customFields[key] = block[key]\n      }\n    } else {\n      customFields[key] = block[key]\n    }\n  }\n\n  const _key =\n    typeof block['_key'] === 'string' ? block['_key'] : keyGenerator()\n\n  const {markDefs, markDefKeys} = parseMarkDefsInternal({\n    schema,\n    keyGenerator,\n    markDefs: block['markDefs'],\n    options,\n  })\n\n  const unparsedChildren: Array<unknown> = Array.isArray(block['children'])\n    ? block['children']\n    : []\n\n  const parsedChildren = unparsedChildren\n    .map((child) =>\n      parseChildInternal({child, schema, keyGenerator, markDefKeys, options}),\n    )\n    .filter((child) => child !== undefined)\n  const marks = parsedChildren.flatMap((child) => child.marks ?? [])\n\n  const children =\n    parsedChildren.length > 0\n      ? parsedChildren\n      : [\n          {\n            _key: keyGenerator(),\n            _type: schema.span.name,\n            text: '',\n            marks: [],\n          },\n        ]\n\n  const normalizedChildren = options.normalize\n    ? // Ensure that inline objects are surrounded by spans\n      children.reduce<Array<PortableTextObject | PortableTextSpan>>(\n        (normalizedChildren, child, index) => {\n          if (isSpan({schema}, child)) {\n            return [...normalizedChildren, child]\n          }\n\n          const previousChild = normalizedChildren.at(-1)\n\n          if (!previousChild || !isSpan({schema}, previousChild)) {\n            return [\n              ...normalizedChildren,\n              {\n                _key: keyGenerator(),\n                _type: schema.span.name,\n                text: '',\n                marks: [],\n              },\n              child,\n              ...(index === children.length - 1\n                ? [\n                    {\n                      _key: keyGenerator(),\n                      _type: schema.span.name,\n                      text: '',\n                      marks: [],\n                    },\n                  ]\n                : []),\n            ]\n          }\n\n          return [...normalizedChildren, child]\n        },\n        [],\n      )\n    : children\n\n  const parsedBlock: PortableTextTextBlock = {\n    _type: schema.block.name,\n    _key,\n    children: normalizedChildren,\n    ...customFields,\n  }\n\n  if (typeof block['markDefs'] === 'object' && block['markDefs'] !== null) {\n    parsedBlock.markDefs = options.removeUnusedMarkDefs\n      ? markDefs.filter((markDef) => marks.includes(markDef._key))\n      : markDefs\n  }\n\n  if (\n    typeof block['style'] === 'string' &&\n    schema.styles.find((style) => style.name === block['style'])\n  ) {\n    parsedBlock.style = block['style']\n  }\n\n  if (\n    typeof block['listItem'] === 'string' &&\n    schema.lists.find((list) => list.name === block['listItem'])\n  ) {\n    parsedBlock.listItem = block['listItem']\n  }\n\n  if (typeof block['level'] === 'number') {\n    parsedBlock.level = block['level']\n  }\n\n  return parsedBlock\n}\n\nfunction parseMarkDefsInternal({\n  schema,\n  keyGenerator,\n  markDefs,\n  options,\n}: {\n  schema: Schema\n  keyGenerator: () => string\n  markDefs: unknown\n  options: {validateFields: boolean}\n}): {\n  markDefs: Array<PortableTextObject>\n  markDefKeys: Set<string>\n} {\n  const unparsedMarkDefs: Array<unknown> = Array.isArray(markDefs)\n    ? markDefs\n    : []\n  const markDefKeys = new Set<string>()\n\n  const parsedMarkDefs = unparsedMarkDefs.flatMap((markDef) => {\n    if (!isTypedObject(markDef)) {\n      return []\n    }\n\n    const schemaType = schema.annotations.find(\n      ({name}) => name === markDef._type,\n    )\n\n    if (!schemaType) {\n      return []\n    }\n\n    if (typeof markDef['_key'] !== 'string') {\n      // If the `markDef` doesn't have a `_key` then we don't know what spans\n      // it belongs to and therefore we have to discard it.\n      return []\n    }\n\n    const parsedAnnotation = parseObject({\n      object: markDef,\n      schema,\n      keyGenerator,\n      schemaType,\n      options,\n    })\n\n    markDefKeys.add(markDef['_key'])\n\n    return [parsedAnnotation]\n  })\n\n  return {\n    markDefs: parsedMarkDefs,\n    markDefKeys,\n  }\n}\n\nfunction parseChildInternal({\n  child,\n  schema,\n  keyGenerator,\n  markDefKeys,\n  options,\n}: {\n  child: unknown\n  schema: Schema\n  keyGenerator: () => string\n  markDefKeys: Set<string>\n  options: {validateFields: boolean}\n}): PortableTextSpan | PortableTextObject | undefined {\n  return (\n    parseSpanInternal({\n      span: child,\n      schema,\n      keyGenerator,\n      markDefKeys,\n      options,\n    }) ??\n    parseInlineObjectInternal({\n      inlineObject: child,\n      schema,\n      keyGenerator,\n      options,\n    })\n  )\n}\n\nfunction parseSpanInternal({\n  span,\n  schema,\n  keyGenerator,\n  markDefKeys,\n  options,\n}: {\n  span: unknown\n  schema: Schema\n  keyGenerator: () => string\n  markDefKeys: Set<string>\n  options: {validateFields: boolean}\n}): PortableTextSpan | undefined {\n  if (!isRecord(span)) {\n    return undefined\n  }\n\n  const customFields: Record<string, unknown> = {}\n\n  for (const key of Object.keys(span)) {\n    if (\n      key !== '_type' &&\n      key !== '_key' &&\n      key !== 'text' &&\n      key !== 'marks'\n    ) {\n      customFields[key] = span[key]\n    }\n  }\n\n  const unparsedMarks: Array<unknown> = Array.isArray(span['marks'])\n    ? span['marks']\n    : []\n  const marks = unparsedMarks.flatMap((mark) => {\n    if (typeof mark !== 'string') {\n      return []\n    }\n\n    if (markDefKeys.has(mark)) {\n      return [mark]\n    }\n\n    if (schema.decorators.some((decorator) => decorator.name === mark)) {\n      return [mark]\n    }\n\n    return []\n  })\n\n  if (typeof span['_type'] === 'string' && span['_type'] !== schema.span.name) {\n    return undefined\n  }\n\n  if (typeof span['_type'] !== 'string') {\n    if (typeof span['text'] === 'string') {\n      return {\n        _type: schema.span.name as 'span',\n        _key: typeof span['_key'] === 'string' ? span['_key'] : keyGenerator(),\n        text: span['text'],\n        marks,\n        ...(options.validateFields ? {} : customFields),\n      }\n    }\n\n    return undefined\n  }\n\n  return {\n    _type: schema.span.name as 'span',\n    _key: typeof span['_key'] === 'string' ? span['_key'] : keyGenerator(),\n    text: typeof span['text'] === 'string' ? span['text'] : '',\n    marks,\n    ...(options.validateFields ? {} : customFields),\n  }\n}\n\nfunction parseInlineObjectInternal({\n  inlineObject,\n  schema,\n  keyGenerator,\n  options,\n}: {\n  inlineObject: unknown\n  schema: Schema\n  keyGenerator: () => string\n  options: {validateFields: boolean}\n}): PortableTextObject | undefined {\n  if (!isTypedObject(inlineObject)) {\n    return undefined\n  }\n\n  const schemaType = schema.inlineObjects.find(\n    ({name}) => name === inlineObject._type,\n  )\n\n  if (!schemaType) {\n    return undefined\n  }\n\n  return parseObject({\n    object: inlineObject,\n    schema,\n    keyGenerator,\n    schemaType,\n    options,\n  })\n}\n\nexport function parseAnnotation({\n  annotation,\n  schema,\n  keyGenerator,\n  profile,\n}: {\n  annotation: TypedObject\n  schema: Schema\n  keyGenerator: () => string\n  profile: ParseProfile\n}): PortableTextObject | undefined {\n  if (!isTypedObject(annotation)) {\n    return undefined\n  }\n\n  const schemaType = schema.annotations.find(\n    ({name}) => name === annotation._type,\n  )\n\n  if (!schemaType) {\n    return undefined\n  }\n\n  const options = fieldProfiles[profile]\n\n  return parseObject({\n    object: annotation,\n    schema,\n    keyGenerator,\n    schemaType,\n    options,\n  })\n}\n\n/**\n * Resolve an `of` member against a runtime `_type`. Returns the schema-type\n * to use for parsing the item, or `undefined` if no member matches.\n *\n * Three forms (one branch each):\n * - Inline declaration `{type: 'object', name: 'X', fields: [...]}` -- name\n *   matches `_type`, fields are inline.\n * - Reference `{type: 'X'}` -- looks up in the ancestor chain first\n *   (inline-declared types are visible to descendants), then in the schema's\n *   root `blockObjects`. Mirrors `resolve-containers.ts`'s reference\n *   resolution.\n * - `{type: 'block'}` -- not a non-PTE object member, returns `undefined`.\n */\nfunction resolveOfMember(\n  of: ReadonlyArray<OfDefinition>,\n  typeName: string,\n  schema: Schema,\n  ancestorFields: ReadonlyMap<string, ReadonlyArray<FieldDefinition>>,\n): {name: string; fields: ReadonlyArray<FieldDefinition>} | undefined {\n  for (const member of of) {\n    if (member.type === 'block') {\n      continue\n    }\n    if (member.type === 'object' && 'name' in member && member.name) {\n      if (member.name === typeName && 'fields' in member && member.fields) {\n        return {name: member.name, fields: member.fields}\n      }\n      continue\n    }\n    if (member.type === typeName) {\n      const ancestorMatch = ancestorFields.get(typeName)\n      if (ancestorMatch) {\n        return {name: typeName, fields: ancestorMatch}\n      }\n      const rootMatch = schema.blockObjects.find(\n        (blockObject) => blockObject.name === typeName,\n      )\n      if (rootMatch && 'fields' in rootMatch && rootMatch.fields) {\n        return {name: rootMatch.name, fields: rootMatch.fields}\n      }\n      return undefined\n    }\n  }\n  return undefined\n}\n\n/**\n * Parse an object against a `{name, fields}` schema type. Validates top-level\n * fields and recurses into any array field whose `of` contains a block-like\n * member -- parsing the nested blocks against a child `Schema` built from\n * that `of`.\n */\nfunction parseObject({\n  object,\n  schema,\n  keyGenerator,\n  schemaType,\n  ancestorFields,\n  options,\n}: {\n  object: TypedObject\n  schema: Schema\n  keyGenerator: () => string\n  schemaType: {\n    name: string\n    fields: ReadonlyArray<FieldDefinition>\n  }\n  ancestorFields?: ReadonlyMap<string, ReadonlyArray<FieldDefinition>>\n  options: {validateFields: boolean}\n}): PortableTextObject {\n  const {_key, ...customFields} = object\n\n  const fieldsByName = new Map(\n    schemaType.fields.map((field) => [field.name, field]),\n  )\n\n  const nextAncestors = new Map(ancestorFields ?? [])\n  nextAncestors.set(schemaType.name, schemaType.fields)\n\n  const values: Record<string, unknown> = {}\n\n  for (const [key, value] of Object.entries(customFields)) {\n    if (key === '_type') {\n      continue\n    }\n\n    if (value === undefined) {\n      continue\n    }\n\n    const field = fieldsByName.get(key)\n\n    if (options.validateFields && !field) {\n      continue\n    }\n\n    if (field && field.type === 'array' && field.of && Array.isArray(value)) {\n      values[key] = parseContainerFieldValue({\n        schema,\n        keyGenerator,\n        of: field.of,\n        value,\n        ancestorFields: nextAncestors,\n        options,\n      })\n      continue\n    }\n\n    values[key] = value\n  }\n\n  return {\n    _type: schemaType.name,\n    _key: typeof _key === 'string' ? _key : keyGenerator(),\n    ...values,\n  }\n}\n\n/**\n * Parse the value of an array field whose `of` declares what's allowed at\n * that position. Each item is dispatched per its own type:\n *\n * - Text blocks (`_type === schema.block.name`) are parsed against a child\n *   sub-schema derived from the `{type: 'block'}` member of `of` (which\n *   carries the styles, decorators, annotations, lists, and inline objects\n *   allowed at this position).\n *\n * - Block objects (and structural objects sitting between containers and\n *   text blocks) are parsed via `resolveOfMember` against the `of` array,\n *   with `ancestorFields` carrying inline type declarations down to bare\n *   references like `{type: 'list'}`. This lets nested containers resolve\n *   to their inline shapes at any depth.\n *\n * Items that don't resolve are passed through unchanged.\n */\nfunction parseContainerFieldValue({\n  schema,\n  keyGenerator,\n  of,\n  value,\n  ancestorFields,\n  options,\n}: {\n  schema: Schema\n  keyGenerator: () => string\n  of: ReadonlyArray<OfDefinition>\n  value: ReadonlyArray<unknown>\n  ancestorFields: ReadonlyMap<string, ReadonlyArray<FieldDefinition>>\n  options: {validateFields: boolean}\n}): Array<unknown> {\n  const hasBlockMember = of.some((member) => member.type === 'block')\n  const childBlockSubSchema = hasBlockMember\n    ? getSubSchema(schema, of)\n    : undefined\n\n  return value.flatMap((item) => {\n    if (!isTypedObject(item)) {\n      return [item]\n    }\n\n    if (childBlockSubSchema && item._type === childBlockSubSchema.block.name) {\n      const parsed = parseTextBlock({\n        block: item,\n        schema: childBlockSubSchema,\n        keyGenerator,\n        options: {\n          normalize: false,\n          removeUnusedMarkDefs: false,\n          validateFields: options.validateFields,\n        },\n      })\n      return parsed ? [parsed] : []\n    }\n\n    const schemaType = resolveOfMember(of, item._type, schema, ancestorFields)\n    if (!schemaType) {\n      return [item]\n    }\n    return [\n      parseObject({\n        object: item,\n        schema,\n        keyGenerator,\n        schemaType: {\n          name: schemaType.name,\n          fields: schemaType.fields,\n        },\n        ancestorFields,\n        options,\n      }),\n    ]\n  })\n}\n","import {isSpan, isTextBlock, type PortableTextBlock} from '@portabletext/schema'\nimport type {EditorContext} from '../editor/editor-snapshot'\nimport {defaultKeyGenerator} from './key-generator'\nimport {parseBlock} from './parse-blocks'\nimport {getSelectionEndPoint} from './util.get-selection-end-point'\nimport {getSelectionStartPoint} from './util.get-selection-start-point'\nimport {\n  getBlockKeyFromSelectionPoint,\n  getChildKeyFromSelectionPoint,\n} from './util.selection-point'\n\n/**\n * @public\n */\nexport function sliceBlocks({\n  context,\n  blocks,\n}: {\n  context: Pick<EditorContext, 'schema' | 'selection'> & {\n    keyGenerator?: () => string\n  }\n  blocks: Array<PortableTextBlock>\n}): Array<PortableTextBlock> {\n  const slice: Array<PortableTextBlock> = []\n\n  if (!context.selection) {\n    return slice\n  }\n\n  let startBlock: PortableTextBlock | undefined\n  const middleBlocks: PortableTextBlock[] = []\n  let endBlock: PortableTextBlock | undefined\n\n  const startPoint = getSelectionStartPoint(context.selection)\n  const endPoint = getSelectionEndPoint(context.selection)\n  const startBlockKey = getBlockKeyFromSelectionPoint(startPoint)\n  const startChildKey = getChildKeyFromSelectionPoint(startPoint)\n  const endBlockKey = getBlockKeyFromSelectionPoint(endPoint)\n  const endChildKey = getChildKeyFromSelectionPoint(endPoint)\n\n  if (!startBlockKey || !endBlockKey) {\n    return slice\n  }\n\n  for (const block of blocks) {\n    if (!isTextBlock(context, block)) {\n      if (block._key === startBlockKey && block._key === endBlockKey) {\n        startBlock = block\n        break\n      }\n    }\n\n    if (block._key === startBlockKey) {\n      if (!isTextBlock(context, block)) {\n        startBlock = block\n        continue\n      }\n\n      if (startChildKey) {\n        for (const child of block.children) {\n          if (child._key === startChildKey) {\n            if (isSpan(context, child)) {\n              const text =\n                child._key === endChildKey\n                  ? child.text.slice(startPoint.offset, endPoint.offset)\n                  : child.text.slice(startPoint.offset)\n\n              startBlock = {\n                ...block,\n                children: [\n                  {\n                    ...child,\n                    text,\n                  },\n                ],\n              }\n            } else {\n              startBlock = {\n                ...block,\n                children: [child],\n              }\n            }\n\n            if (block._key === endBlockKey && startChildKey === endChildKey) {\n              break\n            }\n            continue\n          }\n\n          if (startBlock && isTextBlock(context, startBlock)) {\n            if (\n              endChildKey &&\n              child._key === endChildKey &&\n              isSpan(context, child)\n            ) {\n              startBlock.children.push({\n                ...child,\n                text: child.text.slice(0, endPoint.offset),\n              })\n            } else {\n              startBlock.children.push(child)\n            }\n\n            if (\n              block._key === endBlockKey &&\n              endChildKey &&\n              child._key === endChildKey\n            ) {\n              break\n            }\n          }\n        }\n\n        if (startBlockKey === endBlockKey) {\n          break\n        }\n\n        continue\n      }\n\n      startBlock = block\n\n      if (startBlockKey === endBlockKey) {\n        break\n      }\n    }\n\n    if (block._key === endBlockKey) {\n      if (!isTextBlock(context, block)) {\n        endBlock = block\n        break\n      }\n\n      if (endChildKey) {\n        endBlock = {\n          ...block,\n          children: [],\n        }\n\n        for (const child of block.children) {\n          if (endBlock && isTextBlock(context, endBlock)) {\n            if (child._key === endChildKey && isSpan(context, child)) {\n              endBlock.children.push({\n                ...child,\n                text: child.text.slice(0, endPoint.offset),\n              })\n\n              break\n            }\n\n            endBlock.children.push(child)\n\n            if (endChildKey && child._key === endChildKey) {\n              break\n            }\n          }\n        }\n\n        break\n      }\n\n      endBlock = block\n\n      break\n    }\n\n    if (startBlock) {\n      middleBlocks.push(\n        parseBlock({\n          keyGenerator: context.keyGenerator ?? defaultKeyGenerator,\n          block,\n          profile: 'lenient',\n          schema: context.schema,\n        }) ?? block,\n      )\n    }\n  }\n\n  const parsedStartBlock = startBlock\n    ? parseBlock({\n        keyGenerator: context.keyGenerator ?? defaultKeyGenerator,\n        block: startBlock,\n        profile: 'lenient',\n        schema: context.schema,\n      })\n    : undefined\n\n  const parsedEndBlock = endBlock\n    ? parseBlock({\n        keyGenerator: context.keyGenerator ?? defaultKeyGenerator,\n        block: endBlock,\n        profile: 'lenient',\n        schema: context.schema,\n      })\n    : undefined\n\n  return [\n    ...(parsedStartBlock ? [parsedStartBlock] : []),\n    ...middleBlocks,\n    ...(parsedEndBlock ? [parsedEndBlock] : []),\n  ]\n}\n"],"mappings":";;;;;;;;;;;;;;;AAcA,SAAgB,kBACd,UACA,aACA,UACA,eACoB;CACpB,IAAI,sBAAsB;CAE1B,KAAK,IAAM,SAAS,UAAU;EAC5B,IAAM,OAAO,YAAY,KAAK;EAC9B,IAAI,MAAM,KAAK,MAAM,UACnB,OAAO,SAAS,KAAA,IACZ,KAAA,IACA,sBAAsB;EAE5B,AAAI,SAAS,KAAA,MACX,uBAAuB,KAAK;CAEhC;AAGF;;;;;;;AAQA,SAAgB,kBACd,UACA,aACA,YAC2C;CAC3C,IAAI,kBAAkB;CAEtB,KAAK,IAAM,SAAS,UAAU;EAC5B,IAAM,OAAO,YAAY,KAAK;EAC1B,aAAS,KAAA,GAGb;OAAI,mBAAmB,KAAK,QAAQ;IAClC,IAAM,MAAM,MAAM,KAAK;IACvB,OAAO,QAAQ,KAAA,IAAY,KAAA,IAAY;KAAC;KAAK,QAAQ;IAAe;GACtE;GACA,mBAAmB,KAAK;EADxB;CAEF;AAGF;AAEA,SAAS,MAAM,OAAoC;CACjD,IAAsB,OAAO,SAAU,YAAnC,SAA+C,UAAU,OAAO;EAClE,IAAM,MAAO,MAA0B;EACvC,OAAO,OAAO,OAAQ,WAAW,MAAM,KAAA;CACzC;AAEF;;;;AC1DA,SAAgB,gCAAgC,EAC9C,UACA,aACA,aAKC;CACD,IAAM,aAAa,QAAQ,UAAU,YAAY,IAAI;CAErD,IAAI,CAAC,cAAc,CAAC,YAAY,SAAS,SAAS,WAAW,IAAI,GAC/D;CAGF,IAAM,QAAQ,WAAW,MACnB,YAAY,WAAW;CAE7B,IAAI,cAAc,WAAW;EAC3B,IAAM,SAAS,kBACb,MAAM,WACL,UACC,OAAO,SAAS,SAAS,KAAwC,IAC5D,MAAyB,OAC1B,KAAA,GACN,YAAY,MACd;EACA,OAAO,SACH;GACE,MAAM;IACJ,GAAG;IACH;IACA,EAAC,MAAM,OAAO,IAAG;GACnB;GACA,QAAQ,OAAO;EACjB,IACA,KAAA;CACN;CAEA,IAAI,aAAa,YAAY,QACzB,gBACA,sBAAsB;CAE1B,KAAK,IAAM,SAAS,MAAM,UAAU;EAClC,IAAI,CAAC,OAAO,SAAS,SAAS,KAAK,GAAG;GACpC,sBAAsB;GACtB;EACF;EAEA,IAAI,eAAe,KAAK,kBAAkB,CAAC,qBAKzC;EAGF,IAAI,aAAa,MAAM,KAAK,QAAQ;GAClC,cAAc,MAAM,KAAK;GACzB;EACF;EAEA,IAAI,cAAc,MAAM,KAAK,WAC3B,iBAAiB;GACf,MAAM;IAAC,GAAG;IAAW;IAAY,EAAC,MAAM,MAAM,KAAI;GAAC;GACnD,QAAQ;EACV,GAEA,cAAc,MAAM,KAAK,QAErB,eAAe,IACjB;CAGN;CAEA,OAAO;AACT;;;;AAKA,SAAgB,gCAAgC,EAC9C,UACA,kBAI0B;CAC1B,IAAM,cAAc,eAAe,KAAK,GAAG,EAAE;CAE7C,IAAI,CAAC,eAAe,WAAW,GAC7B;CAGF,IAAM,YAAY,UAAU,UAAU,eAAe,MAAM,EACzD,QAAQ,SAAS,YAAY,EAAC,QAAQ,SAAS,QAAQ,OAAM,GAAG,IAAI,EACtE,CAAC;CAED,IAAI,CAAC,WACH;CAGF,IAAM,SAAS,kBACb,UAAU,KAAK,WACd,UACC,OACE,SAAS,SACT,KACF,IACK,MAAyB,OAC1B,KAAA,GACN,YAAY,MACZ,eAAe,MACjB;CAEA,OAAO,WAAW,KAAA,IAAY,KAAA,IAAY;EAAC,MAAM,UAAU;EAAM;CAAM;AACzE;AC/HA,SAAgB,oBACd,MACA,MACS;CAwBT,OAvBI,SAAS,OACJ,KAGL,SAAS,KAAA,KAAa,SAAS,KAAA,IAC1B,MAIN,OAAO,QAAS,YAAY,OAAO,QAAS,cAC5C,OAAO,QAAS,YAAY,OAAO,QAAS,YAEtC,SAAS,OAGd,eAAe,IAAI,KAAK,eAAe,IAAI,IACtC,KAAK,SAAS,KAAK,OAGxB,MAAM,QAAQ,IAAI,KAAK,MAAM,QAAQ,IAAI,IACpC,KAAK,OAAO,KAAK,MAAM,KAAK,OAAO,KAAK,KAG1C;AACT;;;;ACzBA,SAAgB,aAAa,GAAS,GAAkB;CACtD,IAAI,EAAE,WAAW,EAAE,QACjB,OAAO;CAGT,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,IAAI,CAAC,oBAAoB,EAAE,IAAI,EAAE,EAAE,GACjC,OAAO;CAIX,OAAO;AACT;;;;ACZA,SAAgB,uBACd,GACA,GACA;CACA,OAAO,EAAE,WAAW,EAAE,UAAU,aAAa,EAAE,MAAM,EAAE,IAAI;AAC7D;ACRA,SAAgB,8BAA8B,OAA6B;CACzE,IAAM,mBAAmB,MAAM,KAAK,GAAG,CAAC;CAExC,IAAI,eAAe,gBAAgB,GACjC,OAAO,iBAAiB;AAI5B;AAEA,SAAgB,8BAA8B,OAA6B;CACzE,IAAM,mBAAmB,MAAM,KAAK,GAAG,CAAC;CAExC,IAAI,eAAe,gBAAgB,GACjC,OAAO,iBAAiB;AAI5B;;;;ACbA,SAAgB,iBAAiB,EAC/B,SACA,SAOuB;CACvB,IAAI,YAAY,SAAS,MAAM,IAAI,GAAG;EACpC,IAAM,YAAY,MAAM,KAAK,SAAS,MAAM,KAAK,SAAS,SAAS;EAEnE,IAAI,WACF,OAAO;GACL,MAAM;IAAC,GAAG,MAAM;IAAM;IAAY,EAAC,MAAM,UAAU,KAAI;GAAC;GACxD,QAAQ,OAAO,SAAS,SAAS,IAAI,UAAU,KAAK,SAAS;EAC/D;CAEJ;CAEA,OAAO;EACL,MAAM,MAAM;EACZ,QAAQ;CACV;AACF;;;;ACzBA,SAAgB,mBAAmB,EACjC,SACA,SAOuB;CACvB,IAAI,YAAY,SAAS,MAAM,IAAI,GAAG;EACpC,IAAM,aAAa,MAAM,KAAK,SAAS;EACvC,OAAO;GACL,MAAM;IAAC,GAAG,MAAM;IAAM;IAAY,EAAC,MAAM,YAAY,QAAQ,GAAE;GAAC;GAChE,QAAQ;EACV;CACF;CAEA,OAAO;EACL,MAAM,MAAM;EACZ,QAAQ;CACV;AACF;;;;ACxBA,SAAgB,qBAAqB,WAA4B;CAK/D,OAJK,YAKH,aAAa,UAAU,OAAO,MAAM,UAAU,MAAM,IAAI,KACxD,UAAU,OAAO,WAAW,UAAU,MAAM,SALrC;AAOX;;;;ACVA,SAAgB,qBAMd,WAAoD;CAKpD,OAJK,YAKH,UAAU,WAAW,UAAU,SAAS,UAAU,QAJ3C;AAMX;;;;ACdA,SAAgB,uBAMd,WAAoD;CAKpD,OAJK,YAKH,UAAU,WAAW,UAAU,QAAQ,UAAU,SAJ1C;AAMX;;;;AChBA,MAAa,4BAAoC,UAAU,EAAE,GAEvD,yBAAyB;CAC7B,IAAI;CACJ,aAAa;EACX,IAAI,OACF,OAAO;EAGT,QAAQ,CAAC;EACT,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,GACzB,MAAM,MAAM,IAAI,IAAA,CAAO,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC;EAE7C,OAAO;CACT;AACF,EAAA,CAAG;AAGH,SAAS,UAAU,SAAS,IAAI;CAC9B,IAAM,QAAQ,IAAI,WAAW,MAAM;CAEnC,OADA,OAAO,gBAAgB,KAAK,GACrB;AACT;AAEA,SAAS,UAAU,QAAyB;CAC1C,IAAM,QAAQ,gBAAgB;CAC9B,OAAO,UAAU,MAAM,CAAC,CACrB,QAAQ,KAAK,MAAM,MAAM,MAAM,IAAI,EAAE,CAAC,CACtC,MAAM,GAAG,MAAM;AACpB;ACVA,MAAM,gBAGF;CACF,QAAQ;EAAC,WAAW;EAAM,sBAAsB;EAAM,gBAAgB;CAAI;CAC1E,SAAS;EACP,WAAW;EACX,sBAAsB;EACtB,gBAAgB;CAClB;AACF,GAEM,gBAAiE;CACrE,QAAQ,EAAC,gBAAgB,GAAI;CAC7B,SAAS,EAAC,gBAAgB,GAAK;AACjC;AA+BA,SAAgB,WAAW,EACzB,QACA,cACA,OACA,WAMgC;CAChC,OAAO,mBAAmB;EACxB;EACA;EACA;EACA,SAAS,cAAc;CACzB,CAAC;AACH;AAEA,SAAgB,UAAU,EACxB,MACA,QACA,cACA,aACA,WAO+B;CAC/B,OAAO,kBAAkB;EACvB;EACA;EACA;EACA;EACA,SAAS,cAAc;CACzB,CAAC;AACH;AAEA,SAAgB,kBAAkB,EAChC,cACA,QACA,cACA,WAMiC;CACjC,OAAO,0BAA0B;EAC/B;EACA;EACA;EACA,SAAS,cAAc;CACzB,CAAC;AACH;AAwBA,SAAgB,cAAc,EAC5B,QACA,cACA,UACA,WASA;CACA,OAAO,sBAAsB;EAC3B;EACA;EACA;EACA,SAAS,cAAc;CACzB,CAAC;AACH;AAEA,SAAS,mBAAmB,EAC1B,QACA,cACA,OACA,WAUgC;CAChC,OACE,eAAe;EAAC;EAAO;EAAQ;EAAc;CAAO,CAAC,KACrD,iBAAiB;EAAC,aAAa;EAAO;EAAQ;EAAc;CAAO,CAAC;AAExE;AAEA,SAAS,iBAAiB,EACxB,aACA,QACA,cACA,WAMiC;CACjC,IAAI,CAAC,cAAc,WAAW,GAC5B;CAGF,IAAM,aAAa,OAAO,aAAa,MACpC,EAAC,WAAU,SAAS,YAAY,KACnC;CAEK,gBAIL,OAAO,YAAY;EACjB,QAAQ;EACR;EACA;EACA;EACA;CACF,CAAC;AACH;AAEA,SAAS,eAAe,EACtB,OACA,QACA,cACA,WAUoC;CAKpC,IAJI,CAAC,cAAc,KAAK,KAIpB,MAAM,UAAU,OAAO,MAAM,MAC/B;CAGF,IAAM,eAAwC,CAAC;CAE/C,KAAK,IAAM,OAAO,OAAO,KAAK,KAAK,GAE/B,QAAQ,WACR,QAAQ,UACR,QAAQ,cACR,QAAQ,cACR,QAAQ,WACR,QAAQ,cACR,QAAQ,YAKN,QAAQ,kBACL,OAAO,MAAM,UAAU,CAAC,EAAA,CAAG,MAAM,MAAM,EAAE,SAAS,GAAG,MACxD,aAAa,OAAO,MAAM,QAG5B,aAAa,OAAO,MAAM;CAI9B,IAAM,OACJ,OAAO,MAAM,QAAY,WAAW,MAAM,OAAU,aAAa,GAE7D,EAAC,UAAU,gBAAe,sBAAsB;EACpD;EACA;EACA,UAAU,MAAM;EAChB;CACF,CAAC,GAMK,kBAJmC,MAAM,QAAQ,MAAM,QAAW,IACpE,MAAM,WACN,CAAC,EAAA,CAGF,KAAK,UACJ,mBAAmB;EAAC;EAAO;EAAQ;EAAc;EAAa;CAAO,CAAC,CACxE,CAAC,CACA,QAAQ,UAAU,UAAU,KAAA,CAAS,GAClC,QAAQ,eAAe,SAAS,UAAU,MAAM,SAAS,CAAC,CAAC,GAE3D,WACJ,eAAe,SAAS,IACpB,iBACA,CACE;EACE,MAAM,aAAa;EACnB,OAAO,OAAO,KAAK;EACnB,MAAM;EACN,OAAO,CAAC;CACV,CACF,GAEA,qBAAqB,QAAQ,YAE/B,SAAS,QACN,oBAAoB,OAAO,UAAU;EACpC,IAAI,OAAO,EAAC,OAAM,GAAG,KAAK,GACxB,OAAO,CAAC,GAAG,oBAAoB,KAAK;EAGtC,IAAM,gBAAgB,mBAAmB,GAAG,EAAE;EAyB9C,OAvBI,CAAC,iBAAiB,CAAC,OAAO,EAAC,OAAM,GAAG,aAAa,IAC5C;GACL,GAAG;GACH;IACE,MAAM,aAAa;IACnB,OAAO,OAAO,KAAK;IACnB,MAAM;IACN,OAAO,CAAC;GACV;GACA;GACA,GAAI,UAAU,SAAS,SAAS,IAC5B,CACE;IACE,MAAM,aAAa;IACnB,OAAO,OAAO,KAAK;IACnB,MAAM;IACN,OAAO,CAAC;GACV,CACF,IACA,CAAC;EACP,IAGK,CAAC,GAAG,oBAAoB,KAAK;CACtC,GACA,CAAC,CACH,IACA,UAEE,cAAqC;EACzC,OAAO,OAAO,MAAM;EACpB;EACA,UAAU;EACV,GAAG;CACL;CA0BA,OAxBI,OAAO,MAAM,YAAgB,YAAY,MAAM,aAAgB,SACjE,YAAY,WAAW,QAAQ,uBAC3B,SAAS,QAAQ,YAAY,MAAM,SAAS,QAAQ,IAAI,CAAC,IACzD,WAIJ,OAAO,MAAM,SAAa,YAC1B,OAAO,OAAO,MAAM,UAAU,MAAM,SAAS,MAAM,KAAQ,MAE3D,YAAY,QAAQ,MAAM,QAI1B,OAAO,MAAM,YAAgB,YAC7B,OAAO,MAAM,MAAM,SAAS,KAAK,SAAS,MAAM,QAAW,MAE3D,YAAY,WAAW,MAAM,WAG3B,OAAO,MAAM,SAAa,aAC5B,YAAY,QAAQ,MAAM,QAGrB;AACT;AAEA,SAAS,sBAAsB,EAC7B,QACA,cACA,UACA,WASA;CACA,IAAM,mBAAmC,MAAM,QAAQ,QAAQ,IAC3D,WACA,CAAC,GACC,8BAAc,IAAI,IAAY;CAkCpC,OAAO;EACL,UAjCqB,iBAAiB,SAAS,YAAY;GAC3D,IAAI,CAAC,cAAc,OAAO,GACxB,OAAO,CAAC;GAGV,IAAM,aAAa,OAAO,YAAY,MACnC,EAAC,WAAU,SAAS,QAAQ,KAC/B;GAMA,IAJI,CAAC,cAID,OAAO,QAAQ,QAAY,UAG7B,OAAO,CAAC;GAGV,IAAM,mBAAmB,YAAY;IACnC,QAAQ;IACR;IACA;IACA;IACA;GACF,CAAC;GAID,OAFA,YAAY,IAAI,QAAQ,IAAO,GAExB,CAAC,gBAAgB;EAC1B,CAGY;EACV;CACF;AACF;AAEA,SAAS,mBAAmB,EAC1B,OACA,QACA,cACA,aACA,WAOoD;CACpD,OACE,kBAAkB;EAChB,MAAM;EACN;EACA;EACA;EACA;CACF,CAAC,KACD,0BAA0B;EACxB,cAAc;EACd;EACA;EACA;CACF,CAAC;AAEL;AAEA,SAAS,kBAAkB,EACzB,MACA,QACA,cACA,aACA,WAO+B;CAC/B,IAAI,CAAC,SAAS,IAAI,GAChB;CAGF,IAAM,eAAwC,CAAC;CAE/C,KAAK,IAAM,OAAO,OAAO,KAAK,IAAI,GAChC,AACE,QAAQ,WACR,QAAQ,UACR,QAAQ,UACR,QAAQ,YAER,aAAa,OAAO,KAAK;CAO7B,IAAM,SAHgC,MAAM,QAAQ,KAAK,KAAQ,IAC7D,KAAK,QACL,CAAC,EAAA,CACuB,SAAS,SAC/B,OAAO,QAAS,aAIhB,YAAY,IAAI,IAAI,KAIpB,OAAO,WAAW,MAAM,cAAc,UAAU,SAAS,IAAI,KACxD,CAAC,IAAI,IAGP,CAAC,CACT;CAEG,WAAO,KAAK,SAAa,YAAY,KAAK,UAAa,OAAO,KAAK,MAkBvE,OAdI,OAAO,KAAK,SAAa,WActB;EACL,OAAO,OAAO,KAAK;EACnB,MAAM,OAAO,KAAK,QAAY,WAAW,KAAK,OAAU,aAAa;EACrE,MAAM,OAAO,KAAK,QAAY,WAAW,KAAK,OAAU;EACxD;EACA,GAAI,QAAQ,iBAAiB,CAAC,IAAI;CACpC,IAnBM,OAAO,KAAK,QAAY,WACnB;EACL,OAAO,OAAO,KAAK;EACnB,MAAM,OAAO,KAAK,QAAY,WAAW,KAAK,OAAU,aAAa;EACrE,MAAM,KAAK;EACX;EACA,GAAI,QAAQ,iBAAiB,CAAC,IAAI;CACpC,IAGF;AAUJ;AAEA,SAAS,0BAA0B,EACjC,cACA,QACA,cACA,WAMiC;CACjC,IAAI,CAAC,cAAc,YAAY,GAC7B;CAGF,IAAM,aAAa,OAAO,cAAc,MACrC,EAAC,WAAU,SAAS,aAAa,KACpC;CAEK,gBAIL,OAAO,YAAY;EACjB,QAAQ;EACR;EACA;EACA;EACA;CACF,CAAC;AACH;AAEA,SAAgB,gBAAgB,EAC9B,YACA,QACA,cACA,WAMiC;CACjC,IAAI,CAAC,cAAc,UAAU,GAC3B;CAGF,IAAM,aAAa,OAAO,YAAY,MACnC,EAAC,WAAU,SAAS,WAAW,KAClC;CAEA,IAAI,CAAC,YACH;CAGF,IAAM,UAAU,cAAc;CAE9B,OAAO,YAAY;EACjB,QAAQ;EACR;EACA;EACA;EACA;CACF,CAAC;AACH;;;;;;;;;;;;;;AAeA,SAAS,gBACP,IACA,UACA,QACA,gBACoE;CACpE,KAAK,IAAM,UAAU,IACf,WAAO,SAAS,SAGpB;MAAI,OAAO,SAAS,YAAY,UAAU,UAAU,OAAO,MAAM;GAC/D,IAAI,OAAO,SAAS,YAAY,YAAY,UAAU,OAAO,QAC3D,OAAO;IAAC,MAAM,OAAO;IAAM,QAAQ,OAAO;GAAM;GAElD;EACF;EACA,IAAI,OAAO,SAAS,UAAU;GAC5B,IAAM,gBAAgB,eAAe,IAAI,QAAQ;GACjD,IAAI,eACF,OAAO;IAAC,MAAM;IAAU,QAAQ;GAAa;GAE/C,IAAM,YAAY,OAAO,aAAa,MACnC,gBAAgB,YAAY,SAAS,QACxC;GAIA,OAHI,aAAa,YAAY,aAAa,UAAU,SAC3C;IAAC,MAAM,UAAU;IAAM,QAAQ,UAAU;GAAM,IAExD;EACF;CAbA;AAgBJ;;;;;;;AAQA,SAAS,YAAY,EACnB,QACA,QACA,cACA,YACA,gBACA,WAWqB;CACrB,IAAM,EAAC,MAAM,GAAG,iBAAgB,QAE1B,eAAe,IAAI,IACvB,WAAW,OAAO,KAAK,UAAU,CAAC,MAAM,MAAM,KAAK,CAAC,CACtD,GAEM,gBAAgB,IAAI,IAAI,kBAAkB,CAAC,CAAC;CAClD,cAAc,IAAI,WAAW,MAAM,WAAW,MAAM;CAEpD,IAAM,SAAkC,CAAC;CAEzC,KAAK,IAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,YAAY,GAAG;EAKvD,IAJI,QAAQ,WAIR,UAAU,KAAA,GACZ;EAGF,IAAM,QAAQ,aAAa,IAAI,GAAG;EAE9B,cAAQ,kBAAkB,CAAC,QAI/B;OAAI,SAAS,MAAM,SAAS,WAAW,MAAM,MAAM,MAAM,QAAQ,KAAK,GAAG;IACvE,OAAO,OAAO,yBAAyB;KACrC;KACA;KACA,IAAI,MAAM;KACV;KACA,gBAAgB;KAChB;IACF,CAAC;IACD;GACF;GAEA,OAAO,OAAO;EAFd;CAGF;CAEA,OAAO;EACL,OAAO,WAAW;EAClB,MAAM,OAAO,QAAS,WAAW,OAAO,aAAa;EACrD,GAAG;CACL;AACF;;;;;;;;;;;;;;;;;;AAmBA,SAAS,yBAAyB,EAChC,QACA,cACA,IACA,OACA,gBACA,WAQiB;CAEjB,IAAM,sBADiB,GAAG,MAAM,WAAW,OAAO,SAAS,OAC/B,IACxB,aAAa,QAAQ,EAAE,IACvB,KAAA;CAEJ,OAAO,MAAM,SAAS,SAAS;EAC7B,IAAI,CAAC,cAAc,IAAI,GACrB,OAAO,CAAC,IAAI;EAGd,IAAI,uBAAuB,KAAK,UAAU,oBAAoB,MAAM,MAAM;GACxE,IAAM,SAAS,eAAe;IAC5B,OAAO;IACP,QAAQ;IACR;IACA,SAAS;KACP,WAAW;KACX,sBAAsB;KACtB,gBAAgB,QAAQ;IAC1B;GACF,CAAC;GACD,OAAO,SAAS,CAAC,MAAM,IAAI,CAAC;EAC9B;EAEA,IAAM,aAAa,gBAAgB,IAAI,KAAK,OAAO,QAAQ,cAAc;EAIzE,OAHK,aAGE,CACL,YAAY;GACV,QAAQ;GACR;GACA;GACA,YAAY;IACV,MAAM,WAAW;IACjB,QAAQ,WAAW;GACrB;GACA;GACA;EACF,CAAC,CACH,IAdS,CAAC,IAAI;CAehB,CAAC;AACH;;;;ACjxBA,SAAgB,YAAY,EAC1B,SACA,UAM2B;CAC3B,IAAM,QAAkC,CAAC;CAEzC,IAAI,CAAC,QAAQ,WACX,OAAO;CAGT,IAAI,YACE,eAAoC,CAAC,GACvC,UAEE,aAAa,uBAAuB,QAAQ,SAAS,GACrD,WAAW,qBAAqB,QAAQ,SAAS,GACjD,gBAAgB,8BAA8B,UAAU,GACxD,gBAAgB,8BAA8B,UAAU,GACxD,cAAc,8BAA8B,QAAQ,GACpD,cAAc,8BAA8B,QAAQ;CAE1D,IAAI,CAAC,iBAAiB,CAAC,aACrB,OAAO;CAGT,KAAK,IAAM,SAAS,QAAQ;EAC1B,IAAI,CAAC,YAAY,SAAS,KAAK,KACzB,MAAM,SAAS,iBAAiB,MAAM,SAAS,aAAa;GAC9D,aAAa;GACb;EACF;EAGF,IAAI,MAAM,SAAS,eAAe;GAChC,IAAI,CAAC,YAAY,SAAS,KAAK,GAAG;IAChC,aAAa;IACb;GACF;GAEA,IAAI,eAAe;IACjB,KAAK,IAAM,SAAS,MAAM,UAAU;KAClC,IAAI,MAAM,SAAS,eAAe;MAChC,IAAI,OAAO,SAAS,KAAK,GAAG;OAC1B,IAAM,OACJ,MAAM,SAAS,cACX,MAAM,KAAK,MAAM,WAAW,QAAQ,SAAS,MAAM,IACnD,MAAM,KAAK,MAAM,WAAW,MAAM;OAExC,aAAa;QACX,GAAG;QACH,UAAU,CACR;SACE,GAAG;SACH;QACF,CACF;OACF;MACF,OACE,aAAa;OACX,GAAG;OACH,UAAU,CAAC,KAAK;MAClB;MAGF,IAAI,MAAM,SAAS,eAAe,kBAAkB,aAClD;MAEF;KACF;KAEA,IAAI,cAAc,YAAY,SAAS,UAAU,MAE7C,eACA,MAAM,SAAS,eACf,OAAO,SAAS,KAAK,IAErB,WAAW,SAAS,KAAK;MACvB,GAAG;MACH,MAAM,MAAM,KAAK,MAAM,GAAG,SAAS,MAAM;KAC3C,CAAC,IAED,WAAW,SAAS,KAAK,KAAK,GAI9B,MAAM,SAAS,eACf,eACA,MAAM,SAAS,cAEf;IAGN;IAEA,IAAI,kBAAkB,aACpB;IAGF;GACF;GAIA,IAFA,aAAa,OAET,kBAAkB,aACpB;EAEJ;EAEA,IAAI,MAAM,SAAS,aAAa;GAC9B,IAAI,CAAC,YAAY,SAAS,KAAK,GAAG;IAChC,WAAW;IACX;GACF;GAEA,IAAI,aAAa;IACf,WAAW;KACT,GAAG;KACH,UAAU,CAAC;IACb;IAEA,KAAK,IAAM,SAAS,MAAM,UACxB,IAAI,YAAY,YAAY,SAAS,QAAQ,GAAG;KAC9C,IAAI,MAAM,SAAS,eAAe,OAAO,SAAS,KAAK,GAAG;MACxD,SAAS,SAAS,KAAK;OACrB,GAAG;OACH,MAAM,MAAM,KAAK,MAAM,GAAG,SAAS,MAAM;MAC3C,CAAC;MAED;KACF;KAIA,IAFA,SAAS,SAAS,KAAK,KAAK,GAExB,eAAe,MAAM,SAAS,aAChC;IAEJ;IAGF;GACF;GAEA,WAAW;GAEX;EACF;EAEA,AAAI,cACF,aAAa,KACX,WAAW;GACT,cAAc,QAAQ,gBAAgB;GACtC;GACA,SAAS;GACT,QAAQ,QAAQ;EAClB,CAAC,KAAK,KACR;CAEJ;CAEA,IAAM,mBAAmB,aACrB,WAAW;EACT,cAAc,QAAQ,gBAAgB;EACtC,OAAO;EACP,SAAS;EACT,QAAQ,QAAQ;CAClB,CAAC,IACD,KAAA,GAEE,iBAAiB,WACnB,WAAW;EACT,cAAc,QAAQ,gBAAgB;EACtC,OAAO;EACP,SAAS;EACT,QAAQ,QAAQ;CAClB,CAAC,IACD,KAAA;CAEJ,OAAO;EACL,GAAI,mBAAmB,CAAC,gBAAgB,IAAI,CAAC;EAC7C,GAAG;EACH,GAAI,iBAAiB,CAAC,cAAc,IAAI,CAAC;CAC3C;AACF"}

package/lib/utils/index.d.ts

@@ -1,4 +1,4 @@
-import { I as BlockOffset, at as EditorSelectionPoint, cn as KeyedSegment, et as EditorContext, it as EditorSelection, ln as Path, on as BlockPath, un as PathSegment, xt as TraversalSnapshot } from "../behavior.types.action-C0XDEQnB.js";
+import { I as BlockOffset, at as EditorSelectionPoint, cn as KeyedSegment, et as EditorContext, it as EditorSelection, ln as Path, on as BlockPath, un as PathSegment, xt as TraversalSnapshot } from "../behavior.types.action-DbwK30_J.js";
 import { PortableTextBlock, PortableTextTextBlock, isSpan, isTextBlock } from "@portabletext/schema";
 /**
  * @public

package/lib/utils/index.js

@@ -1,6 +1,6 @@
-import { d as isKeyedSegment, r as getNode, t as getParent } from "../get-parent-DgaKcy8-.js";
-import { _ as isEqualPaths, d as getSelectionEndPoint, f as isSelectionCollapsed, g as isEqualSelectionPoints, i as parseBlock, m as getBlockEndPoint, p as getBlockStartPoint, t as sliceBlocks, u as getSelectionStartPoint, v as blockOffsetToSpanSelectionPoint, y as spanSelectionPointToBlockOffset } from "../util.slice-blocks-_ElaB53f.js";
-import { n as isEmptyTextBlock, r as getTextBlockText, t as isEqualSelections } from "../util.is-equal-selections-BdK98okY.js";
+import { p as isKeyedSegment, r as getNode, t as getParent } from "../get-parent-BLzi7eLr.js";
+import { _ as spanSelectionPointToBlockOffset, c as getSelectionStartPoint, d as getBlockStartPoint, f as getBlockEndPoint, g as blockOffsetToSpanSelectionPoint, h as isEqualPaths, l as getSelectionEndPoint, m as isEqualSelectionPoints, r as parseBlock, t as sliceBlocks, u as isSelectionCollapsed } from "../util.slice-blocks-B-iKFEG7.js";
+import { n as isEmptyTextBlock, r as getTextBlockText, t as isEqualSelections } from "../util.is-equal-selections-sCQib0IC.js";
 import { isSpan, isSpan as isSpan$1, isTextBlock, isTextBlock as isTextBlock$1 } from "@portabletext/schema";
 function blockOffsetToBlockSelectionPoint({ snapshot, blockOffset }) {
 	let blockEntry = getNode(snapshot, blockOffset.path);
@@ -62,11 +62,7 @@ function mergeTextBlocks({ context, targetBlock, incomingBlock }) {
 	let parsedIncomingBlock = parseBlock({
 		keyGenerator: context.keyGenerator,
 		block: incomingBlock,
-		options: {
-			normalize: !1,
-			removeUnusedMarkDefs: !0,
-			validateFields: !1
-		},
+		profile: "lenient",
 		schema: context.schema
 	});
 	return !parsedIncomingBlock || !isTextBlock$1(context, parsedIncomingBlock) ? targetBlock : {

package/lib/utils/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":[],"sources":["../../src/utils/util.block-offset-to-block-selection-point.ts","../../src/utils/util.block-offset-to-selection-point.ts","../../src/utils/util.block-offsets-to-selection.ts","../../src/utils/util.child-selection-point-to-block-offset.ts","../../src/utils/util.merge-text-blocks.ts","../../src/utils/util.reverse-selection.ts"],"sourcesContent":["import {getNode} from '../traversal/get-node'\nimport type {TraversalSnapshot} from '../traversal/traversal-snapshot'\nimport type {BlockOffset} from '../types/block-offset'\nimport type {EditorSelectionPoint} from '../types/editor'\n\nexport function blockOffsetToBlockSelectionPoint({\n  snapshot,\n  blockOffset,\n}: {\n  snapshot: TraversalSnapshot\n  blockOffset: BlockOffset\n}): EditorSelectionPoint | undefined {\n  const blockEntry = getNode(snapshot, blockOffset.path)\n\n  if (!blockEntry) {\n    return undefined\n  }\n\n  return {\n    path: blockEntry.path,\n    offset: blockOffset.offset,\n  }\n}\n","import type {TraversalSnapshot} from '../traversal/traversal-snapshot'\nimport type {BlockOffset} from '../types/block-offset'\nimport type {EditorSelectionPoint} from '../types/editor'\nimport {blockOffsetToSpanSelectionPoint} from './util.block-offset'\nimport {blockOffsetToBlockSelectionPoint} from './util.block-offset-to-block-selection-point'\n\nexport function blockOffsetToSelectionPoint({\n  snapshot,\n  blockOffset,\n  direction,\n}: {\n  snapshot: TraversalSnapshot\n  blockOffset: BlockOffset\n  direction: 'forward' | 'backward'\n}): EditorSelectionPoint | undefined {\n  const spanSelectionPoint = blockOffsetToSpanSelectionPoint({\n    snapshot,\n    blockOffset,\n    direction,\n  })\n\n  if (!spanSelectionPoint) {\n    return blockOffsetToBlockSelectionPoint({\n      snapshot,\n      blockOffset,\n    })\n  }\n\n  return spanSelectionPoint\n}\n","import type {TraversalSnapshot} from '../traversal/traversal-snapshot'\nimport type {BlockOffset} from '../types/block-offset'\nimport type {EditorSelection} from '../types/editor'\nimport {blockOffsetToSelectionPoint} from './util.block-offset-to-selection-point'\n\n/**\n * @public\n */\nexport function blockOffsetsToSelection({\n  snapshot,\n  offsets,\n  backward,\n}: {\n  snapshot: TraversalSnapshot\n  offsets: {anchor: BlockOffset; focus: BlockOffset}\n  backward?: boolean\n}): EditorSelection {\n  const anchor = blockOffsetToSelectionPoint({\n    snapshot,\n    blockOffset: offsets.anchor,\n    direction: backward ? 'backward' : 'forward',\n  })\n  const focus = blockOffsetToSelectionPoint({\n    snapshot,\n    blockOffset: offsets.focus,\n    direction: backward ? 'forward' : 'backward',\n  })\n\n  if (!anchor || !focus) {\n    return null\n  }\n\n  return {\n    anchor,\n    focus,\n    backward,\n  }\n}\n","import {isSpan, isTextBlock} from '@portabletext/schema'\nimport {getParent} from '../traversal/get-parent'\nimport type {TraversalSnapshot} from '../traversal/traversal-snapshot'\nimport type {BlockOffset} from '../types/block-offset'\nimport type {EditorSelectionPoint} from '../types/editor'\nimport {isKeyedSegment} from './util.is-keyed-segment'\n\n/**\n * @public\n */\nexport function childSelectionPointToBlockOffset({\n  snapshot,\n  selectionPoint,\n}: {\n  snapshot: TraversalSnapshot\n  selectionPoint: EditorSelectionPoint\n}): BlockOffset | undefined {\n  const childSegment = selectionPoint.path.at(-1)\n\n  if (!isKeyedSegment(childSegment)) {\n    return undefined\n  }\n\n  const textBlock = getParent(snapshot, selectionPoint.path, {\n    match: (node) => isTextBlock({schema: snapshot.context.schema}, node),\n  })\n\n  if (!textBlock) {\n    return undefined\n  }\n\n  let offset = 0\n\n  for (const child of textBlock.node.children) {\n    if (child._key === childSegment._key) {\n      return {\n        path: textBlock.path,\n        offset: offset + selectionPoint.offset,\n      }\n    }\n\n    if (isSpan(snapshot.context, child)) {\n      offset += child.text.length\n    }\n  }\n\n  return undefined\n}\n","import {isTextBlock, type PortableTextTextBlock} from '@portabletext/schema'\nimport type {EditorContext} from '../editor/editor-snapshot'\nimport {parseBlock} from './parse-blocks'\n\n/**\n * @beta\n */\nexport function mergeTextBlocks({\n  context,\n  targetBlock,\n  incomingBlock,\n}: {\n  context: Pick<EditorContext, 'keyGenerator' | 'schema'>\n  targetBlock: PortableTextTextBlock\n  incomingBlock: PortableTextTextBlock\n}) {\n  const parsedIncomingBlock = parseBlock({\n    keyGenerator: context.keyGenerator,\n    block: incomingBlock,\n    options: {\n      normalize: false,\n      removeUnusedMarkDefs: true,\n      validateFields: false,\n    },\n    schema: context.schema,\n  })\n\n  if (!parsedIncomingBlock || !isTextBlock(context, parsedIncomingBlock)) {\n    return targetBlock\n  }\n\n  return {\n    ...targetBlock,\n    children: [...targetBlock.children, ...parsedIncomingBlock.children],\n    markDefs: [\n      ...(targetBlock.markDefs ?? []),\n      ...(parsedIncomingBlock.markDefs ?? []),\n    ],\n  }\n}\n","import type {EditorSelection} from '../types/editor'\n\n/**\n * @public\n */\nexport function reverseSelection<\n  TEditorSelection extends NonNullable<EditorSelection> | null,\n>(selection: TEditorSelection): TEditorSelection {\n  if (!selection) {\n    return selection\n  }\n\n  if (selection.backward) {\n    return {\n      anchor: selection.focus,\n      focus: selection.anchor,\n      backward: false,\n    } as TEditorSelection\n  }\n\n  return {\n    anchor: selection.focus,\n    focus: selection.anchor,\n    backward: true,\n  } as TEditorSelection\n}\n"],"mappings":";;;;AAKA,SAAgB,iCAAiC,EAC/C,UACA,eAImC;CACnC,IAAM,aAAa,QAAQ,UAAU,YAAY,IAAI;CAEhD,gBAIL,OAAO;EACL,MAAM,WAAW;EACjB,QAAQ,YAAY;CACtB;AACF;AChBA,SAAgB,4BAA4B,EAC1C,UACA,aACA,aAKmC;CAcnC,OAb2B,gCAAgC;EACzD;EACA;EACA;CACF,CAEK,KACI,iCAAiC;EACtC;EACA;CACF,CAAC;AAIL;;;;ACrBA,SAAgB,wBAAwB,EACtC,UACA,SACA,YAKkB;CAClB,IAAM,SAAS,4BAA4B;EACzC;EACA,aAAa,QAAQ;EACrB,WAAW,WAAW,aAAa;CACrC,CAAC,GACK,QAAQ,4BAA4B;EACxC;EACA,aAAa,QAAQ;EACrB,WAAW,WAAW,YAAY;CACpC,CAAC;CAMD,OAJI,CAAC,UAAU,CAAC,QACP,OAGF;EACL;EACA;EACA;CACF;AACF;;;;AC3BA,SAAgB,iCAAiC,EAC/C,UACA,kBAI0B;CAC1B,IAAM,eAAe,eAAe,KAAK,GAAG,EAAE;CAE9C,IAAI,CAAC,eAAe,YAAY,GAC9B;CAGF,IAAM,YAAY,UAAU,UAAU,eAAe,MAAM,EACzD,QAAQ,SAAS,cAAY,EAAC,QAAQ,SAAS,QAAQ,OAAM,GAAG,IAAI,EACtE,CAAC;CAED,IAAI,CAAC,WACH;CAGF,IAAI,SAAS;CAEb,KAAK,IAAM,SAAS,UAAU,KAAK,UAAU;EAC3C,IAAI,MAAM,SAAS,aAAa,MAC9B,OAAO;GACL,MAAM,UAAU;GAChB,QAAQ,SAAS,eAAe;EAClC;EAGF,AAAI,SAAO,SAAS,SAAS,KAAK,MAChC,UAAU,MAAM,KAAK;CAEzB;AAGF;;;;ACxCA,SAAgB,gBAAgB,EAC9B,SACA,aACA,iBAKC;CACD,IAAM,sBAAsB,WAAW;EACrC,cAAc,QAAQ;EACtB,OAAO;EACP,SAAS;GACP,WAAW;GACX,sBAAsB;GACtB,gBAAgB;EAClB;EACA,QAAQ,QAAQ;CAClB,CAAC;CAMD,OAJI,CAAC,uBAAuB,CAAC,cAAY,SAAS,mBAAmB,IAC5D,cAGF;EACL,GAAG;EACH,UAAU,CAAC,GAAG,YAAY,UAAU,GAAG,oBAAoB,QAAQ;EACnE,UAAU,CACR,GAAI,YAAY,YAAY,CAAC,GAC7B,GAAI,oBAAoB,YAAY,CAAC,CACvC;CACF;AACF;;;;AClCA,SAAgB,iBAEd,WAA+C;CAa/C,OAZK,cAID,UAAU,WACL;EACL,QAAQ,UAAU;EAClB,OAAO,UAAU;EACjB,UAAU;CACZ,IAGK;EACL,QAAQ,UAAU;EAClB,OAAO,UAAU;EACjB,UAAU;CACZ;AACF"}
+{"version":3,"file":"index.js","names":[],"sources":["../../src/utils/util.block-offset-to-block-selection-point.ts","../../src/utils/util.block-offset-to-selection-point.ts","../../src/utils/util.block-offsets-to-selection.ts","../../src/utils/util.child-selection-point-to-block-offset.ts","../../src/utils/util.merge-text-blocks.ts","../../src/utils/util.reverse-selection.ts"],"sourcesContent":["import {getNode} from '../traversal/get-node'\nimport type {TraversalSnapshot} from '../traversal/traversal-snapshot'\nimport type {BlockOffset} from '../types/block-offset'\nimport type {EditorSelectionPoint} from '../types/editor'\n\nexport function blockOffsetToBlockSelectionPoint({\n  snapshot,\n  blockOffset,\n}: {\n  snapshot: TraversalSnapshot\n  blockOffset: BlockOffset\n}): EditorSelectionPoint | undefined {\n  const blockEntry = getNode(snapshot, blockOffset.path)\n\n  if (!blockEntry) {\n    return undefined\n  }\n\n  return {\n    path: blockEntry.path,\n    offset: blockOffset.offset,\n  }\n}\n","import type {TraversalSnapshot} from '../traversal/traversal-snapshot'\nimport type {BlockOffset} from '../types/block-offset'\nimport type {EditorSelectionPoint} from '../types/editor'\nimport {blockOffsetToSpanSelectionPoint} from './util.block-offset'\nimport {blockOffsetToBlockSelectionPoint} from './util.block-offset-to-block-selection-point'\n\nexport function blockOffsetToSelectionPoint({\n  snapshot,\n  blockOffset,\n  direction,\n}: {\n  snapshot: TraversalSnapshot\n  blockOffset: BlockOffset\n  direction: 'forward' | 'backward'\n}): EditorSelectionPoint | undefined {\n  const spanSelectionPoint = blockOffsetToSpanSelectionPoint({\n    snapshot,\n    blockOffset,\n    direction,\n  })\n\n  if (!spanSelectionPoint) {\n    return blockOffsetToBlockSelectionPoint({\n      snapshot,\n      blockOffset,\n    })\n  }\n\n  return spanSelectionPoint\n}\n","import type {TraversalSnapshot} from '../traversal/traversal-snapshot'\nimport type {BlockOffset} from '../types/block-offset'\nimport type {EditorSelection} from '../types/editor'\nimport {blockOffsetToSelectionPoint} from './util.block-offset-to-selection-point'\n\n/**\n * @public\n */\nexport function blockOffsetsToSelection({\n  snapshot,\n  offsets,\n  backward,\n}: {\n  snapshot: TraversalSnapshot\n  offsets: {anchor: BlockOffset; focus: BlockOffset}\n  backward?: boolean\n}): EditorSelection {\n  const anchor = blockOffsetToSelectionPoint({\n    snapshot,\n    blockOffset: offsets.anchor,\n    direction: backward ? 'backward' : 'forward',\n  })\n  const focus = blockOffsetToSelectionPoint({\n    snapshot,\n    blockOffset: offsets.focus,\n    direction: backward ? 'forward' : 'backward',\n  })\n\n  if (!anchor || !focus) {\n    return null\n  }\n\n  return {\n    anchor,\n    focus,\n    backward,\n  }\n}\n","import {isSpan, isTextBlock} from '@portabletext/schema'\nimport {getParent} from '../traversal/get-parent'\nimport type {TraversalSnapshot} from '../traversal/traversal-snapshot'\nimport type {BlockOffset} from '../types/block-offset'\nimport type {EditorSelectionPoint} from '../types/editor'\nimport {isKeyedSegment} from './util.is-keyed-segment'\n\n/**\n * @public\n */\nexport function childSelectionPointToBlockOffset({\n  snapshot,\n  selectionPoint,\n}: {\n  snapshot: TraversalSnapshot\n  selectionPoint: EditorSelectionPoint\n}): BlockOffset | undefined {\n  const childSegment = selectionPoint.path.at(-1)\n\n  if (!isKeyedSegment(childSegment)) {\n    return undefined\n  }\n\n  const textBlock = getParent(snapshot, selectionPoint.path, {\n    match: (node) => isTextBlock({schema: snapshot.context.schema}, node),\n  })\n\n  if (!textBlock) {\n    return undefined\n  }\n\n  let offset = 0\n\n  for (const child of textBlock.node.children) {\n    if (child._key === childSegment._key) {\n      return {\n        path: textBlock.path,\n        offset: offset + selectionPoint.offset,\n      }\n    }\n\n    if (isSpan(snapshot.context, child)) {\n      offset += child.text.length\n    }\n  }\n\n  return undefined\n}\n","import {isTextBlock, type PortableTextTextBlock} from '@portabletext/schema'\nimport type {EditorContext} from '../editor/editor-snapshot'\nimport {parseBlock} from './parse-blocks'\n\n/**\n * @beta\n */\nexport function mergeTextBlocks({\n  context,\n  targetBlock,\n  incomingBlock,\n}: {\n  context: Pick<EditorContext, 'keyGenerator' | 'schema'>\n  targetBlock: PortableTextTextBlock\n  incomingBlock: PortableTextTextBlock\n}) {\n  const parsedIncomingBlock = parseBlock({\n    keyGenerator: context.keyGenerator,\n    block: incomingBlock,\n    profile: 'lenient',\n    schema: context.schema,\n  })\n\n  if (!parsedIncomingBlock || !isTextBlock(context, parsedIncomingBlock)) {\n    return targetBlock\n  }\n\n  return {\n    ...targetBlock,\n    children: [...targetBlock.children, ...parsedIncomingBlock.children],\n    markDefs: [\n      ...(targetBlock.markDefs ?? []),\n      ...(parsedIncomingBlock.markDefs ?? []),\n    ],\n  }\n}\n","import type {EditorSelection} from '../types/editor'\n\n/**\n * @public\n */\nexport function reverseSelection<\n  TEditorSelection extends NonNullable<EditorSelection> | null,\n>(selection: TEditorSelection): TEditorSelection {\n  if (!selection) {\n    return selection\n  }\n\n  if (selection.backward) {\n    return {\n      anchor: selection.focus,\n      focus: selection.anchor,\n      backward: false,\n    } as TEditorSelection\n  }\n\n  return {\n    anchor: selection.focus,\n    focus: selection.anchor,\n    backward: true,\n  } as TEditorSelection\n}\n"],"mappings":";;;;AAKA,SAAgB,iCAAiC,EAC/C,UACA,eAImC;CACnC,IAAM,aAAa,QAAQ,UAAU,YAAY,IAAI;CAEhD,gBAIL,OAAO;EACL,MAAM,WAAW;EACjB,QAAQ,YAAY;CACtB;AACF;AChBA,SAAgB,4BAA4B,EAC1C,UACA,aACA,aAKmC;CAcnC,OAb2B,gCAAgC;EACzD;EACA;EACA;CACF,CAEK,KACI,iCAAiC;EACtC;EACA;CACF,CAAC;AAIL;;;;ACrBA,SAAgB,wBAAwB,EACtC,UACA,SACA,YAKkB;CAClB,IAAM,SAAS,4BAA4B;EACzC;EACA,aAAa,QAAQ;EACrB,WAAW,WAAW,aAAa;CACrC,CAAC,GACK,QAAQ,4BAA4B;EACxC;EACA,aAAa,QAAQ;EACrB,WAAW,WAAW,YAAY;CACpC,CAAC;CAMD,OAJI,CAAC,UAAU,CAAC,QACP,OAGF;EACL;EACA;EACA;CACF;AACF;;;;AC3BA,SAAgB,iCAAiC,EAC/C,UACA,kBAI0B;CAC1B,IAAM,eAAe,eAAe,KAAK,GAAG,EAAE;CAE9C,IAAI,CAAC,eAAe,YAAY,GAC9B;CAGF,IAAM,YAAY,UAAU,UAAU,eAAe,MAAM,EACzD,QAAQ,SAAS,cAAY,EAAC,QAAQ,SAAS,QAAQ,OAAM,GAAG,IAAI,EACtE,CAAC;CAED,IAAI,CAAC,WACH;CAGF,IAAI,SAAS;CAEb,KAAK,IAAM,SAAS,UAAU,KAAK,UAAU;EAC3C,IAAI,MAAM,SAAS,aAAa,MAC9B,OAAO;GACL,MAAM,UAAU;GAChB,QAAQ,SAAS,eAAe;EAClC;EAGF,AAAI,SAAO,SAAS,SAAS,KAAK,MAChC,UAAU,MAAM,KAAK;CAEzB;AAGF;;;;ACxCA,SAAgB,gBAAgB,EAC9B,SACA,aACA,iBAKC;CACD,IAAM,sBAAsB,WAAW;EACrC,cAAc,QAAQ;EACtB,OAAO;EACP,SAAS;EACT,QAAQ,QAAQ;CAClB,CAAC;CAMD,OAJI,CAAC,uBAAuB,CAAC,cAAY,SAAS,mBAAmB,IAC5D,cAGF;EACL,GAAG;EACH,UAAU,CAAC,GAAG,YAAY,UAAU,GAAG,oBAAoB,QAAQ;EACnE,UAAU,CACR,GAAI,YAAY,YAAY,CAAC,GAC7B,GAAI,oBAAoB,YAAY,CAAC,CACvC;CACF;AACF;;;;AC9BA,SAAgB,iBAEd,WAA+C;CAa/C,OAZK,cAID,UAAU,WACL;EACL,QAAQ,UAAU;EAClB,OAAO,UAAU;EACjB,UAAU;CACZ,IAGK;EACL,QAAQ,UAAU;EAClB,OAAO,UAAU;EACjB,UAAU;CACZ;AACF"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@portabletext/editor",
-  "version": "8.1.1",
+  "version": "8.1.3",
   "description": "Portable Text Editor made in React",
   "keywords": [
     "collaborative",
@@ -56,7 +56,6 @@
     "@sanity/json-match": "^1.0.5",
     "@sanity/pkg-utils": "^12.3.0",
     "@sanity/tsconfig": "^2.1.0",
-    "@textspec/notation": "^1.0.2",
     "@types/debug": "^4.1.13",
     "@types/node": "^20",
     "@types/react": "^19.2.17",
@@ -73,7 +72,7 @@
     "vite": "^8.2.0",
     "vitest": "^4.1.11",
     "vitest-browser-react": "^2.2.0",
-    "@portabletext/test": "^2.0.0",
+    "@portabletext/test": "^2.1.0",
     "racejar": "3.0.0"
   },
   "peerDependencies": {

package/lib/behavior.types.action-C0XDEQnB.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"behavior.types.action-C0XDEQnB.d.ts","names":[],"sources":["../src/internal-utils/mime-type.ts","../src/type-utils.ts","../src/converters/converter.types.ts","../src/types/paths.ts","../src/renderers/renderer.types.ts","../src/schema/container-types.ts","../src/editor/editor-schema.ts","../src/engine/interfaces/node.ts","../src/traversal/traversal-snapshot.ts","../src/editor/PortableTextEditor.tsx","../src/types/options.ts","../src/editor/Editable.tsx","../src/types/editor.ts","../src/engine/types/types.ts","../src/engine/interfaces/point.ts","../src/engine/interfaces/range.ts","../src/engine/interfaces/operation.ts","../src/engine/interfaces/range-ref.ts","../src/engine/dom/utils/diff-text.ts","../src/engine/dom/utils/dom.ts","../src/engine/dom/plugin/dom-editor.ts","../src/engine/interfaces/location.ts","../src/engine/interfaces/path-ref.ts","../src/engine/interfaces/point-ref.ts","../src/engine/interfaces/editor.ts","../src/engine/core/operation-channel.ts","../src/editor/range-decorations-machine.ts","../src/types/editor-engine.ts","../src/editor/editor-snapshot.ts","../src/behaviors/behavior.types.guard.ts","../src/behaviors/behavior.types.behavior.ts","../src/types/operation.ts","../src/editor/relay.ts","../src/editor.ts","../src/editor/editor-provider.tsx","../src/editor/editor-selector.ts","../src/editor/usePortableTextEditor.ts","../src/editor/usePortableTextEditorSelection.tsx","../src/utils/key-generator.ts","../src/editor/use-editor.ts","../src/types/block-offset.ts","../src/priority/priority.types.ts","../src/behaviors/behavior.config.ts","../src/editor/editor-machine.ts","../src/internal-utils/event-position.ts","../src/types/block-with-optional-key.ts","../src/behaviors/behavior.types.event.ts","../src/editor/editor-dom.ts","../src/behaviors/behavior.types.action.ts"],"mappings":";;;;KAAY;;;;KCGA,cACV,QACA,sBAAsB,QACtB,oBAAoB,OAAO,YACzB,eAAe,OAAO,SAAS,eAAe;KAWtC,eAAe,QAAQ,6BAA6B;EAC9D,YAAY;OAGP,WAAW,SAAS,sBACd,cAAc,wBACjB,OAAO;KAIL,cAAc,GAAG,UAAU,KAAK;KCvBhC,UAAU,kBAAkB,WAAW;EACjD,UAAU;EACV,WAAW,WAAW;EACtB,aAAa,aAAa;;KASvB,eAAe,kBAAkB,WAAW;EAE3C;EACA;;EAGA;EACA,UAAU;EACV;EACA;;EAGA;EACA;EACA,UAAU;EACV;;EAGA;EACA;;EAGA;EACA,UAAU;EACV;;EAGA;EACA,MAAM,MAAM;EACZ,UAAU;;KAGJ,WAAW,kBAAkB,eACvC,UACA;EAEA,UAAU;EACV,OAAO,cAAc,eAAe;MAChC,cACJ,eAAe;KAKL,aAAa,kBAAkB,eACzC,UACA;EAEA,UAAU;EACV,OAAO,cAAc,eAAe;MAChC,cACJ,eAAe;;;;;UChEA;EACf;;;;;;KAOU;;;;;;;;;KAUA,gCAAgC,eAAe;;;;;KAM/C,OAAO;;;;;;KAOP,YAAY;;;;;;KAOZ,iBAAiB;;;;;;KAOjB,YAAY;;;;;;;;;;;;KC7BZ;EACV,YAAY;EACZ,UAAU;EACV;EACA,MAAM;EACN,MAAM;EACN;EACA;;;;;;;;;;;;;;EAcA,gBAAgB,OAAO,yBAAyB;;;;;KAKtC,mBAAmB,OAAO,yBAAyB;;;;;;;;;;KAWnD;EACV,YAAY;EACZ,UAAU;EACV;EACA,MAAM;EACN,MAAM;EACN;EACA;;;;;EAKA,gBAAgB,OAAO,oBAAoB;;;;;KAKjC,cAAc,OAAO,oBAAoB;;;;;;;;;;;;;;KAezC;EACV,UAAU;;;;;EAKV;EACA;;;;EAIA,MAAM;EACN;EACA;;;;;;EAMA,gBAAgB,OAAO,yBAAyB;;;;;KAKtC,mBAAmB,OAAO,yBAAyB;;;;;;;;;;;;;KAcnD;;;;;;;EAOV,YAAY;EACZ,UAAU;EACV;EACA,MAAM;EACN;EACA;;;;;;EAMA,gBAAgB,OAAO,0BAA0B;;;;;KAKvC,oBAAoB,OAAO,0BAA0B;;;;;;;;;;KAWrD;EACV,YAAY;EACZ,UAAU;EACV;EACA,MAAM;EACN,MAAM;EACN;EACA;;;;;EAKA,gBAAgB,OAAO,2BAA2B;;;;;KAKxC,qBAAqB,OAAO,2BAA2B;;;;;;;;;;KAWvD;EACV,YAAY;EACZ,UAAU;EACV;EACA,MAAM;EACN,MAAM;EACN;EACA;;;;;EAKA,gBAAgB,OAAO,4BAA4B;;;;;KAKzC,sBACV,OAAO,4BACJ;;;;;;;;;;;;;;;KAgBO;EACV;EACA;EACA;;;;;;;EAOA,SAAS;;;;;EAKT,KAAK,cAAc,YAAY,YAAY;;;;;;;;;;;;;;;;;;;KAoBjC;EACV;EACA;;;;;;;EAOA,SAAS;;;;;;;;;;EAUT,KAAK,cAAc,OAAO,eAAe,YAAY;;;;;;;;;;;KAY3C;EACV,YAAY;EACZ,UAAU;EACV;EACA,MAAM;EACN,MAAM;EACN;EACA;;;;;EAKA,gBAAgB,OAAO,yBAAyB;;;;;KAKtC,mBAAmB,OAAO,yBAAyB;;;;;;;;;KAUnD;EACV;EACA;;;;;;;EAOA,SAAS;;;;;;;;KASC;EACV;EACA;;;;;;;;EAQA,SAAS;;;;;;;;;KAUC;EACV;EACA;;;;;;;;EAQA,SAAS;;;;;;;;KASC;EACV;EACA;;;;;;;EAOA,SAAS;;;;;;;;KASC;EACV;EACA;;;;;;;EAOA,SAAS;;;;;;;;KASC,kBACR,YACA,YACA,OACA,cACA,eACA,YACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAkCY,sBAAsB,sBAAsB;EAC1D,MAAM,0HAEF,wIAEE,wHAEE;EACR;EACA,UAAU;IACR,YAAY;IACZ,UAAU;IACV;IACA,MAAM,yCAAyC;IAC/C,MAAM;IACN;IACA;IACA,gBAAgB,OAAO,yBAAyB;QAC5C;EACN,KAAK,cAAc,YAAY,YAAY;IACzC;;;;;;;;;;;;;;;;;;;;;;;iBA0BY,iBAAiB,sBAAsB;EACrD,MAAM,mIAEF;EACJ,SAAS;IACP;;;;;;;;;;;;;;;;;;;;;iBAwBY,gBAAgB;EAC9B;EACA,SAAS;IACP;;;;;;;;;;;;;;;;;;;;;;;iBA0BY,iBAAiB;EAC/B;EACA,SAAS;IACP;;;;;;;;;;;;;;;;;;;;;;;;;iBA4BY,wBAAwB,sBAAsB;EAC5D,MAAM,0IAEF,4HAEE;EACN,SAAS;IACP;;;;;;;;;;;;;;;;;;;;;;;;;iBA4BY,yBAAyB,sBAAsB;EAC7D,MAAM,2IAEF,6HAEE;EACN,SAAS;IACP;;;;;;;;;;;;;;;;;;;;;;;iBA0BY,sBAAsB,sBAAsB;EAC1D,MAAM,0HAEF;EACJ,SAAS;EACT,KAAK,cAAc,OAAO,eAAe,YAAY;IACnD;;;;;;KASQ;EACV,MAAM;;;;;;;KAQI;EACV,WAAW;;;;;;;KAQD;EACV,YAAY;;;;;;;KAQF;EACV,aAAa;;;;;;;KAQH;EACV,cAAc;;;;;;;;;KAUJ;EACV,WAAW;EACX,OAAO;EACP,KAAK,cAAc,kBAAkB,oBAAoB;;;;;;;;;;KAW/C;EACV,WAAW;EACX,KAAK,cACH,aAAa,qBAAqB,kBAAkB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KC7rB5C;EACV;EACA;EACA,OAAO;IACL;IACA,IAAI,cAAc;;EAEpB,KAAK,cAAc,sBAAsB;;KAG/B,kBAAkB;;;;;;;;KASlB;EACV;EACA;;;;;;;;;KAUU;EACV;EACA;;;;;;;;;KAUU;EACV;EACA;;;;;;;;;KAUU,uBACR,iBACA,wBACA;;;;;;;;;;;;;;;;;;;;KAqBQ,aAAa,oBAAoB;;;;;;;;;KAUjC,qBAAqB,YAAY;;;;KCpHjC,eAAe;KCEf,SAAO,wBAAwB,qBAAqB;;;;;;;KCGpD;EACV;IACE,QAAQ;IACR,YAAY;IACZ,OAAO,MAAM;;EAEf,eAAe;;;;;;;;;;;;;;;;;;;cCgBJ;;;;EAIJ,aAAa;UAIZ;EAER,YAAY;IAAS,UAAU;IAAa,aAAa;;EAKlD,cAAW,UAAc;;;;;;;;;;;SAiBzB,oBAAiB,QACd,uBACP;;;;;;;;;;;SAcI,qBAAkB,QACf,oBAAkB,gBACV;;;;;;;;;;;;;;;;SAsBX,gBAAiB;IAAqB;KAAa,QAChD,oBAAkB,MACpB,aAAW;KACP;QACT;;;;;;;;;;;;SAcI,OAAI,QAAY;;;;;;;;;;;;;;;SAkBhB,SAAM,QACH,oBAAkB,WACf,iBAAe,UAChB;SAGL,cAAW,QACR,oBAAkB,SACjB,oBAAoB,sBAAiB;SAKzC,aAAU,QAAY,oBAAkB,MAAQ,UAAI,oDAAA,kDAAA,sBAAA,oDAAA,+BAAA;;;;;;;;;;;;SAepD,QAAK,QAAY;;;;;;;;;;;SAcjB,aAAU,QAAY,uBAAkB;;;;;;;;;;;SAcxC,aAAU,QACP,uBACP;;;;;;;;;;;SAcI,eAAY,QAAY,uBAAkB;;;;;;;;;;;SAc1C,WAAQ,QAAY,uBAAkB;;;;;;;;;;;SActC,gBAAa,QAAY,oBAAkB;;;;;;;;;;;SAc3C,eAAY,QAAY,oBAAkB;;;;;;;;;;;SAc1C,uBAAoB,QAAY;;;;;;;;;;;SAahC,sBAAmB,QAAY;;;;;;;;;;;SAa/B,eAAY,QAAY,oBAAkB;;;;;;;;;;;;;;;;;;;;;;SAwB1C,cAAe;IAAqB;KAAa,QAC9C,oBAAkB,MACpB,aAAW;KACP;QACT;;;;;;;;;;;;;;;;;SAoBI,cAAe;IAAqB;KAAa,QAC9C,oBAAkB,MACpB,aAAW;KACP;QACT;;;;;;;;;;;;SAeI,cAAW,QAAY;SAIvB,SAAM,QACH,oBAAkB,SACjB,oBAAoB;SAKxB,eAAY,SAAa,oBAAkB,MAAQ;SASnD,QAAK,QAAY;;;;;;;;;;;;;SAgBjB,SAAM,QACH,oBAAkB,WACf;;;;;;;;;;;;;;;SAmBN,mBAAoB;IAAqB;KAAa,QACnD,oBAAkB,MACpB;;;;;;;;;;;;;SAeD,mBAAgB,QACb,oBAAkB;;;;;;;;;;;;;SAkBrB,aAAU,QAAY,oBAAkB;;;;;;;;;;;;;SAgBxC,aAAU,QAAY,oBAAkB;;;;;;;;;;;SAcxC,cAAW,QACR,uBACP;;;;;;;;;;;;SAeI,OAAI,QAAY;;;;;;;;;;;;SAehB,OAAI,QAAY;;;;;;;;;;;SAchB,0BAAuB,QACpB,oBAAkB,YACd,iBAAe,YACf;;;;;KC/gBJ;EACV,QAAQ;EACR,SAAS,gBAEN,OAAO,oBAAoB,QAAQ;;;;;KC0C5B,4BAA4B,KACtC,uBAAuB;EAGvB,MAAM,MAAM,IAAI;EAChB,UAAU;EACV,iBAAiB,OAAO;EACxB,UAAU;EACV,SAAS;EACT,mBAAmB;EACnB,oBAAoB;EACpB,0BAA0B;EAC1B,YAAY;EACZ;;;;;;;;;;;;;;;;;;;;;;cAuBW,sCAAoB,0BAAA,KAAA,oDAAA,cAAA,KAAA;;;;;;;UCrEhB;EACf;;;;;KAMU;;;;;EAKV,aAAa;EACb,cAAc,MAAM;;;;;;EAMpB,UAAU;;;UAIK;EACf,yBAAyB;EACzB,qBAAqB,gBAAgB;EACrC,gBAAgB;IAAqB;KACnC,MAAM,aACN;KAAU;QACP;EACL;EACA,SACE,WAAW,iBACX,UAAU;EAEZ,aACE,MAAM,UACF,oBAAoB,+BAA+B;EACzD,cACE,SAAS,oBAAoB,sBAC1B;EACL;EACA,kBAAkB;EAClB,kBAAkB;EAClB,oBAAoB;EACpB,mBAAmB;EACnB,gBAAgB;EAChB,gBAAgB;EAChB,eAAe;EACf,cAAc;IAAqB;KACjC,MAAM,aACN;KAAU;QACP;EACL,cAAc;IAAqB;KACjC,MAAM,aACN;KAAU;QACP;EACL;EACA;EACA;EACA,eAAe;EACf,SAAS,SAAS,oBAAoB;EACtC,0BACE,YAAY,iBACZ,YAAY;EAEd;EACA;EACA,mBAAmB;IAAqB;KACtC,MAAM;EAER,SAAS,WAAW;EACpB,mBAAmB;EACnB,aAAa;EACb,aAAa;EACb;;;KAIU;EAAwB,MAAM;EAAM;;;KAEpC;EACV,QAAQ;EACR,OAAO;EACP;;;;;KAMU;EACV;EACA,SAAS;EACT;EACA;EACA,MAAM,sBAAsB,oBAAoB;;;;;;;;EAShD;IACE,mDAAmD;IACnD,8CAA8C;IAC9C,SAAS;;;;KAKD;EAEN,SAAS;EACT,OAAO;;;;;KAOD,yBAAyB,gBAAgB,QAAQ;;UAG5C;EACf,OAAO;EACP,MAAM;EACN,aAAa;EACb,OAAO;;;;;;;;KASG,aAAa,MAAM,cAAc;;KAGjC,YACV,OAAO,iBAAe,iBAAiB;;KAI7B,0BACV,OAAO,8BACJ,IAAI;;KAGG,kCAAkC,MAAM;;KAGxC,mCACV,QAAQ,oBACR,UAAU,WAAW;;;;UAMN;EACf,iBAAiB;EACjB,cAAc;EACd;;;;;;;UAOe;;;;;;;;;;;;;;;;;;;;EAoBf,YAAY,OAAO,sBAAsB;;;;EAIzC,WAAW;;;;;;EAMX,WAAW,SAAS;;;;EAIpB,UAAU;;KCzNA;;;;;;;UCEK;EACf,MAAM;EACN;;;;;;;UCHe;EACf,QAAQ;EACR,OAAO;;;;;;;KCFG;EACV;EACA,MAAM;EACN,MAAM;EACN;EACA,UAAU;;;;;;;KAQA;EACV;EACA,MAAM;EACN;EACA;;;;;;;KAQU;EACV;EACA,MAAM;EACN;EACA;;;;;;;KAQU;EACV;EACA,MAAM;EACN;;;;;;;KAQU;EACV;EACA,MAAM;EACN,MAAM;EACN;;;;;;;KAQU;EACV;EACA,MAAM;;;;;;;;;;;KAYI;EACV;EACA,MAAM;EACN;EACA,UAAU,mBAAmB;;;;;;;;;;;;;;KAenB;EACV;EACA,MAAM;EACN,UAAU,mBAAmB;;KAG1B;EAEC;EACA;EACA,eAAe;;EAGf;EACA,YAAY,QAAQ;EACpB,eAAe,QAAQ;;EAGvB;EACA,YAAY;EACZ;;;;;;;;;;;;;;;;KAiBM,kBACR,kBACA,eACA,iBACA,wBACA,sBACA;;;;;;UCzIa;EACf,SAAS;EACT;EACA,SAAS;;KCOC;EACV;EACA;EACA;;KAGU;EACV;EACA,MAAM;EACN,MAAM;;;;;KCjBH,UAAU,WAAW;KAQrB,WAAW,WAAW;KACtB,eAAe,WAAW;KAC1B,iBAAiB,WAAW;QAWzB;YACI;IACR,mBAAmB;IACnB,sBAAsB;IACtB,cAAc;;;KAIN,YAAY;KCFZ;EAAU,KAAK,QAAQ;EAAO;;;;;UAOzB,kBAAkB;EACjC,oBACE,QAAQ,UACR,QAAQ,uBACL,UAAU;EACf,WAAW,QAAQ,UAAQ,OAAO;EAClC,sBAAsB,QAAQ,UAAQ,QAAQ;EAC9C,YAAY,QAAQ,UAAQ,QAAQ,uBAAuB,UAAU;EACrE,gCACE,QAAQ,UACR,QAAQ;EAGV;EACA,WAAW;EACX,YAAY;EAEZ;EACA;EACA;EACA,eAAe;EACf,mBAAmB;IAAW,YAAY;;EAC1C;EACA,cAAc;EACd,eAAe;EACf,kBAAkB;EAClB;;UAGQ;;;;EAIR,OAAO,QAAQ;;;;EAIf,2BAA2B,QAAQ,aAAW,WAAW;;;;EAKzD,QAAQ,QAAQ,UAAQ;IAAW;;;;;EAKnC,YAAY,QAAQ,aAAW;;;;EAK/B,aACE,QAAQ,UACR,QAAQ,SACR;IAAW;;;;;EAMb,oBACE,QAAQ,UACR,QAAQ,uBACL,UAAU;;;;EAKf,WAAW,QAAQ,UAAQ,OAAO;;;;EAKlC,sBAAsB,QAAQ,UAAQ,QAAQ;;;;EAK9C,YAAY,QAAQ,UAAQ,QAAQ,uBAAuB,UAAU;;;;EAKrE,gCACE,QAAQ,UACR,QAAQ;;;;EAMV,aAAa,QAAQ,UAAQ,OAAO,UAAU;;;;;;;;;EAU9C,aAAa,QAAQ,UAAQ,OAAO,UAAU;;;;EAK9C,mBAAmB,mBACjB,QAAQ,UACR,UAAU,UACV;IACE;IACA,eAAe;;;;;IAKf;QAEC,iBAAiB,eAAe;;;;EAKrC,oBAAoB,mBAClB,QAAQ,UACR,UAAU,WAAW,iBAAiB,cACtC;IACE;IACA,eAAe;QAEd,iBAAiB,eAAe;;cAI1B,WAAW;;;;;;;;;KCtKZ,WAAW,OAAO,QAAQ;;;;;;UCFrB;EACf,SAAS;EACT;EACA,SAAS;;UAGD;EACR,YAAY,KAAK,SAAS,IAAI;;cAInB,SAAS;;;;;;UCVL;EACf,SAAS;EACT,UAAU;EACV,SAAS;;UAGD;EACR,YAAY,KAAK,UAAU,IAAI;;cAIpB,UAAU;;;;;UCPN;EAGf,YAAY;EACZ;IACE,QAAQ,MAAM;IACd,OAAO,MAAM;;EAEf,YAAY;EACZ,eAAe;EACf;EACA;EACA,UAAU,IAAI;EACd,WAAW,IAAI;EACf,WAAW,IAAI;EAIf,QAAQ,WAAW;EACnB,gBACE,QAAQ,WAAS,QAAM,OACvB;IACE,YAAY;;EAGhB,WAAW;IAAW,YAAY;;EAClC,oBACE,WACA,YACA;IAEA;IACA;IACA,YAAY;IACZ,YAAY;;EAKd,SAAS,QAAQ;EACjB,eAAe,OAAO,QAAQ;;KAGpB,WAAS,aAAa,YAAY;;;;;;;;;;;;;;;;KCvClC;KAOA;;;;;;EAMV,WAAW;;;;;;EAMX,aAAa,MAAM;;;;;EAKnB,iBAAiB;;;;;EAKjB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;;;EAIA,QAAQ;;KAGE,qBAAqB,OAAO;KCP5B,iBAAiB;EAC3B,iBAAiB;EACjB,QAAQ,MAAM,kBAAkB;;KC1C7B;EACH,YAAY;EACZ,WAAW;;UAGH;EACR,OAAO;EACP,OAAO;;KAGG;EACV,OAAO;EACP,MAAM;EACN,UAAU;EACV,kBAAkB;;UAGH,iCAAiC;EAChD;EACA;EAEA,YAAY;EACZ,aAAa,YAAY;EACzB,cAAc,YAAY;EAC1B,YAAY,YAAY;EACxB,eAAe,YAAY;EAC3B,OAAO,YAAY;EACnB,YAAY,YAAY;EAExB,iBAAiB,MAAM;EACvB,eAAe;EACf,SAAS;;;;;;;;EAQT;IAA0B;;;;;;;;;;;;;;EAa1B,2BAA2B;EAC3B,eAAe,MAAM;EACrB;EAEA;;;;;EAKA,iBAAiB,MAAM;EACvB;EACA;EACA;;;;;;;;;;;EAWA;EACA;EACA;EACA;;;;;;;;;;EAWA,UAAU;;;;;KC/FA;EACV,YAAY,MAAM;EAClB;EACA;EACA,QAAQ;EACR,WAAW;EACX,OAAO,MAAM;;;;;;;;;;;;;;;;;;;EAmBb,YAAY;;;;;KAMF;EACV,SAAS;EACT,eAAe;;;;;EAKf,gBAAgB;;;;;KC1CN,cAAc,gBAAgB,mBAAmB;EAC3D,UAAU;EACV,OAAO;EACP,KAAK;MACD;;;;KCEM,SACV,oCAEO,iCACH,iCAEG,iCACH,uBACJ,uBACA,uBAAuB,qBAAqB,sBAC1C,qBAAqB;;;;EAKvB,IAAI;;;;;;EAMJ,QAAQ,cAAc,gBAAgB;;;;;EAKtC,SAAS,MAAM,kBAAkB,gBAAgB;;;;;;;;;;;;;;;;iBAiBnC,eACd,iBAAiB,yBACjB,oCAEO,iCACH,wBAAwB,6BAC5B,uBAEA,UAAU,SACR,oBACA,gBACA,qBAAqB,oBAAoB,aAE1C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KC5BS,YACR,kBACA,sBACA,sBACA,eACA;;;;KCpCQ;EAEN;EACA,OAAO,WAAW,gBAAgB;;EAGlC;;EAGA;EACA,OAAO,WAAW,gBAAgB;;EAGlC;EACA,YAAY;EACZ,OAAO,MAAM;IAEf;;;;;;;;;;;;;;;;;;;;EAqBE;EACA,WAAW;;;;;;;;;EASX;IAEF;EAEE;;EAGA;;EAGA;EACA,WAAW;;EAGX;EACA,OAAO,MAAM;;;;;KAMP;EACV;EACA,SAAS,MAAM;EACf,OAAO,MAAM;;KAGH;EACV;EACA,OAAO;;;;;KC1EG;EACV;EACA;EACA,eAAe,MAAM;EACrB,kBAAkB;;;;;KAMR,cACR,sBACA;;;;;;;;;;;;;;;;;;;;;EAsBE;EACA,OAAO,MAAM;;;;;KAMP;EACV,KAAK;EACL,mBAAmB;;;;EAInB,mBAAmB;IAAS,UAAU;;;;;;;;;;;EAUtC,eAAe;IAAS,MAAM;;EAC9B,OAAO,OAAO;;;;;;;;;;;;EAYd;KACG,cAAc,kCACb,MAAM,OACN,WACE,QAAQ,MACN,sBAAsB;MAA+B,MAAM;kBAG/D;MAAU;;MACR;;KACH,cAAc,kCACb,MAAM,OACN,WACE,OAAO,sBACJ;MAA+B,MAAM;iBAE1C;MAAW;;MACT;;;;;;;;;;;;;;;;;;;;EAmBN,UAAU;IACR,QAAQ,UAAU;IAClB,SAAS;IACT;;IACG;;;;;;KC3GK;EACV,eAAe;EACf,WAAW,QAAM;;;;;;;;;;;;;;;;;;;;iBAqBH,eAAe,OAAO,sBAAmB,QAAA,IAAA;;;;KC1B7C,eAAe,cAAc,UAAU,mBAAmB;;;;;;;;;;;;;;;;;;;;;;;;;iBA0BtD,kBAAkB,WAChC,QAAQ,QACR,UAAU,eAAe,YACzB,WAAU,GAAG,WAAW,GAAG,wBAAsC;;;;;;cC3BtD,6BAA4B;;;;;;cCJ5B,sCAAqC;;;;cCPrC;;;;;;;;;;;;;;;;iBCeG,aAAA;;;;KCbJ;EACV,MAAM;EACN;;KCLU;EACV;EACA;EACA;IACE,UAAU;IACV;;;KCJQ;EACV,UAAU;EACV,UAAU;;;;;KCmCA;EACV;EACA,SAAS,MAAM;EACf,UAAU,MAAM;;;;;KAMN;EAEN;EACA;IAEF;KAEC,qBAAqB,eAAe;EACvC;EACA,OAAO,MAAM;;;;;KAMH,cAAc,oBAAoB;;;;cAoHjC,gCAAa;EAGT,WAAA,IAAI;EACE;EACE,mBAAA,MAAM;EACX;EACC,eAAA,MAAM,qBAAqB;EACZ,8BAAA,MAAM;EACd,sBAAA,MAAM;EACpB,QAAA;EACS;EACH,cAAA,MAAM;EACL;IACb,QAAQ,KAAK;;EAEH,YAAA;EACG,eAAA;;EAlJT;EACI;;EAoBJ;EACU,gBAAA;;EAGV;EACU,gBAAA;;EAGV;EACE,QAAA;;EAGF;EACE,QAAA;;EAGF;EACK,WAAA;;EAGL;;EAGA;;EAGA;EACS,eAAA;EACP,QAAA;EACM;IAAC;;;EAKT;EACC,OAAA;;EAGD;EACE,QAAA;EACA,QAAA,KAAK;;EAER;;EACA;;EAEC;EACA,MAAA;;EAGA;EACA,MAAA;;EAED;EAA6B,QAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EA8ErB,aAAA,MAAM;EACL;EACH;EACH,QAAA;EACO,eAAA,MAAM;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KC1Lf;EACV;;;;;EAKA;;;;;;EAMA;EACA,WAAW,YAAY;;KC3Bb,2BAA2B,KAAK;EAC1C,OAAO;;KAGG,6BAA6B,KAAK;EAC5C,OAAO;;KAGG,uBACR,2BACA;KAEQ,sBAAsB,KAAK;EACrC,OAAO;;KAGG,uBACR,sBACA;;;;KCLQ,gBACR,yBACA,sBACA;KAEQ,6BACR,kCACA,+BACA;KAEC,4BACH,mBAAmB,mCACjB,wBACA,wBACA,QAAQ,uBAAuB,gBAAgB;;;;KAM9C;KAEA,0BACH,mBAAmB,gCACnB,6BACE,sBAAsB,kBAAkB,cAAc;KAE9C;EAEN,MAAM;;EAGN,MAAM;;EAGN,MAAM;EACN,WAAW;EACX;IACE;IACA;OAAU;;;IAGd;;;;cAME;KAwBD,qCACO,+CACA;KAEP,kCACH,iBAAiB;;;;KAKP;EAEN,MAAM,cAAc;EACpB;IACE;IACA;IACA;OAAS;;;EAEX,KAAK,YAAY;;EAGjB,MAAM,cAAc;EACpB;IACE;;EAEF,KAAK,YAAY;;EAGjB,MAAM,cAAc;EACpB,IAAI;EACJ,OAAO;;EAGP,MAAM,cAAc;EACpB,IAAI;EACJ,OAAO;;EAGP,MAAM,cAAc;EACpB,IAAI;EACJ;KAAS;;;EAGT,MAAM,cAAc;EACpB,IAAI;EACJ,OAAO;;EAGP,MAAM,cAAc;EACpB;EACA,KAAK,YAAY;;EAGjB,MAAM,cAAc;EACpB;EACA,KAAK,YAAY;;EAGjB,MAAM,cAAc;EACpB,KAAK,YAAY;;;;EAIjB;;;;EAIA;;EAGA,MAAM,cAAc;;EAGpB,MAAM,cAAc;;;;;;;;;;;;;;;;;;;;;;;;EAyBpB,MAAM,cAAc;EACpB,IAAI;EACJ,OAAO,wBAAwB,qBAAqB;EACpD;;EAGA,MAAM,cAAc;EACpB,OAAO;EACP,WAAW;EACX;EACA,KAAK,YAAY;;EAGjB,MAAM,cAAc;EACpB,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;EA2BP,MAAM,cAAc;EACpB,KAAK;EACL;EACA;;EAGA,MAAM,cAAc;EACpB;;EAGA,MAAM,cAAc;EACpB;;;;;;;;;;;;;;;;;;;;;;;;EAyBA,MAAM,cAAc;EACpB,IAAI;EACJ;EACA;;EAGA,MAAM,cAAc;EACpB,IAAI;;;;;;;;;;;;;;;;;;;;;;;;EAyBJ,MAAM,cAAc;EACpB,IAAI;EACJ;;;;;;;;;;;;;;;;;;;;;EAsBA,MAAM,cAAc;EACpB,IAAI;IAEN;;;;KAKQ;;;;cAoBN;KAwCD;EAEC,MAAM,cAAc;EACpB,IAAI;EACJ,OAAO;;EAGP,MAAM,cAAc;EACpB;IACE;IACA;OAAS;;;EAEX,KAAK,YAAY;;EAGjB,MAAM,cAAc;EACpB;EACA,KAAK,YAAY;;EAGjB,MAAM,cAAc;EACpB;;EAGA,MAAM,cAAc;EACpB,IAAI;;EAGJ,MAAM,cAAc;EACpB,IAAI;;EAGJ,MAAM,cAAc;EACpB;;EAGA,MAAM,cAAc;EACpB,IAAI,YAAY;;EAGhB,MAAM,cAAc;EACpB,aACI,cACE,gEAIF;;EAGJ,MAAM,cAAc;EACpB,UAAU;EACV;EACA,aACI,cACE,gEAIF;;EAGJ,MAAM,cAAc;EACpB,aAAa,cACX;;EAMF,MAAM,cAAc;EACpB,UAAU;EACV,aAAa,cACX;;EAMF,MAAM,cAAc;EACpB,UAAU;EACV,MAAM,MAAM;EACZ,aACI,cACE,gEAIF;;EAGJ,MAAM,cAAc;EACpB,UAAU;EACV;EACA,aACI,cACE,gEAIF;;EAGJ,MAAM,cAAc;EACpB,UAAU;EACV;EACA,aAAa,cACX;;EAMF,MAAM,cAAc;EACpB,UAAU;EACV;EACA,aAAa,cACX;;EAMF,MAAM,cAAc;EACpB,QAAQ,MAAM;EACd,WAAW;EACX;EACA,KAAK,YAAY;;EAGjB,MAAM,cAAc;;EAGpB,MAAM,cAAc;EACpB;IACE;IACA;OAAU;;;;EAIZ,MAAM,cAAc;;EAGpB,MAAM,cAAc;EACpB;EACA,cAAc;IACZ;IACA;OAAS;;;EAEX,aAAa;;EAGb,MAAM,cAAc;EACpB;;EAGA,MAAM,cAAc;EACpB;;EAGA,MAAM,cAAc;EACpB;;EAGA,MAAM,cAAc;EACpB,IAAI;EACJ,IAAI;;EAGJ,MAAM,cAAc;EACpB,IAAI;;EAGJ,MAAM,cAAc;EACpB,IAAI;;EAGJ,MAAM,cAAc;EACpB,IAAI;EACJ;;EAGA,MAAM,cAAc;EACpB;;EAGA,MAAM,cAAc;EACpB;;EAGA,MAAM,cAAc;;EAGpB,MAAM,cAAc;EACpB;;EAGA,MAAM,cAAc;EACpB;;EAGA,MAAM,cAAc;EACpB;;;;;cAaA;KAiBD,kCAAkC;KAElC,+BAA+B,iBAAiB;;;;KAWzC,sBACR,yBACA,oBACA,qBACA,wBACA;KAEC;EAEC,MAAM,cAAc;EACpB;IACE,cAAc;;EAEhB,UAAU,KAAK;;EAGf,MAAM,cAAc;EACpB;IACE,cAAc;;EAEhB,UAAU,KAAK;;EAGf,MAAM,cAAc;EACpB;IACE,cAAc;;EAEhB,UAAU,KAAK;;KAGhB;EAEC,MAAM,cAAc;EACpB;IACE;IACA;IACA,cAAc;;EAEhB,UAAU,KAAK;;EAGf,MAAM,cAAc;EACpB;IACE,cAAc;;;EAIhB,MAAM,cAAc;EACpB;IACE,cAAc;;;EAIhB,MAAM,cAAc;EACpB;IACE,cAAc;;EAEhB,UAAU;;EAGV,MAAM,cAAc;EACpB;IACE,cAAc;;EAEhB,aAAa,KAAK;EAClB,UAAU;;EAGV,MAAM,cAAc;EACpB;IACE,cAAc;;EAEhB,aAAa,KAAK;EAClB,UAAU;;EAGV,MAAM,cAAc;EACpB;IACE,cAAc;;;;;;;;;;;;;;KAeV;EACV,MAAM,cAAc;EACpB;IACE,cAAc;;;KAIN;EAEN,MAAM,cAAc;EACpB,aAAa,KACX;;EAKF,MAAM,cAAc;EACpB,aAAa,KACX;;KAKI;EACV,MAAM,cAAc;EACpB,UAAU;;;;;KAOP;KAEA,wBACH,mBAAmB,8BACnB,6BACE,sBAAsB,kBAAkB,cAAc;;;;KAK9C,oBACV,iBAAiB,0BAA0B,yBAC3C,+BACA,sBAAsB,kCAAkC,SACtD,kCAAkC;EAEpC,MAAM;IACJ;;;;KAYQ,qBACV,oCAEO,iCACH,uBACJ,iBAAiB,0BAA0B,2BACzC,iCACA,gBACA,oCAAoC,iBAClC,mBAAmB,6BACjB,cACE,uBAEA,4BAA4B,uBAGhC,2CAA2C,UACzC,oBAAoB,UAAU,SAC9B,2BAA2B,wBACzB,cAAc,uBAAuB;KAG1C,iBAAiB,wBACpB,uBAAuB,wBAAwB,YAAY;KC5xBjD;EACV,gBAAgB,UAAU,mBAAmB,MAAM;EACnD,gBAAgB,UAAU,mBAAmB,MAAM;EACnD,wBAAwB;;;;;EAKxB,mBAAmB,UAAU,mBAAmB;;;;;;;;EAQhD,wBAAwB;IACtB;IACA;QACI;EACN,uBAAuB,UAAU,mBAAmB;EACpD,qBAAqB,UAAU,mBAAmB;;;;;EAKlD,iBACE,OACA;IAEA,OAAO,cAAc;IACrB;MACE,SAAS;MACT;MACA;;;;;;;KCrCM;EAEN;EACA,OAAO;;EAGP;EACA,OAAO,sBAAsB,yBAAyB;;EAGtD;EACA,OAAO,yBAAyB;;EAGhC;EACA,SAAS;;;;;;;;;;;;;;;;;;;;;;;IAuBP,OAAO,OAAO;;;;;;;;;;;;;;;;;;;;iBAqBN,QACd,OAAO,yBACN,cAAc;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAyCD,QACd,OAAO,sBAAsB,yBAAyB,sBACrD,cAAc;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAqCD,QACd,OAAO,yBAAyB,sBAC/B,cAAc;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBA8CD,OACd,QAAQ,cAAc,8CACrB,cAAc;;;;KAOL,kBAAkB,gBAAgB,mBAC5C;EACE,UAAU;EACV,OAAO;EACP,KAAK;GAEP,eAAe,mBACZ,MAAM"}

package/lib/get-parent-DgaKcy8-.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"get-parent-DgaKcy8-.js","names":[],"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 * @public\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 * @public\n */\nexport function getNode(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): {node: Node; path: Path} | undefined {\n  const result = resolveNode(snapshot, path)\n  return result.status === 'found' ? result.entry : undefined\n}\n\n/**\n * Result of walking a path against a snapshot.\n *\n * `unreachable` is the one outcome that means \"structurally impossible\n * by design\": the path digs past a sidecar field (e.g. `markDefs` on\n * a text block) into a keyed/indexed segment, which `getNode` can\n * never resolve (use `getAnnotation` for annotations). Every other\n * negative outcome is `missing`; on those branches a caller bug and a\n * benign race (the node removed by a concurrent edit) produce the\n * same state, so they cannot be told apart.\n */\nexport type ResolveNodeResult =\n  | {status: 'found'; entry: {node: Node; path: Path}}\n  | {status: 'missing'}\n  | {status: 'unreachable'}\n\nexport function resolveNode(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): ResolveNodeResult {\n  if (path.length === 0) {\n    return {status: 'missing'}\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); report unreachable.\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 {status: 'unreachable'}\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 {status: 'missing'}\n    }\n\n    if (!node) {\n      return {status: 'missing'}\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 {status: 'missing'}\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 {status: 'missing'}\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 {status: 'found', entry: {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 * @public\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 * @public\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"],"mappings":";;;;AAKA,SAAgB,eAAe,SAA2C;CACxE,OAAO,OAAO,WAAY,cAAY,WAAoB,UAAU;AACtE;;;;;;;;ACGA,SAAgB,cAAc,MAAoB;CAChD,OAAO,KAAK,QAAgB,QAAQ,SAAS,UACvC,eAAe,OAAO,IACjB,GAAG,OAAO,UAAU,QAAQ,KAAK,MAInC,GAAG,SADQ,UAAU,IAAI,KAAK,MACN,WAC9B,EAAE;AACP;ACjBA,SAAgB,cAAc,QAAwC;CACpE,OAAO,SAAS,MAAM,KAAK,OAAO,OAAO,SAAa;AACxD;AAEA,SAAgB,SAAS,OAAkD;CACzE,OAAO,CAAC,CAAC,UAAU,OAAO,SAAU,YAAY,OAAO,SAAU;AACnE;;;;;;;;;;;;;;;;;;ACeA,SAAgB,qBACd,YACA,MACA,QAMY;CACZ,IAAM,WAAW,qBAAqB,YAAY,QAAQ,IAAI;CAE9D,IAAI,CAAC,UACH;CAGF,IAAM,aAAc,KAAiC,SAAS,MAAM;CAE/D,UAAM,QAAQ,UAAU,GAI7B,OAAO;EACL,UAAU;EACV,WAAW;CACb;AACF;;;;;;AAOA,SAAS,qBACP,YACA,QACA,MACiC;CACjC,IAAI,QAAQ,IACL;OAAA,IAAM,SAAS,OAAO,IACzB,IAAI,MAAM,SAAS,KAAK,OAKtB,OAHI,WAAW,QACN,QAET;CACF;CAGJ,OAAO,WAAW,IAAI,KAAK,KAAK;AAClC;;;;;;ACtDA,SAAgB,YACd,UACA,MACiC;CACjC,IAAI,kBAA+B,SAAS,QAAQ,OAChD,mBAAmB,SACnB,cAAoB,CAAC,GACrB,SAAS,IACT;CAEJ,KAAK,IAAM,WAAW,MAAM;EAC1B,IAAI,OAAO,WAAY,UACrB;EAGF,IAAI;EACJ,IAAI,eAAe,OAAO,GAAG;GAI3B,IAAM,gBAAsB,SACxB,CAAC,EAAC,MAAM,QAAQ,KAAI,CAAC,IACrB;IAAC,GAAG;IAAa;IAAkB,EAAC,MAAM,QAAQ,KAAI;GAAC,GACrD,QAAQ,SAAS,cAAc,IAAI,cAAc,aAAa,CAAC;GACrE,OACE,UAAU,KAAA,KAAa,gBAAgB,MAAM,EAAE,SAAS,QAAQ,OAC5D,gBAAgB,SAChB,gBAAgB,MAAM,UAAU,MAAM,SAAS,QAAQ,IAAI;EACnE,OAAO,AAAI,OAAO,WAAY,aAC5B,OAAO,gBAAgB,GAAG,OAAO;EAGnC,IAAI,CAAC,MACH,OAAO,CAAC;EAMV,AAHA,cAAc,SACV,CAAC,EAAC,MAAM,KAAK,KAAI,CAAC,IAClB;GAAC,GAAG;GAAa;GAAkB,EAAC,MAAM,KAAK,KAAI;EAAC,GACxD,SAAS;EAET,IAAM,OAAO,gBAAgB,SAAS,SAAS,MAAM,aAAa;EAElE,IAAI,CAAC,MACH,OAAO,CAAC;EAKV,AAFA,kBAAkB,KAAK,UACvB,mBAAmB,KAAK,WACxB,gBAAgB,KAAK;CACvB;CAEA,OAAO,gBAAgB,KAAK,WAAW;EACrC,MAAM;EACN,MAAM,SACF,CAAC,EAAC,MAAM,MAAM,KAAI,CAAC,IACnB;GAAC,GAAG;GAAa;GAAkB,EAAC,MAAM,MAAM,KAAI;EAAC;CAC3D,EAAE;AACJ;;;;;;;;;;;;;;;;;AAkBA,SAAgB,gBACd,SAIA,MACA,QAOY;CAEZ,IAAI,YAAY,SAAS,IAAI,GAC3B,OAAO;EACL,UAAU,KAAK;EACf,WAAW;EACX,QAAQ,KAAA;CACV;CAGF,IAAI,cAAc,IAAI,GAAG;EACvB,IAAM,SAAS,qBAAqB,QAAQ,YAAY,MAAM,MAAM;EAEpE,IAAI,QACF,OAAO;GACL,UAAU,OAAO;GACjB,WAAW,OAAO,UAAU,MAAM;GAClC,QAAQ,OAAO;EACjB;CAEJ;CAGA,IACE,WAAW,QACX,MAAM,QAAQ,KAAK,KAAQ,KAC3B,EAAE,UAAU,SACZ,EAAE,WAAW,OAEb,OAAO;EACL,UAAU,KAAK;EACf,WAAW;EACX,QAAQ,KAAA;CACV;AAIJ;;;;;;;;;;;;;;;;;;;;;;;;AClHA,SAAgB,QACd,UACA,MACsC;CACtC,IAAM,SAAS,YAAY,UAAU,IAAI;CACzC,OAAO,OAAO,WAAW,UAAU,OAAO,QAAQ,KAAA;AACpD;AAkBA,SAAgB,YACd,UACA,MACmB;CACnB,IAAI,KAAK,WAAW,GAClB,OAAO,EAAC,QAAQ,UAAS;CAG3B,IAAM,EAAC,SAAS,kBAAiB,UAC7B,kBAA+B,QAAQ,OACvC,kBACA,MACA,eACE,eAAqB,CAAC;CAE5B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,IAAM,UAAU,KAAK;EAErB,IAAI,OAAO,WAAY,UAAU;GAW/B,IAAI,qBAAqB,KAAA,KAAa,YAAY,kBAAkB;IAClE,aAAa,KAAK,OAAO;IACzB;GACF;GACA,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;IACxC,IAAM,IAAI,KAAK;IACf,IAAI,eAAe,CAAC,KAAK,OAAO,KAAM,UACpC,OAAO,EAAC,QAAQ,cAAa;GAEjC;GACA;EACF;EAEA,IAAI,eAAe,OAAO,GAAG;GAC3B,aAAa,KAAK,OAAO;GACzB,IAAM,QAAQ,cAAc,IAAI,cAAc,YAAY,CAAC;GAC3D,AACE,UAAU,KAAA,KACV,gBAAgB,MAAM,EAAE,SAAS,QAAQ,OAEzC,OAAO,gBAAgB,UAOvB,OAAO,gBAAgB,MAAM,UAAU,MAAM,SAAS,QAAQ,IAAI,GAC9D,QAAQ,KAAK,SAAS,KAAA,MACxB,aAAa,aAAa,SAAS,KAAK,EAAC,MAAM,KAAK,KAAI;EAG9D,OAAO,IAAI,OAAO,WAAY,UAE5B,AADA,OAAO,gBAAgB,GAAG,OAAO,GAC7B,QACF,aAAa,KAAK,EAAC,MAAM,KAAK,KAAI,CAAC;OAGrC,OAAO,EAAC,QAAQ,UAAS;EAG3B,IAAI,CAAC,MACH,OAAO,EAAC,QAAQ,UAAS;EAG3B,IAAI,kBAAkB;EACtB,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;GACxC,IAAM,IAAI,KAAK;GACf,IAAI,eAAe,CAAC,KAAK,OAAO,KAAM,UAAU;IAC9C,kBAAkB;IAClB;GACF;EACF;EAEA,IAAI,iBAAiB;GACnB,IAAM,OAAO,gBAAgB,SAAS,MAAM,aAAa;GAEzD,IAAI,CAAC,MACH,OAAO,EAAC,QAAQ,UAAS;GAK3B,AAFA,kBAAkB,KAAK,UACvB,mBAAmB,KAAK,WACxB,gBAAgB,KAAK;EACvB,OACE,mBAAmB,KAAA;CAEvB;CAEA,IAAI,CAAC,MACH,OAAO,EAAC,QAAQ,UAAS;CAQ3B,OACE,aAAa,SAAS,KACtB,OAAO,aAAa,aAAa,SAAS,MAAO,WAEjD,aAAa,IAAI;CAGnB,OAAO;EAAC,QAAQ;EAAS,OAAO;GAAC;GAAM,MAAM;EAAY;CAAC;AAC5D;;;;;;;;;;;AC7JA,SAAgB,WAAW,MAAkB;CAC3C,IAAI,KAAK,WAAW,GAClB,MAAU,MAAM,gDAAgD,KAAK,GAAG;CAG1E,IAAI,gBAAgB;CACpB,KAAK,IAAI,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KACpC,IAAI,eAAe,KAAK,EAAE,KAAK,OAAO,KAAK,MAAO,UAAU;EAC1D,gBAAgB;EAChB;CACF;CAGF,IAAI,kBAAkB,IACpB,OAAO,CAAC;CAGV,IAAM,SAAS,KAAK,MAAM,GAAG,aAAa;CAM1C,OAJI,OAAO,SAAS,KAAK,OAAO,OAAO,OAAO,SAAS,MAAO,WACrD,OAAO,MAAM,GAAG,EAAE,IAGpB;AACT;ACHA,SAAgB,UACd,UACA,MACA,SAGmD;CACnD,IAAI,KAAK,WAAW,GAClB;CAGF,IAAM,SAAS,WAAW,IAAI;CAE9B,IAAI,OAAO,WAAW,GACpB;CAGF,IAAM,QAAQ,QAAQ,UAAU,MAAM;CAEtC,IAAI,CAAC,OACH;CAGF,IAAM,SAAS;EAAC,MAAM,MAAM;EAA2B,MAAM,MAAM;CAAI;CAEnE,eAAS,SAAS,CAAC,QAAQ,MAAM,OAAO,MAAM,OAAO,IAAI,IAI7D,OAAO;AACT"}

package/lib/get-path-sub-schema-Dd0QYZ0m.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"get-path-sub-schema-Dd0QYZ0m.js","names":[],"sources":["../src/traversal/get-ancestors.ts","../src/traversal/has-node.ts","../src/schema/resolve-container-at.ts","../src/schema/is-editable-container.ts","../src/traversal/is-object.ts","../src/engine/path/compare-paths.ts","../src/engine/point/compare-points.ts","../src/engine/point/is-after-point.ts","../src/engine/range/is-backward-range.ts","../src/engine/range/range-edges.ts","../src/engine/node/is-text-block-node.ts","../src/engine/path/is-ancestor-path.ts","../src/traversal/resolve-child-entry-index.ts","../src/traversal/get-nodes.ts","../src/traversal/get-sibling.ts","../src/engine/node/is-span-node.ts","../src/traversal/is-block.ts","../src/traversal/is-inline.ts","../src/traversal/get-enclosing-block.ts","../src/traversal/compare-points.ts","../src/schema/descend-to-parent.ts","../src/schema/get-enclosing-container.ts","../src/traversal/get-path-sub-schema.ts"],"sourcesContent":["import type {PortableTextBlock} from '@portabletext/schema'\nimport 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 all ancestors of the node at a given path, from nearest to furthest.\n *\n * For a path like [{_key:'t1'}, 'rows', {_key:'r1'}, 'cells', {_key:'c1'}],\n * the ancestors are (nearest first):\n *   [{_key:'t1'}, 'rows', {_key:'r1'}]\n *   [{_key:'t1'}]\n *\n * Walks from root to the target in a single pass collecting each ancestor\n * as it goes.\n *\n * Every ancestor is a `PortableTextBlock`: only text blocks and object\n * nodes can contain children.\n *\n * @public\n */\nexport function getAncestors(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): Array<{node: PortableTextBlock; path: Path}> {\n  // Collect keyed-segment indices to know where each ancestor's path ends.\n  const keyedIndices: Array<number> = []\n  for (let i = 0; i < path.length; i++) {\n    if (isKeyedSegment(path[i])) {\n      keyedIndices.push(i)\n    }\n  }\n\n  // Need at least 2 keyed segments to have an ancestor (the last is self).\n  if (keyedIndices.length <= 1) {\n    return []\n  }\n\n  const {context, blockIndexMap} = snapshot\n  let currentChildren: Array<Node> = context.value\n  let currentParent: RegisteredContainer | undefined\n\n  const ancestorsByDepth: Array<{node: PortableTextBlock; path: Path}> = []\n  const resolvedPath: Path = []\n\n  // Descend once. We walk only as far as the second-to-last keyed segment;\n  // the last keyed segment is the target itself, which is not an ancestor.\n  const targetKeyedIndex = keyedIndices[keyedIndices.length - 1]!\n\n  let segmentIndex = 0\n  while (segmentIndex < targetKeyedIndex) {\n    const segment = path[segmentIndex]!\n\n    if (typeof segment === 'string') {\n      resolvedPath.push(segment)\n      segmentIndex++\n      continue\n    }\n\n    let node: Node | undefined\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 []\n    }\n\n    if (!node) {\n      return []\n    }\n\n    // Descend with positional awareness. `getNodeChildren` checks the\n    // current parent's `of` for a positional override before falling\n    // back to the top-level `containers` map - so same-`_type`\n    // registered under different parents with different `field`\n    // resolves to the right entry at this position.\n    const next = getNodeChildren(context, node, currentParent)\n    if (!next) {\n      return []\n    }\n\n    // An ancestor has children, so it is never a span. The narrowing\n    // from `Node` to `PortableTextBlock` (text block | object) is safe.\n    ancestorsByDepth.push({\n      node: node as PortableTextBlock,\n      path: resolvedPath.slice(),\n    })\n\n    currentChildren = next.children\n    currentParent = next.parent\n    segmentIndex++\n  }\n\n  // Return nearest-first (reverse of document order at the call site).\n  return ancestorsByDepth.reverse()\n}\n","import type {Path} from '../engine/interfaces/path'\nimport {getNode} from './get-node'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Check if a node exists at a given path.\n *\n * @public\n */\nexport function hasNode(snapshot: TraversalSnapshot, path: Path): boolean {\n  return getNode(snapshot, path) !== undefined\n}\n","import type {Node} from '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport {isKeyedSegment} from '../utils/util.is-keyed-segment'\nimport type {\n  Containers,\n  RegisteredContainer,\n  RegisteredPositional,\n} from './container-types'\n\n/**\n * Walk the editor value following `path` and return the\n * {@link RegisteredContainer} or {@link RegisteredPositional} that applies\n * at `path`'s target position.\n *\n * Resolution rules at each step:\n *\n * 1. **Positional override.** If the current parent declares the\n *    child's `_type` in its `of`, the positional entry wins.\n *    Used to resolve same-`_type` registered under different\n *    parents with different `field` values.\n *\n * 2. **Global fallback.** If the parent has no positional override,\n *    fall back to the top-level entry for `_type` in\n *    `containers`.\n *\n * 3. **Chain validity.** If any ancestor along the path has no\n *    resolved container entry (unregistered or not reachable as a\n *    container at its position), return `undefined`.\n *\n * Returns `undefined` when the target's `_type` is not registered\n * at this position. Returns a {@link RegisteredPositional} when the target\n * resolves to a leaf in a positional `of` (terminal node with no\n * editable children).\n *\n * @alpha\n */\nexport function resolveContainerAt(\n  containers: Containers,\n  value: ReadonlyArray<Node>,\n  path: Path,\n): RegisteredContainer | RegisteredPositional | undefined {\n  const keyedIndices: Array<number> = []\n  for (let index = 0; index < path.length; index++) {\n    if (isKeyedSegment(path[index])) {\n      keyedIndices.push(index)\n    }\n  }\n  if (keyedIndices.length === 0) {\n    return undefined\n  }\n\n  let currentChildren: ReadonlyArray<Node> = value\n  let parent: RegisteredContainer | undefined\n  let resolved: RegisteredContainer | RegisteredPositional | undefined\n  const targetKeyedIndex = keyedIndices[keyedIndices.length - 1]!\n\n  let segmentIndex = 0\n  while (segmentIndex <= targetKeyedIndex) {\n    const segment = path[segmentIndex]!\n    if (typeof segment === 'string') {\n      segmentIndex++\n      continue\n    }\n\n    let node: Node | undefined\n    if (isKeyedSegment(segment)) {\n      node = currentChildren.find((child) => child._key === segment._key)\n    } else if (typeof segment === 'number') {\n      node = currentChildren.at(segment)\n    } else {\n      return undefined\n    }\n    if (!node) {\n      return undefined\n    }\n\n    resolved = resolveNodeEntry(containers, parent, node)\n    if (!resolved) {\n      return undefined\n    }\n\n    if (segmentIndex < targetKeyedIndex) {\n      // Walk one more level. The resolved entry must be a container\n      // (have children) for descent to continue.\n      if (!('field' in resolved)) {\n        return undefined\n      }\n      const fieldValue = (node as Record<string, unknown>)[resolved.field.name]\n      if (!Array.isArray(fieldValue)) {\n        return undefined\n      }\n      parent = resolved\n      currentChildren = fieldValue as Array<Node>\n    }\n    segmentIndex++\n  }\n\n  return resolved\n}\n\nfunction resolveNodeEntry(\n  containers: Containers,\n  parent: RegisteredContainer | undefined,\n  node: Node,\n): RegisteredContainer | RegisteredPositional | undefined {\n  if (parent?.of) {\n    for (const entry of parent.of) {\n      if (entry.type === node._type) {\n        return entry\n      }\n    }\n  }\n  return containers.get(node._type)\n}\n","import type {Node} from '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport type {TraversalSnapshot} from '../traversal/traversal-snapshot'\nimport {resolveContainerAt} from './resolve-container-at'\n\n/**\n * Check if a node at the given path is a registered editable container.\n *\n * Position-aware: {@link resolveContainerAt} descends from the editor\n * root threading the resolved parent at each step, so positionally-\n * registered containers (e.g. `cell` registered only inside\n * `table.of`) are recognized when reached through their declared\n * parent.\n */\nexport function isEditableContainer(\n  snapshot: TraversalSnapshot,\n  _node: Node,\n  path: Path,\n): boolean {\n  if (snapshot.context.containers.size === 0) {\n    return false\n  }\n\n  // `resolveContainerAt` aborts on the first unregistered object-node\n  // ancestor (chain validity falls out of the single descent), so the\n  // single call below answers both \"is the node here a container?\" and\n  // \"is the ancestor chain valid?\" in one walk.\n  const resolved = resolveContainerAt(\n    snapshot.context.containers,\n    snapshot.context.value,\n    path,\n  )\n  return !!(resolved && 'field' in resolved)\n}\n","import type {PortableTextObject} from '@portabletext/schema'\nimport {isTypedObject} from '../utils/asserters'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Check if a node is an object node (not a text block or span).\n *\n * @public\n */\nexport function isObject(\n  snapshot: TraversalSnapshot,\n  node: unknown,\n): node is PortableTextObject {\n  return (\n    isTypedObject(node) &&\n    node._type !== snapshot.context.schema.block.name &&\n    node._type !== snapshot.context.schema.span.name\n  )\n}\n","import {isKeyedSegment} from '../../utils/util.is-keyed-segment'\nimport type {Node} from '../interfaces/node'\nimport type {Path} from '../interfaces/path'\n\n/**\n * Compare two paths in document order.\n *\n * When paths contain keyed segments, the root node tree is needed to\n * resolve document order. Without a root, keyed segments are compared\n * by _key string (consistent but not necessarily document order).\n */\nexport function comparePaths(\n  path: Path,\n  another: Path,\n  root: {value: Array<Node>},\n): -1 | 0 | 1 {\n  const min = Math.min(path.length, another.length)\n  let currentChildren: Array<Node> | undefined = root?.value\n  let currentNode: Node | undefined\n\n  for (let i = 0; i < min; i++) {\n    const segment = path[i]!\n    const otherSegment = another[i]!\n\n    if (isKeyedSegment(segment) && isKeyedSegment(otherSegment)) {\n      if (segment._key === otherSegment._key) {\n        if (currentChildren) {\n          currentNode = currentChildren.find((c) => c._key === segment._key)\n          currentChildren = undefined\n        }\n        continue\n      }\n\n      if (currentChildren) {\n        const segmentIndex = currentChildren.findIndex(\n          (c) => c._key === segment._key,\n        )\n        const otherSegmentIndex = currentChildren.findIndex(\n          (c) => c._key === otherSegment._key,\n        )\n        if (segmentIndex !== -1 && otherSegmentIndex !== -1) {\n          return segmentIndex < otherSegmentIndex ? -1 : 1\n        }\n      }\n\n      // Fallback: compare by _key string\n      if (segment._key < otherSegment._key) {\n        return -1\n      }\n      if (segment._key > otherSegment._key) {\n        return 1\n      }\n      continue\n    }\n\n    if (typeof segment === 'string' && typeof otherSegment === 'string') {\n      if (segment === otherSegment) {\n        if (currentNode) {\n          const fieldValue = (currentNode as Record<string, unknown>)[segment]\n          currentChildren = Array.isArray(fieldValue)\n            ? (fieldValue as Array<Node>)\n            : undefined\n          currentNode = undefined\n        }\n        continue\n      }\n      if (segment < otherSegment) {\n        return -1\n      }\n      if (segment > otherSegment) {\n        return 1\n      }\n      continue\n    }\n\n    if (typeof segment === 'number' && typeof otherSegment === 'number') {\n      if (segment < otherSegment) {\n        return -1\n      }\n      if (segment > otherSegment) {\n        return 1\n      }\n      continue\n    }\n\n    break\n  }\n\n  return 0\n}\n","import type {Node} from '../interfaces/node'\nimport type {Point} from '../interfaces/point'\nimport {comparePaths} from '../path/compare-paths'\n\nexport function comparePoints(\n  point: Point,\n  another: Point,\n  root: {value: Array<Node>},\n): -1 | 0 | 1 {\n  const result = comparePaths(point.path, another.path, root)\n  if (result === 0) {\n    if (point.offset < another.offset) {\n      return -1\n    }\n    if (point.offset > another.offset) {\n      return 1\n    }\n    return 0\n  }\n  return result\n}\n","import type {Node} from '../interfaces/node'\nimport type {Point} from '../interfaces/point'\nimport {comparePoints} from './compare-points'\n\nexport function isAfterPoint(\n  point: Point,\n  another: Point,\n  root: {value: Array<Node>},\n): boolean {\n  return comparePoints(point, another, root) === 1\n}\n","import type {Node} from '../interfaces/node'\nimport type {Range} from '../interfaces/range'\nimport {isAfterPoint} from '../point/is-after-point'\n\nexport function isBackwardRange(\n  range: Range,\n  root: {value: Array<Node>},\n): boolean {\n  const {anchor, focus} = range\n  return isAfterPoint(anchor, focus, root)\n}\n","import type {Node} from '../interfaces/node'\nimport type {Point} from '../interfaces/point'\nimport type {Range} from '../interfaces/range'\nimport {isBackwardRange} from './is-backward-range'\n\nexport function rangeEdges(\n  range: Range,\n  root: {value: Array<Node>},\n): [Point, Point] {\n  const {anchor, focus} = range\n  return isBackwardRange(range, root) ? [focus, anchor] : [anchor, focus]\n}\n","import type {PortableTextObject, PortableTextSpan} from '@portabletext/schema'\nimport type {EditorSchema} from '../../editor/editor-schema'\nimport {isTypedObject} from '../../utils/asserters'\n\ntype TextBlockNode = {\n  _type: string\n  _key: string\n  children?: Array<PortableTextSpan | PortableTextObject>\n  markDefs?: Array<PortableTextObject>\n  style?: string\n  listItem?: string\n  level?: number\n}\n\n/**\n * Checks if a node is a text block based on `_type` alone, without requiring\n * `children` to be present. This is needed to identify text blocks before\n * normalization has had a chance to add the missing `children` property.\n */\nexport function isTextBlockNode(\n  context: {schema: EditorSchema},\n  node: unknown,\n): node is TextBlockNode {\n  return isTypedObject(node) && node._type === context.schema.block.name\n}\n","import {isKeyedSegment} from '../../utils/util.is-keyed-segment'\nimport type {Path} from '../interfaces/path'\n\nexport function isAncestorPath(path: Path, another: Path): boolean {\n  if (path.length >= another.length) {\n    return false\n  }\n\n  for (let i = 0; i < path.length; i++) {\n    const segment = path[i]\n    const otherSegment = another[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 '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport {serializePath} from '../paths/serialize-path'\nimport {isKeyedSegment} from '../utils/util.is-keyed-segment'\n\n/**\n * The index of the child addressed by `childPath`'s last segment within\n * `children` (entries as resolved by `getChildren`). Numeric last\n * segments are literal, bounds-checked indices. Keyed segments resolve\n * through `blockIndexMap` when the path is fully keyed (the map's id\n * space), verified against the entry at the mapped position, with a\n * linear scan fallback for misses, disagreements, and paths the map\n * cannot key, mirroring `getNode`/`getChildren`. Returns `-1` when the\n * child is not found.\n *\n * The map is taken explicitly rather than assumed current: some callers\n * deliberately resolve against pre-operation map state. The engine\n * keeps raw-array siblings of this helper (`resolveChildIndex` in\n * `apply-operation.ts`, `childIndexFromMap` in\n * `transform-block-index-map.ts`) for call sites that hold plain node\n * arrays mid-mutation, where no entries exist.\n */\nexport function resolveChildEntryIndex(\n  blockIndexMap: ReadonlyMap<string, number>,\n  children: ReadonlyArray<{node: Node; path: Path}>,\n  childPath: Path,\n): number {\n  const lastSegment = childPath[childPath.length - 1]\n\n  if (typeof lastSegment === 'number') {\n    return lastSegment >= 0 && lastSegment < children.length ? lastSegment : -1\n  }\n\n  if (!isKeyedSegment(lastSegment)) {\n    return -1\n  }\n\n  let fullyKeyed = true\n  for (\n    let segmentIndex = 0;\n    segmentIndex < childPath.length - 1;\n    segmentIndex++\n  ) {\n    const segment = childPath[segmentIndex]\n    if (typeof segment !== 'string' && !isKeyedSegment(segment)) {\n      fullyKeyed = false\n      break\n    }\n  }\n\n  if (fullyKeyed) {\n    const mappedIndex = blockIndexMap.get(serializePath(childPath))\n    if (\n      mappedIndex !== undefined &&\n      children[mappedIndex]?.node._key === lastSegment._key\n    ) {\n      return mappedIndex\n    }\n  }\n\n  return children.findIndex((child) => child.node._key === lastSegment._key)\n}\n","import type {EditorSchema} from '../editor/editor-schema'\nimport type {Node} from '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport {isAncestorPath} from '../engine/path/is-ancestor-path'\nimport {serializePath} from '../paths/serialize-path'\nimport type {\n  Containers,\n  RegisteredContainer,\n} from '../schema/resolve-containers'\nimport {getChildren, getNodeChildren} from './get-children'\nimport {resolveChildEntryIndex} from './resolve-child-entry-index'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get the descendant nodes of the node at a given path.\n *\n * When `from` and `to` are provided, performs a range-bounded DFS traversal,\n * yielding only nodes between `from` and `to` (inclusive). Both paths are\n * always in document order: `from` is the earlier path, `to` is the later\n * path. The `reverse` flag controls iteration direction within that range.\n *\n * When `match` is provided, only yields nodes where the predicate returns true.\n * The traversal still visits all nodes in range - `match` is a filter, not a\n * traversal control.\n *\n * When `at` is provided, traverses descendants of the node at that path\n * instead of the root.\n */\nexport function* getNodes(\n  snapshot: TraversalSnapshot,\n  options: {\n    at?: Path\n    from?: Path\n    to?: Path\n    match?: (node: Node, path: Path) => boolean\n    reverse?: boolean\n  } = {},\n): Generator<{node: Node; path: Path}, void, undefined> {\n  const {at = [], from, to, match, reverse = false} = options\n\n  if (from === undefined && to === undefined) {\n    yield* getNodesSimple(snapshot, at, {match, reverse})\n    return\n  }\n\n  yield* getNodesInRange(snapshot, at, {from, to, match, reverse})\n}\n\n/**\n * Get descendant nodes of a standalone node (not in the editor tree).\n * Used for cases like getDirtyPaths where the node hasn't been inserted yet.\n */\nexport function* getNodeDescendants(\n  context: {\n    schema: EditorSchema\n    containers: Containers\n  },\n  node: Node | {value: Array<Node>},\n): Generator<{node: Node; path: Path}, void, undefined> {\n  // The editor root wrapper ({value: [...]}) is not a real node, so its field\n  // name is not part of paths. For standalone nodes (a real {_key, _type, ...}\n  // passed in by callers like getDirtyPaths), the field name IS part of the\n  // path.\n  const isRoot = !('_key' in node) && !('_type' in node)\n  yield* walkStandalone(context, node, [], isRoot)\n}\n\nfunction* walkStandalone(\n  context: {\n    schema: EditorSchema\n    containers: Containers\n  },\n  node: Node | {value: Array<Node>},\n  path: Path,\n  isRoot: boolean,\n  parent?: RegisteredContainer,\n): Generator<{node: Node; path: Path}, void, undefined> {\n  const next = getNodeChildren(context, node, parent)\n  if (!next) {\n    return\n  }\n\n  for (const child of next.children) {\n    const childPath: Path = isRoot\n      ? [{_key: child._key}]\n      : [...path, next.fieldName, {_key: child._key}]\n    yield {node: child, path: childPath}\n    yield* walkStandalone(context, child, childPath, false, next.parent)\n  }\n}\n\n/**\n * Simple recursive DFS - the original behavior.\n * Yields all descendants of the node at `path`.\n */\nfunction* getNodesSimple(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options: {\n    match?: (node: Node, path: Path) => boolean\n    reverse?: boolean\n  },\n): Generator<{node: Node; path: Path}, void, undefined> {\n  const {match, reverse = false} = options\n\n  const children = getChildren(snapshot, path)\n\n  const entries = reverse ? [...children].reverse() : children\n\n  for (const entry of entries) {\n    if (!match || match(entry.node, entry.path)) {\n      yield entry\n    }\n\n    yield* getNodesSimple(snapshot, entry.path, options)\n  }\n}\n\n/**\n * Compare two keyed paths in DFS pre-order. Returns -1, 0, or 1.\n *\n * Walks both paths in parallel; at the first divergence, consults\n * `blockIndexMap` for the sibling indices and compares them.\n *\n * Deliberately not `comparePaths` (`engine/path/compare-paths.ts`):\n * that compare treats an ancestor/descendant pair as equal (0), while\n * range traversal needs the ancestor ordered first (-1/1), it is what\n * excludes `to`'s descendants from a range. The two compares answer\n * different questions and must not be merged.\n */\nfunction comparePathsInTree(\n  snapshot: TraversalSnapshot,\n  pathA: Path,\n  pathB: Path,\n): -1 | 0 | 1 {\n  // Walk both full paths in parallel; at the first divergent keyed\n  // segment, consult blockIndexMap for the sibling indices. The map is\n  // keyed by serialized paths that include both keyed and field-name\n  // segments, so we keep the full path prefix as we descend.\n  const minLength = Math.min(pathA.length, pathB.length)\n  const prefix: Path = []\n\n  for (let i = 0; i < minLength; i++) {\n    const segA = pathA[i]!\n    const segB = pathB[i]!\n\n    if (\n      typeof segA === 'string' ||\n      typeof segB === 'string' ||\n      typeof segA === 'number' ||\n      typeof segB === 'number' ||\n      Array.isArray(segA) ||\n      Array.isArray(segB)\n    ) {\n      prefix.push(segA as never)\n      continue\n    }\n\n    if (segA._key === segB._key) {\n      prefix.push(segA)\n      continue\n    }\n\n    const indexA =\n      snapshot.blockIndexMap.get(serializePath([...prefix, segA])) ?? -1\n    const indexB =\n      snapshot.blockIndexMap.get(serializePath([...prefix, segB])) ?? -1\n    if (indexA < indexB) {\n      return -1\n    }\n    if (indexA > indexB) {\n      return 1\n    }\n    return 0\n  }\n\n  // One path is a prefix of the other (ancestor relationship).\n  // In DFS order, shorter path (ancestor) comes first.\n  if (pathA.length < pathB.length) {\n    return -1\n  }\n  if (pathA.length > pathB.length) {\n    return 1\n  }\n\n  return 0\n}\n\n/**\n * Range-bounded recursive DFS traversal.\n *\n * `from` and `to` are always in document order (from is earlier, to is\n * later), regardless of traversal direction.\n */\nfunction* getNodesInRange(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options: {\n    from?: Path\n    to?: Path\n    match?: (node: Node, path: Path) => boolean\n    reverse?: boolean\n  },\n): Generator<{node: Node; path: Path}, void, undefined> {\n  const {from, to, match, reverse = false} = options\n\n  const children = getChildren(snapshot, path)\n\n  // Seek instead of scan: only the children between the boundaries'\n  // branches at this level can intersect [from, to], so resolve those\n  // positions (O(1) through `blockIndexMap`) and iterate the window\n  // between them. The per-entry checks below stay the semantic source\n  // of truth; an unresolvable boundary just leaves its side of the\n  // window open, degrading to the previous full scan.\n  const startIndex =\n    from === undefined ? 0 : (boundaryChildIndex(snapshot, children, from) ?? 0)\n  const endIndex =\n    to === undefined\n      ? children.length - 1\n      : (boundaryChildIndex(snapshot, children, to) ?? children.length - 1)\n  const window = children.slice(startIndex, endIndex + 1)\n  const entries = reverse ? window.reverse() : window\n\n  for (const entry of entries) {\n    if (canStopTraversal(snapshot, entry.path, from, to, reverse)) {\n      return\n    }\n\n    if (!couldContainInRangeNodes(snapshot, entry.path, from, to)) {\n      continue\n    }\n\n    if (isInRange(snapshot, entry.path, from, to)) {\n      if (!match || match(entry.node, entry.path)) {\n        yield entry\n      }\n    }\n\n    yield* getNodesInRange(snapshot, entry.path, options)\n  }\n}\n\n/**\n * The index of the child whose subtree `boundary` passes through, at\n * the level `children` was resolved for. `undefined` when the boundary\n * does not pass through this level or cannot be resolved, in which\n * case the caller must not narrow the window on that side.\n */\nfunction boundaryChildIndex(\n  snapshot: TraversalSnapshot,\n  children: Array<{node: Node; path: Path}>,\n  boundary: Path,\n): number | undefined {\n  const firstChild = children[0]\n  if (!firstChild) {\n    return undefined\n  }\n  const childPathLength = firstChild.path.length\n  if (boundary.length < childPathLength) {\n    return undefined\n  }\n\n  // The children share every path segment but the last; the boundary\n  // passes through this level only when that shared prefix is an\n  // ancestor of it.\n  const sharedPrefix = firstChild.path.slice(0, -1)\n  if (sharedPrefix.length > 0 && !isAncestorPath(sharedPrefix, boundary)) {\n    return undefined\n  }\n\n  const resolvedIndex = resolveChildEntryIndex(\n    snapshot.blockIndexMap,\n    children,\n    boundary.slice(0, childPathLength),\n  )\n  return resolvedIndex === -1 ? undefined : resolvedIndex\n}\n\n/**\n * Check if a node is within the [from, to] range in document order.\n * Both bounds are inclusive. Ancestor nodes of from or to are also\n * considered in range since they contain the range boundary.\n */\nfunction isInRange(\n  snapshot: TraversalSnapshot,\n  nodePath: Path,\n  from: Path | undefined,\n  to: Path | undefined,\n): boolean {\n  if (\n    from !== undefined &&\n    comparePathsInTree(snapshot, nodePath, from) === -1\n  ) {\n    if (!isAncestorPath(nodePath, from)) {\n      return false\n    }\n  }\n\n  if (to !== undefined && comparePathsInTree(snapshot, nodePath, to) === 1) {\n    if (!isAncestorPath(nodePath, to)) {\n      return false\n    }\n  }\n\n  return true\n}\n\n/**\n * Check if a subtree rooted at `nodePath` could contain any nodes in the\n * [from, to] range.\n */\nfunction couldContainInRangeNodes(\n  snapshot: TraversalSnapshot,\n  nodePath: Path,\n  from: Path | undefined,\n  to: Path | undefined,\n): boolean {\n  if (isInRange(snapshot, nodePath, from, to)) {\n    return true\n  }\n\n  if (from !== undefined && isAncestorPath(nodePath, from)) {\n    return true\n  }\n\n  if (to !== undefined && isAncestorPath(nodePath, to)) {\n    return true\n  }\n\n  return false\n}\n\n/**\n * Check if all remaining nodes in iteration order will be outside the range.\n */\nfunction canStopTraversal(\n  snapshot: TraversalSnapshot,\n  nodePath: Path,\n  from: Path | undefined,\n  to: Path | undefined,\n  reverse: boolean,\n): boolean {\n  if (reverse) {\n    if (from === undefined) {\n      return false\n    }\n\n    return (\n      comparePathsInTree(snapshot, nodePath, from) === -1 &&\n      !isAncestorPath(nodePath, from)\n    )\n  }\n\n  if (to === undefined) {\n    return false\n  }\n\n  return comparePathsInTree(snapshot, nodePath, to) === 1\n}\n","import type {Node} from '../engine/interfaces/node'\nimport type {Path} from '../engine/interfaces/path'\nimport {parentPath} from '../engine/path/parent-path'\nimport {getChildren} from './get-children'\nimport {resolveChildEntryIndex} from './resolve-child-entry-index'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Get a sibling of the node at a given path.\n *\n * Without `match`, returns the immediate next or previous sibling.\n * With `match`, returns the first sibling in `direction` that satisfies\n * the predicate.\n *\n * When `match` is a type predicate, the returned `node` narrows to that type.\n *\n * @public\n */\nexport function getSibling<TMatch extends Node>(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options: {\n    direction: 'next' | 'previous'\n    match: (node: Node, path: Path) => node is TMatch\n  },\n): {node: TMatch; path: Path} | undefined\n/**\n * @public\n */\nexport function getSibling(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options: {\n    direction: 'next' | 'previous'\n    match?: (node: Node, path: Path) => boolean\n  },\n): {node: Node; path: Path} | undefined\nexport function getSibling(\n  snapshot: TraversalSnapshot,\n  path: Path,\n  options: {\n    direction: 'next' | 'previous'\n    match?: (node: Node, path: Path) => boolean\n  },\n): {node: Node; path: Path} | undefined {\n  const {direction, match} = options\n\n  if (path.length === 0) {\n    return undefined\n  }\n\n  const parent = parentPath(path)\n  const children = getChildren(snapshot, parent)\n\n  const currentIndex = resolveChildEntryIndex(\n    snapshot.blockIndexMap,\n    children,\n    path,\n  )\n\n  if (currentIndex === -1) {\n    return undefined\n  }\n\n  if (!match) {\n    const siblingIndex =\n      direction === 'next' ? currentIndex + 1 : currentIndex - 1\n\n    if (siblingIndex < 0 || siblingIndex >= children.length) {\n      return undefined\n    }\n\n    return children[siblingIndex]\n  }\n\n  const candidates =\n    direction === 'next'\n      ? children.slice(currentIndex + 1)\n      : children.slice(0, currentIndex).reverse()\n\n  return candidates.find((child) => match(child.node, child.path))\n}\n","import type {EditorSchema} from '../../editor/editor-schema'\nimport {isTypedObject} from '../../utils/asserters'\n\nexport type SpanNode = {\n  _type: string\n  _key: string\n  text?: string\n  marks?: Array<string>\n}\n\n/**\n * Checks if a node is a span based on `_type` alone, without requiring `text`\n * to be present. This is needed to identify spans before normalization has had\n * a chance to add the missing `text` property.\n */\nexport function isSpanNode(\n  context: {schema: EditorSchema},\n  node: unknown,\n): node is SpanNode {\n  return isTypedObject(node) && node._type === context.schema.span.name\n}\n","import type {PortableTextBlock} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {isSpanNode} from '../engine/node/is-span-node'\nimport {isTextBlockNode} from '../engine/node/is-text-block-node'\nimport {getNode} from './get-node'\nimport {getParent} from './get-parent'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Determine if a node at the given path is a block.\n *\n * A node is a block if its parent is not a text block. Top-level nodes\n * (direct children of the editor) are always blocks. Children of text blocks\n * (spans and inline objects) are not blocks. Children of containers are\n * blocks within that container.\n *\n * @public\n */\nexport function isBlock(snapshot: TraversalSnapshot, path: Path): boolean {\n  const parent = getParent(snapshot, path)\n\n  if (!parent) {\n    return true\n  }\n\n  return !isTextBlockNode({schema: snapshot.context.schema}, parent.node)\n}\n\n/**\n * Get the node at the given path if it is a block.\n *\n * Returns the node narrowed to PortableTextBlock, or undefined if the node\n * doesn't exist or is not a block.\n *\n * @public\n */\nexport function getBlock(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): {node: PortableTextBlock; path: Path} | undefined {\n  const entry = getNode(snapshot, path)\n\n  if (!entry) {\n    return undefined\n  }\n\n  if (!isBlock(snapshot, path)) {\n    return undefined\n  }\n\n  if (isSpanNode({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 '../engine/interfaces/path'\nimport {isBlock} from './is-block'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Determine if a node at the given path is inline.\n *\n * A node is inline if its parent is a text block. This is the inverse of\n * `isBlock`. Top-level nodes are never inline.\n *\n * @public\n */\nexport function isInline(snapshot: TraversalSnapshot, path: Path): boolean {\n  return !isBlock(snapshot, path)\n}\n","import type {PortableTextBlock} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {getAncestors} from './get-ancestors'\nimport {getBlock} from './is-block'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Walk up from a path to find the nearest enclosing block.\n *\n * Returns the node at the path if it is a block, otherwise the first ancestor\n * that is a block. Works at any depth — inside a container this returns the\n * container-internal block, not the outer container.\n *\n * With `match`, returns the first enclosing block that also satisfies the\n * predicate. When `match` is a type predicate, the returned `node` narrows\n * to that type.\n *\n * `mode: 'lowest'` (default) returns the innermost enclosing block; the node\n * at the path itself counts. `mode: 'highest'` returns the outermost\n * ancestor that matches, falling back to the node at the path only if no\n * ancestor does.\n *\n * @public\n */\nexport function getEnclosingBlock<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 * @public\n */\nexport function getEnclosingBlock(\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 getEnclosingBlock(\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 = options?.match\n  const mode = options?.mode ?? 'lowest'\n\n  if (mode === 'highest') {\n    const ancestors = getAncestors(snapshot, path)\n\n    for (const ancestor of [...ancestors].reverse()) {\n      if (!match || match(ancestor.node, ancestor.path)) {\n        return ancestor\n      }\n    }\n\n    const direct = getBlock(snapshot, path)\n\n    if (direct && (!match || match(direct.node, direct.path))) {\n      return direct\n    }\n\n    return undefined\n  }\n\n  const direct = getBlock(snapshot, path)\n\n  if (direct && (!match || match(direct.node, direct.path))) {\n    return direct\n  }\n\n  for (const ancestor of getAncestors(snapshot, path)) {\n    if (!match || match(ancestor.node, ancestor.path)) {\n      return ancestor\n    }\n  }\n\n  return undefined\n}\n","import {comparePaths} from '../engine/path/compare-paths'\nimport type {EditorSelectionPoint} from '../types/editor'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Returns:\n *\n * - `-1` if `pointA` is before `pointB`\n * - `0` if `pointA` and `pointB` are equal\n * - `1` if `pointA` is after `pointB`.\n *\n * Compares the two points by document order, resolved at any depth. When\n * the paths are equal, compares offsets.\n *\n * @public\n */\nexport function comparePoints(\n  snapshot: TraversalSnapshot,\n  pointA: EditorSelectionPoint,\n  pointB: EditorSelectionPoint,\n): -1 | 0 | 1 {\n  const pathComparison = comparePaths(pointA.path, pointB.path, {\n    value: snapshot.context.value,\n  })\n\n  if (pathComparison !== 0) {\n    return pathComparison\n  }\n\n  if (pointA.offset < pointB.offset) {\n    return -1\n  }\n\n  if (pointA.offset > pointB.offset) {\n    return 1\n  }\n\n  return 0\n}\n","import type {Path} from '../engine/interfaces/path'\nimport {getAncestors} from '../traversal/get-ancestors'\nimport {isObject} from '../traversal/is-object'\nimport type {TraversalSnapshot} from '../traversal/traversal-snapshot'\nimport type {RegisteredContainer} from './container-types'\nimport {resolveContainerAt} from './resolve-container-at'\n\n/**\n * Descent primitive: return the immediate parent\n * {@link RegisteredContainer} of the node at `path` (and that parent's\n * path), or `undefined` when the target's immediate parent is the\n * editor root, when no object-node ancestor is a registered container,\n * or when descent hits an ancestor whose `_type` is not registered.\n *\n * Walks ancestors and resolves each object-node ancestor positionally\n * via {@link resolveContainerAt}. Text-block and span ancestors are\n * skipped - \"container\" here means the enclosing object container,\n * not the text-block holding spans.\n */\nexport function descendToParent(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): {parent: RegisteredContainer; parentPath: Path} | undefined {\n  const ancestors = getAncestors(snapshot, path)\n  for (const ancestor of ancestors) {\n    if (!isObject(snapshot, ancestor.node)) {\n      continue\n    }\n    const resolved = resolveContainerAt(\n      snapshot.context.containers,\n      snapshot.context.value,\n      ancestor.path,\n    )\n    if (!resolved || !('field' in resolved)) {\n      return undefined\n    }\n    return {parent: resolved, parentPath: ancestor.path}\n  }\n  return undefined\n}\n","import type {OfDefinition} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport type {TraversalSnapshot} from '../traversal/traversal-snapshot'\nimport {descendToParent} from './descend-to-parent'\n\n/**\n * Return the immediate registered-container ancestor of `path` along\n * with its `of` array (the schema definitions accepted at this position).\n *\n * Position-aware: nested-only registrations (e.g. `cell` registered\n * only inside `table.row.of`) are recognized via the same descent\n * primitive used by all parent-aware traversal.\n *\n * Returns `undefined` when `path` has no registered-container ancestor\n * (i.e. is at the document root) or when descent hits a leaf-resolved\n * ancestor.\n */\nexport function getEnclosingContainer(\n  snapshot: TraversalSnapshot,\n  path: Path,\n):\n  | {\n      of: ReadonlyArray<OfDefinition>\n      path: Path\n    }\n  | undefined {\n  const descent = descendToParent(snapshot, path)\n  if (!descent) {\n    return undefined\n  }\n  return {\n    of: descent.parent.field.of,\n    path: descent.parentPath,\n  }\n}\n","import {getSubSchema, type Schema} from '@portabletext/schema'\nimport type {Path} from '../engine/interfaces/path'\nimport {getEnclosingContainer} from '../schema/get-enclosing-container'\nimport type {TraversalSnapshot} from './traversal-snapshot'\n\n/**\n * Return the `Schema` view that applies at a given path.\n *\n * For paths at the root of the document, or for paths where no ancestor is\n * a registered container, returns the top-level schema. For paths inside a\n * container, walks ancestors to find the nearest container and returns the\n * sub-schema derived from its `of` declaration.\n *\n * @public\n */\nexport function getPathSubSchema(\n  snapshot: TraversalSnapshot,\n  path: Path,\n): Schema {\n  const enclosing = getEnclosingContainer(snapshot, path)\n\n  if (!enclosing) {\n    return snapshot.context.schema\n  }\n\n  return getSubSchema(snapshot.context.schema, enclosing.of)\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AAyBA,SAAgB,aACd,UACA,MAC8C;CAE9C,IAAM,eAA8B,CAAC;CACrC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,AAAI,eAAe,KAAK,EAAE,KACxB,aAAa,KAAK,CAAC;CAKvB,IAAI,aAAa,UAAU,GACzB,OAAO,CAAC;CAGV,IAAM,EAAC,SAAS,kBAAiB,UAC7B,kBAA+B,QAAQ,OACvC,eAEE,mBAAiE,CAAC,GAClE,eAAqB,CAAC,GAItB,mBAAmB,aAAa,aAAa,SAAS,IAExD,eAAe;CACnB,OAAO,eAAe,mBAAkB;EACtC,IAAM,UAAU,KAAK;EAErB,IAAI,OAAO,WAAY,UAAU;GAE/B,AADA,aAAa,KAAK,OAAO,GACzB;GACA;EACF;EAEA,IAAI;EACJ,IAAI,eAAe,OAAO,GAAG;GAC3B,aAAa,KAAK,OAAO;GACzB,IAAM,QAAQ,cAAc,IAAI,cAAc,YAAY,CAAC;GAC3D,AACE,UAAU,KAAA,KACV,gBAAgB,MAAM,EAAE,SAAS,QAAQ,OAEzC,OAAO,gBAAgB,UAOvB,OAAO,gBAAgB,MAAM,UAAU,MAAM,SAAS,QAAQ,IAAI,GAC9D,QAAQ,KAAK,SAAS,KAAA,MACxB,aAAa,aAAa,SAAS,KAAK,EAAC,MAAM,KAAK,KAAI;EAG9D,OAAO,IAAI,OAAO,WAAY,UAE5B,AADA,OAAO,gBAAgB,GAAG,OAAO,GAC7B,QACF,aAAa,KAAK,EAAC,MAAM,KAAK,KAAI,CAAC;OAGrC,OAAO,CAAC;EAGV,IAAI,CAAC,MACH,OAAO,CAAC;EAQV,IAAM,OAAO,gBAAgB,SAAS,MAAM,aAAa;EACzD,IAAI,CAAC,MACH,OAAO,CAAC;EAYV,AAPA,iBAAiB,KAAK;GACd;GACN,MAAM,aAAa,MAAM;EAC3B,CAAC,GAED,kBAAkB,KAAK,UACvB,gBAAgB,KAAK,QACrB;CACF;CAGA,OAAO,iBAAiB,QAAQ;AAClC;;;;;;AC/GA,SAAgB,QAAQ,UAA6B,MAAqB;CACxE,OAAO,QAAQ,UAAU,IAAI,MAAM,KAAA;AACrC;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACyBA,SAAgB,mBACd,YACA,OACA,MACwD;CACxD,IAAM,eAA8B,CAAC;CACrC,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SACvC,AAAI,eAAe,KAAK,MAAM,KAC5B,aAAa,KAAK,KAAK;CAG3B,IAAI,aAAa,WAAW,GAC1B;CAGF,IAAI,kBAAuC,OACvC,QACA,UACE,mBAAmB,aAAa,aAAa,SAAS,IAExD,eAAe;CACnB,OAAO,gBAAgB,mBAAkB;EACvC,IAAM,UAAU,KAAK;EACrB,IAAI,OAAO,WAAY,UAAU;GAC/B;GACA;EACF;EAEA,IAAI;EACJ,IAAI,eAAe,OAAO,GACxB,OAAO,gBAAgB,MAAM,UAAU,MAAM,SAAS,QAAQ,IAAI;OAC7D,IAAI,OAAO,WAAY,UAC5B,OAAO,gBAAgB,GAAG,OAAO;OAEjC;EAOF,IALI,CAAC,SAIL,WAAW,iBAAiB,YAAY,QAAQ,IAAI,GAChD,CAAC,WACH;EAGF,IAAI,eAAe,kBAAkB;GAGnC,IAAI,EAAE,WAAW,WACf;GAEF,IAAM,aAAc,KAAiC,SAAS,MAAM;GACpE,IAAI,CAAC,MAAM,QAAQ,UAAU,GAC3B;GAGF,AADA,SAAS,UACT,kBAAkB;EACpB;EACA;CACF;CAEA,OAAO;AACT;AAEA,SAAS,iBACP,YACA,QACA,MACwD;CACxD,IAAI,QAAQ,IACL;OAAA,IAAM,SAAS,OAAO,IACzB,IAAI,MAAM,SAAS,KAAK,OACtB,OAAO;CAAA;CAIb,OAAO,WAAW,IAAI,KAAK,KAAK;AAClC;;;;;;;;;;ACnGA,SAAgB,oBACd,UACA,OACA,MACS;CACT,IAAI,SAAS,QAAQ,WAAW,SAAS,GACvC,OAAO;CAOT,IAAM,WAAW,mBACf,SAAS,QAAQ,YACjB,SAAS,QAAQ,OACjB,IACF;CACA,OAAO,CAAC,EAAE,YAAY,WAAW;AACnC;;;;;;ACxBA,SAAgB,SACd,UACA,MAC4B;CAC5B,OACE,cAAc,IAAI,KAClB,KAAK,UAAU,SAAS,QAAQ,OAAO,MAAM,QAC7C,KAAK,UAAU,SAAS,QAAQ,OAAO,KAAK;AAEhD;;;;;;;;ACPA,SAAgB,aACd,MACA,SACA,MACY;CACZ,IAAM,MAAM,KAAK,IAAI,KAAK,QAAQ,QAAQ,MAAM,GAC5C,kBAA2C,MAAM,OACjD;CAEJ,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK;EAC5B,IAAM,UAAU,KAAK,IACf,eAAe,QAAQ;EAE7B,IAAI,eAAe,OAAO,KAAK,eAAe,YAAY,GAAG;GAC3D,IAAI,QAAQ,SAAS,aAAa,MAAM;IACtC,AAEE,qBADA,cAAc,gBAAgB,MAAM,MAAM,EAAE,SAAS,QAAQ,IAAI,GAC/C,KAAA;IAEpB;GACF;GAEA,IAAI,iBAAiB;IACnB,IAAM,eAAe,gBAAgB,WAClC,MAAM,EAAE,SAAS,QAAQ,IAC5B,GACM,oBAAoB,gBAAgB,WACvC,MAAM,EAAE,SAAS,aAAa,IACjC;IACA,IAAI,iBAAiB,MAAM,sBAAsB,IAC/C,OAAO,eAAe,oBAAoB,KAAK;GAEnD;GAGA,IAAI,QAAQ,OAAO,aAAa,MAC9B,OAAO;GAET,IAAI,QAAQ,OAAO,aAAa,MAC9B,OAAO;GAET;EACF;EAEA,IAAI,OAAO,WAAY,YAAY,OAAO,gBAAiB,UAAU;GACnE,IAAI,YAAY,cAAc;IAC5B,IAAI,aAAa;KACf,IAAM,aAAc,YAAwC;KAI5D,AAHA,kBAAkB,MAAM,QAAQ,UAAU,IACrC,aACD,KAAA,GACJ,cAAc,KAAA;IAChB;IACA;GACF;GACA,IAAI,UAAU,cACZ,OAAO;GAET,IAAI,UAAU,cACZ,OAAO;GAET;EACF;EAEA,IAAI,OAAO,WAAY,YAAY,OAAO,gBAAiB,UAAU;GACnE,IAAI,UAAU,cACZ,OAAO;GAET,IAAI,UAAU,cACZ,OAAO;GAET;EACF;EAEA;CACF;CAEA,OAAO;AACT;ACrFA,SAAgB,gBACd,OACA,SACA,MACY;CACZ,IAAM,SAAS,aAAa,MAAM,MAAM,QAAQ,MAAM,IAAI;CAU1D,OATI,WAAW,IACT,MAAM,SAAS,QAAQ,SAClB,KAET,EAAI,MAAM,SAAS,QAAQ,UAKtB;AACT;AChBA,SAAgB,aACd,OACA,SACA,MACS;CACT,OAAO,gBAAc,OAAO,SAAS,IAAI,MAAM;AACjD;ACNA,SAAgB,gBACd,OACA,MACS;CACT,IAAM,EAAC,QAAQ,UAAS;CACxB,OAAO,aAAa,QAAQ,OAAO,IAAI;AACzC;ACLA,SAAgB,WACd,OACA,MACgB;CAChB,IAAM,EAAC,QAAQ,UAAS;CACxB,OAAO,gBAAgB,OAAO,IAAI,IAAI,CAAC,OAAO,MAAM,IAAI,CAAC,QAAQ,KAAK;AACxE;;;;;;ACQA,SAAgB,gBACd,SACA,MACuB;CACvB,OAAO,cAAc,IAAI,KAAK,KAAK,UAAU,QAAQ,OAAO,MAAM;AACpE;ACrBA,SAAgB,eAAe,MAAY,SAAwB;CACjE,IAAI,KAAK,UAAU,QAAQ,QACzB,OAAO;CAGT,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,IAAM,UAAU,KAAK,IACf,eAAe,QAAQ;EAE7B,IAAI,eAAe,OAAO,KAAK,eAAe,YAAY,GACpD;OAAA,QAAQ,SAAS,aAAa,MAChC,OAAO;EAAA,OAEJ,IAAI,YAAY,cACrB,OAAO;CAEX;CAEA,OAAO;AACT;;;;;;;;;;;;;;;;;;ACAA,SAAgB,uBACd,eACA,UACA,WACQ;CACR,IAAM,cAAc,UAAU,UAAU,SAAS;CAEjD,IAAI,OAAO,eAAgB,UACzB,OAAO,eAAe,KAAK,cAAc,SAAS,SAAS,cAAc;CAG3E,IAAI,CAAC,eAAe,WAAW,GAC7B,OAAO;CAGT,IAAI,aAAa;CACjB,KACE,IAAI,eAAe,GACnB,eAAe,UAAU,SAAS,GAClC,gBACA;EACA,IAAM,UAAU,UAAU;EAC1B,IAAI,OAAO,WAAY,YAAY,CAAC,eAAe,OAAO,GAAG;GAC3D,aAAa;GACb;EACF;CACF;CAEA,IAAI,YAAY;EACd,IAAM,cAAc,cAAc,IAAI,cAAc,SAAS,CAAC;EAC9D,IACE,gBAAgB,KAAA,KAChB,SAAS,YAAY,EAAE,KAAK,SAAS,YAAY,MAEjD,OAAO;CAEX;CAEA,OAAO,SAAS,WAAW,UAAU,MAAM,KAAK,SAAS,YAAY,IAAI;AAC3E;;;;;;;;;;;;;;;;ACjCA,UAAiB,SACf,UACA,UAMI,CAAC,GACiD;CACtD,IAAM,EAAC,KAAK,CAAC,GAAG,MAAM,IAAI,OAAO,UAAU,OAAS;CAEpD,IAAI,SAAS,KAAA,KAAa,OAAO,KAAA,GAAW;EAC1C,OAAO,eAAe,UAAU,IAAI;GAAC;GAAO;EAAO,CAAC;EACpD;CACF;CAEA,OAAO,gBAAgB,UAAU,IAAI;EAAC;EAAM;EAAI;EAAO;CAAO,CAAC;AACjE;;;;;AAiDA,UAAU,eACR,UACA,MACA,SAIsD;CACtD,IAAM,EAAC,OAAO,UAAU,OAAS,SAE3B,WAAW,YAAY,UAAU,IAAI,GAErC,UAAU,UAAU,CAAC,GAAG,QAAQ,CAAC,CAAC,QAAQ,IAAI;CAEpD,KAAK,IAAM,SAAS,SAKlB,CAJI,CAAC,SAAS,MAAM,MAAM,MAAM,MAAM,IAAI,OACxC,MAAM,QAGR,OAAO,eAAe,UAAU,MAAM,MAAM,OAAO;AAEvD;;;;;;;;;;;;;AAcA,SAAS,mBACP,UACA,OACA,OACY;CAKZ,IAAM,YAAY,KAAK,IAAI,MAAM,QAAQ,MAAM,MAAM,GAC/C,SAAe,CAAC;CAEtB,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;EAClC,IAAM,OAAO,MAAM,IACb,OAAO,MAAM;EAEnB,IACE,OAAO,QAAS,YAChB,OAAO,QAAS,YAChB,OAAO,QAAS,YAChB,OAAO,QAAS,YAChB,MAAM,QAAQ,IAAI,KAClB,MAAM,QAAQ,IAAI,GAClB;GACA,OAAO,KAAK,IAAa;GACzB;EACF;EAEA,IAAI,KAAK,SAAS,KAAK,MAAM;GAC3B,OAAO,KAAK,IAAI;GAChB;EACF;EAEA,IAAM,SACJ,SAAS,cAAc,IAAI,cAAc,CAAC,GAAG,QAAQ,IAAI,CAAC,CAAC,KAAK,IAC5D,SACJ,SAAS,cAAc,IAAI,cAAc,CAAC,GAAG,QAAQ,IAAI,CAAC,CAAC,KAAK;EAOlE,OANI,SAAS,SACJ,KAET,EAAI,SAAS;CAIf;CAWA,OAPI,MAAM,SAAS,MAAM,SAChB,KAET,EAAI,MAAM,SAAS,MAAM;AAK3B;;;;;;;AAQA,UAAU,gBACR,UACA,MACA,SAMsD;CACtD,IAAM,EAAC,MAAM,IAAI,OAAO,UAAU,OAAS,SAErC,WAAW,YAAY,UAAU,IAAI,GAQrC,aACJ,SAAS,KAAA,IAAY,IAAK,mBAAmB,UAAU,UAAU,IAAI,KAAK,GACtE,WACJ,OAAO,KAAA,IACH,SAAS,SAAS,IACjB,mBAAmB,UAAU,UAAU,EAAE,KAAK,SAAS,SAAS,GACjE,SAAS,SAAS,MAAM,YAAY,WAAW,CAAC,GAChD,UAAU,UAAU,OAAO,QAAQ,IAAI;CAE7C,KAAK,IAAM,SAAS,SAAS;EAC3B,IAAI,iBAAiB,UAAU,MAAM,MAAM,MAAM,IAAI,OAAO,GAC1D;EAGG,yBAAyB,UAAU,MAAM,MAAM,MAAM,EAAE,MAIxD,UAAU,UAAU,MAAM,MAAM,MAAM,EAAE,MACtC,CAAC,SAAS,MAAM,MAAM,MAAM,MAAM,IAAI,OACxC,MAAM,QAIV,OAAO,gBAAgB,UAAU,MAAM,MAAM,OAAO;CACtD;AACF;;;;;;;AAQA,SAAS,mBACP,UACA,UACA,UACoB;CACpB,IAAM,aAAa,SAAS;CAC5B,IAAI,CAAC,YACH;CAEF,IAAM,kBAAkB,WAAW,KAAK;CACxC,IAAI,SAAS,SAAS,iBACpB;CAMF,IAAM,eAAe,WAAW,KAAK,MAAM,GAAG,EAAE;CAChD,IAAI,aAAa,SAAS,KAAK,CAAC,eAAe,cAAc,QAAQ,GACnE;CAGF,IAAM,gBAAgB,uBACpB,SAAS,eACT,UACA,SAAS,MAAM,GAAG,eAAe,CACnC;CACA,OAAO,kBAAkB,KAAK,KAAA,IAAY;AAC5C;;;;;;AAOA,SAAS,UACP,UACA,UACA,MACA,IACS;CAgBT,OANA,EARE,SAAS,KAAA,KACT,mBAAmB,UAAU,UAAU,IAAI,MAAM,MAE7C,CAAC,eAAe,UAAU,IAAI,KAKhC,OAAO,KAAA,KAAa,mBAAmB,UAAU,UAAU,EAAE,MAAM,KACjE,CAAC,eAAe,UAAU,EAAE;AAMpC;;;;;AAMA,SAAS,yBACP,UACA,UACA,MACA,IACS;CAaT,OAJA,GARI,UAAU,UAAU,UAAU,MAAM,EAAE,KAItC,SAAS,KAAA,KAAa,eAAe,UAAU,IAAI,KAInD,OAAO,KAAA,KAAa,eAAe,UAAU,EAAE;AAKrD;;;;AAKA,SAAS,iBACP,UACA,UACA,MACA,IACA,SACS;CAgBT,OAfI,UACE,SAAS,KAAA,KAKX,mBAAmB,UAAU,UAAU,IAAI,MAAM,MACjD,CAAC,eAAe,UAAU,IAAI,IAI9B,OAAO,KAAA,KAIJ,mBAAmB,UAAU,UAAU,EAAE,MAAM;AACxD;ACjUA,SAAgB,WACd,UACA,MACA,SAIsC;CACtC,IAAM,EAAC,WAAW,UAAS;CAE3B,IAAI,KAAK,WAAW,GAClB;CAGF,IAAM,SAAS,WAAW,IAAI,GACxB,WAAW,YAAY,UAAU,MAAM,GAEvC,eAAe,uBACnB,SAAS,eACT,UACA,IACF;CAEI,qBAAiB,IAIrB;MAAI,CAAC,OAAO;GACV,IAAM,eACJ,cAAc,SAAS,eAAe,IAAI,eAAe;GAM3D,OAJI,eAAe,KAAK,gBAAgB,SAAS,SAC/C,SAGK,SAAS;EAClB;EAOA,QAJE,cAAc,SACV,SAAS,MAAM,eAAe,CAAC,IAC/B,SAAS,MAAM,GAAG,YAAY,CAAC,CAAC,QAAQ,EAAA,CAE5B,MAAM,UAAU,MAAM,MAAM,MAAM,MAAM,IAAI,CAAC;CAP/D;AAQF;;;;;;AClEA,SAAgB,WACd,SACA,MACkB;CAClB,OAAO,cAAc,IAAI,KAAK,KAAK,UAAU,QAAQ,OAAO,KAAK;AACnE;;;;;;;;;;;ACFA,SAAgB,QAAQ,UAA6B,MAAqB;CACxE,IAAM,SAAS,UAAU,UAAU,IAAI;CAMvC,OAJA,CAAK,UAIE,CAAC,gBAAgB,EAAC,QAAQ,SAAS,QAAQ,OAAM,GAAG,OAAO,IAAI;AACxE;;;;;;;;;AAUA,SAAgB,SACd,UACA,MACmD;CACnD,IAAM,QAAQ,QAAQ,UAAU,IAAI;CAE/B,aAIA,QAAQ,UAAU,IAAI,KAIvB,YAAW,EAAC,QAAQ,SAAS,QAAQ,OAAM,GAAG,MAAM,IAAI,GAI5D,OAAO;EAAC,MAAM,MAAM;EAAM,MAAM,MAAM;CAAI;AAC5C;;;;;;;;;AC3CA,SAAgB,SAAS,UAA6B,MAAqB;CACzE,OAAO,CAAC,QAAQ,UAAU,IAAI;AAChC;AC6BA,SAAgB,kBACd,UACA,MACA,SAImD;CACnD,IAAM,QAAQ,SAAS;CAGvB,KAFa,SAAS,QAAQ,cAEjB,WAAW;EACtB,IAAM,YAAY,aAAa,UAAU,IAAI;EAE7C,KAAK,IAAM,YAAY,CAAC,GAAG,SAAS,CAAC,CAAC,QAAQ,GAC5C,IAAI,CAAC,SAAS,MAAM,SAAS,MAAM,SAAS,IAAI,GAC9C,OAAO;EAIX,IAAM,SAAS,SAAS,UAAU,IAAI;EAMtC,OAJI,WAAW,CAAC,SAAS,MAAM,OAAO,MAAM,OAAO,IAAI,KAC9C,SAGT;CACF;CAEA,IAAM,SAAS,SAAS,UAAU,IAAI;CAEtC,IAAI,WAAW,CAAC,SAAS,MAAM,OAAO,MAAM,OAAO,IAAI,IACrD,OAAO;CAGT,KAAK,IAAM,YAAY,aAAa,UAAU,IAAI,GAChD,IAAI,CAAC,SAAS,MAAM,SAAS,MAAM,SAAS,IAAI,GAC9C,OAAO;AAKb;;;;;;;;;;;;;ACrEA,SAAgB,cACd,UACA,QACA,QACY;CACZ,IAAM,iBAAiB,aAAa,OAAO,MAAM,OAAO,MAAM,EAC5D,OAAO,SAAS,QAAQ,MAC1B,CAAC;CAcD,OAZI,mBAAmB,IAInB,OAAO,SAAS,OAAO,SAClB,KAGT,EAAI,OAAO,SAAS,OAAO,UAPlB;AAYX;;;;;;;;;;;;;ACnBA,SAAgB,gBACd,UACA,MAC6D;CAC7D,IAAM,YAAY,aAAa,UAAU,IAAI;CAC7C,KAAK,IAAM,YAAY,WAAW;EAChC,IAAI,CAAC,SAAS,UAAU,SAAS,IAAI,GACnC;EAEF,IAAM,WAAW,mBACf,SAAS,QAAQ,YACjB,SAAS,QAAQ,OACjB,SAAS,IACX;EAIA,OAHI,CAAC,YAAY,EAAE,WAAW,YAC5B,SAEK;GAAC,QAAQ;GAAU,YAAY,SAAS;EAAI;CACrD;AAEF;;;;;;;;;;;;;ACtBA,SAAgB,sBACd,UACA,MAMY;CACZ,IAAM,UAAU,gBAAgB,UAAU,IAAI;CACzC,aAGL,OAAO;EACL,IAAI,QAAQ,OAAO,MAAM;EACzB,MAAM,QAAQ;CAChB;AACF;;;;;;;;;;;ACnBA,SAAgB,iBACd,UACA,MACQ;CACR,IAAM,YAAY,sBAAsB,UAAU,IAAI;CAMtD,OAJK,YAIE,aAAa,SAAS,QAAQ,QAAQ,UAAU,EAAE,IAHhD,SAAS,QAAQ;AAI5B"}