@prismicio/client/dist/richtext/asTree.cjs.map

The official JavaScript + TypeScript client library for Prismic

{"version":3,"file":"asTree.cjs","names":["children: TreeNode[]","RichTextNodeType","mutNodes: RTBlockNode[]","items: (RTListItemNode | RTOListItemNode)[]","mutSpans: RTInlineNode[]","childSpans: RTInlineNode[]"],"sources":["../../src/richtext/asTree.ts"],"sourcesContent":["import type {\n\tRTAnyNode,\n\tRTBlockNode,\n\tRTInlineNode,\n\tRTListItemNode,\n\tRTNode,\n\tRTOListItemNode,\n\tRTTextNode,\n} from \"../types/value/richText\"\nimport { RichTextNodeType } from \"../types/value/richText\"\nimport type { Tree, TreeNode } from \"./types\"\n\nconst uuid = (): string => {\n\treturn (++uuid.i).toString()\n}\nuuid.i = 0\n\n/**\n * Parses a rich text or title field into a tree\n *\n * @remarks\n * This is a low level helper mainly intended to be used by higher level\n * packages. Most users aren't expected to this function directly.\n *\n * @param nodes - A rich text or title field from Prismic\n *\n * @returns Tree from given rich text or title field\n */\nexport const asTree = (nodes: RTNode[]): Tree => {\n\tconst preparedNodes = prepareNodes(nodes)\n\n\tconst children: TreeNode[] = []\n\tfor (let i = 0; i < preparedNodes.length; i++) {\n\t\tchildren.push(nodeToTreeNode(preparedNodes[i]))\n\t}\n\n\treturn {\n\t\tkey: uuid(),\n\t\tchildren,\n\t}\n}\n\nconst createTreeNode = (\n\tnode: RTAnyNode,\n\tchildren: TreeNode[] = [],\n): TreeNode => {\n\treturn {\n\t\tkey: uuid(),\n\t\ttype: node.type,\n\t\ttext: \"text\" in node ? node.text : undefined,\n\t\tnode,\n\t\tchildren,\n\t}\n}\n\nconst createTextTreeNode = (text: string): TreeNode => {\n\treturn createTreeNode({\n\t\ttype: RichTextNodeType.span,\n\t\ttext,\n\t\tspans: [],\n\t})\n}\n\nconst prepareNodes = (nodes: RTNode[]): RTBlockNode[] => {\n\tconst mutNodes: RTBlockNode[] = nodes.slice(0)\n\n\tfor (let i = 0; i < mutNodes.length; i++) {\n\t\tconst node = mutNodes[i]\n\n\t\tif (\n\t\t\tnode.type === RichTextNodeType.listItem ||\n\t\t\tnode.type === RichTextNodeType.oListItem\n\t\t) {\n\t\t\tconst items: (RTListItemNode | RTOListItemNode)[] = [\n\t\t\t\tnode as RTListItemNode | RTOListItemNode,\n\t\t\t]\n\n\t\t\twhile (mutNodes[i + 1] && mutNodes[i + 1].type === node.type) {\n\t\t\t\titems.push(mutNodes[i + 1] as RTListItemNode | RTOListItemNode)\n\t\t\t\tmutNodes.splice(i, 1)\n\t\t\t}\n\n\t\t\tif (node.type === RichTextNodeType.listItem) {\n\t\t\t\tmutNodes[i] = {\n\t\t\t\t\ttype: RichTextNodeType.list,\n\t\t\t\t\titems: items as RTListItemNode[],\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tmutNodes[i] = {\n\t\t\t\t\ttype: RichTextNodeType.oList,\n\t\t\t\t\titems: items as RTOListItemNode[],\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn mutNodes\n}\n\nconst nodeToTreeNode = (node: RTBlockNode): TreeNode => {\n\tif (\"text\" in node) {\n\t\treturn createTreeNode(\n\t\t\tnode,\n\t\t\ttextNodeSpansToTreeNodeChildren(node.spans, node),\n\t\t)\n\t}\n\n\tif (\"items\" in node) {\n\t\tconst children: TreeNode[] = []\n\t\tfor (let i = 0; i < node.items.length; i++) {\n\t\t\tchildren.push(nodeToTreeNode(node.items[i]))\n\t\t}\n\n\t\treturn createTreeNode(node, children)\n\t}\n\n\treturn createTreeNode(node)\n}\n\nconst textNodeSpansToTreeNodeChildren = (\n\tspans: RTInlineNode[],\n\tnode: RTTextNode,\n\tparentSpan?: RTInlineNode,\n): TreeNode[] => {\n\tif (!spans.length) {\n\t\treturn [createTextTreeNode(node.text)]\n\t}\n\n\tconst mutSpans: RTInlineNode[] = spans.slice(0)\n\n\t// Sort spans using the following criteria:\n\t//\n\t//   1. By start index (ascending)\n\t//   2. If start indices are equal, by end index (descending)\n\t//\n\t// If start and end indices of more than one span are equal, use what\n\t// the API gives without modifications.\n\t//\n\t// Sorting using this algorithm ensures proper detection of child\n\t// spans.\n\tmutSpans.sort((a, b) => a.start - b.start || b.end - a.end)\n\n\tconst children: TreeNode[] = []\n\n\tfor (let i = 0; i < mutSpans.length; i++) {\n\t\tconst span = mutSpans[i]\n\t\tconst parentSpanStart = (parentSpan && parentSpan.start) || 0\n\t\tconst spanStart = span.start - parentSpanStart\n\t\tconst spanEnd = span.end - parentSpanStart\n\t\tconst text = node.text.slice(spanStart, spanEnd)\n\n\t\tconst childSpans: RTInlineNode[] = []\n\t\tfor (let j = i; j < mutSpans.length; j++) {\n\t\t\tconst siblingSpan = mutSpans[j]\n\n\t\t\tif (siblingSpan !== span) {\n\t\t\t\tif (siblingSpan.start >= span.start && siblingSpan.end <= span.end) {\n\t\t\t\t\tchildSpans.push(siblingSpan)\n\t\t\t\t\tmutSpans.splice(j, 1)\n\t\t\t\t\tj--\n\t\t\t\t} else if (\n\t\t\t\t\tsiblingSpan.start < span.end &&\n\t\t\t\t\tsiblingSpan.end > span.start\n\t\t\t\t) {\n\t\t\t\t\tchildSpans.push({\n\t\t\t\t\t\t...siblingSpan,\n\t\t\t\t\t\tend: span.end,\n\t\t\t\t\t})\n\t\t\t\t\tmutSpans[j] = {\n\t\t\t\t\t\t...siblingSpan,\n\t\t\t\t\t\tstart: span.end,\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (i === 0 && spanStart > 0) {\n\t\t\tchildren.push(createTextTreeNode(node.text.slice(0, spanStart)))\n\t\t}\n\n\t\tconst spanWithText = { ...span, text }\n\t\tchildren.push(\n\t\t\tcreateTreeNode(\n\t\t\t\tspanWithText,\n\t\t\t\ttextNodeSpansToTreeNodeChildren(\n\t\t\t\t\tchildSpans,\n\t\t\t\t\t{\n\t\t\t\t\t\t...node,\n\t\t\t\t\t\ttext,\n\t\t\t\t\t},\n\t\t\t\t\tspan,\n\t\t\t\t),\n\t\t\t),\n\t\t)\n\n\t\tif (spanEnd < node.text.length) {\n\t\t\tchildren.push(\n\t\t\t\tcreateTextTreeNode(\n\t\t\t\t\tnode.text.slice(\n\t\t\t\t\t\tspanEnd,\n\t\t\t\t\t\tmutSpans[i + 1]\n\t\t\t\t\t\t\t? mutSpans[i + 1].start - parentSpanStart\n\t\t\t\t\t\t\t: undefined,\n\t\t\t\t\t),\n\t\t\t\t),\n\t\t\t)\n\t\t}\n\t}\n\n\treturn children\n}\n"],"mappings":";;;AAYA,MAAM,aAAqB;AAC1B,SAAQ,EAAE,KAAK,GAAG,UAAU;;AAE7B,KAAK,IAAI;;;;;;;;;;;;AAaT,MAAa,UAAU,UAA0B;CAChD,MAAM,gBAAgB,aAAa,MAAM;CAEzC,MAAMA,WAAuB,EAAE;AAC/B,MAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,IACzC,UAAS,KAAK,eAAe,cAAc,GAAG,CAAC;AAGhD,QAAO;EACN,KAAK,MAAM;EACX;EACA;;AAGF,MAAM,kBACL,MACA,WAAuB,EAAE,KACX;AACd,QAAO;EACN,KAAK,MAAM;EACX,MAAM,KAAK;EACX,MAAM,UAAU,OAAO,KAAK,OAAO;EACnC;EACA;EACA;;AAGF,MAAM,sBAAsB,SAA2B;AACtD,QAAO,eAAe;EACrB,MAAMC,kCAAiB;EACvB;EACA,OAAO,EAAE;EACT,CAAC;;AAGH,MAAM,gBAAgB,UAAmC;CACxD,MAAMC,WAA0B,MAAM,MAAM,EAAE;AAE9C,MAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACzC,MAAM,OAAO,SAAS;AAEtB,MACC,KAAK,SAASD,kCAAiB,YAC/B,KAAK,SAASA,kCAAiB,WAC9B;GACD,MAAME,QAA8C,CACnD,KACA;AAED,UAAO,SAAS,IAAI,MAAM,SAAS,IAAI,GAAG,SAAS,KAAK,MAAM;AAC7D,UAAM,KAAK,SAAS,IAAI,GAAuC;AAC/D,aAAS,OAAO,GAAG,EAAE;;AAGtB,OAAI,KAAK,SAASF,kCAAiB,SAClC,UAAS,KAAK;IACb,MAAMA,kCAAiB;IAChB;IACP;OAED,UAAS,KAAK;IACb,MAAMA,kCAAiB;IAChB;IACP;;;AAKJ,QAAO;;AAGR,MAAM,kBAAkB,SAAgC;AACvD,KAAI,UAAU,KACb,QAAO,eACN,MACA,gCAAgC,KAAK,OAAO,KAAK,CACjD;AAGF,KAAI,WAAW,MAAM;EACpB,MAAMD,WAAuB,EAAE;AAC/B,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,MAAM,QAAQ,IACtC,UAAS,KAAK,eAAe,KAAK,MAAM,GAAG,CAAC;AAG7C,SAAO,eAAe,MAAM,SAAS;;AAGtC,QAAO,eAAe,KAAK;;AAG5B,MAAM,mCACL,OACA,MACA,eACgB;AAChB,KAAI,CAAC,MAAM,OACV,QAAO,CAAC,mBAAmB,KAAK,KAAK,CAAC;CAGvC,MAAMI,WAA2B,MAAM,MAAM,EAAE;AAY/C,UAAS,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI;CAE3D,MAAMJ,WAAuB,EAAE;AAE/B,MAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACzC,MAAM,OAAO,SAAS;EACtB,MAAM,kBAAmB,cAAc,WAAW,SAAU;EAC5D,MAAM,YAAY,KAAK,QAAQ;EAC/B,MAAM,UAAU,KAAK,MAAM;EAC3B,MAAM,OAAO,KAAK,KAAK,MAAM,WAAW,QAAQ;EAEhD,MAAMK,aAA6B,EAAE;AACrC,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;GACzC,MAAM,cAAc,SAAS;AAE7B,OAAI,gBAAgB,MACnB;QAAI,YAAY,SAAS,KAAK,SAAS,YAAY,OAAO,KAAK,KAAK;AACnE,gBAAW,KAAK,YAAY;AAC5B,cAAS,OAAO,GAAG,EAAE;AACrB;eAEA,YAAY,QAAQ,KAAK,OACzB,YAAY,MAAM,KAAK,OACtB;AACD,gBAAW,KAAK;MACf,GAAG;MACH,KAAK,KAAK;MACV,CAAC;AACF,cAAS,KAAK;MACb,GAAG;MACH,OAAO,KAAK;MACZ;;;;AAKJ,MAAI,MAAM,KAAK,YAAY,EAC1B,UAAS,KAAK,mBAAmB,KAAK,KAAK,MAAM,GAAG,UAAU,CAAC,CAAC;EAGjE,MAAM,eAAe;GAAE,GAAG;GAAM;GAAM;AACtC,WAAS,KACR,eACC,cACA,gCACC,YACA;GACC,GAAG;GACH;GACA,EACD,KACA,CACD,CACD;AAED,MAAI,UAAU,KAAK,KAAK,OACvB,UAAS,KACR,mBACC,KAAK,KAAK,MACT,SACA,SAAS,IAAI,KACV,SAAS,IAAI,GAAG,QAAQ,kBACxB,OACH,CACD,CACD;;AAIH,QAAO"}