@notectl/core 2.2.1 → 2.2.3

package/dist/chunks/ColorValidation-DAijTjG9.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"ColorValidation-DAijTjG9.mjs","names":[],"sources":["../../src/plugins/shared/ColorValidation.ts"],"sourcesContent":["/**\n * Shared CSS validation and normalization utilities\n * for style-based mark plugins (TextColor, Highlight, Font, FontSize).\n */\n\nconst HEX_COLOR_PATTERN: RegExp = /^#([0-9a-f]{3}|[0-9a-f]{6})$/i;\n\n/** Returns `true` when the value is a valid `#RGB` or `#RRGGBB` hex color. */\nexport function isValidHexColor(value: string): boolean {\n\treturn HEX_COLOR_PATTERN.test(value);\n}\n\n// --- CSS Color Validation (broad format support for paste / API input) ---\n\n/** Matches `rgb(r, g, b)` and `rgba(r, g, b, a)` with integer or percentage values. */\nconst RGB_PATTERN: RegExp =\n\t/^rgba?\\(\\s*(\\d{1,3}%?\\s*,\\s*){2}\\d{1,3}%?(\\s*,\\s*(0|1|0?\\.\\d+))?\\s*\\)$/;\n\n/** Matches `hsl(h, s%, l%)` and `hsla(h, s%, l%, a)`. */\nconst HSL_PATTERN: RegExp =\n\t/^hsla?\\(\\s*\\d{1,3}\\s*,\\s*\\d{1,3}%\\s*,\\s*\\d{1,3}%(\\s*,\\s*(0|1|0?\\.\\d+))?\\s*\\)$/;\n\n/**\n * Complete set of CSS Level 4 named colors (including `transparent`).\n * Used as an allowlist — unknown names are rejected.\n */\nconst CSS_NAMED_COLORS: ReadonlySet<string> = new Set([\n\t'aliceblue',\n\t'antiquewhite',\n\t'aqua',\n\t'aquamarine',\n\t'azure',\n\t'beige',\n\t'bisque',\n\t'black',\n\t'blanchedalmond',\n\t'blue',\n\t'blueviolet',\n\t'brown',\n\t'burlywood',\n\t'cadetblue',\n\t'chartreuse',\n\t'chocolate',\n\t'coral',\n\t'cornflowerblue',\n\t'cornsilk',\n\t'crimson',\n\t'cyan',\n\t'darkblue',\n\t'darkcyan',\n\t'darkgoldenrod',\n\t'darkgray',\n\t'darkgreen',\n\t'darkgrey',\n\t'darkkhaki',\n\t'darkmagenta',\n\t'darkolivegreen',\n\t'darkorange',\n\t'darkorchid',\n\t'darkred',\n\t'darksalmon',\n\t'darkseagreen',\n\t'darkslateblue',\n\t'darkslategray',\n\t'darkslategrey',\n\t'darkturquoise',\n\t'darkviolet',\n\t'deeppink',\n\t'deepskyblue',\n\t'dimgray',\n\t'dimgrey',\n\t'dodgerblue',\n\t'firebrick',\n\t'floralwhite',\n\t'forestgreen',\n\t'fuchsia',\n\t'gainsboro',\n\t'ghostwhite',\n\t'gold',\n\t'goldenrod',\n\t'gray',\n\t'green',\n\t'greenyellow',\n\t'grey',\n\t'honeydew',\n\t'hotpink',\n\t'indianred',\n\t'indigo',\n\t'ivory',\n\t'khaki',\n\t'lavender',\n\t'lavenderblush',\n\t'lawngreen',\n\t'lemonchiffon',\n\t'lightblue',\n\t'lightcoral',\n\t'lightcyan',\n\t'lightgoldenrodyellow',\n\t'lightgray',\n\t'lightgreen',\n\t'lightgrey',\n\t'lightpink',\n\t'lightsalmon',\n\t'lightseagreen',\n\t'lightskyblue',\n\t'lightslategray',\n\t'lightslategrey',\n\t'lightsteelblue',\n\t'lightyellow',\n\t'lime',\n\t'limegreen',\n\t'linen',\n\t'magenta',\n\t'maroon',\n\t'mediumaquamarine',\n\t'mediumblue',\n\t'mediumorchid',\n\t'mediumpurple',\n\t'mediumseagreen',\n\t'mediumslateblue',\n\t'mediumspringgreen',\n\t'mediumturquoise',\n\t'mediumvioletred',\n\t'midnightblue',\n\t'mintcream',\n\t'mistyrose',\n\t'moccasin',\n\t'navajowhite',\n\t'navy',\n\t'oldlace',\n\t'olive',\n\t'olivedrab',\n\t'orange',\n\t'orangered',\n\t'orchid',\n\t'palegoldenrod',\n\t'palegreen',\n\t'paleturquoise',\n\t'palevioletred',\n\t'papayawhip',\n\t'peachpuff',\n\t'peru',\n\t'pink',\n\t'plum',\n\t'powderblue',\n\t'purple',\n\t'rebeccapurple',\n\t'red',\n\t'rosybrown',\n\t'royalblue',\n\t'saddlebrown',\n\t'salmon',\n\t'sandybrown',\n\t'seagreen',\n\t'seashell',\n\t'sienna',\n\t'silver',\n\t'skyblue',\n\t'slateblue',\n\t'slategray',\n\t'slategrey',\n\t'snow',\n\t'springgreen',\n\t'steelblue',\n\t'tan',\n\t'teal',\n\t'thistle',\n\t'tomato',\n\t'transparent',\n\t'turquoise',\n\t'violet',\n\t'wheat',\n\t'white',\n\t'whitesmoke',\n\t'yellow',\n\t'yellowgreen',\n]);\n\n/**\n * Returns `true` when `value` is a safe CSS color value.\n * Accepts hex (`#RGB`, `#RRGGBB`), `rgb()`, `rgba()`, `hsl()`, `hsla()`,\n * and CSS named colors. Rejects anything else — defense against CSS injection\n * via manipulated color values in `style` attributes.\n */\nexport function isValidCSSColor(value: string): boolean {\n\tif (!value) return false;\n\tconst trimmed: string = value.trim().toLowerCase();\n\tif (!trimmed) return false;\n\n\treturn (\n\t\tHEX_COLOR_PATTERN.test(trimmed) ||\n\t\tRGB_PATTERN.test(trimmed) ||\n\t\tHSL_PATTERN.test(trimmed) ||\n\t\tCSS_NAMED_COLORS.has(trimmed)\n\t);\n}\n\n/**\n * Validates, deduplicates, and normalizes a user-supplied color list.\n * Returns `fallbackPalette` when no custom colors are provided.\n *\n * @throws {Error} if any value is not a valid hex color code.\n */\nexport function resolveColors(\n\tcolors: readonly string[] | undefined,\n\tfallbackPalette: readonly string[],\n\tpluginName: string,\n): readonly string[] {\n\tif (!colors || colors.length === 0) return fallbackPalette;\n\n\tconst invalid: string[] = colors.filter((c) => !isValidHexColor(c));\n\tif (invalid.length > 0) {\n\t\tthrow new Error(\n\t\t\t`${pluginName}: invalid hex color(s): ${invalid.join(', ')}. Expected format: #RGB or #RRGGBB.`,\n\t\t);\n\t}\n\n\tconst seen: Set<string> = new Set();\n\tconst unique: string[] = [];\n\tfor (const color of colors) {\n\t\tconst normalized: string = color.toLowerCase();\n\t\tif (!seen.has(normalized)) {\n\t\t\tseen.add(normalized);\n\t\t\tunique.push(normalized);\n\t\t}\n\t}\n\treturn unique;\n}\n\n// --- Font Family Validation ---\n\n/** Characters that are never valid in a CSS font-family value. */\nconst FONT_FAMILY_FORBIDDEN: RegExp = /[{}<>;]|url\\(|expression\\(/i;\n\n/**\n * Returns `true` when `value` is a safe CSS `font-family` value.\n * Rejects values containing `{`, `}`, `;`, `<`, `>`, `url(`, or `expression(`\n * to defend against CSS injection.\n */\nexport function isValidCSSFontFamily(value: string): boolean {\n\tif (!value) return false;\n\tconst trimmed: string = value.trim();\n\tif (!trimmed) return false;\n\treturn !FONT_FAMILY_FORBIDDEN.test(trimmed);\n}\n\n// --- Font Size Validation ---\n\n/** Matches valid CSS font-size values: number with unit (px, pt, em, rem, %). */\nconst FONT_SIZE_PATTERN: RegExp = /^\\d+(\\.\\d+)?(px|pt|em|rem|%)$/i;\n\n/**\n * Returns `true` when `value` is a safe CSS `font-size` value.\n * Accepts values like `16px`, `1.5em`, `12pt`, `100%`, `0.875rem`.\n */\nexport function isValidCSSFontSize(value: string): boolean {\n\tif (!value) return false;\n\treturn FONT_SIZE_PATTERN.test(value.trim());\n}\n"],"mappings":"AAKA,IAAM,EAA4B,gCAGlC,SAAgB,EAAgB,GAC/B,OAAO,EAAkB,KAAK,EAC/B,CAKA,IAAM,EACL,yEAGK,EACL,gFAMK,EAAwC,IAAI,IAAI,CACrD,YACA,eACA,OACA,aACA,QACA,QACA,SACA,QACA,iBACA,OACA,aACA,QACA,YACA,YACA,aACA,YACA,QACA,iBACA,WACA,UACA,OACA,WACA,WACA,gBACA,WACA,YACA,WACA,YACA,cACA,iBACA,aACA,aACA,UACA,aACA,eACA,gBACA,gBACA,gBACA,gBACA,aACA,WACA,cACA,UACA,UACA,aACA,YACA,cACA,cACA,UACA,YACA,aACA,OACA,YACA,OACA,QACA,cACA,OACA,WACA,UACA,YACA,SACA,QACA,QACA,WACA,gBACA,YACA,eACA,YACA,aACA,YACA,uBACA,YACA,aACA,YACA,YACA,cACA,gBACA,eACA,iBACA,iBACA,iBACA,cACA,OACA,YACA,QACA,UACA,SACA,mBACA,aACA,eACA,eACA,iBACA,kBACA,oBACA,kBACA,kBACA,eACA,YACA,YACA,WACA,cACA,OACA,UACA,QACA,YACA,SACA,YACA,SACA,gBACA,YACA,gBACA,gBACA,aACA,YACA,OACA,OACA,OACA,aACA,SACA,gBACA,MACA,YACA,YACA,cACA,SACA,aACA,WACA,WACA,SACA,SACA,UACA,YACA,YACA,YACA,OACA,cACA,YACA,MACA,OACA,UACA,SACA,cACA,YACA,SACA,QACA,QACA,aACA,SACA,gBASD,SAAgB,EAAgB,GAC/B,IAAK,EAAO,OAAO,EACnB,MAAM,EAAkB,EAAM,OAAO,cACrC,QAAK,IAGJ,EAAkB,KAAK,IACvB,EAAY,KAAK,IACjB,EAAY,KAAK,IACjB,EAAiB,IAAI,GAEvB,CAQA,SAAgB,EACf,EACA,EACA,GAEA,IAAK,GAA4B,IAAlB,EAAO,OAAc,OAAO,EAE3C,MAAM,EAAoB,EAAO,OAAQ,IAAO,EAAgB,IAChE,GAAI,EAAQ,OAAS,EACpB,MAAM,IAAI,MACT,GAAG,4BAAqC,EAAQ,KAAK,4CAIvD,MAAM,iBAAoB,IAAI,IACxB,EAAmB,GACzB,IAAK,MAAM,KAAS,EAAQ,CAC3B,MAAM,EAAqB,EAAM,cAC5B,EAAK,IAAI,KACb,EAAK,IAAI,GACT,EAAO,KAAK,GAEd,CACA,OAAO,CACR,CAKA,IAAM,EAAgC,8BAOtC,SAAgB,EAAqB,GACpC,IAAK,EAAO,OAAO,EACnB,MAAM,EAAkB,EAAM,OAC9B,QAAK,IACG,EAAsB,KAAK,EACpC,CAKA,IAAM,EAA4B,iCAMlC,SAAgB,EAAmB,GAClC,QAAK,GACE,EAAkB,KAAK,EAAM,OACrC"}

package/dist/chunks/Commands-BIIpx_Zd.mjs

@@ -0,0 +1,2 @@
+import{T as t,_ as n,b as e,g as o,h as r,m as c,n as s,o as i,p as l,s as u,u as f,v as a,w as d}from"./Document-r7vLOAGA.mjs";import{i as m,n as k,r as b,t as g}from"./WordBoundary-DxeMBRyP.mjs";import{a as p,c as I,d as h,l as S,o as B,r as x,t as T,u as O}from"./Selection-HYoVFpAx.mjs";import{i as N,r as y}from"./TypeBrands-Ch9856Gb.mjs";import{r as A}from"./NodeResolver-ChgLF_IP.mjs";import{T as M,b as j,w as v,x as w}from"./BlockInsertion-6rR9tIGP.mjs";import{i as _,n as C,o as P,r as R}from"./NavigationQueries-Bt4zZ17v.mjs";import{a as D,o as Q}from"./AttributedMarkCommands-D4W2Jgpj.mjs";import{n as W,r as q,t as z}from"./NodeSelectionCommands-Dj4VxLdD.mjs";import{n as E}from"./RangeIterator-o8v3msQe.mjs";function F(){return{nodeTypes:["paragraph"],markTypes:["bold","italic","underline"],getNodeSpec:()=>{}}}function G(t){return{nodeTypes:t.getNodeTypes(),markTypes:t.getMarkTypes(),getNodeSpec:n=>t.getNodeSpec(n),getInlineNodeSpec:n=>t.getInlineNodeSpec(n),getMarkSpec:n=>t.getMarkSpec(n)}}function H(t,n){return t.markTypes.includes(n)}function J(t,n){return t.nodeTypes.includes(n)}function K(t,n){if("after"===n.side)return U(t,n);const e=t.getBlockOrder(),o=e.indexOf(n.blockId);if(o<=0)return null;const r=e[o-1];if(!r)return null;if(_(t,r)){const n=A(t.doc,r)??[];return t.transaction("input").setSelection(x(r,n)).build()}const c=t.getBlock(r);if(!c)return null;const s=l(c);return t.transaction("input").setSelection(T(r,s)).build()}function L(t,n){if("before"===n.side)return U(t,n);const e=t.getBlockOrder(),o=e.indexOf(n.blockId);if(o>=e.length-1)return null;const r=e[o+1];if(!r)return null;if(_(t,r)){const n=A(t.doc,r)??[];return t.transaction("input").setSelection(x(r,n)).build()}return t.transaction("input").setSelection(T(r,0)).build()}function U(t,n){const e=A(t.doc,n.blockId)??[];return z(t,x(n.blockId,e))}function V(t,n){const e=A(t.doc,n);if(!e||0===e.length)return-1;const o=e[0];return t.doc.children.findIndex(t=>t.id===o)}var X={bold:!0,italic:!0,underline:!0};function Y(t,n,o=X){if(function(t,n){const e=t;return"bold"===e?!n.bold:"italic"===e?!n.italic:"underline"===e&&!n.underline}(n,o))return null;if(!H(t.schema,n))return null;if(!O(t.selection))return null;const r={type:n},c=t.selection;if(B(c)){if(!t.getBlock(c.anchor.blockId))return null;const o=Q(t),s=e(o,n)?o.filter(t=>t.type!==n):[...o,r];return t.transaction("command").setStoredMarks(s,t.storedMarks).setSelection(c).build()}const s=h(c,t.getBlockOrder()),i=t.transaction("command"),l=et(t,n);return E(t,s,(t,n,e)=>{l?i.removeMark(t,n,e,r):i.addMark(t,n,e,r)}),i.setSelection(c),i.build()}function Z(t,n){return Y(t,N("bold"),n)}function $(t,n){return Y(t,N("italic"),n)}function tt(t,n){return Y(t,N("underline"),n)}function nt(t,n){const o=t.selection;return!!O(o)&&(B(o)?e(Q(t),n):et(t,n))}function et(t,n){const e=t.selection;if(!O(e))return!1;const o=t.getBlockOrder(),r=h(e,o),c=o.indexOf(r.from.blockId),s=o.indexOf(r.to.blockId);let i=!1;for(let u=c;u<=s;u++){const e=o[u];if(!e)continue;const f=t.getBlock(e);if(!f)continue;const a=l(f),d=ot(f,u===c?r.from.offset:0,u===s?r.to.offset:a,n);if("missing"===d)return!1;"present"===d&&(i=!0)}return i}function ot(n,o,r,c){let s=0,i=!1;for(const l of a(n))if(t(l)){const t=s+l.text.length;if(t>o&&s<r&&(i=!0,!e(l.marks,c)))return"missing";s=t}else s+=1;return i?"present":"empty"}function rt(t,n){const e=t.selection;if(S(e))return z(t,e);if(I(e))return null;if(!B(e))return dt(t);const o=t.getBlock(e.anchor.blockId);if(!o)return null;const r=n.range(o,e.anchor.offset);if(!r)return n.merge(t);const[c,s]=r;return t.transaction("input").deleteTextAt(o.id,c,s).setSelection(T(o.id,c)).build()}function ct(t){return rt(t,{merge:bt,range:(t,n)=>n<=0?null:"inline"===o(t,n-1)?.kind?[n-1,n]:[n-(m(r(t),s(t,n))||1),n]})}function st(t){return rt(t,{merge:gt,range:(t,n)=>n>=l(t)?null:"inline"===o(t,n)?.kind?[n,n+1]:[n,n+(b(r(t),s(t,n))||1)]})}function it(t){return rt(t,{merge:bt,range:(t,n)=>n>0?[g(t,n),n]:null})}function lt(t){return rt(t,{merge:gt,range:(t,n)=>n<l(t)?[n,k(t,n)]:null})}function ut(t){return rt(t,{merge:bt,range:(t,n)=>n>0?[0,n]:null})}function ft(t){return rt(t,{merge:gt,range:(t,n)=>{const e=l(t);return n<e?[n,e]:null}})}function at(t,e,o="input"){const r=t.selection;if(S(r))return q(t,r,e,o);if(I(r))return function(t,n,e,o){const{parentPath:r,siblings:c,index:s}=M(t,n.blockId),l="before"===n.side?Math.max(s,0):s>=0?s+1:c.length,u=f(),a=t.transaction(o);return a.insertNode(r,l,i(u)),a.insertText(u,0,e,[]),a.setSelection(T(u,e.length)),a.build()}(t,r,e,o);const s=t.transaction(o),l=function(t){if(t.storedMarks)return t.storedMarks;const e=t.selection;if(!O(e))return[];const o=t.getBlock(e.anchor.blockId);return o?B(e)?n(o,e.anchor.offset,n=>D(t.schema,n)):c(o,e.anchor.offset):[]}(t);let u;B(r)||(u=St(t,s));const a=v(r,t.getBlockOrder()),d=u??a.blockId,m=u?0:a.offset;return s.insertText(d,m,e,l),s.setSelection(T(d,m+e.length)),s.build()}function dt(t){if(S(t.selection))return z(t,t.selection);if(I(t.selection))return null;if(B(t.selection))return null;if(function(t){if(!O(t.selection))return!1;const n=ht(t);if(!n)return!1;const e=h(t.selection,t.getBlockOrder());return e.from.blockId===n.from.blockId&&e.from.offset===n.from.offset&&e.to.blockId===n.to.blockId&&e.to.offset===n.to.offset}(t))return function(t){const n=f(),e=t.transaction("input"),o=t.doc.children.length;e.insertNode([],0,i(n));for(let r=o;r>=1;r--)e.removeNode([],r);return e.setSelection(T(n,0)),e.build()}(t);const n=t.transaction("input"),e=St(t,n),o=h(t.selection,t.getBlockOrder()),r=e??o.from.blockId,c=e?0:o.from.offset;return n.setSelection(T(r,c)),n.build()}function mt(t){const n=t.selection;if(S(n))return W(t,n);if(I(n))return function(t,n){const{parentPath:e,index:o}=M(t,n.blockId);if(o<0)return null;const r="before"===n.side?o:o+1,c=f(),s=t.transaction("input");return s.insertNode(e,r,i(c)),s.setSelection(T(c,0)),s.build()}(t,n);const e=t.transaction("input");let o;B(n)||(o=St(t,e));const r=v(n,t.getBlockOrder()),c=o??r.blockId,s=o?0:r.offset,l=f();return e.splitBlock(c,s,l),e.setSelection(T(l,0)),e.build()}function kt(t){const n=t.selection;if(!O(n))return null;const e=t.transaction("input");let o;if(B(n)||(o=St(t,e)),o)e.insertInlineNode(o,0,u(y("hard_break"))),e.setSelection(T(o,1));else{const{blockId:o,offset:r}=v(n,t.getBlockOrder());e.insertInlineNode(o,r,u(y("hard_break"))),e.setSelection(T(o,r+1))}return e.build()}function bt(t){return pt(t,"backward")}function gt(t){return pt(t,"forward")}function pt(t,n){const e=t.selection;if(!O(e))return null;const o=t.getBlockOrder(),r=o.indexOf(e.anchor.blockId),c="backward"===n?r-1:r+1;if(c<0||c>=o.length)return null;const s=o[c];if(!s)return null;if(R(t,e.anchor.blockId)||R(t,s))return null;if(!P(t,e.anchor.blockId,s)&&C(t,e.anchor.blockId))return null;if(_(t,s)){const n=A(t.doc,s)??[];return t.transaction("input").setSelection(x(s,n)).build()}if("backward"===n){const n=t.getBlock(s);if(!n)return null;const o=l(n);return t.transaction("input").mergeBlocksAt(s,e.anchor.blockId).setSelection(T(s,o)).build()}return t.transaction("input").mergeBlocksAt(e.anchor.blockId,s).setSelection(T(e.anchor.blockId,e.anchor.offset)).build()}function It(t){const n=ht(t);return n?t.transaction("command").setSelection(p(n.from,n.to)).build():t.transaction("command").setSelection(t.selection).build()}function ht(t){const n=t.doc.children,e=n[0],o=n[n.length-1];if(!e||!o)return null;const r=j(e),c=w(o),s=t.getBlock(c);return{from:{blockId:r,offset:0},to:{blockId:c,offset:s?l(s):0}}}function St(t,n){if(!O(t.selection))return;const e=t.getBlockOrder(),o=h(t.selection,e),r=e.indexOf(o.from.blockId),c=e.indexOf(o.to.blockId);if(r===c)return void n.deleteTextAt(o.from.blockId,o.from.offset,o.to.offset);const s=V(t,o.from.blockId),u=V(t,o.to.blockId);if(!(s===u||s<0||u<0))return function(t,n,e,o,r){const c=t.doc.children[o],s=t.doc.children[r];if(!c||!s)return;const u=d(c),a=d(s);let m,k=0;if(u||(m=f(),n.insertNode([],o,i(m)),k=1),u){const o=t.getBlock(e.from.blockId);if(o){const t=l(o);e.from.offset<t&&n.deleteTextAt(e.from.blockId,e.from.offset,t)}}a&&e.to.offset>0&&n.deleteTextAt(e.to.blockId,0,e.to.offset);const b=u?o+1:o+k;for(let i=a?r-1+k:r+k;i>=b;i--)n.removeNode([],i);return u&&a&&n.mergeBlocksAt(e.from.blockId,e.to.blockId),m}(t,n,o,s,u);!function(t,n,e,o,r,c){const s=t.getBlock(o.from.blockId);if(!s)return;const i=l(s);o.from.offset<i&&n.deleteTextAt(o.from.blockId,o.from.offset,i),o.to.offset>0&&n.deleteTextAt(o.to.blockId,0,o.to.offset);for(let u=r+1;u<c;u++){const r=e[u];if(!r)continue;const c=t.getBlock(r);if(!c)continue;const s=l(c);s>0&&n.deleteTextAt(r,0,s),n.mergeBlocksAt(o.from.blockId,r)}n.mergeBlocksAt(o.from.blockId,o.to.blockId)}(t,n,e,o,r,c)}export{J as C,H as S,Y as _,bt as a,L as b,ct as c,ft as d,it as f,$ as g,Z as h,at as i,st as l,nt as m,dt as n,It as o,lt as p,kt as r,mt as s,St as t,ut as u,tt as v,G as w,F as x,K as y};
+//# sourceMappingURL=Commands-BIIpx_Zd.mjs.map

package/dist/chunks/Commands-BIIpx_Zd.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Commands-BIIpx_Zd.mjs","names":[],"sources":["../../src/model/Schema.ts","../../src/commands/GapCursorCommands.ts","../../src/commands/SelectionDeletion.ts","../../src/commands/MarkCommands.ts","../../src/commands/DeleteCommands.ts","../../src/commands/Commands.ts"],"sourcesContent":["/**\n * Schema definition for the Notectl editor.\n * Defines which node types and marks are allowed.\n */\n\nimport type { InlineNodeSpec } from './InlineNodeSpec.js';\nimport type { MarkSpec } from './MarkSpec.js';\nimport type { NodeSpec } from './NodeSpec.js';\nimport type { SchemaRegistry } from './SchemaRegistry.js';\n\nexport interface Schema {\n\treadonly nodeTypes: readonly string[];\n\treadonly markTypes: readonly string[];\n\t/** Looks up the full NodeSpec for a given type. Available when created via schemaFromRegistry. */\n\treadonly getNodeSpec?: (type: string) => NodeSpec | undefined;\n\t/** Looks up the full InlineNodeSpec for a given type. Available via schemaFromRegistry. */\n\treadonly getInlineNodeSpec?: (type: string) => InlineNodeSpec | undefined;\n\t/** Looks up the full MarkSpec for a given type. Available via schemaFromRegistry. */\n\treadonly getMarkSpec?: (type: string) => MarkSpec | undefined;\n}\n\n/** Creates the default schema with paragraph nodes and bold/italic/underline marks. */\nexport function defaultSchema(): Schema {\n\treturn {\n\t\tnodeTypes: ['paragraph'],\n\t\tmarkTypes: ['bold', 'italic', 'underline'],\n\t\tgetNodeSpec: () => undefined,\n\t};\n}\n\n/** Derives a Schema from a SchemaRegistry's registered specs. */\nexport function schemaFromRegistry(registry: SchemaRegistry): Schema {\n\treturn {\n\t\tnodeTypes: registry.getNodeTypes(),\n\t\tmarkTypes: registry.getMarkTypes(),\n\t\tgetNodeSpec: (type: string) => registry.getNodeSpec(type),\n\t\tgetInlineNodeSpec: (type: string) => registry.getInlineNodeSpec(type),\n\t\tgetMarkSpec: (type: string) => registry.getMarkSpec(type),\n\t};\n}\n\n/** Checks whether the given mark type is allowed by the schema. */\nexport function isMarkAllowed(schema: Schema, markType: string): boolean {\n\treturn schema.markTypes.includes(markType);\n}\n\n/** Checks whether the given node type is allowed by the schema. */\nexport function isNodeTypeAllowed(schema: Schema, nodeType: string): boolean {\n\treturn schema.nodeTypes.includes(nodeType);\n}\n","/**\n * Commands for GapCursor: deleting void blocks adjacent to gap cursors\n * and inserting paragraphs at gap positions.\n */\n\nimport { createEmptyParagraph, generateBlockId, getBlockLength } from '../model/Document.js';\nimport { findNodePath } from '../model/NodeResolver.js';\nimport type { GapCursorSelection, NodeSelection } from '../model/Selection.js';\nimport { createCollapsedSelection, createNodeSelection } from '../model/Selection.js';\nimport type { BlockId } from '../model/TypeBrands.js';\nimport type { EditorState } from '../state/EditorState.js';\nimport { isVoidBlock } from '../state/NavigationQueries.js';\nimport type { Transaction } from '../state/Transaction.js';\nimport { resolveSiblingContext } from './CommandHelpers.js';\nimport { deleteNodeSelection } from './NodeSelectionCommands.js';\n\n/**\n * Deletes the void block adjacent to a GapCursor when pressing Backspace.\n *\n * - `side === 'after'` → void block is behind the cursor → delete it.\n * - `side === 'before'` → void block is ahead → navigate backward (to previous block).\n * - At document start with `side === 'before'` → `null` (no-op).\n */\nexport function deleteBackwardAtGap(\n\tstate: EditorState,\n\tsel: GapCursorSelection,\n): Transaction | null {\n\tif (sel.side === 'after') {\n\t\treturn deleteVoidAtGap(state, sel);\n\t}\n\n\t// side === 'before': navigate to previous block\n\tconst blockOrder: readonly BlockId[] = state.getBlockOrder();\n\tconst blockIdx: number = blockOrder.indexOf(sel.blockId);\n\n\tif (blockIdx <= 0) return null;\n\n\tconst prevId: BlockId | undefined = blockOrder[blockIdx - 1];\n\tif (!prevId) return null;\n\n\tif (isVoidBlock(state, prevId)) {\n\t\tconst path = findNodePath(state.doc, prevId) ?? [];\n\t\treturn state\n\t\t\t.transaction('input')\n\t\t\t.setSelection(createNodeSelection(prevId, path as BlockId[]))\n\t\t\t.build();\n\t}\n\n\tconst prevBlock = state.getBlock(prevId);\n\tif (!prevBlock) return null;\n\tconst prevLen: number = getBlockLength(prevBlock);\n\treturn state.transaction('input').setSelection(createCollapsedSelection(prevId, prevLen)).build();\n}\n\n/**\n * Deletes the void block adjacent to a GapCursor when pressing Delete.\n *\n * - `side === 'before'` → void block is ahead of the cursor → delete it.\n * - `side === 'after'` → void block is behind → navigate forward (to next block).\n * - At document end with `side === 'after'` → `null` (no-op).\n */\nexport function deleteForwardAtGap(\n\tstate: EditorState,\n\tsel: GapCursorSelection,\n): Transaction | null {\n\tif (sel.side === 'before') {\n\t\treturn deleteVoidAtGap(state, sel);\n\t}\n\n\t// side === 'after': navigate to next block\n\tconst blockOrder: readonly BlockId[] = state.getBlockOrder();\n\tconst blockIdx: number = blockOrder.indexOf(sel.blockId);\n\n\tif (blockIdx >= blockOrder.length - 1) return null;\n\n\tconst nextId: BlockId | undefined = blockOrder[blockIdx + 1];\n\tif (!nextId) return null;\n\n\tif (isVoidBlock(state, nextId)) {\n\t\tconst path = findNodePath(state.doc, nextId) ?? [];\n\t\treturn state\n\t\t\t.transaction('input')\n\t\t\t.setSelection(createNodeSelection(nextId, path as BlockId[]))\n\t\t\t.build();\n\t}\n\n\treturn state.transaction('input').setSelection(createCollapsedSelection(nextId, 0)).build();\n}\n\n/** Deletes the void block that the GapCursor is adjacent to, delegating to deleteNodeSelection. */\nfunction deleteVoidAtGap(state: EditorState, sel: GapCursorSelection): Transaction | null {\n\tconst path = (findNodePath(state.doc, sel.blockId) ?? []) as BlockId[];\n\tconst nodeSel: NodeSelection = createNodeSelection(sel.blockId, path);\n\treturn deleteNodeSelection(state, nodeSel);\n}\n\n/** Inserts a new paragraph at a GapCursor position (before or after the void block). */\nexport function insertParagraphAtGap(\n\tstate: EditorState,\n\tsel: GapCursorSelection,\n): Transaction | null {\n\tconst { parentPath, index } = resolveSiblingContext(state, sel.blockId);\n\tif (index < 0) return null;\n\n\tconst insertIdx: number = sel.side === 'before' ? index : index + 1;\n\tconst newId = generateBlockId();\n\tconst builder = state.transaction('input');\n\tbuilder.insertNode(parentPath, insertIdx, createEmptyParagraph(newId));\n\tbuilder.setSelection(createCollapsedSelection(newId, 0));\n\treturn builder.build();\n}\n\n/** Inserts text in a new paragraph at a GapCursor position. */\nexport function insertTextAtGap(\n\tstate: EditorState,\n\tsel: GapCursorSelection,\n\ttext: string,\n\torigin: 'input' | 'paste',\n): Transaction {\n\tconst { parentPath, siblings, index } = resolveSiblingContext(state, sel.blockId);\n\tconst insertIdx: number =\n\t\tsel.side === 'before' ? Math.max(index, 0) : index >= 0 ? index + 1 : siblings.length;\n\n\tconst newId = generateBlockId();\n\tconst builder = state.transaction(origin);\n\tbuilder.insertNode(parentPath, insertIdx, createEmptyParagraph(newId));\n\tbuilder.insertText(newId, 0, text, []);\n\tbuilder.setSelection(createCollapsedSelection(newId, text.length));\n\treturn builder.build();\n}\n","/**\n * Range-deletion helpers for multi-block text selections, split out of\n * Commands.ts. Handles two cases: a selection whose blocks share one root\n * ancestor (leaf range) and a selection spanning different root ancestors\n * (cross-root range).\n */\n\nimport {\n\tcreateEmptyParagraph,\n\tgenerateBlockId,\n\tgetBlockLength,\n\tisLeafBlock,\n} from '../model/Document.js';\nimport { findNodePath } from '../model/NodeResolver.js';\nimport type { BlockId } from '../model/TypeBrands.js';\nimport type { EditorState } from '../state/EditorState.js';\nimport type { TransactionBuilder } from '../state/Transaction.js';\n\n/** A normalized text-selection range (document-order from/to positions). */\nexport interface DeletionRange {\n\treadonly from: { readonly blockId: BlockId; readonly offset: number };\n\treadonly to: { readonly blockId: BlockId; readonly offset: number };\n}\n\n/** Returns the root-level ancestor index in `doc.children` for a given block. */\nexport function getRootBlockIndex(state: EditorState, blockId: BlockId): number {\n\tconst path = findNodePath(state.doc, blockId);\n\tif (!path || path.length === 0) return -1;\n\tconst rootId: string = path[0] as string;\n\treturn state.doc.children.findIndex((c) => c.id === rootId);\n}\n\n/** Deletes a multi-block selection where all blocks share the same root ancestor. */\nexport function deleteLeafRange(\n\tstate: EditorState,\n\tbuilder: TransactionBuilder,\n\tblockOrder: readonly BlockId[],\n\trange: DeletionRange,\n\tfromIdx: number,\n\ttoIdx: number,\n): void {\n\tconst firstBlock = state.getBlock(range.from.blockId);\n\tif (!firstBlock) return;\n\tconst firstLen = getBlockLength(firstBlock);\n\n\tif (range.from.offset < firstLen) {\n\t\tbuilder.deleteTextAt(range.from.blockId, range.from.offset, firstLen);\n\t}\n\n\tif (range.to.offset > 0) {\n\t\tbuilder.deleteTextAt(range.to.blockId, 0, range.to.offset);\n\t}\n\n\tfor (let i = fromIdx + 1; i < toIdx; i++) {\n\t\tconst midBlockId = blockOrder[i];\n\t\tif (!midBlockId) continue;\n\t\tconst midBlock = state.getBlock(midBlockId);\n\t\tif (!midBlock) continue;\n\t\tconst midLen = getBlockLength(midBlock);\n\t\tif (midLen > 0) {\n\t\t\tbuilder.deleteTextAt(midBlockId, 0, midLen);\n\t\t}\n\t\tbuilder.mergeBlocksAt(range.from.blockId, midBlockId);\n\t}\n\n\tbuilder.mergeBlocksAt(range.from.blockId, range.to.blockId);\n}\n\n/**\n * Deletes a selection spanning different root-level ancestors.\n * Removes intermediate and composite root blocks, merges leaf roots.\n * Returns a replacement cursor block ID if from was inside a removed composite.\n */\nexport function deleteCrossRootRange(\n\tstate: EditorState,\n\tbuilder: TransactionBuilder,\n\trange: DeletionRange,\n\tfromRootIdx: number,\n\ttoRootIdx: number,\n): BlockId | undefined {\n\tconst fromRoot = state.doc.children[fromRootIdx];\n\tconst toRoot = state.doc.children[toRootIdx];\n\tif (!fromRoot || !toRoot) return undefined;\n\n\tconst fromIsLeaf: boolean = isLeafBlock(fromRoot);\n\tconst toIsLeaf: boolean = isLeafBlock(toRoot);\n\n\t// When from is inside a composite root, insert a landing paragraph\n\t// so callers can reference a surviving block for cursor/insert.\n\tlet landingId: BlockId | undefined;\n\tlet indexShift = 0;\n\n\tif (!fromIsLeaf) {\n\t\tlandingId = generateBlockId();\n\t\tbuilder.insertNode([], fromRootIdx, createEmptyParagraph(landingId));\n\t\tindexShift = 1;\n\t}\n\n\t// Delete text in from-leaf (only for leaf roots; composite roots are removed entirely)\n\tif (fromIsLeaf) {\n\t\tconst fromBlock = state.getBlock(range.from.blockId);\n\t\tif (fromBlock) {\n\t\t\tconst fromLen: number = getBlockLength(fromBlock);\n\t\t\tif (range.from.offset < fromLen) {\n\t\t\t\tbuilder.deleteTextAt(range.from.blockId, range.from.offset, fromLen);\n\t\t\t}\n\t\t}\n\t}\n\n\t// Delete text in to-leaf (only for leaf roots)\n\tif (toIsLeaf && range.to.offset > 0) {\n\t\tbuilder.deleteTextAt(range.to.blockId, 0, range.to.offset);\n\t}\n\n\t// Remove root-level blocks in descending index order.\n\t// Keep from-root if it's a leaf; remove if composite (shifted by indexShift).\n\t// Keep to-root if it's a leaf (will merge into from); remove if composite.\n\tconst removeEnd: number = toIsLeaf ? toRootIdx - 1 + indexShift : toRootIdx + indexShift;\n\tconst removeStart: number = fromIsLeaf ? fromRootIdx + 1 : fromRootIdx + indexShift;\n\n\tfor (let i = removeEnd; i >= removeStart; i--) {\n\t\tbuilder.removeNode([], i);\n\t}\n\n\t// Merge to-root into from if both are leaf roots\n\tif (fromIsLeaf && toIsLeaf) {\n\t\tbuilder.mergeBlocksAt(range.from.blockId, range.to.blockId);\n\t}\n\n\treturn landingId;\n}\n","/**\n * Mark-related commands: toggling bold/italic/underline and checking\n * whether a mark is active.\n */\n\nimport {\n\ttype BlockNode,\n\ttype Mark,\n\tgetBlockLength,\n\tgetInlineChildren,\n\thasMark,\n\tisTextNode,\n} from '../model/Document.js';\nimport { isMarkAllowed } from '../model/Schema.js';\nimport { isCollapsed, isTextSelection, selectionRange } from '../model/Selection.js';\nimport type { MarkTypeName } from '../model/TypeBrands.js';\nimport { markType as mkType } from '../model/TypeBrands.js';\nimport type { EditorState } from '../state/EditorState.js';\nimport type { Transaction } from '../state/Transaction.js';\nimport { resolveCursorMarks } from './CursorMarks.js';\nimport { forEachBlockInRange } from './RangeIterator.js';\n\n// --- Feature Configuration ---\n\nexport interface FeatureConfig {\n\treadonly bold: boolean;\n\treadonly italic: boolean;\n\treadonly underline: boolean;\n}\n\nconst defaultFeatures: FeatureConfig = { bold: true, italic: true, underline: true };\n\n/**\n * Toggles a mark on the current selection.\n * If collapsed, toggles stored marks. If range, applies/removes from text.\n */\nexport function toggleMark(\n\tstate: EditorState,\n\tmarkType: MarkTypeName,\n\tfeatures: FeatureConfig = defaultFeatures,\n): Transaction | null {\n\tif (isFeatureGated(markType, features)) return null;\n\tif (!isMarkAllowed(state.schema, markType)) return null;\n\tif (!isTextSelection(state.selection)) return null;\n\n\tconst mark: Mark = { type: markType };\n\tconst sel = state.selection;\n\n\tif (isCollapsed(sel)) {\n\t\t// Toggle stored marks\n\t\tconst anchorBlock = state.getBlock(sel.anchor.blockId);\n\t\tif (!anchorBlock) return null;\n\t\tconst currentMarks = resolveCursorMarks(state);\n\t\tconst hasIt = hasMark(currentMarks, markType);\n\t\tconst newMarks = hasIt\n\t\t\t? currentMarks.filter((m) => m.type !== markType)\n\t\t\t: [...currentMarks, mark];\n\n\t\treturn state\n\t\t\t.transaction('command')\n\t\t\t.setStoredMarks(newMarks, state.storedMarks)\n\t\t\t.setSelection(sel)\n\t\t\t.build();\n\t}\n\n\t// Range selection — apply/remove mark to all blocks in range\n\tconst range = selectionRange(sel, state.getBlockOrder());\n\tconst builder = state.transaction('command');\n\n\t// Determine if we should add or remove\n\tconst shouldRemove = isMarkActiveInRange(state, markType);\n\n\tforEachBlockInRange(state, range, (blockId, from, to) => {\n\t\tif (shouldRemove) {\n\t\t\tbuilder.removeMark(blockId, from, to, mark);\n\t\t} else {\n\t\t\tbuilder.addMark(blockId, from, to, mark);\n\t\t}\n\t});\n\n\tbuilder.setSelection(sel);\n\treturn builder.build();\n}\n\nexport function toggleBold(state: EditorState, features?: FeatureConfig): Transaction | null {\n\treturn toggleMark(state, mkType('bold'), features);\n}\n\nexport function toggleItalic(state: EditorState, features?: FeatureConfig): Transaction | null {\n\treturn toggleMark(state, mkType('italic'), features);\n}\n\nexport function toggleUnderline(state: EditorState, features?: FeatureConfig): Transaction | null {\n\treturn toggleMark(state, mkType('underline'), features);\n}\n\n/** Checks if a mark is active at the current selection. */\nexport function isMarkActive(state: EditorState, markType: MarkTypeName): boolean {\n\tconst sel = state.selection;\n\tif (!isTextSelection(sel)) return false;\n\n\tif (isCollapsed(sel)) {\n\t\treturn hasMark(resolveCursorMarks(state), markType);\n\t}\n\n\treturn isMarkActiveInRange(state, markType);\n}\n\n/** Per-slice result of scanning a block for a mark. */\ntype SliceMarkStatus = 'present' | 'missing' | 'empty';\n\n/** Checks if a mark is active across the entire selection range. */\nfunction isMarkActiveInRange(state: EditorState, markType: MarkTypeName): boolean {\n\tconst sel = state.selection;\n\tif (!isTextSelection(sel)) return false;\n\tconst blockOrder = state.getBlockOrder();\n\tconst range = selectionRange(sel, blockOrder);\n\n\tconst fromIdx = blockOrder.indexOf(range.from.blockId);\n\tconst toIdx = blockOrder.indexOf(range.to.blockId);\n\n\tlet sawMarkedText = false;\n\tfor (let i = fromIdx; i <= toIdx; i++) {\n\t\tconst blockId = blockOrder[i];\n\t\tif (!blockId) continue;\n\t\tconst block = state.getBlock(blockId);\n\t\tif (!block) continue;\n\t\tconst blockLen = getBlockLength(block);\n\t\tconst from = i === fromIdx ? range.from.offset : 0;\n\t\tconst to = i === toIdx ? range.to.offset : blockLen;\n\n\t\tconst status = markStatusInBlock(block, from, to, markType);\n\t\tif (status === 'missing') return false;\n\t\tif (status === 'present') sawMarkedText = true;\n\t}\n\n\t// Active only when the range actually contains text that carries the mark.\n\t// A range with no markable text (only empty blocks, or a void block such as a\n\t// lone display formula on Ctrl+A) is NOT active — returning true there would\n\t// light up every toolbar format button.\n\treturn sawMarkedText;\n}\n\n/**\n * Scans a block's `[from, to)` slice for `markType`. Returns:\n * - `missing` when some text character in the slice lacks the mark,\n * - `present` when the slice has text and all of it carries the mark,\n * - `empty` when the slice has no markable text (empty slice or only InlineNodes).\n *\n * An `empty` slice is neutral: it neither activates nor inverts the range check,\n * so an empty paragraph in the middle of a multi-block selection does not flip\n * the result (regression #130).\n */\nfunction markStatusInBlock(\n\tblock: BlockNode,\n\tfrom: number,\n\tto: number,\n\tmarkType: MarkTypeName,\n): SliceMarkStatus {\n\tlet pos = 0;\n\tlet sawText = false;\n\tfor (const child of getInlineChildren(block)) {\n\t\tif (isTextNode(child)) {\n\t\t\tconst childEnd = pos + child.text.length;\n\t\t\tif (childEnd > from && pos < to) {\n\t\t\t\tsawText = true;\n\t\t\t\tif (!hasMark(child.marks, markType)) return 'missing';\n\t\t\t}\n\t\t\tpos = childEnd;\n\t\t} else {\n\t\t\t// InlineNode: atomic, width 1, carries no marks.\n\t\t\tpos += 1;\n\t\t}\n\t}\n\treturn sawText ? 'present' : 'empty';\n}\n\nfunction isFeatureGated(type: MarkTypeName, features: FeatureConfig): boolean {\n\tconst key = type as string;\n\tif (key === 'bold') return !features.bold;\n\tif (key === 'italic') return !features.italic;\n\tif (key === 'underline') return !features.underline;\n\treturn false;\n}\n","/**\n * Delete commands: character, word, and soft-line deletion in both directions.\n */\n\nimport {\n\ttype BlockNode,\n\tblockOffsetToTextOffset,\n\tgetBlockLength,\n\tgetBlockText,\n\tgetContentAtOffset,\n} from '../model/Document.js';\nimport { nextGraphemeSize, prevGraphemeSize } from '../model/GraphemeUtils.js';\nimport {\n\tcreateCollapsedSelection,\n\tisCollapsed,\n\tisGapCursor,\n\tisNodeSelection,\n} from '../model/Selection.js';\nimport type { EditorState } from '../state/EditorState.js';\nimport type { Transaction } from '../state/Transaction.js';\nimport { deleteSelectionCommand, mergeBlockBackward, mergeBlockForward } from './Commands.js';\nimport { deleteNodeSelection } from './NodeSelectionCommands.js';\nimport { findWordBoundaryBackward, findWordBoundaryForward } from './WordBoundary.js';\n\ninterface DeleteConfig {\n\treadonly merge: (state: EditorState) => Transaction | null;\n\treadonly range: (block: BlockNode, offset: number) => readonly [number, number] | null;\n}\n\nfunction deleteInDirection(state: EditorState, config: DeleteConfig): Transaction | null {\n\tconst sel = state.selection;\n\n\tif (isNodeSelection(sel)) return deleteNodeSelection(state, sel);\n\tif (isGapCursor(sel)) return null;\n\tif (!isCollapsed(sel)) return deleteSelectionCommand(state);\n\n\tconst block = state.getBlock(sel.anchor.blockId);\n\tif (!block) return null;\n\n\tconst range = config.range(block, sel.anchor.offset);\n\tif (!range) return config.merge(state);\n\n\tconst [from, to] = range;\n\treturn state\n\t\t.transaction('input')\n\t\t.deleteTextAt(block.id, from, to)\n\t\t.setSelection(createCollapsedSelection(block.id, from))\n\t\t.build();\n}\n\n/** Handles backspace key. */\nexport function deleteBackward(state: EditorState): Transaction | null {\n\treturn deleteInDirection(state, {\n\t\tmerge: mergeBlockBackward,\n\t\trange: (block, offset) => {\n\t\t\tif (offset <= 0) return null;\n\t\t\tconst content = getContentAtOffset(block, offset - 1);\n\t\t\tif (content?.kind === 'inline') return [offset - 1, offset];\n\t\t\tconst text: string = getBlockText(block);\n\t\t\tconst textOffset: number = blockOffsetToTextOffset(block, offset);\n\t\t\tconst step: number = prevGraphemeSize(text, textOffset) || 1;\n\t\t\treturn [offset - step, offset];\n\t\t},\n\t});\n}\n\n/** Handles delete key. */\nexport function deleteForward(state: EditorState): Transaction | null {\n\treturn deleteInDirection(state, {\n\t\tmerge: mergeBlockForward,\n\t\trange: (block, offset) => {\n\t\t\tconst len: number = getBlockLength(block);\n\t\t\tif (offset >= len) return null;\n\t\t\tconst content = getContentAtOffset(block, offset);\n\t\t\tif (content?.kind === 'inline') return [offset, offset + 1];\n\t\t\tconst text: string = getBlockText(block);\n\t\t\tconst textOffset: number = blockOffsetToTextOffset(block, offset);\n\t\t\tconst step: number = nextGraphemeSize(text, textOffset) || 1;\n\t\t\treturn [offset, offset + step];\n\t\t},\n\t});\n}\n\n/** Handles Ctrl+Backspace: delete word backward. */\nexport function deleteWordBackward(state: EditorState): Transaction | null {\n\treturn deleteInDirection(state, {\n\t\tmerge: mergeBlockBackward,\n\t\trange: (block, offset) =>\n\t\t\toffset > 0 ? [findWordBoundaryBackward(block, offset), offset] : null,\n\t});\n}\n\n/** Handles Ctrl+Delete: delete word forward. */\nexport function deleteWordForward(state: EditorState): Transaction | null {\n\treturn deleteInDirection(state, {\n\t\tmerge: mergeBlockForward,\n\t\trange: (block, offset) => {\n\t\t\tconst len = getBlockLength(block);\n\t\t\treturn offset < len ? [offset, findWordBoundaryForward(block, offset)] : null;\n\t\t},\n\t});\n}\n\n/** Handles Cmd+Backspace: delete to start of line/block. */\nexport function deleteSoftLineBackward(state: EditorState): Transaction | null {\n\treturn deleteInDirection(state, {\n\t\tmerge: mergeBlockBackward,\n\t\trange: (_block, offset) => (offset > 0 ? [0, offset] : null),\n\t});\n}\n\n/** Handles Cmd+Delete: delete to end of line/block. */\nexport function deleteSoftLineForward(state: EditorState): Transaction | null {\n\treturn deleteInDirection(state, {\n\t\tmerge: mergeBlockForward,\n\t\trange: (block, offset) => {\n\t\t\tconst len = getBlockLength(block);\n\t\t\treturn offset < len ? [offset, len] : null;\n\t\t},\n\t});\n}\n","/**\n * Core editor commands and barrel re-exports from submodules.\n *\n * This module contains text insertion, block splitting, block merging,\n * selection deletion, and select-all. Mark, delete, gap-cursor, node-selection,\n * and word-boundary commands are re-exported from their respective modules.\n */\n\nimport {\n\ttype Mark,\n\tcreateEmptyParagraph,\n\tcreateInlineNode,\n\tgenerateBlockId,\n\tgetBlockLength,\n\tgetBlockMarksAtOffset,\n\tgetCursorMarks,\n} from '../model/Document.js';\nimport { findNodePath } from '../model/NodeResolver.js';\nimport {\n\tcreateCollapsedSelection,\n\tcreateNodeSelection,\n\tcreateSelection,\n\tisCollapsed,\n\tisGapCursor,\n\tisNodeSelection,\n\tisTextSelection,\n\tselectionRange,\n} from '../model/Selection.js';\nimport { type BlockId, inlineType } from '../model/TypeBrands.js';\nimport type { EditorState } from '../state/EditorState.js';\nimport {\n\tisInsideIsolating,\n\tisIsolatingBlock,\n\tisVoidBlock,\n\tsharesParent,\n} from '../state/NavigationQueries.js';\nimport type { Transaction } from '../state/Transaction.js';\nimport type { TransactionBuilder } from '../state/Transaction.js';\nimport { resolveInsertPoint } from './CommandHelpers.js';\nimport { isMarkInclusive } from './CursorMarks.js';\nimport { insertParagraphAtGap, insertTextAtGap } from './GapCursorCommands.js';\nimport {\n\tdeleteNodeSelection,\n\tfindFirstLeafBlockId,\n\tfindLastLeafBlockId,\n\tinsertParagraphAfterNodeSelection,\n\tinsertTextAfterNodeSelection,\n} from './NodeSelectionCommands.js';\nimport { deleteCrossRootRange, deleteLeafRange, getRootBlockIndex } from './SelectionDeletion.js';\n\n// --- Re-exports from submodules ---\n\nexport {\n\tcanCrossBlockBoundary,\n\tisInsideIsolating,\n\tisIsolatingBlock,\n\tisVoidBlock,\n\tsharesParent,\n} from '../state/NavigationQueries.js';\n\nexport type { FeatureConfig } from './MarkCommands.js';\nexport {\n\tisMarkActive,\n\ttoggleBold,\n\ttoggleItalic,\n\ttoggleMark,\n\ttoggleUnderline,\n} from './MarkCommands.js';\n\nexport {\n\tdeleteBackward,\n\tdeleteForward,\n\tdeleteSoftLineBackward,\n\tdeleteSoftLineForward,\n\tdeleteWordBackward,\n\tdeleteWordForward,\n} from './DeleteCommands.js';\n\nexport {\n\tdeleteNodeSelection,\n\tfindFirstLeafBlockId,\n\tfindLastLeafBlockId,\n\tinsertParagraphAfterNodeSelection,\n\tinsertTextAfterNodeSelection,\n\tnavigateArrowIntoVoid,\n} from './NodeSelectionCommands.js';\n\nexport {\n\tdeleteBackwardAtGap,\n\tdeleteForwardAtGap,\n\tinsertParagraphAtGap,\n\tinsertTextAtGap,\n} from './GapCursorCommands.js';\n\nexport {\n\tfindWordBoundaryBackward,\n\tfindWordBoundaryForward,\n} from './WordBoundary.js';\n\nexport {\n\tapplyAttributedMark,\n\tgetMarkAttrAtSelection,\n\tisAttributedMarkActive,\n\tremoveAttributedMark,\n} from './AttributedMarkCommands.js';\n\nexport { forEachBlockIdInRange, forEachBlockInRange } from './RangeIterator.js';\n\n// --- Text Commands ---\n\n/** Inserts text at the current selection, replacing any selected range. */\nexport function insertTextCommand(\n\tstate: EditorState,\n\ttext: string,\n\torigin: 'input' | 'paste' = 'input',\n): Transaction {\n\tconst sel = state.selection;\n\n\t// NodeSelection: insert paragraph after void block with the text\n\tif (isNodeSelection(sel)) {\n\t\treturn insertTextAfterNodeSelection(state, sel, text, origin);\n\t}\n\n\t// GapCursor: insert paragraph at the gap position with the text\n\tif (isGapCursor(sel)) {\n\t\treturn insertTextAtGap(state, sel, text, origin);\n\t}\n\n\tconst builder = state.transaction(origin);\n\tconst marks = resolveActiveMarks(state);\n\n\tlet landingId: BlockId | undefined;\n\tif (!isCollapsed(sel)) {\n\t\tlandingId = addDeleteSelectionSteps(state, builder);\n\t}\n\n\tconst resolved = resolveInsertPoint(sel, state.getBlockOrder());\n\tconst insertBlockId: BlockId = landingId ?? resolved.blockId;\n\tconst insertOffset: number = landingId ? 0 : resolved.offset;\n\n\tbuilder.insertText(insertBlockId, insertOffset, text, marks);\n\tbuilder.setSelection(createCollapsedSelection(insertBlockId, insertOffset + text.length));\n\n\treturn builder.build();\n}\n\n/** Deletes the current selection. */\nexport function deleteSelectionCommand(state: EditorState): Transaction | null {\n\tif (isNodeSelection(state.selection)) {\n\t\treturn deleteNodeSelection(state, state.selection);\n\t}\n\tif (isGapCursor(state.selection)) return null;\n\tif (isCollapsed(state.selection)) return null;\n\n\t// Deleting a selection that spans the whole document resets it to the\n\t// canonical empty state (a single empty paragraph). Without this, the range\n\t// merge keeps the first block's type and attributes, leaving e.g. an empty\n\t// centered title behind so the placeholder never returns.\n\tif (selectionCoversDocument(state)) {\n\t\treturn clearDocument(state);\n\t}\n\n\tconst builder = state.transaction('input');\n\tconst landingId: BlockId | undefined = addDeleteSelectionSteps(state, builder);\n\n\tconst range = selectionRange(state.selection, state.getBlockOrder());\n\tconst cursorBlockId: BlockId = landingId ?? range.from.blockId;\n\tconst cursorOffset: number = landingId ? 0 : range.from.offset;\n\tbuilder.setSelection(createCollapsedSelection(cursorBlockId, cursorOffset));\n\n\treturn builder.build();\n}\n\n/** Splits the current block at the cursor position (Enter key). */\nexport function splitBlockCommand(state: EditorState): Transaction | null {\n\tconst sel = state.selection;\n\n\t// NodeSelection: insert empty paragraph after the void block\n\tif (isNodeSelection(sel)) {\n\t\treturn insertParagraphAfterNodeSelection(state, sel);\n\t}\n\n\t// GapCursor: insert empty paragraph at the gap position\n\tif (isGapCursor(sel)) {\n\t\treturn insertParagraphAtGap(state, sel);\n\t}\n\n\tconst builder = state.transaction('input');\n\n\tlet landingId: BlockId | undefined;\n\tif (!isCollapsed(sel)) {\n\t\tlandingId = addDeleteSelectionSteps(state, builder);\n\t}\n\n\tconst resolved = resolveInsertPoint(sel, state.getBlockOrder());\n\tconst blockId: BlockId = landingId ?? resolved.blockId;\n\tconst offset: number = landingId ? 0 : resolved.offset;\n\tconst newBlockId = generateBlockId();\n\n\t// splitBlock operates at the same level in the tree — the StepApplication\n\t// handles this correctly because it looks up the block by ID recursively.\n\tbuilder.splitBlock(blockId, offset, newBlockId);\n\tbuilder.setSelection(createCollapsedSelection(newBlockId, 0));\n\n\treturn builder.build();\n}\n\n/** Inserts a hard line break (InlineNode) at the current cursor position. */\nexport function insertHardBreakCommand(state: EditorState): Transaction | null {\n\tconst sel = state.selection;\n\n\tif (!isTextSelection(sel)) return null;\n\n\tconst builder = state.transaction('input');\n\n\tlet cursorBlockId: BlockId | undefined;\n\tif (!isCollapsed(sel)) {\n\t\tconst landingId: BlockId | undefined = addDeleteSelectionSteps(state, builder);\n\t\tcursorBlockId = landingId;\n\t}\n\n\tif (cursorBlockId) {\n\t\t// Cross-root deletion replaced from-block; insert hard break in landing block\n\t\tbuilder.insertInlineNode(cursorBlockId, 0, createInlineNode(inlineType('hard_break')));\n\t\tbuilder.setSelection(createCollapsedSelection(cursorBlockId, 1));\n\t} else {\n\t\tconst { blockId: insertBlockId, offset: insertOffset } = resolveInsertPoint(\n\t\t\tsel,\n\t\t\tstate.getBlockOrder(),\n\t\t);\n\t\tbuilder.insertInlineNode(\n\t\t\tinsertBlockId,\n\t\t\tinsertOffset,\n\t\t\tcreateInlineNode(inlineType('hard_break')),\n\t\t);\n\t\tbuilder.setSelection(createCollapsedSelection(insertBlockId, insertOffset + 1));\n\t}\n\n\treturn builder.build();\n}\n\n/**\n * Merges the current block with the previous block, respecting\n * isolating boundaries and void blocks.\n */\nexport function mergeBlockBackward(state: EditorState): Transaction | null {\n\treturn mergeAdjacentBlock(state, 'backward');\n}\n\n/**\n * Merges the next block into the current block, respecting\n * isolating boundaries and void blocks.\n */\nexport function mergeBlockForward(state: EditorState): Transaction | null {\n\treturn mergeAdjacentBlock(state, 'forward');\n}\n\n/**\n * Shared implementation for merging adjacent blocks in either direction.\n * Validates selection, isolating boundaries, and void blocks before merging.\n */\nfunction mergeAdjacentBlock(\n\tstate: EditorState,\n\tdirection: 'backward' | 'forward',\n): Transaction | null {\n\tconst sel = state.selection;\n\tif (!isTextSelection(sel)) return null;\n\n\tconst blockOrder = state.getBlockOrder();\n\tconst blockIdx: number = blockOrder.indexOf(sel.anchor.blockId);\n\n\tconst adjacentIdx: number = direction === 'backward' ? blockIdx - 1 : blockIdx + 1;\n\tif (adjacentIdx < 0 || adjacentIdx >= blockOrder.length) return null;\n\n\tconst adjacentId: BlockId | undefined = blockOrder[adjacentIdx];\n\tif (!adjacentId) return null;\n\n\tif (isIsolatingBlock(state, sel.anchor.blockId) || isIsolatingBlock(state, adjacentId)) {\n\t\treturn null;\n\t}\n\tif (!sharesParent(state, sel.anchor.blockId, adjacentId)) {\n\t\tif (isInsideIsolating(state, sel.anchor.blockId)) return null;\n\t}\n\n\tif (isVoidBlock(state, adjacentId)) {\n\t\tconst path = findNodePath(state.doc, adjacentId) ?? [];\n\t\treturn state\n\t\t\t.transaction('input')\n\t\t\t.setSelection(createNodeSelection(adjacentId, path as BlockId[]))\n\t\t\t.build();\n\t}\n\n\tif (direction === 'backward') {\n\t\tconst prevBlock = state.getBlock(adjacentId);\n\t\tif (!prevBlock) return null;\n\t\tconst prevLen: number = getBlockLength(prevBlock);\n\t\treturn state\n\t\t\t.transaction('input')\n\t\t\t.mergeBlocksAt(adjacentId, sel.anchor.blockId)\n\t\t\t.setSelection(createCollapsedSelection(adjacentId, prevLen))\n\t\t\t.build();\n\t}\n\n\treturn state\n\t\t.transaction('input')\n\t\t.mergeBlocksAt(sel.anchor.blockId, adjacentId)\n\t\t.setSelection(createCollapsedSelection(sel.anchor.blockId, sel.anchor.offset))\n\t\t.build();\n}\n\n/** Selects all content in the editor, using leaf block endpoints. */\nexport function selectAll(state: EditorState): Transaction {\n\tconst docRange = documentRange(state);\n\tif (!docRange) return state.transaction('command').setSelection(state.selection).build();\n\n\treturn state\n\t\t.transaction('command')\n\t\t.setSelection(createSelection(docRange.from, docRange.to))\n\t\t.build();\n}\n\n// --- Internal Helpers ---\n\ninterface DocumentPosition {\n\treadonly blockId: BlockId;\n\treadonly offset: number;\n}\n\n/**\n * Endpoints of a full-document selection: the start of the first leaf block to\n * the end of the last leaf block. Returns `null` for an empty document.\n */\nfunction documentRange(\n\tstate: EditorState,\n): { from: DocumentPosition; to: DocumentPosition } | null {\n\tconst blocks = state.doc.children;\n\tconst firstBlock = blocks[0];\n\tconst lastBlock = blocks[blocks.length - 1];\n\tif (!firstBlock || !lastBlock) return null;\n\n\tconst firstLeafId: BlockId = findFirstLeafBlockId(firstBlock);\n\tconst lastLeafId: BlockId = findLastLeafBlockId(lastBlock);\n\tconst lastLeaf = state.getBlock(lastLeafId);\n\tconst lastLeafLen: number = lastLeaf ? getBlockLength(lastLeaf) : 0;\n\n\treturn {\n\t\tfrom: { blockId: firstLeafId, offset: 0 },\n\t\tto: { blockId: lastLeafId, offset: lastLeafLen },\n\t};\n}\n\n/** True when the current text selection spans the entire document. */\nfunction selectionCoversDocument(state: EditorState): boolean {\n\tif (!isTextSelection(state.selection)) return false;\n\tconst docRange = documentRange(state);\n\tif (!docRange) return false;\n\n\tconst range = selectionRange(state.selection, state.getBlockOrder());\n\treturn (\n\t\trange.from.blockId === docRange.from.blockId &&\n\t\trange.from.offset === docRange.from.offset &&\n\t\trange.to.blockId === docRange.to.blockId &&\n\t\trange.to.offset === docRange.to.offset\n\t);\n}\n\n/**\n * Replaces the whole document with a single empty paragraph and places the\n * cursor inside it. The fresh paragraph is inserted before the originals are\n * removed so the document never passes through a zero-children state.\n */\nfunction clearDocument(state: EditorState): Transaction {\n\tconst newBlockId: BlockId = generateBlockId();\n\tconst builder = state.transaction('input');\n\tconst originalCount: number = state.doc.children.length;\n\n\tbuilder.insertNode([], 0, createEmptyParagraph(newBlockId));\n\t// The originals shifted to indices 1..originalCount; remove them descending\n\t// so each index stays valid as the document shrinks.\n\tfor (let i = originalCount; i >= 1; i--) {\n\t\tbuilder.removeNode([], i);\n\t}\n\tbuilder.setSelection(createCollapsedSelection(newBlockId, 0));\n\n\treturn builder.build();\n}\n\nfunction resolveActiveMarks(state: EditorState): readonly Mark[] {\n\tif (state.storedMarks) return state.storedMarks;\n\n\tconst sel = state.selection;\n\tif (!isTextSelection(sel)) return [];\n\n\tconst block = state.getBlock(sel.anchor.blockId);\n\tif (!block) return [];\n\n\t// A range replaced by typing inherits the marks at its anchor (raw content\n\t// marks); only a collapsed cursor honors right-boundary inclusivity.\n\tif (!isCollapsed(sel)) return getBlockMarksAtOffset(block, sel.anchor.offset);\n\n\treturn getCursorMarks(block, sel.anchor.offset, (type) => isMarkInclusive(state.schema, type));\n}\n\n/**\n * Adds steps to delete the current text selection.\n * Returns a replacement cursor block ID when the original from-block\n * was inside a composite root that got removed (undefined otherwise).\n */\nexport function addDeleteSelectionSteps(\n\tstate: EditorState,\n\tbuilder: TransactionBuilder,\n): BlockId | undefined {\n\tif (!isTextSelection(state.selection)) return undefined;\n\tconst blockOrder = state.getBlockOrder();\n\tconst range = selectionRange(state.selection, blockOrder);\n\tconst fromIdx = blockOrder.indexOf(range.from.blockId);\n\tconst toIdx = blockOrder.indexOf(range.to.blockId);\n\n\tif (fromIdx === toIdx) {\n\t\tbuilder.deleteTextAt(range.from.blockId, range.from.offset, range.to.offset);\n\t\treturn undefined;\n\t}\n\n\tconst fromRootIdx: number = getRootBlockIndex(state, range.from.blockId);\n\tconst toRootIdx: number = getRootBlockIndex(state, range.to.blockId);\n\n\tif (fromRootIdx === toRootIdx || fromRootIdx < 0 || toRootIdx < 0) {\n\t\tdeleteLeafRange(state, builder, blockOrder, range, fromIdx, toIdx);\n\t\treturn undefined;\n\t}\n\n\treturn deleteCrossRootRange(state, builder, range, fromRootIdx, toRootIdx);\n}\n"],"mappings":"ktBAsBA,SAAgB,IACf,MAAO,CACN,UAAW,CAAC,aACZ,UAAW,CAAC,OAAQ,SAAU,aAC9B,YAAA,OAEF,CAGA,SAAgB,EAAmB,GAClC,MAAO,CACN,UAAW,EAAS,eACpB,UAAW,EAAS,eACpB,YAAc,GAAiB,EAAS,YAAY,GACpD,kBAAoB,GAAiB,EAAS,kBAAkB,GAChE,YAAc,GAAiB,EAAS,YAAY,GAEtD,CAGA,SAAgB,EAAc,EAAgB,GAC7C,OAAO,EAAO,UAAU,SAAS,EAClC,CAGA,SAAgB,EAAkB,EAAgB,GACjD,OAAO,EAAO,UAAU,SAAS,EAClC,CC1BA,SAAgB,EACf,EACA,GAEA,GAAiB,UAAb,EAAI,KACP,OAAO,EAAgB,EAAO,GAI/B,MAAM,EAAiC,EAAM,gBACvC,EAAmB,EAAW,QAAQ,EAAI,SAEhD,GAAI,GAAY,EAAG,OAAO,KAE1B,MAAM,EAA8B,EAAW,EAAW,GAC1D,IAAK,EAAQ,OAAO,KAEpB,GAAI,EAAY,EAAO,GAAS,CAC/B,MAAM,EAAO,EAAa,EAAM,IAAK,IAAW,GAChD,OAAO,EACL,YAAY,SACZ,aAAa,EAAoB,EAAQ,IACzC,OACH,CAEA,MAAM,EAAY,EAAM,SAAS,GACjC,IAAK,EAAW,OAAO,KACvB,MAAM,EAAkB,EAAe,GACvC,OAAO,EAAM,YAAY,SAAS,aAAa,EAAyB,EAAQ,IAAU,OAC3F,CASA,SAAgB,EACf,EACA,GAEA,GAAiB,WAAb,EAAI,KACP,OAAO,EAAgB,EAAO,GAI/B,MAAM,EAAiC,EAAM,gBACvC,EAAmB,EAAW,QAAQ,EAAI,SAEhD,GAAI,GAAY,EAAW,OAAS,EAAG,OAAO,KAE9C,MAAM,EAA8B,EAAW,EAAW,GAC1D,IAAK,EAAQ,OAAO,KAEpB,GAAI,EAAY,EAAO,GAAS,CAC/B,MAAM,EAAO,EAAa,EAAM,IAAK,IAAW,GAChD,OAAO,EACL,YAAY,SACZ,aAAa,EAAoB,EAAQ,IACzC,OACH,CAEA,OAAO,EAAM,YAAY,SAAS,aAAa,EAAyB,EAAQ,IAAI,OACrF,CAGA,SAAS,EAAgB,EAAoB,GAC5C,MAAM,EAAQ,EAAa,EAAM,IAAK,EAAI,UAAY,GAEtD,OAAO,EAAoB,EADI,EAAoB,EAAI,QAAS,GAEjE,CCrEA,SAAgB,EAAkB,EAAoB,GACrD,MAAM,EAAO,EAAa,EAAM,IAAK,GACrC,IAAK,GAAwB,IAAhB,EAAK,OAAc,OAAO,EACvC,MAAM,EAAiB,EAAK,GAC5B,OAAO,EAAM,IAAI,SAAS,UAAW,GAAM,EAAE,KAAO,EACrD,CCAA,IAAM,EAAiC,CAAE,MAAM,EAAM,QAAQ,EAAM,WAAW,GAM9E,SAAgB,EACf,EACA,EACA,EAA0B,GAE1B,GAwID,SAAwB,EAAoB,GAC3C,MAAM,EAAM,EACZ,MAAY,SAAR,GAAwB,EAAS,KACzB,WAAR,GAA0B,EAAS,OAC3B,cAAR,IAA6B,EAAS,SAE3C,CA9IK,CAAe,EAAU,GAAW,OAAO,KAC/C,IAAK,EAAc,EAAM,OAAQ,GAAW,OAAO,KACnD,IAAK,EAAgB,EAAM,WAAY,OAAO,KAE9C,MAAM,EAAa,CAAE,KAAM,GACrB,EAAM,EAAM,UAElB,GAAI,EAAY,GAAM,CAGrB,IADoB,EAAM,SAAS,EAAI,OAAO,SAC5B,OAAO,KACzB,MAAM,EAAe,EAAmB,GAElC,EADQ,EAAQ,EAAc,GAEjC,EAAa,OAAQ,GAAM,EAAE,OAAS,GACtC,IAAI,EAAc,GAErB,OAAO,EACL,YAAY,WACZ,eAAe,EAAU,EAAM,aAC/B,aAAa,GACb,OACH,CAGA,MAAM,EAAQ,EAAe,EAAK,EAAM,iBAClC,EAAU,EAAM,YAAY,WAG5B,EAAe,GAAoB,EAAO,GAWhD,OATA,EAAoB,EAAO,EAAA,CAAQ,EAAS,EAAM,KAC7C,EACH,EAAQ,WAAW,EAAS,EAAM,EAAI,GAEtC,EAAQ,QAAQ,EAAS,EAAM,EAAI,KAIrC,EAAQ,aAAa,GACd,EAAQ,OAChB,CAEA,SAAgB,EAAW,EAAoB,GAC9C,OAAO,EAAW,EAAO,EAAO,QAAS,EAC1C,CAEA,SAAgB,EAAa,EAAoB,GAChD,OAAO,EAAW,EAAO,EAAO,UAAW,EAC5C,CAEA,SAAgB,GAAgB,EAAoB,GACnD,OAAO,EAAW,EAAO,EAAO,aAAc,EAC/C,CAGA,SAAgB,GAAa,EAAoB,GAChD,MAAM,EAAM,EAAM,UAClB,QAAK,EAAgB,KAEjB,EAAY,GACR,EAAQ,EAAmB,GAAQ,GAGpC,GAAoB,EAAO,GACnC,CAMA,SAAS,GAAoB,EAAoB,GAChD,MAAM,EAAM,EAAM,UAClB,IAAK,EAAgB,GAAM,OAAO,EAClC,MAAM,EAAa,EAAM,gBACnB,EAAQ,EAAe,EAAK,GAE5B,EAAU,EAAW,QAAQ,EAAM,KAAK,SACxC,EAAQ,EAAW,QAAQ,EAAM,GAAG,SAE1C,IAAI,GAAgB,EACpB,IAAK,IAAI,EAAI,EAAS,GAAK,EAAO,IAAK,CACtC,MAAM,EAAU,EAAW,GAC3B,IAAK,EAAS,SACd,MAAM,EAAQ,EAAM,SAAS,GAC7B,IAAK,EAAO,SACZ,MAAM,EAAW,EAAe,GAI1B,EAAS,GAAkB,EAHpB,IAAM,EAAU,EAAM,KAAK,OAAS,EACtC,IAAM,EAAQ,EAAM,GAAG,OAAS,EAEO,GAClD,GAAe,YAAX,EAAsB,OAAO,EAClB,YAAX,IAAsB,GAAgB,EAC3C,CAMA,OAAO,CACR,CAYA,SAAS,GACR,EACA,EACA,EACA,GAEA,IAAI,EAAM,EACN,GAAU,EACd,IAAK,MAAM,KAAS,EAAkB,GACrC,GAAI,EAAW,GAAQ,CACtB,MAAM,EAAW,EAAM,EAAM,KAAK,OAClC,GAAI,EAAW,GAAQ,EAAM,IAC5B,GAAU,GACL,EAAQ,EAAM,MAAO,IAAW,MAAO,UAE7C,EAAM,CACP,MAEC,GAAO,EAGT,OAAO,EAAU,UAAY,OAC9B,CClJA,SAAS,GAAkB,EAAoB,GAC9C,MAAM,EAAM,EAAM,UAElB,GAAI,EAAgB,GAAM,OAAO,EAAoB,EAAO,GAC5D,GAAI,EAAY,GAAM,OAAO,KAC7B,IAAK,EAAY,GAAM,OAAO,GAAuB,GAErD,MAAM,EAAQ,EAAM,SAAS,EAAI,OAAO,SACxC,IAAK,EAAO,OAAO,KAEnB,MAAM,EAAQ,EAAO,MAAM,EAAO,EAAI,OAAO,QAC7C,IAAK,EAAO,OAAO,EAAO,MAAM,GAEhC,MAAO,EAAM,GAAM,EACnB,OAAO,EACL,YAAY,SACZ,aAAa,EAAM,GAAI,EAAM,GAC7B,aAAa,EAAyB,EAAM,GAAI,IAChD,OACH,CAGA,SAAgB,GAAe,GAC9B,OAAO,GAAkB,EAAO,CAC/B,MAAO,GACP,MAAA,CAAQ,EAAO,IACV,GAAU,EAAU,KAEF,WADN,EAAmB,EAAO,EAAS,IACtC,KAA0B,CAAC,EAAS,EAAG,GAI7C,CAAC,GADa,EAFA,EAAa,GACP,EAAwB,EAAO,KACC,GACpC,IAG1B,CAGA,SAAgB,GAAc,GAC7B,OAAO,GAAkB,EAAO,CAC/B,MAAO,GACP,MAAA,CAAQ,EAAO,IAEV,GADgB,EAAe,GACT,KAEJ,WADN,EAAmB,EAAO,IAC7B,KAA0B,CAAC,EAAQ,EAAS,GAIlD,CAAC,EAAQ,GADK,EAFA,EAAa,GACP,EAAwB,EAAO,KACC,KAI9D,CAGA,SAAgB,GAAmB,GAClC,OAAO,GAAkB,EAAO,CAC/B,MAAO,GACP,MAAA,CAAQ,EAAO,IACd,EAAS,EAAI,CAAC,EAAyB,EAAO,GAAS,GAAU,MAEpE,CAGA,SAAgB,GAAkB,GACjC,OAAO,GAAkB,EAAO,CAC/B,MAAO,GACP,MAAA,CAAQ,EAAO,IAEP,EADK,EAAe,GACL,CAAC,EAAQ,EAAwB,EAAO,IAAW,MAG5E,CAGA,SAAgB,GAAuB,GACtC,OAAO,GAAkB,EAAO,CAC/B,MAAO,GACP,MAAA,CAAQ,EAAQ,IAAY,EAAS,EAAI,CAAC,EAAG,GAAU,MAEzD,CAGA,SAAgB,GAAsB,GACrC,OAAO,GAAkB,EAAO,CAC/B,MAAO,GACP,MAAA,CAAQ,EAAO,KACd,MAAM,EAAM,EAAe,GAC3B,OAAO,EAAS,EAAM,CAAC,EAAQ,GAAO,OAGzC,CCTA,SAAgB,GACf,EACA,EACA,EAA4B,SAE5B,MAAM,EAAM,EAAM,UAGlB,GAAI,EAAgB,GACnB,OAAO,EAA6B,EAAO,EAAK,EAAM,GAIvD,GAAI,EAAY,GACf,OJZF,SACC,EACA,EACA,EACA,GAEA,MAAM,WAAE,EAAA,SAAY,EAAA,MAAU,GAAU,EAAsB,EAAO,EAAI,SACnE,EACQ,WAAb,EAAI,KAAoB,KAAK,IAAI,EAAO,GAAK,GAAS,EAAI,EAAQ,EAAI,EAAS,OAE1E,EAAQ,IACR,EAAU,EAAM,YAAY,GAIlC,OAHA,EAAQ,WAAW,EAAY,EAAW,EAAqB,IAC/D,EAAQ,WAAW,EAAO,EAAG,EAAM,IACnC,EAAQ,aAAa,EAAyB,EAAO,EAAK,SACnD,EAAQ,OAChB,CIJS,CAAgB,EAAO,EAAK,EAAM,GAG1C,MAAM,EAAU,EAAM,YAAY,GAC5B,EAkQP,SAA4B,GAC3B,GAAI,EAAM,YAAa,OAAO,EAAM,YAEpC,MAAM,EAAM,EAAM,UAClB,IAAK,EAAgB,GAAM,MAAO,GAElC,MAAM,EAAQ,EAAM,SAAS,EAAI,OAAO,SACxC,OAAK,EAIA,EAAY,GAEV,EAAe,EAAO,EAAI,OAAO,OAAS,GAAS,EAAgB,EAAM,OAAQ,IAF1D,EAAsB,EAAO,EAAI,OAAO,QAJnD,EAOpB,CAhRe,CAAmB,GAEjC,IAAI,EACC,EAAY,KAChB,EAAY,GAAwB,EAAO,IAG5C,MAAM,EAAW,EAAmB,EAAK,EAAM,iBACzC,EAAyB,GAAa,EAAS,QAC/C,EAAuB,EAAY,EAAI,EAAS,OAKtD,OAHA,EAAQ,WAAW,EAAe,EAAc,EAAM,GACtD,EAAQ,aAAa,EAAyB,EAAe,EAAe,EAAK,SAE1E,EAAQ,OAChB,CAGA,SAAgB,GAAuB,GACtC,GAAI,EAAgB,EAAM,WACzB,OAAO,EAAoB,EAAO,EAAM,WAEzC,GAAI,EAAY,EAAM,WAAY,OAAO,KACzC,GAAI,EAAY,EAAM,WAAY,OAAO,KAMzC,GAkMD,SAAiC,GAChC,IAAK,EAAgB,EAAM,WAAY,OAAO,EAC9C,MAAM,EAAW,GAAc,GAC/B,IAAK,EAAU,OAAO,EAEtB,MAAM,EAAQ,EAAe,EAAM,UAAW,EAAM,iBACpD,OACC,EAAM,KAAK,UAAY,EAAS,KAAK,SACrC,EAAM,KAAK,SAAW,EAAS,KAAK,QACpC,EAAM,GAAG,UAAY,EAAS,GAAG,SACjC,EAAM,GAAG,SAAW,EAAS,GAAG,MAElC,CA9MK,CAAwB,GAC3B,OAoNF,SAAuB,GACtB,MAAM,EAAsB,IACtB,EAAU,EAAM,YAAY,SAC5B,EAAwB,EAAM,IAAI,SAAS,OAEjD,EAAQ,WAAW,GAAI,EAAG,EAAqB,IAG/C,IAAK,IAAI,EAAI,EAAe,GAAK,EAAG,IACnC,EAAQ,WAAW,GAAI,GAIxB,OAFA,EAAQ,aAAa,EAAyB,EAAY,IAEnD,EAAQ,OAChB,CAlOS,CAAc,GAGtB,MAAM,EAAU,EAAM,YAAY,SAC5B,EAAiC,GAAwB,EAAO,GAEhE,EAAQ,EAAe,EAAM,UAAW,EAAM,iBAC9C,EAAyB,GAAa,EAAM,KAAK,QACjD,EAAuB,EAAY,EAAI,EAAM,KAAK,OAGxD,OAFA,EAAQ,aAAa,EAAyB,EAAe,IAEtD,EAAQ,OAChB,CAGA,SAAgB,GAAkB,GACjC,MAAM,EAAM,EAAM,UAGlB,GAAI,EAAgB,GACnB,OAAO,EAAkC,EAAO,GAIjD,GAAI,EAAY,GACf,OJvFF,SACC,EACA,GAEA,MAAM,WAAE,EAAA,MAAY,GAAU,EAAsB,EAAO,EAAI,SAC/D,GAAI,EAAQ,EAAG,OAAO,KAEtB,MAAM,EAAiC,WAAb,EAAI,KAAoB,EAAQ,EAAQ,EAC5D,EAAQ,IACR,EAAU,EAAM,YAAY,SAGlC,OAFA,EAAQ,WAAW,EAAY,EAAW,EAAqB,IAC/D,EAAQ,aAAa,EAAyB,EAAO,IAC9C,EAAQ,OAChB,CI0ES,CAAqB,EAAO,GAGpC,MAAM,EAAU,EAAM,YAAY,SAElC,IAAI,EACC,EAAY,KAChB,EAAY,GAAwB,EAAO,IAG5C,MAAM,EAAW,EAAmB,EAAK,EAAM,iBACzC,EAAmB,GAAa,EAAS,QACzC,EAAiB,EAAY,EAAI,EAAS,OAC1C,EAAa,IAOnB,OAHA,EAAQ,WAAW,EAAS,EAAQ,GACpC,EAAQ,aAAa,EAAyB,EAAY,IAEnD,EAAQ,OAChB,CAGA,SAAgB,GAAuB,GACtC,MAAM,EAAM,EAAM,UAElB,IAAK,EAAgB,GAAM,OAAO,KAElC,MAAM,EAAU,EAAM,YAAY,SAElC,IAAI,EAMJ,GALK,EAAY,KAEhB,EADuC,GAAwB,EAAO,IAInE,EAEH,EAAQ,iBAAiB,EAAe,EAAG,EAAiB,EAAW,gBACvE,EAAQ,aAAa,EAAyB,EAAe,QACvD,CACN,MAAQ,QAAS,EAAe,OAAQ,GAAiB,EACxD,EACA,EAAM,iBAEP,EAAQ,iBACP,EACA,EACA,EAAiB,EAAW,gBAE7B,EAAQ,aAAa,EAAyB,EAAe,EAAe,GAC7E,CAEA,OAAO,EAAQ,OAChB,CAMA,SAAgB,GAAmB,GAClC,OAAO,GAAmB,EAAO,WAClC,CAMA,SAAgB,GAAkB,GACjC,OAAO,GAAmB,EAAO,UAClC,CAMA,SAAS,GACR,EACA,GAEA,MAAM,EAAM,EAAM,UAClB,IAAK,EAAgB,GAAM,OAAO,KAElC,MAAM,EAAa,EAAM,gBACnB,EAAmB,EAAW,QAAQ,EAAI,OAAO,SAEjD,EAAoC,aAAd,EAA2B,EAAW,EAAI,EAAW,EACjF,GAAI,EAAc,GAAK,GAAe,EAAW,OAAQ,OAAO,KAEhE,MAAM,EAAkC,EAAW,GACnD,IAAK,EAAY,OAAO,KAExB,GAAI,EAAiB,EAAO,EAAI,OAAO,UAAY,EAAiB,EAAO,GAC1E,OAAO,KAER,IAAK,EAAa,EAAO,EAAI,OAAO,QAAS,IACxC,EAAkB,EAAO,EAAI,OAAO,SAAU,OAAO,KAG1D,GAAI,EAAY,EAAO,GAAa,CACnC,MAAM,EAAO,EAAa,EAAM,IAAK,IAAe,GACpD,OAAO,EACL,YAAY,SACZ,aAAa,EAAoB,EAAY,IAC7C,OACH,CAEA,GAAkB,aAAd,EAA0B,CAC7B,MAAM,EAAY,EAAM,SAAS,GACjC,IAAK,EAAW,OAAO,KACvB,MAAM,EAAkB,EAAe,GACvC,OAAO,EACL,YAAY,SACZ,cAAc,EAAY,EAAI,OAAO,SACrC,aAAa,EAAyB,EAAY,IAClD,OACH,CAEA,OAAO,EACL,YAAY,SACZ,cAAc,EAAI,OAAO,QAAS,GAClC,aAAa,EAAyB,EAAI,OAAO,QAAS,EAAI,OAAO,SACrE,OACH,CAGA,SAAgB,GAAU,GACzB,MAAM,EAAW,GAAc,GAC/B,OAAK,EAEE,EACL,YAAY,WACZ,aAAa,EAAgB,EAAS,KAAM,EAAS,KACrD,QALoB,EAAM,YAAY,WAAW,aAAa,EAAM,WAAW,OAMlF,CAaA,SAAS,GACR,GAEA,MAAM,EAAS,EAAM,IAAI,SACnB,EAAa,EAAO,GACpB,EAAY,EAAO,EAAO,OAAS,GACzC,IAAK,IAAe,EAAW,OAAO,KAEtC,MAAM,EAAuB,EAAqB,GAC5C,EAAsB,EAAoB,GAC1C,EAAW,EAAM,SAAS,GAGhC,MAAO,CACN,KAAM,CAAE,QAAS,EAAa,OAAQ,GACtC,GAAI,CAAE,QAAS,EAAY,OAJA,EAAW,EAAe,GAAY,GAMnE,CA2DA,SAAgB,GACf,EACA,GAEA,IAAK,EAAgB,EAAM,WAAY,OACvC,MAAM,EAAa,EAAM,gBACnB,EAAQ,EAAe,EAAM,UAAW,GACxC,EAAU,EAAW,QAAQ,EAAM,KAAK,SACxC,EAAQ,EAAW,QAAQ,EAAM,GAAG,SAE1C,GAAI,IAAY,EAEf,YADA,EAAQ,aAAa,EAAM,KAAK,QAAS,EAAM,KAAK,OAAQ,EAAM,GAAG,QAItE,MAAM,EAAsB,EAAkB,EAAO,EAAM,KAAK,SAC1D,EAAoB,EAAkB,EAAO,EAAM,GAAG,SAE5D,KAAI,IAAgB,GAAa,EAAc,GAAK,EAAY,GAKhE,OHtWD,SACC,EACA,EACA,EACA,EACA,GAEA,MAAM,EAAW,EAAM,IAAI,SAAS,GAC9B,EAAS,EAAM,IAAI,SAAS,GAClC,IAAK,IAAa,EAAQ,OAE1B,MAAM,EAAsB,EAAY,GAClC,EAAoB,EAAY,GAItC,IAAI,EACA,EAAa,EASjB,GAPK,IACJ,EAAY,IACZ,EAAQ,WAAW,GAAI,EAAa,EAAqB,IACzD,EAAa,GAIV,EAAY,CACf,MAAM,EAAY,EAAM,SAAS,EAAM,KAAK,SAC5C,GAAI,EAAW,CACd,MAAM,EAAkB,EAAe,GACnC,EAAM,KAAK,OAAS,GACvB,EAAQ,aAAa,EAAM,KAAK,QAAS,EAAM,KAAK,OAAQ,EAE9D,CACD,CAGI,GAAY,EAAM,GAAG,OAAS,GACjC,EAAQ,aAAa,EAAM,GAAG,QAAS,EAAG,EAAM,GAAG,QAMpD,MACM,EAAsB,EAAa,EAAc,EAAI,EAAc,EAEzE,IAAK,IAAI,EAHiB,EAAW,EAAY,EAAI,EAAa,EAAY,EAGtD,GAAK,EAAa,IACzC,EAAQ,WAAW,GAAI,GAQxB,OAJI,GAAc,GACjB,EAAQ,cAAc,EAAM,KAAK,QAAS,EAAM,GAAG,SAG7C,CACR,CG6SQ,CAAqB,EAAO,EAAS,EAAO,EAAa,IH9YjE,SACC,EACA,EACA,EACA,EACA,EACA,GAEA,MAAM,EAAa,EAAM,SAAS,EAAM,KAAK,SAC7C,IAAK,EAAY,OACjB,MAAM,EAAW,EAAe,GAE5B,EAAM,KAAK,OAAS,GACvB,EAAQ,aAAa,EAAM,KAAK,QAAS,EAAM,KAAK,OAAQ,GAGzD,EAAM,GAAG,OAAS,GACrB,EAAQ,aAAa,EAAM,GAAG,QAAS,EAAG,EAAM,GAAG,QAGpD,IAAK,IAAI,EAAI,EAAU,EAAG,EAAI,EAAO,IAAK,CACzC,MAAM,EAAa,EAAW,GAC9B,IAAK,EAAY,SACjB,MAAM,EAAW,EAAM,SAAS,GAChC,IAAK,EAAU,SACf,MAAM,EAAS,EAAe,GAC1B,EAAS,GACZ,EAAQ,aAAa,EAAY,EAAG,GAErC,EAAQ,cAAc,EAAM,KAAK,QAAS,EAC3C,CAEA,EAAQ,cAAc,EAAM,KAAK,QAAS,EAAM,GAAG,QACpD,CGyWE,CAAgB,EAAO,EAAS,EAAY,EAAO,EAAS,EAK9D"}

package/dist/chunks/Decoration-ZeyVfwJB.mjs

@@ -0,0 +1,2 @@
+import{C as t,D as e,O as o,S as n,T as r,c as s,f as c,g as l,h as f,i,j as d,k as u,m as a,p,r as k,t as m,v as h}from"./Document-r7vLOAGA.mjs";import{i as I}from"./Selection-HYoVFpAx.mjs";import{a as b}from"./TypeBrands-Ch9856Gb.mjs";import{n as y,o as g,s as B}from"./NodeResolver-ChgLF_IP.mjs";var v={type:"identity"};function x(t){const e=/* @__PURE__ */new Set,o=t=>{e.add(t.id);for(const e of t.children)n(e)&&o(e)};return o(t),e}function w(t,e,o=-1){switch(e.type){case"identity":case"childIndexShift":return{pos:t,deleted:!1};case"shift":return function(t,e,o){if(t.blockId!==e.blockId)return{pos:t,deleted:!1};const n=e.newLen-(e.to-e.from),r=t.offset;if(r<e.from)return{pos:t,deleted:!1};if(r===e.from){if(e.from===e.to){const n=1===o?e.from+e.newLen:e.from;return n===r?{pos:t,deleted:!1}:{pos:M(t,n),deleted:!1}}return{pos:t,deleted:!1}}if(r<e.to)return{pos:M(t,1===o?e.from+e.newLen:e.from),deleted:!0};const s=r+n;return s===r?{pos:t,deleted:!1}:{pos:M(t,s),deleted:!1}}(t,e,o);case"split":return function(t,e,o){return t.blockId!==e.blockId||t.offset<e.offset?{pos:t,deleted:!1}:t.offset>e.offset?{pos:I(e.newBlockId,t.offset-e.offset),deleted:!1}:1===o?{pos:I(e.newBlockId,0),deleted:!1}:{pos:t,deleted:!1}}(t,e,o);case"merge":return function(t,e){return t.blockId!==e.sourceBlockId?{pos:t,deleted:!1}:{pos:I(e.targetBlockId,t.offset+e.targetLengthBefore),deleted:!1}}(t,e);case"blockRemoval":return function(t,e){return e.removedBlockIds.has(t.blockId)?{pos:t,deleted:!0}:{pos:t,deleted:!1}}(t,e)}}function M(t,e){return I(t.blockId,e,t.path)}var T=class t{static empty=new t([]);maps;constructor(t){this.maps=t}static from(e){const o=[];for(const t of e)"identity"!==t.type&&o.push(t);return 0===o.length?t.empty:new t(o)}appendMap(e){return"identity"===e.type?this:new t([...this.maps,e])}appendMapping(e){return 0===e.maps.length?this:0===this.maps.length?e:new t([...this.maps,...e.maps])}get isEmpty(){return 0===this.maps.length}map(t,e=-1){return this.mapResult(t,e).pos}mapResult(t,e=-1){let o=t,n=!1;for(const r of this.maps){const t=w(o,r,e);o=t.pos,t.deleted&&(n=!0)}return{pos:o,deleted:n}}mapRange(t,e=-1,o=1){const n=this.mapResult(t.from,e),r=this.mapResult(t.to,o);return n.deleted&&r.deleted&&n.pos.blockId===r.pos.blockId&&n.pos.offset>=r.pos.offset?null:{from:n.pos,to:r.pos}}};function N(t,e,o,n,r=1,s=-1){if(n.isEmpty)return{blockId:t,from:e,to:o};const c=I(t,e),l=I(t,o),f=n.mapResult(c,r),i=n.mapResult(l,s);return f.deleted&&i.deleted||f.pos.blockId!==i.pos.blockId||f.pos.offset>i.pos.offset?null:{blockId:f.pos.blockId,from:f.pos.offset,to:i.pos.offset}}function A(t,e,o,n=-1){if(o.isEmpty)return{blockId:t,from:e,to:e};const r=I(t,e),s=o.mapResult(r,n);return s.deleted?null:{blockId:s.pos.blockId,from:s.pos.offset,to:s.pos.offset}}function P(t,e,o){return R(t,e,o,"existing")}function L(t,e,o){return R(t,e,o,"insertion")}function R(t,e,o,n){if(o.isEmpty)return e;let r=e;for(const s of o.maps){const e=S(t,r,s,n);if(null===e)return null;r=e}return r}function S(t,e,o,n){switch(o.type){case"identity":case"shift":case"split":case"merge":return e;case"blockRemoval":return E(t,o.parentPath)?e===o.index?"existing"===n?null:e:e>o.index?e-1:e:e;case"childIndexShift":return E(t,o.parentPath)&&e>=o.fromIndex?e+o.delta:e}}function E(t,e){if(t===e)return!0;if(t.length!==e.length)return!1;for(let o=0;o<t.length;o++)if(t[o]!==e[o])return!1;return!0}function j(t){switch(t.type){case"identity":case"blockRemoval":case"childIndexShift":return v;case"shift":return{type:"shift",blockId:t.blockId,from:t.from,to:t.from+t.newLen,newLen:t.to-t.from};case"split":return{type:"merge",targetBlockId:t.blockId,sourceBlockId:t.newBlockId,targetLengthBefore:t.offset};case"merge":return{type:"split",blockId:t.targetBlockId,offset:t.targetLengthBefore,newBlockId:t.sourceBlockId}}}function O(t,e){if(t.type!==e.type)return!1;switch(t.type){case"identity":return!0;case"shift":{const o=e;return t.blockId===o.blockId&&t.from===o.from&&t.to===o.to&&t.newLen===o.newLen}case"split":{const o=e;return t.blockId===o.blockId&&t.offset===o.offset&&t.newBlockId===o.newBlockId}case"merge":{const o=e;return t.targetBlockId===o.targetBlockId&&t.sourceBlockId===o.sourceBlockId&&t.targetLengthBefore===o.targetLengthBefore}case"blockRemoval":{const o=e;if(t.index!==o.index)return!1;if(!E(t.parentPath,o.parentPath))return!1;if(t.removedBlockIds.size!==o.removedBlockIds.size)return!1;for(const e of t.removedBlockIds)if(!o.removedBlockIds.has(e))return!1;return!0}case"childIndexShift":{const o=e;return t.fromIndex===o.fromIndex&&t.delta===o.delta&&E(t.parentPath,o.parentPath)}}}function z(t,e,o){return{children:D(t.children,e,o)}}function D(t,e,o){let r=!1;const s=t.map(t=>{if(!n(t))return t;if(t.id===e)return r=!0,o(t);const s=D(t.children,e,o);return s===t.children?t:(r=!0,{...t,children:s})});return r?s:t}function C(t,e,o){if(0===e.length)return t;const r=e[0];return r?{children:t.children.map(t=>n(t)&&t.id===r?1===e.length?o(t):q(t,e,1,o):t)}:t}function q(t,e,o,r){const s=e[o];if(!s)return t;const c=t.children.map(t=>n(t)&&t.id===s?o===e.length-1?r(t):q(t,e,o+1,r):t);return{...t,children:c}}function W(t,e,o){if(e(t))return o(t);let r=!1;const s=t.map(t=>{if(!n(t))return t;const s=W(t.children,e,o);return s?(r=!0,{...t,children:s}):t});return r?s:null}function _(e,o,n){const r=[];let c=0,l=!1;for(const f of e){if(t(f)){l||o!==c||(r.push(...n()),l=!0),r.push(f),c+=1;continue}const e=c+f.text.length;if(!l&&o>=c&&o<=e){const t=o-c,e=f.text.slice(0,t),i=f.text.slice(t);e&&r.push(s(e,f.marks)),r.push(...n()),i&&r.push(s(i,f.marks)),l=!0}else r.push(f);c=e}return l||r.push(...n()),r}function F(e,o,n){const r=[];let c=0;for(const l of e){if(t(l)){const t=c+1;t>o&&c<n&&r.push(l),c=t;continue}const e=c+l.text.length;if(e<=o||c>=n);else{const t=Math.max(0,o-c),e=Math.min(l.text.length,n-c),f=l.text.slice(t,e);f.length>0&&r.push(s(f,l.marks))}c=e}return 0===r.length&&r.push(s("")),r}function G(e,o,n,r,c){const l=[];let f=0;for(const i of e){if(t(i)){l.push(i),f+=1;continue}const e=f+i.text.length;if(e<=o||f>=n)l.push(i);else if(f>=o&&e<=n){const t=c?m(i.marks,r):u(i.marks,r.type);l.push(s(i.text,t))}else{const t=Math.max(0,o-f),e=Math.min(i.text.length,n-f),d=i.text.slice(0,t),a=i.text.slice(t,e),p=i.text.slice(e);if(d&&l.push(s(d,i.marks)),a){const t=c?m(i.marks,r):u(i.marks,r.type);l.push(s(a,t))}p&&l.push(s(p,i.marks))}f=e}return l}function H(e,o,n,r){const s=[];if(o>=n)return s;let c=null,l=0;const f=()=>{c&&(s.push(c),c=null)};for(const i of e){const e=l+(t(i)?1:i.text.length);if(e<=o||l>=n){l=e;continue}const s=Math.max(l,o),d=Math.min(e,n);t(i)?c&&(c.to=d):i.marks.some(t=>t.type===r)?f():c?c.to=d:c={from:s,to:d},l=e}return f(),s}function J(o,n,r,s){const c=[];if(n>=r)return c;let l=null,f=0;const i=()=>{l&&(c.push(l),l=null)};for(const d of o){const o=f+(t(d)?1:d.text.length);if(o<=n||f>=r){f=o;continue}const c=Math.max(f,n),u=Math.min(o,r);if(t(d))l&&(l.to=u);else{const t=d.marks.find(t=>t.type===s);t?l&&e(l.mark,t)?l.to=u:(i(),l={from:c,to:u,mark:t}):i()}f=o}return i(),c}function K(e,o){if(e.every(e=>r(e)||t(e)))return o;const n=e.filter(e=>!r(e)&&!t(e));return[...o,...n]}function Q(t,e,n,r=!0){return z(t,e,t=>{const e=n(h(t));return{...t,children:K(t.children,r?o(e):e)}})}function U(t){return t.reduce((t,e)=>t+("inline"===e.kind?1:e.text.length),0)}function V(t){return{blocks:t.split(/\r?\n/).map(t=>({type:b("paragraph"),segments:[d(t)]}))}}function X(t){return t.segments?U(t.segments):t.text.length}function Y(t){return t.path?{path:t.path}:{}}function Z(t){for(const e of t.steps)if("setStoredMarks"===e.type)return e.previousMarks;return t.storedMarksAfter}function $(t,e,o){return o?t!==e?{}:{path:o}:{}}function tt(t,e){if(e.isEmpty)return!0;for(const o of t){const t=e.mapResult({blockId:o,offset:0},-1);if(t.deleted)return!1;if(t.pos.blockId!==o)return!1}return!0}function et(t,e){return e.blockId===t.blockId&&e.from===t.from&&e.to===t.to}function ot(t,e){if(t===e)return!0;if(!t||!e)return!1;const o=Object.keys(t),n=Object.keys(e);if(o.length!==n.length)return!1;for(const r of o)if(t[r]!==e[r])return!1;return!0}var nt={insertText:{apply:function(t,e){return Q(t,e.blockId,t=>{return e.segments?(o=t,n=e.offset,r=e.segments,_(o,n,()=>r.map(k))):function(t,e,o,n){return _(t,e,()=>[s(o,n)])}(t,e.offset,e.text,e.marks);var o,n,r})},invert:function(t){return{type:"deleteText",blockId:t.blockId,from:t.offset,to:t.offset+X(t),deletedText:t.text,deletedMarks:t.marks,deletedSegments:t.segments??[d(t.text,[...t.marks])],...Y(t)}},getMap:function(t,e){return{type:"shift",blockId:e.blockId,from:e.offset,to:e.offset,newLen:X(e)}},map:function(t,e,o){const n=A(t.blockId,t.offset,e,-1);return n?n.blockId===t.blockId&&n.from===t.offset?t:{type:"insertText",blockId:n.blockId,offset:n.from,text:t.text,marks:t.marks,...t.segments?{segments:t.segments}:{},...$(t.blockId,n.blockId,t.path)}:null}},deleteText:{apply:function(e,o){return Q(e,o.blockId,e=>function(e,o,n){const r=[];let c=0;for(const l of e){if(t(l)){const t=c+1;(t<=o||c>=n)&&r.push(l),c=t;continue}const e=c+l.text.length;if(e<=o||c>=n)r.push(l);else{const t=Math.max(0,o-c),e=Math.min(l.text.length,n-c),f=l.text.slice(0,t)+l.text.slice(e);f.length>0&&r.push(s(f,l.marks))}c=e}return r}(e,o.from,o.to))},invert:function(t){return{type:"insertText",blockId:t.blockId,offset:t.from,text:t.deletedText,marks:t.deletedMarks,segments:t.deletedSegments,...Y(t)}},getMap:function(t,e){return{type:"shift",blockId:e.blockId,from:e.from,to:e.to,newLen:0}},map:function(t,e,o){const n=N(t.blockId,t.from,t.to,e);if(!n)return null;if(et({blockId:t.blockId,from:t.from,to:t.to},n))return t;const r=y(o,n.blockId);if(!r)return null;const s=f(r).slice(n.from,n.to),l=a(r,n.from),i=c(r,n.from,n.to);return{type:"deleteText",blockId:n.blockId,from:n.from,to:n.to,deletedText:s,deletedMarks:l,deletedSegments:i,...$(t.blockId,n.blockId,t.path)}}},splitBlock:{apply:function(t,e){const r=W(t.children,t=>t.some(t=>n(t)&&t.id===e.blockId),t=>{const r=t.findIndex(t=>n(t)&&t.id===e.blockId);if(-1===r)return t;const s=t[r],c=h(s),l=p(s),f=F(c,0,e.offset),d=F(c,e.offset,l),u={...s,children:o(f)},a=void 0!==e.newBlockType,k=e.newBlockType??s.type,m=a?e.newBlockAttrs:s.attrs,I=i(k,o(d),e.newBlockId,m),b=[...t];return b.splice(r,1,u,I),b});return r?{children:r}:t},invert:function(t){return{type:"mergeBlocks",targetBlockId:t.blockId,sourceBlockId:t.newBlockId,targetLengthBefore:t.offset,...void 0!==t.newBlockType?{sourceType:t.newBlockType}:{},...t.newBlockAttrs?{sourceAttrs:t.newBlockAttrs}:{},...Y(t)}},getMap:function(t,e){return{type:"split",blockId:e.blockId,offset:e.offset,newBlockId:e.newBlockId}},map:function(t,e,o){const n=A(t.blockId,t.offset,e,-1);return n?n.blockId===t.blockId&&n.from===t.offset?t:{type:"splitBlock",blockId:n.blockId,offset:n.from,newBlockId:t.newBlockId,...void 0!==t.newBlockType?{newBlockType:t.newBlockType}:{},...t.newBlockAttrs?{newBlockAttrs:t.newBlockAttrs}:{},...$(t.blockId,n.blockId,t.path)}:null}},mergeBlocks:{apply:function(t,e){const r=W(t.children,t=>t.some(t=>n(t)&&t.id===e.targetBlockId)&&t.some(t=>n(t)&&t.id===e.sourceBlockId),t=>{const r=t.findIndex(t=>n(t)&&t.id===e.targetBlockId),s=t.findIndex(t=>n(t)&&t.id===e.sourceBlockId);if(-1===r||-1===s)return t;const c=t[r],l=t[s],f=h(c),i=h(l),d=o([...f,...i]),u={...c,children:d};return t.filter(t=>!n(t)||t.id!==e.sourceBlockId).map(t=>n(t)&&t.id===e.targetBlockId?u:t)});return r?{children:r}:t},invert:function(t){return{type:"splitBlock",blockId:t.targetBlockId,offset:t.targetLengthBefore,newBlockId:t.sourceBlockId,...void 0!==t.sourceType?{newBlockType:t.sourceType}:{},...t.sourceAttrs?{newBlockAttrs:t.sourceAttrs}:{},...Y(t)}},getMap:function(t,e){return{type:"merge",targetBlockId:e.targetBlockId,sourceBlockId:e.sourceBlockId,targetLengthBefore:e.targetLengthBefore}},map:function(t,e,o){if(e.isEmpty)return t;const n=e.mapResult({blockId:t.targetBlockId,offset:0},-1),r=e.mapResult({blockId:t.sourceBlockId,offset:0},-1);if(n.deleted||r.deleted)return null;const s=n.pos.blockId,c=r.pos.blockId;if(s===c)return null;const l=y(o,s);if(!l)return null;const f=p(l);return s===t.targetBlockId&&c===t.sourceBlockId&&f===t.targetLengthBefore?t:{type:"mergeBlocks",targetBlockId:s,sourceBlockId:c,targetLengthBefore:f,...void 0!==t.sourceType?{sourceType:t.sourceType}:{},...t.sourceAttrs?{sourceAttrs:t.sourceAttrs}:{},...$(t.targetBlockId,s,t.path)}}},addMark:{apply:function(t,e){return Q(t,e.blockId,t=>G(t,e.from,e.to,e.mark,!0))},invert:function(t){return{type:"removeMark",blockId:t.blockId,from:t.from,to:t.to,mark:t.mark,...Y(t)}},getMap:function(t,e){return v},map:function(t,e,o){const n=N(t.blockId,t.from,t.to,e);return n?et({blockId:t.blockId,from:t.from,to:t.to},n)?t:{type:"addMark",blockId:n.blockId,from:n.from,to:n.to,mark:t.mark,...$(t.blockId,n.blockId,t.path)}:null}},removeMark:{apply:function(t,e){return Q(t,e.blockId,t=>G(t,e.from,e.to,e.mark,!1))},invert:function(t){return{type:"addMark",blockId:t.blockId,from:t.from,to:t.to,mark:t.mark,...Y(t)}},getMap:function(t,e){return v},map:function(t,e,o){const n=N(t.blockId,t.from,t.to,e);return n?et({blockId:t.blockId,from:t.from,to:t.to},n)?t:{type:"removeMark",blockId:n.blockId,from:n.from,to:n.to,mark:t.mark,...$(t.blockId,n.blockId,t.path)}:null}},setStoredMarks:{apply:function(t){return t},invert:function(t){return{type:"setStoredMarks",marks:t.previousMarks,previousMarks:t.marks}},getMap:function(t,e){return v},map:function(t,e,o){return t}},setBlockType:{apply:function(t,e){return z(t,e.blockId,t=>{const{attrs:o,...n}=t;return{...n,type:e.nodeType,...e.attrs?{attrs:e.attrs}:{}}})},invert:function(t){return{type:"setBlockType",blockId:t.blockId,nodeType:t.previousNodeType,attrs:t.previousAttrs,previousNodeType:t.nodeType,previousAttrs:t.attrs,...Y(t)}},getMap:function(t,e){return v},map:function(t,e,o){if(e.isEmpty)return t;const n=e.mapResult({blockId:t.blockId,offset:0},-1);if(n.deleted)return null;const r=n.pos.blockId,s=y(o,r);return s?r===t.blockId&&s.type===t.previousNodeType&&ot(s.attrs,t.previousAttrs)?t:{type:"setBlockType",blockId:r,nodeType:t.nodeType,...t.attrs?{attrs:t.attrs}:{},previousNodeType:s.type,...s.attrs?{previousAttrs:s.attrs}:{},...$(t.blockId,r,t.path)}:null}},insertNode:{apply:function(t,e){if(0===e.parentPath.length){const o=[...t.children];return o.splice(e.index,0,e.node),{children:o}}return C(t,e.parentPath,t=>{const o=[...t.children];return o.splice(e.index,0,e.node),{...t,children:o}})},invert:function(t){return{type:"removeNode",parentPath:t.parentPath,index:t.index,removedNode:t.node}},getMap:function(t,e){return{type:"childIndexShift",parentPath:e.parentPath,fromIndex:e.index,delta:1}},map:function(t,e,o){if(!tt(t.parentPath,e))return null;const n=L(t.parentPath,t.index,e);return n===t.index?t:{type:"insertNode",parentPath:t.parentPath,index:n,node:t.node}}},removeNode:{apply:function(t,e){if(0===e.parentPath.length){const o=[...t.children];return o.splice(e.index,1),{children:o}}return C(t,e.parentPath,t=>{const o=[...t.children];return o.splice(e.index,1),{...t,children:o}})},invert:function(t){return{type:"insertNode",parentPath:t.parentPath,index:t.index,node:t.removedNode}},getMap:function(t,e){return{type:"blockRemoval",removedBlockIds:x(e.removedNode),parentPath:e.parentPath,index:e.index}},map:function(t,e,o){if(!tt(t.parentPath,e))return null;const n=e.mapResult({blockId:t.removedNode.id,offset:0},-1);if(n.deleted)return null;if(n.pos.blockId!==t.removedNode.id)return null;const r=P(t.parentPath,t.index,e);if(null===r)return null;const s=g(o,t.parentPath,r);return s?s.id!==t.removedNode.id?null:r===t.index&&s===t.removedNode?t:{type:"removeNode",parentPath:t.parentPath,index:r,removedNode:s}:null}},setNodeAttr:{apply:function(t,e){const o=e.path[e.path.length-1];return o?z(t,o,t=>({...t,attrs:e.attrs})):t},invert:function(t){return{type:"setNodeAttr",path:t.path,attrs:t.previousAttrs,previousAttrs:t.attrs}},getMap:function(t,e){return v},map:function(t,e,o){if(e.isEmpty)return t;if(!tt(t.path,e))return null;const n=B(o,t.path);return n?{type:"setNodeAttr",path:t.path,attrs:t.attrs,...n.attrs?{previousAttrs:n.attrs}:{}}:null}},insertInlineNode:{apply:function(e,o){return Q(e,o.blockId,e=>function(e,o,n){const r=[];let c=0,l=!1;for(const f of e){if(t(f)){l||o!==c||(r.push(n),l=!0),r.push(f),c+=1;continue}const e=c+f.text.length;if(!l&&o>=c&&o<=e){const t=o-c,e=f.text.slice(0,t),i=f.text.slice(t);e&&r.push(s(e,f.marks)),r.push(n),i&&r.push(s(i,f.marks)),l=!0}else r.push(f);c=e}return l||r.push(n),r}(e,o.offset,o.node))},invert:function(t){return{type:"removeInlineNode",blockId:t.blockId,offset:t.offset,removedNode:t.node,...Y(t)}},getMap:function(t,e){return{type:"shift",blockId:e.blockId,from:e.offset,to:e.offset,newLen:1}},map:function(t,e,o){const n=A(t.blockId,t.offset,e,-1);return n?n.blockId===t.blockId&&n.from===t.offset?t:{type:"insertInlineNode",blockId:n.blockId,offset:n.from,node:t.node,...$(t.blockId,n.blockId,t.path)}:null}},removeInlineNode:{apply:function(e,o){return Q(e,o.blockId,e=>function(e,o){const n=[];let r=0;for(const s of e)t(s)?(r!==o&&n.push(s),r+=1):(n.push(s),r+=s.text.length);return n}(e,o.offset))},invert:function(t){return{type:"insertInlineNode",blockId:t.blockId,offset:t.offset,node:t.removedNode,...Y(t)}},getMap:function(t,e){return{type:"shift",blockId:e.blockId,from:e.offset,to:e.offset+1,newLen:0}},map:function(e,o,n){const r=N(e.blockId,e.offset,e.offset+1,o,1,1);if(!r)return null;if(r.to-r.from!==1)return null;const s=y(n,r.blockId);if(!s)return null;const c=l(s,r.from);return c&&"inline"===c.kind&&t(c.node)?(f=e.removedNode)===(i=c.node)||f.inlineType===i.inlineType&&ot(f.attrs,i.attrs)?r.blockId===e.blockId&&r.from===e.offset?e:{type:"removeInlineNode",blockId:r.blockId,offset:r.from,removedNode:c.node,...$(e.blockId,r.blockId,e.path)}:null:null;var f,i}},setInlineNodeAttr:{apply:function(e,o){return Q(e,o.blockId,e=>function(e,o,n){const r=[];let s=0;for(const c of e)t(c)?(s===o?r.push({...c,attrs:n}):r.push(c),s+=1):(r.push(c),s+=c.text.length);return r}(e,o.offset,o.attrs),!1)},invert:function(t){return{type:"setInlineNodeAttr",blockId:t.blockId,offset:t.offset,attrs:t.previousAttrs,previousAttrs:t.attrs,...Y(t)}},getMap:function(t,e){return v},map:function(e,o,n){const r=N(e.blockId,e.offset,e.offset+1,o,1,1);if(!r)return null;if(r.to-r.from!==1)return null;if(r.blockId===e.blockId&&r.from===e.offset)return e;const s=y(n,r.blockId);if(!s)return null;const c=l(s,r.from);return c&&"inline"===c.kind&&t(c.node)?{type:"setInlineNodeAttr",blockId:r.blockId,offset:r.from,attrs:e.attrs,previousAttrs:c.node.attrs,...$(e.blockId,r.blockId,e.path)}:null}}};function rt(t){return nt[t.type]}function st(t,e){return rt(e).apply(t,e)}function ct(t){return rt(t).invert(t)}function lt(t,e){return rt(e).getMap(t,e)}function ft(t,e,o){return e.isEmpty?t:rt(t).map(t,e,o)}function it(t){const e=t.steps.map(ct).reverse();return{steps:e,selectionBefore:t.selectionAfter,selectionAfter:t.selectionBefore,storedMarksAfter:Z(t),mapping:T.empty,forwardStepMaps:e.map(()=>v),metadata:{origin:"history",timestamp:Date.now()}}}function dt(t,e){switch(t.type){case"inline":return function(t,e){switch(e.type){case"identity":case"childIndexShift":return t;case"shift":return function(t,e){if(t.blockId!==e.blockId)return t;const o=w(I(t.blockId,t.from),e,-1).pos,n=w(I(t.blockId,t.to),e,1).pos;return o.offset>=n.offset?null:o.offset===t.from&&n.offset===t.to?t:{...t,from:o.offset,to:n.offset}}(t,e);case"split":return function(t,e){return t.blockId!==e.blockId||t.to<=e.offset?t:t.from>=e.offset?{...t,blockId:e.newBlockId,from:t.from-e.offset,to:t.to-e.offset}:[{...t,to:e.offset},{...t,blockId:e.newBlockId,from:0,to:t.to-e.offset}]}(t,e);case"merge":return function(t,e){return t.blockId!==e.sourceBlockId?t:{...t,blockId:e.targetBlockId,from:t.from+e.targetLengthBefore,to:t.to+e.targetLengthBefore}}(t,e);case"blockRemoval":return e.removedBlockIds.has(t.blockId)?null:t}}(t,e);case"widget":return function(t,e){switch(e.type){case"identity":case"childIndexShift":return t;case"shift":return function(t,e){if(t.blockId!==e.blockId)return t;const o=w(I(t.blockId,t.offset),e,t.side);return o.deleted?null:o.pos.offset===t.offset?t:{...t,offset:o.pos.offset}}(t,e);case"split":return function(t,e){if(t.blockId!==e.blockId)return t;const o=w(I(t.blockId,t.offset),e,t.side);return o.pos.blockId===t.blockId&&o.pos.offset===t.offset?t:{...t,blockId:o.pos.blockId,offset:o.pos.offset}}(t,e);case"merge":return function(t,e){return t.blockId!==e.sourceBlockId?t:{...t,blockId:e.targetBlockId,offset:t.offset+e.targetLengthBefore}}(t,e);case"blockRemoval":return e.removedBlockIds.has(t.blockId)?null:t}}(t,e);case"node":return function(t,e){switch(e.type){case"identity":case"shift":case"split":case"childIndexShift":return t;case"merge":return t.blockId===e.sourceBlockId?null:t;case"blockRemoval":return e.removedBlockIds.has(t.blockId)?null:t}}(t,e)}}function ut(t,e,o,n){return{type:"inline",blockId:t,from:e,to:o,attrs:n}}function at(t,e){return{type:"node",blockId:t,attrs:e}}function pt(t,e,o,n){return{type:"widget",blockId:t,offset:e,toDOM:o,side:n?.side??-1,key:n?.key}}var kt=class t{byBlock;static empty=new t(/* @__PURE__ */new Map);constructor(t){this.byBlock=t}static create(e){if(0===e.length)return t.empty;const o=/* @__PURE__ */new Map;for(const t of e){const e=o.get(t.blockId);e?e.push(t):o.set(t.blockId,[t])}return new t(o)}find(t){return this.byBlock.get(t)??[]}findInline(t){const e=this.byBlock.get(t);return e?e.filter(t=>"inline"===t.type):[]}findNode(t){const e=this.byBlock.get(t);return e?e.filter(t=>"node"===t.type):[]}findWidget(t){const e=this.byBlock.get(t);return e?e.filter(t=>"widget"===t.type):[]}add(e){if(0===e.length)return this;if(this.isEmpty)return t.create(e);const o=/* @__PURE__ */new Map;for(const[t,n]of this.byBlock)o.set(t,[...n]);for(const t of e){const e=o.get(t.blockId);e?e.push(t):o.set(t.blockId,[t])}return new t(o)}remove(e){const o=/* @__PURE__ */new Map;let n=!1;for(const[t,r]of this.byBlock){const s=r.filter(t=>!e(t));s.length!==r.length&&(n=!0),s.length>0&&o.set(t,s)}return n?0===o.size?t.empty:new t(o):this}merge(e){if(e.isEmpty)return this;if(this.isEmpty)return e;const o=/* @__PURE__ */new Map;for(const[t,n]of this.byBlock)o.set(t,[...n]);for(const[t,n]of e.byBlock){const e=o.get(t);e?e.push(...n):o.set(t,[...n])}return new t(o)}equals(t){if(this===t)return!0;if(this.byBlock.size!==t.byBlock.size)return!1;for(const[e,o]of this.byBlock){const n=t.byBlock.get(e);if(!n)return!1;if(!mt(o,n))return!1}return!0}get isEmpty(){return 0===this.byBlock.size}map(e){if(this.isEmpty||e.mapping.isEmpty)return this;let o=[];for(const t of this.byBlock.values())for(const e of t)o.push(e);for(const t of e.mapping.maps){const e=[];for(const n of o){const o=dt(n,t);if(null!==o)if(Array.isArray(o))for(const t of o)e.push(t);else e.push(o)}o=e}return 0===o.length?t.empty:t.create(o)}};function mt(t,e){if(t===e)return!0;if(t.length!==e.length)return!1;for(let o=0;o<t.length;o++){const n=t[o],r=e[o];if(!n||!r||!ht(n,r))return!1}return!0}function ht(t,e){if(t.type!==e.type)return!1;if(t.blockId!==e.blockId)return!1;switch(t.type){case"inline":{const o=e;return t.from===o.from&&t.to===o.to&&It(t.attrs,o.attrs)}case"node":{const o=e;return It(t.attrs,o.attrs)}case"widget":{const o=e;return t.offset===o.offset&&t.side===o.side&&t.key===o.key&&t.toDOM===o.toDOM}}}function It(t,e){if(t===e)return!0;const o=Object.keys(t),n=Object.keys(e);if(o.length!==n.length)return!1;for(const r of o)if(t[r]!==e[r])return!1;return!0}export{O as C,w as S,T as _,pt as a,P as b,ct as c,Z as d,V as f,v as g,J as h,at as i,it as l,H as m,mt as n,st as o,U as p,ut as r,lt as s,kt as t,ft as u,x as v,L as x,j as y};
+//# sourceMappingURL=Decoration-ZeyVfwJB.mjs.map

package/dist/chunks/Decoration-ZeyVfwJB.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Decoration-ZeyVfwJB.mjs","names":[],"sources":["../../src/state/Mapping.ts","../../src/state/BlockTreeOps.ts","../../src/state/InlineContentOps.ts","../../src/state/StepApplication.ts","../../src/model/ContentSlice.ts","../../src/state/Steps.ts","../../src/state/StepInversion.ts","../../src/state/StepMapping.ts","../../src/state/StepMaps.ts","../../src/state/StepHandlers.ts","../../src/decorations/PositionMapping.ts","../../src/decorations/Decoration.ts"],"sourcesContent":["/**\n * Generic position-mapping primitive.\n *\n * Each {@link Step} produces a {@link StepMap} that describes how positions\n * in `{blockId, offset}` space shift when the step is applied. A\n * {@link Mapping} composes a sequence of `StepMap`s — typically all the maps\n * of a transaction — into a single mapper, so any consumer (decorations,\n * comments, selections, remote cursors, history) can fold a position\n * through an entire change set without re-implementing per-step math.\n *\n * The model mirrors ProseMirror's `StepMap` / `Mapping`, adapted to\n * notectl's `{blockId, offset}` position space (positions are scoped to\n * blocks, not a flat document offset).\n *\n * ## Association (bias) semantics\n *\n * The optional `assoc` argument decides which side of a boundary a position\n * sticks to:\n *\n * - `assoc = -1` (\"sticky left\"): the position stays at the boundary when\n *   content is inserted at, or split exactly at, the position. This is the\n *   semantics expected by an inclusive-start range marker (a decoration's\n *   `from`, the left edge of a selection).\n * - `assoc = +1` (\"sticky right\"): the position moves past inserted content\n *   and migrates to the new block when its host block is split exactly at\n *   the position. This is the semantics expected by an exclusive-end range\n *   marker (a decoration's `to`, the right edge of a selection).\n *\n * The default is `-1`, matching the most common case (cursor and from-side\n * mappers).\n *\n * ## StepMap categories\n *\n * Every {@link Step} produces exactly one of six categories:\n *\n * 1. `identity` — no position shift (mark, attribute, schema, block-type).\n * 2. `shift` — within a single block, the range `[from, to)` is replaced\n *    with content of length `newLen`. Covers `insertText`, `deleteText`,\n *    `insertInlineNode`, `removeInlineNode` as a single primitive.\n * 3. `split` — a block is split at an offset; positions past the split\n *    migrate to the new block with rebased offsets.\n * 4. `merge` — a source block is appended to a target block; positions in\n *    the source block migrate to the target block with offsets shifted by\n *    the target's previous length.\n * 5. `blockRemoval` — one block subtree vanishes; positions inside any\n *    removed block are marked deleted, and sibling child-indices in the\n *    same parent shift down by one past the removed index.\n * 6. `childIndexShift` — a new block was inserted at `fromIndex` in\n *    `parentPath`'s children; sibling child-indices `≥ fromIndex` shift up.\n *    Position space ({blockId, offset}) is unaffected.\n *\n * `blockRemoval` and `childIndexShift` are the two categories that carry\n * **structural** information about a parent's child list. They are\n * orthogonal to positions ({blockId, offset}) and are interpreted by\n * {@link mapChildIndex} when rebasing tree-structural steps\n * (`insertNode` / `removeNode`).\n */\n\nimport { isBlockNode } from '../model/Document.js';\nimport type { BlockNode } from '../model/Document.js';\nimport type { Position } from '../model/Selection.js';\nimport { createPosition } from '../model/Selection.js';\nimport type { BlockId } from '../model/TypeBrands.js';\n\n/**\n * Result of mapping an `(blockId, [from, to))` range through a {@link Mapping}.\n *\n * Both endpoints are guaranteed to live in the same block. Callers can rely\n * on `from <= to` (the helper returns `null` rather than producing an\n * inverted range).\n */\nexport interface MappedInBlockRange {\n\treadonly blockId: BlockId;\n\treadonly from: number;\n\treadonly to: number;\n}\n\n/** Position-mapping bias at a boundary. */\nexport type Assoc = -1 | 1;\n\n// --- StepMap variants ---\n\n/** No-op map: positions pass through unchanged. */\nexport interface IdentityMap {\n\treadonly type: 'identity';\n}\n\n/**\n * Within `blockId`, the offset range `[from, to)` is replaced with content\n * of length `newLen`. Covers all in-block content edits with a single\n * primitive:\n *\n * - `insertText(blockId, off, text)` → `{from: off, to: off, newLen: text.length}`.\n * - `deleteText(blockId, f, t)`      → `{from: f,   to: t,   newLen: 0}`.\n * - `insertInlineNode(blockId, off)` → `{from: off, to: off, newLen: 1}`.\n * - `removeInlineNode(blockId, off)` → `{from: off, to: off + 1, newLen: 0}`.\n */\nexport interface ShiftMap {\n\treadonly type: 'shift';\n\treadonly blockId: BlockId;\n\treadonly from: number;\n\treadonly to: number;\n\treadonly newLen: number;\n}\n\n/**\n * A block is split at `offset`. Content `[0, offset)` stays in `blockId`;\n * content `[offset, length)` migrates to `newBlockId` rebased to start at 0.\n */\nexport interface SplitMap {\n\treadonly type: 'split';\n\treadonly blockId: BlockId;\n\treadonly offset: number;\n\treadonly newBlockId: BlockId;\n}\n\n/**\n * `sourceBlockId` is appended to `targetBlockId`. Positions in the source\n * block migrate to the target block with offset shifted by\n * `targetLengthBefore` (the target's length before the merge).\n */\nexport interface MergeMap {\n\treadonly type: 'merge';\n\treadonly targetBlockId: BlockId;\n\treadonly sourceBlockId: BlockId;\n\treadonly targetLengthBefore: number;\n}\n\n/**\n * A block subtree is removed from the document. Positions whose `blockId`\n * is in `removedBlockIds` are marked deleted; `removedBlockIds` covers the\n * removed root **plus all descendant block IDs** (see\n * {@link collectRemovedBlockIds}).\n *\n * `parentPath` and `index` carry the removal's structural coordinates so\n * sibling child-indices in the same parent can be rebased: any\n * `(parentPath, i)` with `i === index` becomes invalid (the block is gone),\n * and `i > index` shifts down by one. See {@link mapChildIndex}.\n */\nexport interface BlockRemovalMap {\n\treadonly type: 'blockRemoval';\n\treadonly removedBlockIds: ReadonlySet<BlockId>;\n\treadonly parentPath: readonly BlockId[];\n\treadonly index: number;\n}\n\n/**\n * A new block was inserted at `fromIndex` in `parentPath`'s child list.\n * Sibling child-indices `≥ fromIndex` shift up by `delta` (always `+1`\n * since {@link InsertNodeStep} inserts a single block). Position space\n * (`{blockId, offset}`) is unaffected — the new block has no prior\n * positions, and positions inside other siblings keep their offsets.\n *\n * Only consumed by {@link mapChildIndex}.\n */\nexport interface ChildIndexShiftMap {\n\treadonly type: 'childIndexShift';\n\treadonly parentPath: readonly BlockId[];\n\treadonly fromIndex: number;\n\treadonly delta: number;\n}\n\n/** Discriminated union of all StepMap variants. */\nexport type StepMap =\n\t| IdentityMap\n\t| ShiftMap\n\t| SplitMap\n\t| MergeMap\n\t| BlockRemovalMap\n\t| ChildIndexShiftMap;\n\n// --- Map results ---\n\n/** Result of mapping a single position. */\nexport interface MapResult {\n\treadonly pos: Position;\n\t/** True if the input position fell inside content removed by the map. */\n\treadonly deleted: boolean;\n}\n\n/** A range expressed in `Position` space. */\nexport interface PositionRange {\n\treadonly from: Position;\n\treadonly to: Position;\n}\n\n// --- Singletons / factories ---\n\n/** The shared identity StepMap; reuse instead of allocating per step. */\nexport const IDENTITY_MAP: IdentityMap = { type: 'identity' };\n\n/**\n * Walks a block subtree and returns the set of its own ID plus every\n * descendant block ID. Used to build {@link BlockRemovalMap.removedBlockIds}.\n */\nexport function collectRemovedBlockIds(node: BlockNode): Set<BlockId> {\n\tconst ids = new Set<BlockId>();\n\tconst walk = (n: BlockNode): void => {\n\t\tids.add(n.id);\n\t\tfor (const child of n.children) {\n\t\t\tif (isBlockNode(child)) walk(child);\n\t\t}\n\t};\n\twalk(node);\n\treturn ids;\n}\n\n// --- Single-StepMap application ---\n\n/**\n * Maps a single position through one {@link StepMap}.\n *\n * @param pos input position\n * @param map the StepMap describing the change\n * @param assoc which side of a boundary to stick to (default `-1`)\n * @returns mapped position plus a `deleted` flag indicating whether `pos`\n *          fell inside content that the step removed\n */\nexport function mapPositionThroughStep(pos: Position, map: StepMap, assoc: Assoc = -1): MapResult {\n\tswitch (map.type) {\n\t\tcase 'identity':\n\t\t\treturn { pos, deleted: false };\n\t\tcase 'shift':\n\t\t\treturn mapPositionThroughShift(pos, map, assoc);\n\t\tcase 'split':\n\t\t\treturn mapPositionThroughSplit(pos, map, assoc);\n\t\tcase 'merge':\n\t\t\treturn mapPositionThroughMerge(pos, map);\n\t\tcase 'blockRemoval':\n\t\t\treturn mapPositionThroughBlockRemoval(pos, map);\n\t\tcase 'childIndexShift':\n\t\t\t// Child-index shifts do not touch position space ({blockId, offset}):\n\t\t\t// a new sibling block has no prior positions to map, and existing\n\t\t\t// siblings keep their internal offsets even if their parent-relative\n\t\t\t// index changed. Consumed only by {@link mapChildIndex}.\n\t\t\treturn { pos, deleted: false };\n\t}\n}\n\nfunction mapPositionThroughShift(pos: Position, map: ShiftMap, assoc: Assoc): MapResult {\n\tif (pos.blockId !== map.blockId) return { pos, deleted: false };\n\n\tconst delta: number = map.newLen - (map.to - map.from);\n\tconst off: number = pos.offset;\n\n\t// Strictly before the affected range\n\tif (off < map.from) return { pos, deleted: false };\n\n\t// At the start boundary\n\tif (off === map.from) {\n\t\t// Pure insertion (from === to): assoc decides whether we stick before\n\t\t// or after the inserted run.\n\t\tif (map.from === map.to) {\n\t\t\tconst newOff: number = assoc === 1 ? map.from + map.newLen : map.from;\n\t\t\treturn newOff === off\n\t\t\t\t? { pos, deleted: false }\n\t\t\t\t: { pos: shiftedPos(pos, newOff), deleted: false };\n\t\t}\n\t\t// Deletion starts at this point — position stays at `from` regardless\n\t\t// of assoc; nothing was inserted to skip past.\n\t\treturn { pos, deleted: false };\n\t}\n\n\t// Strictly inside [from, to): position fell into removed content\n\tif (off < map.to) {\n\t\tconst newOff: number = assoc === 1 ? map.from + map.newLen : map.from;\n\t\treturn { pos: shiftedPos(pos, newOff), deleted: true };\n\t}\n\n\t// At or past the end boundary: shift by delta\n\tconst newOff: number = off + delta;\n\treturn newOff === off\n\t\t? { pos, deleted: false }\n\t\t: { pos: shiftedPos(pos, newOff), deleted: false };\n}\n\nfunction mapPositionThroughSplit(pos: Position, map: SplitMap, assoc: Assoc): MapResult {\n\tif (pos.blockId !== map.blockId) return { pos, deleted: false };\n\n\tif (pos.offset < map.offset) return { pos, deleted: false };\n\n\tif (pos.offset > map.offset) {\n\t\treturn {\n\t\t\tpos: createPosition(map.newBlockId, pos.offset - map.offset),\n\t\t\tdeleted: false,\n\t\t};\n\t}\n\n\t// At the split boundary: assoc decides which side keeps the cursor.\n\tif (assoc === 1) {\n\t\treturn { pos: createPosition(map.newBlockId, 0), deleted: false };\n\t}\n\treturn { pos, deleted: false };\n}\n\nfunction mapPositionThroughMerge(pos: Position, map: MergeMap): MapResult {\n\tif (pos.blockId !== map.sourceBlockId) return { pos, deleted: false };\n\treturn {\n\t\tpos: createPosition(map.targetBlockId, pos.offset + map.targetLengthBefore),\n\t\tdeleted: false,\n\t};\n}\n\nfunction mapPositionThroughBlockRemoval(pos: Position, map: BlockRemovalMap): MapResult {\n\tif (map.removedBlockIds.has(pos.blockId)) {\n\t\treturn { pos, deleted: true };\n\t}\n\treturn { pos, deleted: false };\n}\n\n/** Allocates a new Position with the given offset, preserving an optional `path`. */\nfunction shiftedPos(original: Position, newOffset: number): Position {\n\treturn createPosition(original.blockId, newOffset, original.path);\n}\n\n// --- Mapping ---\n\n/**\n * Composes a sequence of {@link StepMap}s into a single mapper. A `Mapping`\n * is immutable; `appendMap` returns a new instance.\n *\n * Construction always normalizes by dropping identity maps — they're a\n * common case and would otherwise inflate every transaction's mapping\n * pipeline with no-ops.\n */\nexport class Mapping {\n\t/** Shared empty Mapping. */\n\tstatic readonly empty: Mapping = new Mapping([]);\n\n\treadonly maps: readonly StepMap[];\n\n\tprivate constructor(maps: readonly StepMap[]) {\n\t\tthis.maps = maps;\n\t}\n\n\t/** Creates a Mapping from a list of StepMaps, dropping identity maps. */\n\tstatic from(maps: readonly StepMap[]): Mapping {\n\t\tconst filtered: StepMap[] = [];\n\t\tfor (const m of maps) {\n\t\t\tif (m.type !== 'identity') filtered.push(m);\n\t\t}\n\t\tif (filtered.length === 0) return Mapping.empty;\n\t\treturn new Mapping(filtered);\n\t}\n\n\t/** Returns a new Mapping with `map` appended. */\n\tappendMap(map: StepMap): Mapping {\n\t\tif (map.type === 'identity') return this;\n\t\treturn new Mapping([...this.maps, map]);\n\t}\n\n\t/** Concatenates two mappings into a new one. */\n\tappendMapping(other: Mapping): Mapping {\n\t\tif (other.maps.length === 0) return this;\n\t\tif (this.maps.length === 0) return other;\n\t\treturn new Mapping([...this.maps, ...other.maps]);\n\t}\n\n\t/** True if the mapping contains no position-changing maps. */\n\tget isEmpty(): boolean {\n\t\treturn this.maps.length === 0;\n\t}\n\n\t/**\n\t * Folds a position through every contained StepMap in order.\n\t * Returns the mapped position; the `deleted` flag is **not** preserved\n\t * (use {@link mapResult} when you need it).\n\t */\n\tmap(pos: Position, assoc: Assoc = -1): Position {\n\t\treturn this.mapResult(pos, assoc).pos;\n\t}\n\n\t/**\n\t * Like {@link map}, but returns whether the position landed in deleted\n\t * content at any step. Once a position is marked deleted, the flag is\n\t * sticky — subsequent steps do not \"un-delete\" it.\n\t */\n\tmapResult(pos: Position, assoc: Assoc = -1): MapResult {\n\t\tlet current: Position = pos;\n\t\tlet deleted = false;\n\t\tfor (const m of this.maps) {\n\t\t\tconst result: MapResult = mapPositionThroughStep(current, m, assoc);\n\t\t\tcurrent = result.pos;\n\t\t\tif (result.deleted) deleted = true;\n\t\t}\n\t\treturn { pos: current, deleted };\n\t}\n\n\t/**\n\t * Maps a range. By convention, `from` is mapped with `assoc = -1`\n\t * (inclusive-start) and `to` with `assoc = +1` (exclusive-end). The\n\t * caller may override either bias.\n\t *\n\t * Returns `null` when both endpoints land in deleted content **and** the\n\t * mapped range would collapse to length zero or negative — i.e. the\n\t * range no longer covers any live content.\n\t *\n\t * The returned `from`/`to` may live in different blocks (e.g. after a\n\t * `split` map). Callers that require an in-block range (decorations,\n\t * inline selections) must detect and split accordingly.\n\t */\n\tmapRange(range: PositionRange, assocFrom: Assoc = -1, assocTo: Assoc = 1): PositionRange | null {\n\t\tconst from: MapResult = this.mapResult(range.from, assocFrom);\n\t\tconst to: MapResult = this.mapResult(range.to, assocTo);\n\n\t\tif (from.deleted && to.deleted) {\n\t\t\tif (from.pos.blockId === to.pos.blockId && from.pos.offset >= to.pos.offset) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\treturn { from: from.pos, to: to.pos };\n\t}\n}\n\n// --- In-block range helpers (used by per-step Step→Step mapping) ---\n\n/**\n * Maps an `(blockId, [from, to))` range through `mapping`, asserting the\n * result lives in a single block.\n *\n * Returns `null` when the range no longer addresses live content in a single\n * block:\n *\n * - the host block was removed;\n * - the range was fully deleted (both endpoints flagged deleted and collapse);\n * - the endpoints migrated to different blocks (range fragmented, e.g. a\n *   `split` map placed `from` and `to` on opposite sides of the cut).\n *\n * Default biases are **conservative for step rebasing**: `assocFrom = +1`,\n * `assocTo = -1`. An intervening insertion at either boundary therefore\n * does NOT expand the rebased range to cover the new content — the user's\n * original edit only addressed the original content, and the agent's\n * intervening insertion should be preserved across an undo/redo. This is\n * the opposite of {@link Mapping.mapRange}'s default biases, which model\n * selections (inclusive-start, exclusive-end) where boundary insertions\n * naturally extend the selection.\n */\nexport function mapInBlockRange(\n\tblockId: BlockId,\n\tfrom: number,\n\tto: number,\n\tmapping: Mapping,\n\tassocFrom: Assoc = 1,\n\tassocTo: Assoc = -1,\n): MappedInBlockRange | null {\n\tif (mapping.isEmpty) return { blockId, from, to };\n\n\tconst fromPos: Position = createPosition(blockId, from);\n\tconst toPos: Position = createPosition(blockId, to);\n\tconst fromResult: MapResult = mapping.mapResult(fromPos, assocFrom);\n\tconst toResult: MapResult = mapping.mapResult(toPos, assocTo);\n\n\t// If both endpoints fell inside removed/replaced content, the range no\n\t// longer addresses live document territory — abandon. A partial overlap\n\t// (one endpoint deleted, the other shifted) still survives clamped.\n\tif (fromResult.deleted && toResult.deleted) return null;\n\n\t// Range must remain within a single block. A split could have moved one\n\t// endpoint to the new block; that's a fragmentation we cannot represent\n\t// as a single in-block step.\n\tif (fromResult.pos.blockId !== toResult.pos.blockId) return null;\n\n\t// Defensive: a range whose endpoints inverted (from > to) is invalid.\n\t// An empty range with from === to is still valid (e.g. a pure-insertion\n\t// `shift` whose offset survived).\n\tif (fromResult.pos.offset > toResult.pos.offset) return null;\n\n\treturn {\n\t\tblockId: fromResult.pos.blockId,\n\t\tfrom: fromResult.pos.offset,\n\t\tto: toResult.pos.offset,\n\t};\n}\n\n/**\n * Maps an `(blockId, offset)` point through `mapping`, returning the\n * equivalent in-block position or `null` when the host block was removed.\n *\n * Convenience wrapper around {@link mapInBlockRange} for steps that carry a\n * single offset (`insertText`, `insertInlineNode`, `splitBlock`).\n */\nexport function mapOffsetInBlock(\n\tblockId: BlockId,\n\toffset: number,\n\tmapping: Mapping,\n\tassoc: Assoc = -1,\n): MappedInBlockRange | null {\n\tif (mapping.isEmpty) return { blockId, from: offset, to: offset };\n\n\tconst pos: Position = createPosition(blockId, offset);\n\tconst result: MapResult = mapping.mapResult(pos, assoc);\n\tif (result.deleted) return null;\n\treturn { blockId: result.pos.blockId, from: result.pos.offset, to: result.pos.offset };\n}\n\n// --- Child-index mapping (used by structural step rebasing) ---\n\n/**\n * Rebases a child-index `(parentPath, index)` through `mapping`. The\n * `index` is interpreted as the position of an **existing** child block:\n * if an intervening edit removed exactly that child, the result is\n * `null`. For an **insertion slot** (the target index of a future\n * `insertNode`), use {@link mapInsertionIndex} — slots stay valid even\n * when the block previously at that index is removed.\n *\n * Child-indices live in a coordinate space orthogonal to positions\n * (`{blockId, offset}`): they describe a slot in a parent's child list,\n * not a place inside text. Only two {@link StepMap} categories carry\n * child-index-affecting information:\n *\n * - {@link ChildIndexShiftMap} (produced by `insertNode`): shifts\n *   sibling indices `≥ fromIndex` by `delta` (always `+1` today).\n * - {@link BlockRemovalMap} (produced by `removeNode`): removes the child\n *   at `index` (the input index becomes invalid → `null`), and shifts\n *   sibling indices `> index` down by `1`.\n *\n * Maps whose `parentPath` differs from the input pass through; all\n * non-structural categories (`shift`, `split`, `merge`, `identity`) are\n * no-ops here.\n */\nexport function mapChildIndex(\n\tparentPath: readonly BlockId[],\n\tindex: number,\n\tmapping: Mapping,\n): number | null {\n\treturn foldChildIndex(parentPath, index, mapping, 'existing');\n}\n\n/**\n * Rebases an **insertion slot** `(parentPath, index)` through `mapping`.\n * An insertion slot lives in `[0, children.length]` (inclusive of the\n * end) and represents \"where to insert\", not an existing block. Slots\n * remain valid across intervening edits — even when the block previously\n * at that index is removed — so this function never returns `null`.\n *\n * Difference from {@link mapChildIndex}: for a `BlockRemovalMap` with\n * matching parent and `index === map.index`, this function keeps the\n * slot (returning `map.index`, which is the same numeric position in the\n * post-removal frame); {@link mapChildIndex} would return `null`.\n * {@link ChildIndexShiftMap} handling is identical.\n */\nexport function mapInsertionIndex(\n\tparentPath: readonly BlockId[],\n\tindex: number,\n\tmapping: Mapping,\n): number {\n\t// `foldChildIndex` with `'insertion'` provably never returns `null` —\n\t// the only path that would (BlockRemovalMap, matching parent, matching\n\t// index) is short-circuited inside `mapChildIndexThroughStep`. The\n\t// overload signature carries that invariant into the type system.\n\treturn foldChildIndex(parentPath, index, mapping, 'insertion');\n}\n\ntype ChildIndexKind = 'existing' | 'insertion';\n\nfunction foldChildIndex(\n\tparentPath: readonly BlockId[],\n\tindex: number,\n\tmapping: Mapping,\n\tkind: 'existing',\n): number | null;\nfunction foldChildIndex(\n\tparentPath: readonly BlockId[],\n\tindex: number,\n\tmapping: Mapping,\n\tkind: 'insertion',\n): number;\nfunction foldChildIndex(\n\tparentPath: readonly BlockId[],\n\tindex: number,\n\tmapping: Mapping,\n\tkind: ChildIndexKind,\n): number | null {\n\tif (mapping.isEmpty) return index;\n\n\tlet current: number = index;\n\tfor (const m of mapping.maps) {\n\t\tconst next: number | null = mapChildIndexThroughStep(parentPath, current, m, kind);\n\t\tif (next === null) return null;\n\t\tcurrent = next;\n\t}\n\treturn current;\n}\n\nfunction mapChildIndexThroughStep(\n\tparentPath: readonly BlockId[],\n\tindex: number,\n\tmap: StepMap,\n\tkind: ChildIndexKind,\n): number | null {\n\tswitch (map.type) {\n\t\tcase 'identity':\n\t\tcase 'shift':\n\t\tcase 'split':\n\t\tcase 'merge':\n\t\t\treturn index;\n\t\tcase 'blockRemoval':\n\t\t\tif (!sameParentPath(parentPath, map.parentPath)) return index;\n\t\t\tif (index === map.index) {\n\t\t\t\t// Existing-child semantics: that child is gone → invalid.\n\t\t\t\t// Insertion-slot semantics: the slot survives; nothing was\n\t\t\t\t// inserted/removed *to the left* of `index`, so the slot\n\t\t\t\t// number is unchanged in the post-removal frame.\n\t\t\t\treturn kind === 'existing' ? null : index;\n\t\t\t}\n\t\t\tif (index > map.index) return index - 1;\n\t\t\treturn index;\n\t\tcase 'childIndexShift':\n\t\t\tif (!sameParentPath(parentPath, map.parentPath)) return index;\n\t\t\tif (index >= map.fromIndex) return index + map.delta;\n\t\t\treturn index;\n\t}\n}\n\nfunction sameParentPath(a: readonly BlockId[], b: readonly BlockId[]): boolean {\n\tif (a === b) return true;\n\tif (a.length !== b.length) return false;\n\tfor (let i = 0; i < a.length; i++) {\n\t\tif (a[i] !== b[i]) return false;\n\t}\n\treturn true;\n}\n\n// --- StepMap inversion (used by history's frame-walk cancellation) ---\n\n/**\n * Returns the {@link StepMap} that undoes `map` in position space — i.e.\n * composing `map` with `invertStepMap(map)` is content-preserving (though\n * the composed position-mapping is *not* a true identity in our framework:\n * positions interior to a delete-then-reinsert round-trip clamp to the\n * deletion start during the deletion half and don't return on the insert\n * half).\n *\n * Used by history to detect mutually-inverse stepmaps in the rebase chain\n * and cancel them, sidestepping the round-trip clamping for cases where\n * the rebase is a no-op in content terms.\n *\n * `BlockRemovalMap`'s inverse is {@link IDENTITY_MAP}: re-inserting a\n * removed block subtree does not shift positions in *other* blocks, so the\n * inverse direction is invisible to position-mapping. Callers that need to\n * re-validate \"did the block come back\" must check the document instead.\n */\nexport function invertStepMap(map: StepMap): StepMap {\n\tswitch (map.type) {\n\t\tcase 'identity':\n\t\t\treturn IDENTITY_MAP;\n\t\tcase 'shift':\n\t\t\treturn {\n\t\t\t\ttype: 'shift',\n\t\t\t\tblockId: map.blockId,\n\t\t\t\tfrom: map.from,\n\t\t\t\tto: map.from + map.newLen,\n\t\t\t\tnewLen: map.to - map.from,\n\t\t\t};\n\t\tcase 'split':\n\t\t\treturn {\n\t\t\t\ttype: 'merge',\n\t\t\t\ttargetBlockId: map.blockId,\n\t\t\t\tsourceBlockId: map.newBlockId,\n\t\t\t\ttargetLengthBefore: map.offset,\n\t\t\t};\n\t\tcase 'merge':\n\t\t\treturn {\n\t\t\t\ttype: 'split',\n\t\t\t\tblockId: map.targetBlockId,\n\t\t\t\toffset: map.targetLengthBefore,\n\t\t\t\tnewBlockId: map.sourceBlockId,\n\t\t\t};\n\t\tcase 'blockRemoval':\n\t\t\t// Re-inserting a removed subtree does not shift positions in other\n\t\t\t// blocks, so the inverse position-space direction is invisible. The\n\t\t\t// child-index shift direction *is* representable as a\n\t\t\t// `childIndexShift` map, but history's cancellation only looks for\n\t\t\t// content-trivial round-trips; we return IDENTITY_MAP and let the\n\t\t\t// caller fall back to the standard rebase path. See JSDoc above.\n\t\t\treturn IDENTITY_MAP;\n\t\tcase 'childIndexShift':\n\t\t\t// Inverting an insertNode (delta = +1 at fromIndex) is a removeNode\n\t\t\t// at the same index, which carries both position- and child-index\n\t\t\t// effects via `BlockRemovalMap`. Producing a faithful inverse here\n\t\t\t// would require knowing `removedBlockIds`, which a position-only\n\t\t\t// `StepMap` does not carry. Return IDENTITY_MAP for the same reason\n\t\t\t// as `blockRemoval`: cancellation won't fire for these pairs, but\n\t\t\t// the frame-walk's standard rebase path still produces correct\n\t\t\t// rebased steps.\n\t\t\treturn IDENTITY_MAP;\n\t}\n}\n\n/**\n * Structural equality for {@link StepMap}s. Used by history to recognize\n * cancelling pairs in the rebase chain ({@link invertStepMap}(a) ≡ b).\n */\nexport function stepMapsEqual(a: StepMap, b: StepMap): boolean {\n\tif (a.type !== b.type) return false;\n\tswitch (a.type) {\n\t\tcase 'identity':\n\t\t\treturn true;\n\t\tcase 'shift': {\n\t\t\tconst bs = b as ShiftMap;\n\t\t\treturn (\n\t\t\t\ta.blockId === bs.blockId && a.from === bs.from && a.to === bs.to && a.newLen === bs.newLen\n\t\t\t);\n\t\t}\n\t\tcase 'split': {\n\t\t\tconst bs = b as SplitMap;\n\t\t\treturn a.blockId === bs.blockId && a.offset === bs.offset && a.newBlockId === bs.newBlockId;\n\t\t}\n\t\tcase 'merge': {\n\t\t\tconst bm = b as MergeMap;\n\t\t\treturn (\n\t\t\t\ta.targetBlockId === bm.targetBlockId &&\n\t\t\t\ta.sourceBlockId === bm.sourceBlockId &&\n\t\t\t\ta.targetLengthBefore === bm.targetLengthBefore\n\t\t\t);\n\t\t}\n\t\tcase 'blockRemoval': {\n\t\t\tconst br = b as BlockRemovalMap;\n\t\t\tif (a.index !== br.index) return false;\n\t\t\tif (!sameParentPath(a.parentPath, br.parentPath)) return false;\n\t\t\tif (a.removedBlockIds.size !== br.removedBlockIds.size) return false;\n\t\t\tfor (const id of a.removedBlockIds) {\n\t\t\t\tif (!br.removedBlockIds.has(id)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t\tcase 'childIndexShift': {\n\t\t\tconst cs = b as ChildIndexShiftMap;\n\t\t\treturn (\n\t\t\t\ta.fromIndex === cs.fromIndex &&\n\t\t\t\ta.delta === cs.delta &&\n\t\t\t\tsameParentPath(a.parentPath, cs.parentPath)\n\t\t\t);\n\t\t}\n\t}\n}\n","/**\n * Pure functions for recursive block-tree traversal and transformation.\n * Extracted from StepApplication.ts to keep files under ~500 lines.\n */\n\nimport { type BlockNode, type ChildNode, type Document, isBlockNode } from '../model/Document.js';\n\n/** Finds a block by ID anywhere in the tree and applies a transform. */\nexport function mapBlock(\n\tdoc: Document,\n\tblockId: string,\n\tfn: (block: BlockNode) => BlockNode,\n): Document {\n\treturn {\n\t\tchildren: mapBlockInChildren(doc.children, blockId, fn) as BlockNode[],\n\t};\n}\n\n/**\n * Recursively maps over children to find and transform a block by ID.\n *\n * Preserves reference identity: when the target block is not found in a given\n * subtree, the original `children` array (and the original child nodes along\n * the way) are returned unchanged, so unrelated subtrees are not reallocated on\n * every edit.\n */\nexport function mapBlockInChildren(\n\tchildren: readonly ChildNode[],\n\tblockId: string,\n\tfn: (block: BlockNode) => BlockNode,\n): ChildNode[] {\n\tlet changed = false;\n\tconst mapped: ChildNode[] = children.map((child) => {\n\t\tif (!isBlockNode(child)) return child;\n\t\tif (child.id === blockId) {\n\t\t\tchanged = true;\n\t\t\treturn fn(child);\n\t\t}\n\t\t// Recurse into block children; an unchanged subtree returns the same\n\t\t// `child.children` reference, so the identity check below holds.\n\t\tconst mappedChildren: ChildNode[] = mapBlockInChildren(child.children, blockId, fn);\n\t\tif (mappedChildren === child.children) return child;\n\t\tchanged = true;\n\t\treturn { ...child, children: mappedChildren };\n\t});\n\treturn changed ? mapped : (children as ChildNode[]);\n}\n\n/**\n * Maps a node at the given path, replacing it with the result of fn.\n * Navigates down the path immutably, creating new parent nodes as needed.\n */\nexport function mapNodeByPath(\n\tdoc: Document,\n\tpath: readonly string[],\n\tfn: (node: BlockNode) => BlockNode,\n): Document {\n\tif (path.length === 0) return doc;\n\n\tconst rootId: string | undefined = path[0];\n\tif (!rootId) return doc;\n\treturn {\n\t\tchildren: doc.children.map((child) => {\n\t\t\tif (!isBlockNode(child) || child.id !== rootId) return child;\n\t\t\tif (path.length === 1) return fn(child);\n\t\t\treturn mapNodeByPathRecursive(child, path, 1, fn);\n\t\t}),\n\t};\n}\n\n/** Recursive helper for mapNodeByPath — walks one level deeper. */\nexport function mapNodeByPathRecursive(\n\tnode: BlockNode,\n\tpath: readonly string[],\n\tdepth: number,\n\tfn: (node: BlockNode) => BlockNode,\n): BlockNode {\n\tconst targetId: string | undefined = path[depth];\n\tif (!targetId) return node;\n\tconst newChildren: ChildNode[] = node.children.map((child) => {\n\t\tif (!isBlockNode(child) || child.id !== targetId) return child;\n\t\tif (depth === path.length - 1) return fn(child);\n\t\treturn mapNodeByPathRecursive(child, path, depth + 1, fn);\n\t});\n\treturn { ...node, children: newChildren };\n}\n\n/**\n * Searches children for a level where `predicate` matches,\n * then applies `transform` at that level.\n * Recurses into nested BlockNodes if not found at the current level.\n *\n * Returns `null` if no matching level was found.\n */\nexport function findAndTransformChildren(\n\tchildren: readonly ChildNode[],\n\tpredicate: (children: readonly ChildNode[]) => boolean,\n\ttransform: (children: readonly ChildNode[]) => readonly ChildNode[],\n): readonly ChildNode[] | null {\n\tif (predicate(children)) {\n\t\treturn transform(children);\n\t}\n\n\tlet changed = false;\n\tconst newChildren: ChildNode[] = children.map((child) => {\n\t\tif (!isBlockNode(child)) return child;\n\t\tconst result: readonly ChildNode[] | null = findAndTransformChildren(\n\t\t\tchild.children,\n\t\t\tpredicate,\n\t\t\ttransform,\n\t\t);\n\t\tif (result) {\n\t\t\tchanged = true;\n\t\t\treturn { ...child, children: result };\n\t\t}\n\t\treturn child;\n\t});\n\n\treturn changed ? newChildren : null;\n}\n","/**\n * Pure functions for manipulating inline content (TextNode / InlineNode arrays).\n * Extracted from StepApplication.ts to keep files under ~500 lines.\n */\n\nimport {\n\ttype ChildNode,\n\ttype ContentSegment,\n\ttype InlineNode,\n\ttype Mark,\n\ttype TextNode,\n\taddMarkToSet,\n\tcontentSegmentToInlineNode,\n\tcreateTextNode,\n\tisInlineNode,\n\tisTextNode,\n\tmarksEqual,\n\tremoveMarkFromSet,\n} from '../model/Document.js';\nimport type { MarkTypeName } from '../model/TypeBrands.js';\n\n/**\n * Inserts text into mixed inline content at the given offset.\n * Handles both TextNode and InlineNode children.\n */\nexport function insertTextIntoInlineContent(\n\tnodes: readonly (TextNode | InlineNode)[],\n\toffset: number,\n\ttext: string,\n\tmarks: readonly Mark[],\n): (TextNode | InlineNode)[] {\n\treturn insertIntoInlineContent(nodes, offset, () => [createTextNode(text, marks)]);\n}\n\n/**\n * Inserts content segments (text and inline nodes) into mixed inline content\n * at the given offset. Inline segments are restored as atomic nodes, so this\n * round-trips the payload captured by `getBlockContentSegmentsInRange`.\n */\nexport function insertSegmentsIntoInlineContent(\n\tnodes: readonly (TextNode | InlineNode)[],\n\toffset: number,\n\tsegments: readonly ContentSegment[],\n): (TextNode | InlineNode)[] {\n\treturn insertIntoInlineContent(nodes, offset, () => segments.map(contentSegmentToInlineNode));\n}\n\n/** Shared insertion logic for text and segments into mixed inline content. */\nfunction insertIntoInlineContent(\n\tnodes: readonly (TextNode | InlineNode)[],\n\toffset: number,\n\tcreateInsertedNodes: () => readonly (TextNode | InlineNode)[],\n): (TextNode | InlineNode)[] {\n\tconst result: (TextNode | InlineNode)[] = [];\n\tlet pos = 0;\n\tlet inserted = false;\n\n\tfor (const node of nodes) {\n\t\tif (isInlineNode(node)) {\n\t\t\tif (!inserted && offset === pos) {\n\t\t\t\tresult.push(...createInsertedNodes());\n\t\t\t\tinserted = true;\n\t\t\t}\n\t\t\tresult.push(node);\n\t\t\tpos += 1;\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst nodeEnd: number = pos + node.text.length;\n\n\t\tif (!inserted && offset >= pos && offset <= nodeEnd) {\n\t\t\tconst localOffset: number = offset - pos;\n\t\t\tconst before: string = node.text.slice(0, localOffset);\n\t\t\tconst after: string = node.text.slice(localOffset);\n\n\t\t\tif (before) result.push(createTextNode(before, node.marks));\n\t\t\tresult.push(...createInsertedNodes());\n\t\t\tif (after) result.push(createTextNode(after, node.marks));\n\t\t\tinserted = true;\n\t\t} else {\n\t\t\tresult.push(node);\n\t\t}\n\n\t\tpos = nodeEnd;\n\t}\n\n\tif (!inserted) {\n\t\tresult.push(...createInsertedNodes());\n\t}\n\n\treturn result;\n}\n\n/**\n * Deletes content from mixed inline content in the given range.\n * Removes InlineNodes that fall within the range.\n */\nexport function deleteFromInlineContent(\n\tnodes: readonly (TextNode | InlineNode)[],\n\tfrom: number,\n\tto: number,\n): (TextNode | InlineNode)[] {\n\tconst result: (TextNode | InlineNode)[] = [];\n\tlet pos = 0;\n\n\tfor (const node of nodes) {\n\t\tif (isInlineNode(node)) {\n\t\t\tconst nodeEnd: number = pos + 1;\n\t\t\t// Keep if outside the delete range\n\t\t\tif (nodeEnd <= from || pos >= to) {\n\t\t\t\tresult.push(node);\n\t\t\t}\n\t\t\tpos = nodeEnd;\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst nodeEnd: number = pos + node.text.length;\n\n\t\tif (nodeEnd <= from || pos >= to) {\n\t\t\tresult.push(node);\n\t\t} else {\n\t\t\tconst deleteFrom: number = Math.max(0, from - pos);\n\t\t\tconst deleteTo: number = Math.min(node.text.length, to - pos);\n\t\t\tconst remaining: string = node.text.slice(0, deleteFrom) + node.text.slice(deleteTo);\n\t\t\tif (remaining.length > 0) {\n\t\t\t\tresult.push(createTextNode(remaining, node.marks));\n\t\t\t}\n\t\t}\n\n\t\tpos = nodeEnd;\n\t}\n\n\treturn result;\n}\n\n/**\n * Slices mixed inline content to the given range.\n * InlineNodes are preserved as atoms (included if within range).\n */\nexport function sliceInlineContent(\n\tnodes: readonly (TextNode | InlineNode)[],\n\tfrom: number,\n\tto: number,\n): (TextNode | InlineNode)[] {\n\tconst result: (TextNode | InlineNode)[] = [];\n\tlet pos = 0;\n\n\tfor (const node of nodes) {\n\t\tif (isInlineNode(node)) {\n\t\t\tconst nodeEnd: number = pos + 1;\n\t\t\tif (nodeEnd > from && pos < to) {\n\t\t\t\tresult.push(node);\n\t\t\t}\n\t\t\tpos = nodeEnd;\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst nodeEnd: number = pos + node.text.length;\n\n\t\tif (nodeEnd <= from || pos >= to) {\n\t\t\t// Outside the slice range\n\t\t} else {\n\t\t\tconst sliceFrom: number = Math.max(0, from - pos);\n\t\t\tconst sliceTo: number = Math.min(node.text.length, to - pos);\n\t\t\tconst text: string = node.text.slice(sliceFrom, sliceTo);\n\t\t\tif (text.length > 0) {\n\t\t\t\tresult.push(createTextNode(text, node.marks));\n\t\t\t}\n\t\t}\n\n\t\tpos = nodeEnd;\n\t}\n\n\tif (result.length === 0) {\n\t\tresult.push(createTextNode(''));\n\t}\n\n\treturn result;\n}\n\n/**\n * Applies or removes a mark from mixed inline content in the given range.\n * InlineNodes are passed through unchanged (marks only apply to text).\n */\nexport function applyMarkToInlineContent(\n\tnodes: readonly (TextNode | InlineNode)[],\n\tfrom: number,\n\tto: number,\n\tmark: Mark,\n\tadd: boolean,\n): (TextNode | InlineNode)[] {\n\tconst result: (TextNode | InlineNode)[] = [];\n\tlet pos = 0;\n\n\tfor (const node of nodes) {\n\t\tif (isInlineNode(node)) {\n\t\t\tresult.push(node);\n\t\t\tpos += 1;\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst nodeEnd: number = pos + node.text.length;\n\n\t\tif (nodeEnd <= from || pos >= to) {\n\t\t\tresult.push(node);\n\t\t} else if (pos >= from && nodeEnd <= to) {\n\t\t\tconst newMarks: readonly Mark[] = add\n\t\t\t\t? addMarkToSet(node.marks, mark)\n\t\t\t\t: removeMarkFromSet(node.marks, mark.type);\n\t\t\tresult.push(createTextNode(node.text, newMarks));\n\t\t} else {\n\t\t\tconst overlapStart: number = Math.max(0, from - pos);\n\t\t\tconst overlapEnd: number = Math.min(node.text.length, to - pos);\n\n\t\t\tconst beforeText: string = node.text.slice(0, overlapStart);\n\t\t\tconst insideText: string = node.text.slice(overlapStart, overlapEnd);\n\t\t\tconst afterText: string = node.text.slice(overlapEnd);\n\n\t\t\tif (beforeText) result.push(createTextNode(beforeText, node.marks));\n\t\t\tif (insideText) {\n\t\t\t\tconst newMarks: readonly Mark[] = add\n\t\t\t\t\t? addMarkToSet(node.marks, mark)\n\t\t\t\t\t: removeMarkFromSet(node.marks, mark.type);\n\t\t\t\tresult.push(createTextNode(insideText, newMarks));\n\t\t\t}\n\t\t\tif (afterText) result.push(createTextNode(afterText, node.marks));\n\t\t}\n\n\t\tpos = nodeEnd;\n\t}\n\n\treturn result;\n}\n\n/**\n * Maximal sub-ranges within [from, to) where no text node carries a mark\n * of type `markType`. InlineNodes are inert: they pass through and do not\n * break coalescing, but a range never starts on an InlineNode.\n *\n * Used by `TransactionBuilder.addMark` to emit `AddMarkStep`s only over\n * sub-ranges that actually lack the mark, so the symmetric inverse\n * preserves any marks that pre-existed.\n */\nexport function findRangesMissingMark(\n\tnodes: readonly (TextNode | InlineNode)[],\n\tfrom: number,\n\tto: number,\n\tmarkType: MarkTypeName,\n): readonly { readonly from: number; readonly to: number }[] {\n\tconst result: { from: number; to: number }[] = [];\n\tif (from >= to) return result;\n\tlet current: { from: number; to: number } | null = null;\n\tlet pos = 0;\n\n\tconst flush = (): void => {\n\t\tif (current) {\n\t\t\tresult.push(current);\n\t\t\tcurrent = null;\n\t\t}\n\t};\n\n\tfor (const node of nodes) {\n\t\tconst nodeLength: number = isInlineNode(node) ? 1 : node.text.length;\n\t\tconst nodeEnd: number = pos + nodeLength;\n\n\t\tif (nodeEnd <= from || pos >= to) {\n\t\t\tpos = nodeEnd;\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst overlapStart: number = Math.max(pos, from);\n\t\tconst overlapEnd: number = Math.min(nodeEnd, to);\n\n\t\tif (isInlineNode(node)) {\n\t\t\tif (current) current.to = overlapEnd;\n\t\t} else if (node.marks.some((m) => m.type === markType)) {\n\t\t\tflush();\n\t\t} else if (current) {\n\t\t\tcurrent.to = overlapEnd;\n\t\t} else {\n\t\t\tcurrent = { from: overlapStart, to: overlapEnd };\n\t\t}\n\n\t\tpos = nodeEnd;\n\t}\n\n\tflush();\n\treturn result;\n}\n\n/**\n * Maximal sub-ranges within [from, to) where every text node carries a mark\n * of type `markType`. Each range is paired with the actual mark from the\n * document (including attrs). Adjacent sub-ranges coalesce only when their\n * marks are `marksEqual`. InlineNodes are inert: they pass through and do\n * not break coalescing, but a range never starts on an InlineNode.\n *\n * Used by `TransactionBuilder.removeMark` to emit `RemoveMarkStep`s whose\n * `mark` reflects the actual document content, so the symmetric inverse\n * restores attrs faithfully.\n */\nexport function findRangesWithMark(\n\tnodes: readonly (TextNode | InlineNode)[],\n\tfrom: number,\n\tto: number,\n\tmarkType: MarkTypeName,\n): readonly { readonly from: number; readonly to: number; readonly mark: Mark }[] {\n\tconst result: { from: number; to: number; mark: Mark }[] = [];\n\tif (from >= to) return result;\n\tlet current: { from: number; to: number; mark: Mark } | null = null;\n\tlet pos = 0;\n\n\tconst flush = (): void => {\n\t\tif (current) {\n\t\t\tresult.push(current);\n\t\t\tcurrent = null;\n\t\t}\n\t};\n\n\tfor (const node of nodes) {\n\t\tconst nodeLength: number = isInlineNode(node) ? 1 : node.text.length;\n\t\tconst nodeEnd: number = pos + nodeLength;\n\n\t\tif (nodeEnd <= from || pos >= to) {\n\t\t\tpos = nodeEnd;\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst overlapStart: number = Math.max(pos, from);\n\t\tconst overlapEnd: number = Math.min(nodeEnd, to);\n\n\t\tif (isInlineNode(node)) {\n\t\t\tif (current) current.to = overlapEnd;\n\t\t} else {\n\t\t\tconst actual: Mark | undefined = node.marks.find((m) => m.type === markType);\n\t\t\tif (!actual) {\n\t\t\t\tflush();\n\t\t\t} else if (current && marksEqual(current.mark, actual)) {\n\t\t\t\tcurrent.to = overlapEnd;\n\t\t\t} else {\n\t\t\t\tflush();\n\t\t\t\tcurrent = { from: overlapStart, to: overlapEnd, mark: actual };\n\t\t\t}\n\t\t}\n\n\t\tpos = nodeEnd;\n\t}\n\n\tflush();\n\treturn result;\n}\n\n/** Inserts an InlineNode at the given offset in mixed inline content. */\nexport function insertInlineNodeAtOffset(\n\tnodes: readonly (TextNode | InlineNode)[],\n\toffset: number,\n\tinlineNode: InlineNode,\n): (TextNode | InlineNode)[] {\n\tconst result: (TextNode | InlineNode)[] = [];\n\tlet pos = 0;\n\tlet inserted = false;\n\n\tfor (const node of nodes) {\n\t\tif (isInlineNode(node)) {\n\t\t\tif (!inserted && offset === pos) {\n\t\t\t\tresult.push(inlineNode);\n\t\t\t\tinserted = true;\n\t\t\t}\n\t\t\tresult.push(node);\n\t\t\tpos += 1;\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst nodeEnd: number = pos + node.text.length;\n\n\t\tif (!inserted && offset >= pos && offset <= nodeEnd) {\n\t\t\tconst localOffset: number = offset - pos;\n\t\t\tconst before: string = node.text.slice(0, localOffset);\n\t\t\tconst after: string = node.text.slice(localOffset);\n\n\t\t\tif (before) result.push(createTextNode(before, node.marks));\n\t\t\tresult.push(inlineNode);\n\t\t\tif (after) result.push(createTextNode(after, node.marks));\n\t\t\tinserted = true;\n\t\t} else {\n\t\t\tresult.push(node);\n\t\t}\n\n\t\tpos = nodeEnd;\n\t}\n\n\tif (!inserted) {\n\t\tresult.push(inlineNode);\n\t}\n\n\treturn result;\n}\n\n/** Removes the InlineNode at the given offset from mixed inline content. */\nexport function removeInlineNodeAtOffset(\n\tnodes: readonly (TextNode | InlineNode)[],\n\toffset: number,\n): (TextNode | InlineNode)[] {\n\tconst result: (TextNode | InlineNode)[] = [];\n\tlet pos = 0;\n\n\tfor (const node of nodes) {\n\t\tif (isInlineNode(node)) {\n\t\t\tif (pos !== offset) {\n\t\t\t\tresult.push(node);\n\t\t\t}\n\t\t\tpos += 1;\n\t\t\tcontinue;\n\t\t}\n\t\tresult.push(node);\n\t\tpos += node.text.length;\n\t}\n\n\treturn result;\n}\n\n/** Replaces the attrs of an InlineNode at the given offset. */\nexport function setInlineNodeAttrsAtOffset(\n\tnodes: readonly (TextNode | InlineNode)[],\n\toffset: number,\n\tattrs: Readonly<Record<string, string | number | boolean>>,\n): (TextNode | InlineNode)[] {\n\tconst result: (TextNode | InlineNode)[] = [];\n\tlet pos = 0;\n\n\tfor (const node of nodes) {\n\t\tif (isInlineNode(node)) {\n\t\t\tif (pos === offset) {\n\t\t\t\tresult.push({ ...node, attrs });\n\t\t\t} else {\n\t\t\t\tresult.push(node);\n\t\t\t}\n\t\t\tpos += 1;\n\t\t\tcontinue;\n\t\t}\n\t\tresult.push(node);\n\t\tpos += node.text.length;\n\t}\n\n\treturn result;\n}\n\n/**\n * Replaces the inline content children of a ChildNode array,\n * preserving any BlockNode children in their original positions.\n */\nexport function replaceInlineChildren(\n\toriginal: readonly ChildNode[],\n\tnewInlineChildren: readonly (TextNode | InlineNode)[],\n): readonly ChildNode[] {\n\t// Fast path: if no block children exist, just return new inline nodes\n\tif (original.every((c) => isTextNode(c) || isInlineNode(c))) {\n\t\treturn newInlineChildren;\n\t}\n\t// Mixed: put inline nodes first, then block nodes (preserves structure)\n\tconst blockChildren: ChildNode[] = original.filter((c) => !isTextNode(c) && !isInlineNode(c));\n\treturn [...newInlineChildren, ...blockChildren];\n}\n","/**\n * Per-step apply functions: each transforms a Document by applying a single\n * Step of the matching type. Dispatch lives in `StepHandlers.ts`, which pairs\n * each function with its inverse counterpart in `StepInversion.ts`.\n */\n\nimport {\n\ttype BlockAttrs,\n\ttype BlockNode,\n\ttype ChildNode,\n\ttype Document,\n\ttype InlineNode,\n\ttype TextNode,\n\tcreateBlockNode,\n\tgetBlockLength,\n\tgetInlineChildren,\n\tisBlockNode,\n\tnormalizeInlineContent,\n} from '../model/Document.js';\nimport type { NodeTypeName } from '../model/TypeBrands.js';\nimport { findAndTransformChildren, mapBlock, mapNodeByPath } from './BlockTreeOps.js';\nimport {\n\tapplyMarkToInlineContent,\n\tdeleteFromInlineContent,\n\tinsertInlineNodeAtOffset,\n\tinsertSegmentsIntoInlineContent,\n\tinsertTextIntoInlineContent,\n\tremoveInlineNodeAtOffset,\n\treplaceInlineChildren,\n\tsetInlineNodeAttrsAtOffset,\n\tsliceInlineContent,\n} from './InlineContentOps.js';\nimport type {\n\tAddMarkStep,\n\tDeleteTextStep,\n\tInsertInlineNodeStep,\n\tInsertNodeStep,\n\tInsertTextStep,\n\tMergeBlocksStep,\n\tRemoveInlineNodeStep,\n\tRemoveMarkStep,\n\tRemoveNodeStep,\n\tSetBlockTypeStep,\n\tSetInlineNodeAttrStep,\n\tSetNodeAttrStep,\n\tSplitBlockStep,\n} from './Transaction.js';\n\nexport function applyInsertText(doc: Document, step: InsertTextStep): Document {\n\treturn mapBlockInlineContent(doc, step.blockId, (inline) =>\n\t\tstep.segments\n\t\t\t? insertSegmentsIntoInlineContent(inline, step.offset, step.segments)\n\t\t\t: insertTextIntoInlineContent(inline, step.offset, step.text, step.marks),\n\t);\n}\n\nexport function applyDeleteText(doc: Document, step: DeleteTextStep): Document {\n\treturn mapBlockInlineContent(doc, step.blockId, (inline) =>\n\t\tdeleteFromInlineContent(inline, step.from, step.to),\n\t);\n}\n\nexport function applySplitBlock(doc: Document, step: SplitBlockStep): Document {\n\tconst splitAtLevel = (children: readonly ChildNode[]): readonly ChildNode[] => {\n\t\tconst blockIndex: number = children.findIndex((c) => isBlockNode(c) && c.id === step.blockId);\n\t\tif (blockIndex === -1) return children;\n\n\t\tconst block: BlockNode = children[blockIndex] as BlockNode;\n\t\tconst inlineChildren: readonly (TextNode | InlineNode)[] = getInlineChildren(block);\n\t\tconst len: number = getBlockLength(block);\n\t\tconst nodesBeforeSplit: (TextNode | InlineNode)[] = sliceInlineContent(\n\t\t\tinlineChildren,\n\t\t\t0,\n\t\t\tstep.offset,\n\t\t);\n\t\tconst nodesAfterSplit: (TextNode | InlineNode)[] = sliceInlineContent(\n\t\t\tinlineChildren,\n\t\t\tstep.offset,\n\t\t\tlen,\n\t\t);\n\n\t\tconst updatedBlock: BlockNode = {\n\t\t\t...block,\n\t\t\tchildren: normalizeInlineContent(nodesBeforeSplit),\n\t\t};\n\n\t\t// When the step carries overrides (typically produced by inverting a\n\t\t// cross-type merge), use the captured source identity verbatim so\n\t\t// undo restores the original block. An absent override means the new\n\t\t// block inherits the target block's type/attrs, matching the natural\n\t\t// outcome of a user-initiated split.\n\t\tconst hasOverride: boolean = step.newBlockType !== undefined;\n\t\tconst newType: NodeTypeName = step.newBlockType ?? block.type;\n\t\tconst newAttrs: BlockAttrs | undefined = hasOverride ? step.newBlockAttrs : block.attrs;\n\n\t\tconst newBlock: BlockNode = createBlockNode(\n\t\t\tnewType,\n\t\t\tnormalizeInlineContent(nodesAfterSplit),\n\t\t\tstep.newBlockId,\n\t\t\tnewAttrs,\n\t\t);\n\n\t\tconst result: ChildNode[] = [...children];\n\t\tresult.splice(blockIndex, 1, updatedBlock, newBlock);\n\t\treturn result;\n\t};\n\n\tconst hasTarget = (children: readonly ChildNode[]): boolean =>\n\t\tchildren.some((c) => isBlockNode(c) && c.id === step.blockId);\n\n\tconst transformed: readonly ChildNode[] | null = findAndTransformChildren(\n\t\tdoc.children,\n\t\thasTarget,\n\t\tsplitAtLevel,\n\t);\n\treturn transformed ? { children: transformed as BlockNode[] } : doc;\n}\n\nexport function applyMergeBlocks(doc: Document, step: MergeBlocksStep): Document {\n\tconst mergeAtLevel = (children: readonly ChildNode[]): readonly ChildNode[] => {\n\t\tconst targetIdx: number = children.findIndex(\n\t\t\t(c) => isBlockNode(c) && c.id === step.targetBlockId,\n\t\t);\n\t\tconst sourceIdx: number = children.findIndex(\n\t\t\t(c) => isBlockNode(c) && c.id === step.sourceBlockId,\n\t\t);\n\t\tif (targetIdx === -1 || sourceIdx === -1) return children;\n\n\t\tconst target: BlockNode = children[targetIdx] as BlockNode;\n\t\tconst source: BlockNode = children[sourceIdx] as BlockNode;\n\t\tconst targetInline: readonly (TextNode | InlineNode)[] = getInlineChildren(target);\n\t\tconst sourceInline: readonly (TextNode | InlineNode)[] = getInlineChildren(source);\n\t\tconst mergedChildren: readonly (TextNode | InlineNode)[] = normalizeInlineContent([\n\t\t\t...targetInline,\n\t\t\t...sourceInline,\n\t\t]);\n\t\tconst mergedBlock: BlockNode = { ...target, children: mergedChildren };\n\n\t\tconst filtered: ChildNode[] = children.filter(\n\t\t\t(c) => !isBlockNode(c) || c.id !== step.sourceBlockId,\n\t\t);\n\t\treturn filtered.map((c) => (isBlockNode(c) && c.id === step.targetBlockId ? mergedBlock : c));\n\t};\n\n\tconst hasTargetAndSource = (children: readonly ChildNode[]): boolean =>\n\t\tchildren.some((c) => isBlockNode(c) && c.id === step.targetBlockId) &&\n\t\tchildren.some((c) => isBlockNode(c) && c.id === step.sourceBlockId);\n\n\tconst transformed: readonly ChildNode[] | null = findAndTransformChildren(\n\t\tdoc.children,\n\t\thasTargetAndSource,\n\t\tmergeAtLevel,\n\t);\n\treturn transformed ? { children: transformed as BlockNode[] } : doc;\n}\n\nexport function applyAddMark(doc: Document, step: AddMarkStep): Document {\n\treturn mapBlockInlineContent(doc, step.blockId, (inline) =>\n\t\tapplyMarkToInlineContent(inline, step.from, step.to, step.mark, true),\n\t);\n}\n\nexport function applyRemoveMark(doc: Document, step: RemoveMarkStep): Document {\n\treturn mapBlockInlineContent(doc, step.blockId, (inline) =>\n\t\tapplyMarkToInlineContent(inline, step.from, step.to, step.mark, false),\n\t);\n}\n\n/**\n * Stored marks live on EditorState, not on the Document, so applying this\n * step at the document level is a no-op. The state-level update happens in\n * `EditorState.apply()`.\n */\nexport function applySetStoredMarks(doc: Document): Document {\n\treturn doc;\n}\n\n// --- InlineNode Step Application ---\n\nexport function applyInsertInlineNode(doc: Document, step: InsertInlineNodeStep): Document {\n\treturn mapBlockInlineContent(doc, step.blockId, (inline) =>\n\t\tinsertInlineNodeAtOffset(inline, step.offset, step.node),\n\t);\n}\n\nexport function applyRemoveInlineNode(doc: Document, step: RemoveInlineNodeStep): Document {\n\treturn mapBlockInlineContent(doc, step.blockId, (inline) =>\n\t\tremoveInlineNodeAtOffset(inline, step.offset),\n\t);\n}\n\nexport function applySetInlineNodeAttr(doc: Document, step: SetInlineNodeAttrStep): Document {\n\treturn mapBlockInlineContent(\n\t\tdoc,\n\t\tstep.blockId,\n\t\t(inline) => setInlineNodeAttrsAtOffset(inline, step.offset, step.attrs),\n\t\tfalse,\n\t);\n}\n\n/** Maps inline content of a block, optionally normalizing the result. */\nfunction mapBlockInlineContent(\n\tdoc: Document,\n\tblockId: string,\n\tfn: (inline: readonly (TextNode | InlineNode)[]) => (TextNode | InlineNode)[],\n\tnormalize = true,\n): Document {\n\treturn mapBlock(doc, blockId, (block) => {\n\t\tconst inlineChildren: readonly (TextNode | InlineNode)[] = getInlineChildren(block);\n\t\tconst newChildren: (TextNode | InlineNode)[] = fn(inlineChildren);\n\t\treturn {\n\t\t\t...block,\n\t\t\tchildren: replaceInlineChildren(\n\t\t\t\tblock.children,\n\t\t\t\tnormalize ? normalizeInlineContent(newChildren) : newChildren,\n\t\t\t),\n\t\t};\n\t});\n}\n\nexport function applySetBlockType(doc: Document, step: SetBlockTypeStep): Document {\n\treturn mapBlock(doc, step.blockId, (block) => {\n\t\tconst { attrs: _previousAttrs, ...rest } = block;\n\t\treturn {\n\t\t\t...rest,\n\t\t\ttype: step.nodeType,\n\t\t\t...(step.attrs ? { attrs: step.attrs } : {}),\n\t\t};\n\t});\n}\n\n// --- Structural Step Application ---\n\nexport function applyInsertNode(doc: Document, step: InsertNodeStep): Document {\n\tif (step.parentPath.length === 0) {\n\t\t// Insert at document root\n\t\tconst newChildren: BlockNode[] = [...doc.children];\n\t\tnewChildren.splice(step.index, 0, step.node);\n\t\treturn { children: newChildren };\n\t}\n\n\treturn mapNodeByPath(doc, step.parentPath, (parent) => {\n\t\tconst newChildren: ChildNode[] = [...parent.children];\n\t\tnewChildren.splice(step.index, 0, step.node);\n\t\treturn { ...parent, children: newChildren };\n\t});\n}\n\nexport function applyRemoveNode(doc: Document, step: RemoveNodeStep): Document {\n\tif (step.parentPath.length === 0) {\n\t\t// Remove from document root\n\t\tconst newChildren: BlockNode[] = [...doc.children];\n\t\tnewChildren.splice(step.index, 1);\n\t\treturn { children: newChildren };\n\t}\n\n\treturn mapNodeByPath(doc, step.parentPath, (parent) => {\n\t\tconst newChildren: ChildNode[] = [...parent.children];\n\t\tnewChildren.splice(step.index, 1);\n\t\treturn { ...parent, children: newChildren };\n\t});\n}\n\nexport function applySetNodeAttr(doc: Document, step: SetNodeAttrStep): Document {\n\tconst nodeId: string | undefined = step.path[step.path.length - 1];\n\tif (!nodeId) return doc;\n\n\treturn mapBlock(doc, nodeId, (block) => ({\n\t\t...block,\n\t\tattrs: step.attrs,\n\t}));\n}\n","/**\n * ContentSlice: an immutable fragment of document content for paste operations.\n * Represents \"what to insert\" independent of where it will be inserted.\n */\n\nimport type { BlockAttrs, ContentSegment } from './Document.js';\nimport { textSegment } from './Document.js';\nimport type { NodeTypeName } from './TypeBrands.js';\nimport { nodeType } from './TypeBrands.js';\n\nexport interface SliceBlock {\n\treadonly type: NodeTypeName;\n\treadonly attrs?: BlockAttrs;\n\t/** Inline content: text segments (with marks) and atomic inline nodes. */\n\treadonly segments: readonly ContentSegment[];\n}\n\nexport interface ContentSlice {\n\treadonly blocks: readonly SliceBlock[];\n}\n\n/** Returns the offset-space length of a block's segments (inline nodes count as 1). */\nexport function segmentsLength(segments: readonly ContentSegment[]): number {\n\treturn segments.reduce(\n\t\t(acc: number, s: ContentSegment) => acc + (s.kind === 'inline' ? 1 : s.text.length),\n\t\t0,\n\t);\n}\n\n/** Creates a content slice from plain text, one paragraph block per line. */\nexport function plainTextSlice(text: string): ContentSlice {\n\tconst lines: readonly string[] = text.split(/\\r?\\n/);\n\treturn {\n\t\tblocks: lines.map(\n\t\t\t(line: string): SliceBlock => ({\n\t\t\t\ttype: nodeType('paragraph'),\n\t\t\t\tsegments: [textSegment(line)],\n\t\t\t}),\n\t\t),\n\t};\n}\n","/**\n * Step type definitions for the transaction system.\n * Each step represents an atomic, invertible change to the document.\n */\n\nimport { segmentsLength } from '../model/ContentSlice.js';\nimport type { BlockAttrs, BlockNode, ContentSegment, InlineNode, Mark } from '../model/Document.js';\nimport type { BlockId, NodeTypeName } from '../model/TypeBrands.js';\n\nexport interface InsertTextStep {\n\treadonly type: 'insertText';\n\treadonly blockId: BlockId;\n\treadonly offset: number;\n\treadonly text: string;\n\treadonly marks: readonly Mark[];\n\t/**\n\t * Optional per-segment payload (text with marks, or atomic inline nodes).\n\t * When present it supersedes `text`/`marks` on apply, so it must carry the\n\t * full content, including any inline nodes, for paste and delete-undo to\n\t * round-trip faithfully.\n\t */\n\treadonly segments?: readonly ContentSegment[];\n\treadonly path?: readonly BlockId[];\n}\n\nexport interface DeleteTextStep {\n\treadonly type: 'deleteText';\n\treadonly blockId: BlockId;\n\treadonly from: number;\n\treadonly to: number;\n\treadonly deletedText: string;\n\treadonly deletedMarks: readonly Mark[];\n\t/** Full deleted content (text and inline nodes) so undo restores both. */\n\treadonly deletedSegments: readonly ContentSegment[];\n\treadonly path?: readonly BlockId[];\n}\n\nexport interface SplitBlockStep {\n\treadonly type: 'splitBlock';\n\treadonly blockId: BlockId;\n\treadonly offset: number;\n\treadonly newBlockId: BlockId;\n\t/**\n\t * Override for the new block's node type. When present, the new block is\n\t * created with this type instead of inheriting from the target. Populated\n\t * by {@link invertMergeBlocks} so undo can restore the original source\n\t * block's identity across cross-type merges.\n\t */\n\treadonly newBlockType?: NodeTypeName;\n\t/**\n\t * Override for the new block's attrs. Only consulted when\n\t * {@link newBlockType} is also present; the override pair is taken\n\t * as-is (an absent value here means \"the source block had no attrs\").\n\t */\n\treadonly newBlockAttrs?: BlockAttrs;\n\treadonly path?: readonly BlockId[];\n}\n\nexport interface MergeBlocksStep {\n\treadonly type: 'mergeBlocks';\n\treadonly targetBlockId: BlockId;\n\treadonly sourceBlockId: BlockId;\n\treadonly targetLengthBefore: number;\n\t/**\n\t * Source block's node type at merge time. Captured by the builder so the\n\t * inverse split can restore the source block with its original identity.\n\t */\n\treadonly sourceType?: NodeTypeName;\n\t/** Source block's attrs at merge time, if any. */\n\treadonly sourceAttrs?: BlockAttrs;\n\treadonly path?: readonly BlockId[];\n}\n\n/**\n * Adds `mark` to every text node in `[from, to)`.\n *\n * **Builder invariant** (enforced by `TransactionBuilder.addMark`): the range\n * carries no text node with a mark of `mark.type`. Steps emitted under this\n * invariant invert exactly to a `RemoveMarkStep` over the same range, so undo\n * cannot strip pre-existing marks. Direct step construction (rare; e.g.\n * middleware) must uphold the same precondition.\n */\nexport interface AddMarkStep {\n\treadonly type: 'addMark';\n\treadonly blockId: BlockId;\n\treadonly from: number;\n\treadonly to: number;\n\treadonly mark: Mark;\n\treadonly path?: readonly BlockId[];\n}\n\n/**\n * Removes the mark of `mark.type` from every text node in `[from, to)`.\n *\n * **Builder invariant** (enforced by `TransactionBuilder.removeMark`): every\n * text node in the range carries exactly `mark` (deep equality, including\n * attrs). The `mark` field therefore stores the actual document mark, which\n * the symmetric inverse (`AddMarkStep`) re-adds verbatim, preserving attrs\n * through undo. Direct step construction must uphold the same precondition.\n */\nexport interface RemoveMarkStep {\n\treadonly type: 'removeMark';\n\treadonly blockId: BlockId;\n\treadonly from: number;\n\treadonly to: number;\n\treadonly mark: Mark;\n\treadonly path?: readonly BlockId[];\n}\n\nexport interface SetStoredMarksStep {\n\treadonly type: 'setStoredMarks';\n\treadonly marks: readonly Mark[] | null;\n\treadonly previousMarks: readonly Mark[] | null;\n}\n\nexport interface SetBlockTypeStep {\n\treadonly type: 'setBlockType';\n\treadonly blockId: BlockId;\n\treadonly nodeType: NodeTypeName;\n\treadonly attrs?: BlockAttrs;\n\treadonly previousNodeType: NodeTypeName;\n\treadonly previousAttrs?: BlockAttrs;\n\treadonly path?: readonly BlockId[];\n}\n\n// --- Structural Steps (for nested documents) ---\n\nexport interface InsertNodeStep {\n\treadonly type: 'insertNode';\n\treadonly parentPath: readonly BlockId[];\n\treadonly index: number;\n\treadonly node: BlockNode;\n}\n\nexport interface RemoveNodeStep {\n\treadonly type: 'removeNode';\n\treadonly parentPath: readonly BlockId[];\n\treadonly index: number;\n\treadonly removedNode: BlockNode;\n}\n\nexport interface SetNodeAttrStep {\n\treadonly type: 'setNodeAttr';\n\treadonly path: readonly BlockId[];\n\treadonly attrs: BlockAttrs | undefined;\n\treadonly previousAttrs?: BlockAttrs;\n}\n\n// --- InlineNode Steps ---\n\nexport interface InsertInlineNodeStep {\n\treadonly type: 'insertInlineNode';\n\treadonly blockId: BlockId;\n\treadonly offset: number;\n\treadonly node: InlineNode;\n\treadonly path?: readonly BlockId[];\n}\n\nexport interface RemoveInlineNodeStep {\n\treadonly type: 'removeInlineNode';\n\treadonly blockId: BlockId;\n\treadonly offset: number;\n\treadonly removedNode: InlineNode;\n\treadonly path?: readonly BlockId[];\n}\n\nexport interface SetInlineNodeAttrStep {\n\treadonly type: 'setInlineNodeAttr';\n\treadonly blockId: BlockId;\n\treadonly offset: number;\n\treadonly attrs: Readonly<Record<string, string | number | boolean>>;\n\treadonly previousAttrs: Readonly<Record<string, string | number | boolean>>;\n\treadonly path?: readonly BlockId[];\n}\n\nexport type Step =\n\t| InsertTextStep\n\t| DeleteTextStep\n\t| SplitBlockStep\n\t| MergeBlocksStep\n\t| AddMarkStep\n\t| RemoveMarkStep\n\t| SetStoredMarksStep\n\t| SetBlockTypeStep\n\t| InsertNodeStep\n\t| RemoveNodeStep\n\t| SetNodeAttrStep\n\t| InsertInlineNodeStep\n\t| RemoveInlineNodeStep\n\t| SetInlineNodeAttrStep;\n\nexport type TransactionOrigin = 'input' | 'paste' | 'command' | 'history' | 'api';\n\n/**\n * Block-space width an {@link InsertTextStep} occupies once applied. When the\n * step carries `segments` (which may include inline nodes, each width 1), the\n * width is the segment span, not the plain-text length, because `applyInsertText`\n * inserts the segments verbatim. The inverse delete range ({@link invertInsertText})\n * and the forward position map ({@link getMapInsertText}) must both use this so\n * undo/redo of a deletion that removed inline content round-trips without\n * corrupting positions.\n */\nexport function insertTextStepWidth(step: InsertTextStep): number {\n\treturn step.segments ? segmentsLength(step.segments) : step.text.length;\n}\n","/**\n * Per-step invert functions: each returns the inverse of a single step\n * for undo/redo support. Dispatch and transaction-level inversion live in\n * `StepHandlers.ts`, which pairs each function with its forward counterpart\n * in `StepApplication.ts`.\n */\n\nimport type { Mark } from '../model/Document.js';\nimport { textSegment } from '../model/Document.js';\nimport type { BlockId } from '../model/TypeBrands.js';\nimport { insertTextStepWidth } from './Steps.js';\nimport type {\n\tAddMarkStep,\n\tDeleteTextStep,\n\tInsertInlineNodeStep,\n\tInsertNodeStep,\n\tInsertTextStep,\n\tMergeBlocksStep,\n\tRemoveInlineNodeStep,\n\tRemoveMarkStep,\n\tRemoveNodeStep,\n\tSetBlockTypeStep,\n\tSetInlineNodeAttrStep,\n\tSetNodeAttrStep,\n\tSetStoredMarksStep,\n\tSplitBlockStep,\n\tStep,\n} from './Steps.js';\nimport type { Transaction } from './Transaction.js';\n\n/** Returns a path spread object if the step has a path, or empty object otherwise. */\nfunction optionalPath(step: { readonly path?: readonly BlockId[] }):\n\t| { readonly path: readonly BlockId[] }\n\t| Record<string, never> {\n\treturn step.path ? { path: step.path } : {};\n}\n\nexport function invertInsertText(step: InsertTextStep): Step {\n\treturn {\n\t\ttype: 'deleteText',\n\t\tblockId: step.blockId,\n\t\tfrom: step.offset,\n\t\tto: step.offset + insertTextStepWidth(step),\n\t\tdeletedText: step.text,\n\t\tdeletedMarks: step.marks,\n\t\tdeletedSegments: step.segments ?? [textSegment(step.text, [...step.marks])],\n\t\t...optionalPath(step),\n\t};\n}\n\nexport function invertDeleteText(step: DeleteTextStep): Step {\n\treturn {\n\t\ttype: 'insertText',\n\t\tblockId: step.blockId,\n\t\toffset: step.from,\n\t\ttext: step.deletedText,\n\t\tmarks: step.deletedMarks,\n\t\tsegments: step.deletedSegments,\n\t\t...optionalPath(step),\n\t};\n}\n\nexport function invertSplitBlock(step: SplitBlockStep): Step {\n\treturn {\n\t\ttype: 'mergeBlocks',\n\t\ttargetBlockId: step.blockId,\n\t\tsourceBlockId: step.newBlockId,\n\t\ttargetLengthBefore: step.offset,\n\t\t...(step.newBlockType !== undefined ? { sourceType: step.newBlockType } : {}),\n\t\t...(step.newBlockAttrs ? { sourceAttrs: step.newBlockAttrs } : {}),\n\t\t...optionalPath(step),\n\t};\n}\n\nexport function invertMergeBlocks(step: MergeBlocksStep): Step {\n\treturn {\n\t\ttype: 'splitBlock',\n\t\tblockId: step.targetBlockId,\n\t\toffset: step.targetLengthBefore,\n\t\tnewBlockId: step.sourceBlockId,\n\t\t...(step.sourceType !== undefined ? { newBlockType: step.sourceType } : {}),\n\t\t...(step.sourceAttrs ? { newBlockAttrs: step.sourceAttrs } : {}),\n\t\t...optionalPath(step),\n\t};\n}\n\nexport function invertAddMark(step: AddMarkStep): Step {\n\treturn {\n\t\ttype: 'removeMark',\n\t\tblockId: step.blockId,\n\t\tfrom: step.from,\n\t\tto: step.to,\n\t\tmark: step.mark,\n\t\t...optionalPath(step),\n\t};\n}\n\nexport function invertRemoveMark(step: RemoveMarkStep): Step {\n\treturn {\n\t\ttype: 'addMark',\n\t\tblockId: step.blockId,\n\t\tfrom: step.from,\n\t\tto: step.to,\n\t\tmark: step.mark,\n\t\t...optionalPath(step),\n\t};\n}\n\nexport function invertSetStoredMarks(step: SetStoredMarksStep): Step {\n\treturn {\n\t\ttype: 'setStoredMarks',\n\t\tmarks: step.previousMarks,\n\t\tpreviousMarks: step.marks,\n\t};\n}\n\nexport function invertSetBlockType(step: SetBlockTypeStep): Step {\n\treturn {\n\t\ttype: 'setBlockType',\n\t\tblockId: step.blockId,\n\t\tnodeType: step.previousNodeType,\n\t\tattrs: step.previousAttrs,\n\t\tpreviousNodeType: step.nodeType,\n\t\tpreviousAttrs: step.attrs,\n\t\t...optionalPath(step),\n\t};\n}\n\nexport function invertInsertNode(step: InsertNodeStep): Step {\n\treturn {\n\t\ttype: 'removeNode',\n\t\tparentPath: step.parentPath,\n\t\tindex: step.index,\n\t\tremovedNode: step.node,\n\t};\n}\n\nexport function invertRemoveNode(step: RemoveNodeStep): Step {\n\treturn {\n\t\ttype: 'insertNode',\n\t\tparentPath: step.parentPath,\n\t\tindex: step.index,\n\t\tnode: step.removedNode,\n\t};\n}\n\nexport function invertSetNodeAttr(step: SetNodeAttrStep): Step {\n\treturn {\n\t\ttype: 'setNodeAttr',\n\t\tpath: step.path,\n\t\tattrs: step.previousAttrs,\n\t\tpreviousAttrs: step.attrs,\n\t};\n}\n\nexport function invertInsertInlineNode(step: InsertInlineNodeStep): Step {\n\treturn {\n\t\ttype: 'removeInlineNode',\n\t\tblockId: step.blockId,\n\t\toffset: step.offset,\n\t\tremovedNode: step.node,\n\t\t...optionalPath(step),\n\t};\n}\n\nexport function invertRemoveInlineNode(step: RemoveInlineNodeStep): Step {\n\treturn {\n\t\ttype: 'insertInlineNode',\n\t\tblockId: step.blockId,\n\t\toffset: step.offset,\n\t\tnode: step.removedNode,\n\t\t...optionalPath(step),\n\t};\n}\n\nexport function invertSetInlineNodeAttr(step: SetInlineNodeAttrStep): Step {\n\treturn {\n\t\ttype: 'setInlineNodeAttr',\n\t\tblockId: step.blockId,\n\t\toffset: step.offset,\n\t\tattrs: step.previousAttrs,\n\t\tpreviousAttrs: step.attrs,\n\t\t...optionalPath(step),\n\t};\n}\n\n/**\n * Walks the transaction's steps to find the storedMarks value that was\n * active before the transaction ran, falling back to the post-state if\n * no `setStoredMarks` step was recorded.\n */\nexport function deriveStoredMarksBefore(tr: Transaction): readonly Mark[] | null {\n\tfor (const step of tr.steps) {\n\t\tif (step.type === 'setStoredMarks') {\n\t\t\treturn step.previousMarks;\n\t\t}\n\t}\n\treturn tr.storedMarksAfter;\n}\n","/**\n * Per-step rebase functions: each takes a {@link Step}, a {@link Mapping}\n * that describes intervening changes in position space, and the current\n * document state, and returns either the rebased step or `null` when the\n * step can no longer be applied meaningfully.\n *\n * This is the symmetric counterpart to {@link getStepMap} / {@link applyStep}\n * / {@link invertStep}: where `getStepMap` answers \"how do positions shift\n * **through** this step\", these `mapXxx` functions answer \"how do this\n * step's *inputs* shift through *another* mapping\". The pair is what makes\n * undo/redo robust under out-of-band intervening edits, and the same\n * primitive is the foundation any future collaborative-editing layer needs.\n *\n * ## `null`-semantics\n *\n * A `null` return is not an error — it means the step's referenced\n * coordinates no longer address live content in the current frame. Callers\n * (e.g. {@link HistoryManager.undo}) treat this as \"abandon the whole\n * undo/redo group\", because applying a partial rebase would silently\n * corrupt the document.\n *\n * Conditions that produce `null`:\n *\n * - the host block was removed by an intervening edit;\n * - a single-offset step's offset fell inside removed/replaced content;\n * - a range step's range was fully eaten;\n * - a range step's endpoints landed in different blocks (fragmented);\n * - for structural steps, an ancestor in `parentPath` was removed or\n *   migrated to a new block identity.\n *\n * Dispatch is via the {@link StepHandlerRegistry} so adding a new `Step`\n * variant fails to type-check until its `map` is registered.\n */\n\nimport type { BlockNode, Document, InlineNode } from '../model/Document.js';\nimport {\n\tgetBlockContentSegmentsInRange,\n\tgetBlockLength,\n\tgetBlockMarksAtOffset,\n\tgetBlockText,\n\tgetContentAtOffset,\n\tisInlineNode,\n} from '../model/Document.js';\nimport { findNode, resolveChildAt, resolveNodeByPath } from '../model/NodeResolver.js';\nimport type { BlockId } from '../model/TypeBrands.js';\nimport {\n\ttype MappedInBlockRange,\n\ttype Mapping,\n\tmapChildIndex,\n\tmapInBlockRange,\n\tmapInsertionIndex,\n\tmapOffsetInBlock,\n} from './Mapping.js';\nimport type {\n\tAddMarkStep,\n\tDeleteTextStep,\n\tInsertInlineNodeStep,\n\tInsertNodeStep,\n\tInsertTextStep,\n\tMergeBlocksStep,\n\tRemoveInlineNodeStep,\n\tRemoveMarkStep,\n\tRemoveNodeStep,\n\tSetBlockTypeStep,\n\tSetInlineNodeAttrStep,\n\tSetNodeAttrStep,\n\tSetStoredMarksStep,\n\tSplitBlockStep,\n\tStep,\n} from './Steps.js';\n\n// --- Helpers ---\n\n/**\n * Spreads `path` onto a rebased step only when the block identity did not\n * change. A migrated block likely sits at a different parent path, so\n * carrying the stale hint would mislead the applyStep fast-path lookup;\n * dropping it falls back to a global block-id search.\n */\nfunction preservedPath(\n\toriginalBlockId: BlockId,\n\tnewBlockId: BlockId,\n\tpath: readonly BlockId[] | undefined,\n): { readonly path: readonly BlockId[] } | Record<string, never> {\n\tif (!path) return {};\n\tif (originalBlockId !== newBlockId) return {};\n\treturn { path };\n}\n\n/**\n * Validates that every block id along `parentPath` still exists and has\n * not migrated. The `parentPath` itself is **never** rebased through\n * `childIndexShift` / `blockRemoval` (those describe shifts in *child\n * slots*, not in block identity), so when any ancestor block is gone the\n * structural anchor is lost and the step must be abandoned.\n */\nfunction parentPathStillValid(parentPath: readonly BlockId[], mapping: Mapping): boolean {\n\tif (mapping.isEmpty) return true;\n\tfor (const id of parentPath) {\n\t\tconst result = mapping.mapResult({ blockId: id, offset: 0 }, -1);\n\t\tif (result.deleted) return false;\n\t\tif (result.pos.blockId !== id) return false;\n\t}\n\treturn true;\n}\n\n/**\n * Returns whether a rebased range is identical to the original range —\n * letting callers return the input step unchanged to preserve reference\n * equality (cheap downstream change-detection short-circuit).\n */\nfunction isRangeUnchanged(\n\toriginal: { readonly blockId: BlockId; readonly from: number; readonly to: number },\n\tmapped: MappedInBlockRange,\n): boolean {\n\treturn (\n\t\tmapped.blockId === original.blockId &&\n\t\tmapped.from === original.from &&\n\t\tmapped.to === original.to\n\t);\n}\n\n// --- Content-shifting steps ---\n\nexport function mapInsertText(step: InsertTextStep, mapping: Mapping, _doc: Document): Step | null {\n\tconst mapped = mapOffsetInBlock(step.blockId, step.offset, mapping, -1);\n\tif (!mapped) return null;\n\tif (mapped.blockId === step.blockId && mapped.from === step.offset) return step;\n\treturn {\n\t\ttype: 'insertText',\n\t\tblockId: mapped.blockId,\n\t\toffset: mapped.from,\n\t\ttext: step.text,\n\t\tmarks: step.marks,\n\t\t...(step.segments ? { segments: step.segments } : {}),\n\t\t...preservedPath(step.blockId, mapped.blockId, step.path),\n\t};\n}\n\nexport function mapDeleteText(step: DeleteTextStep, mapping: Mapping, doc: Document): Step | null {\n\tconst mapped = mapInBlockRange(step.blockId, step.from, step.to, mapping);\n\tif (!mapped) return null;\n\tif (isRangeUnchanged({ blockId: step.blockId, from: step.from, to: step.to }, mapped)) {\n\t\treturn step;\n\t}\n\n\t// Re-snapshot the content payload from the current doc — the original\n\t// `deletedText` / `deletedSegments` / `deletedMarks` describe content that\n\t// no longer sits at the rebased range. Without the refresh, redoing this\n\t// undo would produce a step whose inverse reinserts the wrong content.\n\tconst block = findNode(doc, mapped.blockId);\n\tif (!block) return null;\n\tconst deletedText = getBlockText(block).slice(mapped.from, mapped.to);\n\tconst deletedMarks = getBlockMarksAtOffset(block, mapped.from);\n\tconst deletedSegments = getBlockContentSegmentsInRange(block, mapped.from, mapped.to);\n\n\treturn {\n\t\ttype: 'deleteText',\n\t\tblockId: mapped.blockId,\n\t\tfrom: mapped.from,\n\t\tto: mapped.to,\n\t\tdeletedText,\n\t\tdeletedMarks,\n\t\tdeletedSegments,\n\t\t...preservedPath(step.blockId, mapped.blockId, step.path),\n\t};\n}\n\nexport function mapInsertInlineNode(\n\tstep: InsertInlineNodeStep,\n\tmapping: Mapping,\n\t_doc: Document,\n): Step | null {\n\tconst mapped = mapOffsetInBlock(step.blockId, step.offset, mapping, -1);\n\tif (!mapped) return null;\n\tif (mapped.blockId === step.blockId && mapped.from === step.offset) return step;\n\treturn {\n\t\ttype: 'insertInlineNode',\n\t\tblockId: mapped.blockId,\n\t\toffset: mapped.from,\n\t\tnode: step.node,\n\t\t...preservedPath(step.blockId, mapped.blockId, step.path),\n\t};\n}\n\nexport function mapRemoveInlineNode(\n\tstep: RemoveInlineNodeStep,\n\tmapping: Mapping,\n\tdoc: Document,\n): Step | null {\n\t// Inline nodes occupy [offset, offset+1) atomically. Treating the position\n\t// as a width-1 range with sticky-right `from` is what keeps the rebased\n\t// offset pointing at the SAME slot even when intervening edits inserted\n\t// content immediately before it.\n\tconst mapped = mapInBlockRange(step.blockId, step.offset, step.offset + 1, mapping, 1, 1);\n\tif (!mapped) return null;\n\tif (mapped.to - mapped.from !== 1) return null;\n\n\t// Verify the inline at the rebased slot is still the one the user wanted\n\t// to remove. The position mapping does not track inline identity, so an\n\t// intervening `removeInlineNode` + `insertInlineNode` pair at the same\n\t// offset would shift the position by zero net while replacing the\n\t// content. Removing the substitute would corrupt the agent's edit; abandon\n\t// the group instead.\n\tconst block = findNode(doc, mapped.blockId);\n\tif (!block) return null;\n\tconst content = getContentAtOffset(block, mapped.from);\n\tif (!content || content.kind !== 'inline' || !isInlineNode(content.node)) return null;\n\tif (!inlineNodesEqual(step.removedNode, content.node)) return null;\n\n\tif (mapped.blockId === step.blockId && mapped.from === step.offset) return step;\n\treturn {\n\t\ttype: 'removeInlineNode',\n\t\tblockId: mapped.blockId,\n\t\toffset: mapped.from,\n\t\tremovedNode: content.node,\n\t\t...preservedPath(step.blockId, mapped.blockId, step.path),\n\t};\n}\n\n// --- Structural block steps ---\n\nexport function mapSplitBlock(step: SplitBlockStep, mapping: Mapping, _doc: Document): Step | null {\n\tconst mapped = mapOffsetInBlock(step.blockId, step.offset, mapping, -1);\n\tif (!mapped) return null;\n\tif (mapped.blockId === step.blockId && mapped.from === step.offset) return step;\n\treturn {\n\t\ttype: 'splitBlock',\n\t\tblockId: mapped.blockId,\n\t\toffset: mapped.from,\n\t\tnewBlockId: step.newBlockId,\n\t\t...(step.newBlockType !== undefined ? { newBlockType: step.newBlockType } : {}),\n\t\t...(step.newBlockAttrs ? { newBlockAttrs: step.newBlockAttrs } : {}),\n\t\t...preservedPath(step.blockId, mapped.blockId, step.path),\n\t};\n}\n\nexport function mapMergeBlocks(\n\tstep: MergeBlocksStep,\n\tmapping: Mapping,\n\tdoc: Document,\n): Step | null {\n\tif (mapping.isEmpty) return step;\n\n\t// Both blocks must remain addressable as distinct entities.\n\tconst targetProbe = mapping.mapResult({ blockId: step.targetBlockId, offset: 0 }, -1);\n\tconst sourceProbe = mapping.mapResult({ blockId: step.sourceBlockId, offset: 0 }, -1);\n\tif (targetProbe.deleted || sourceProbe.deleted) return null;\n\tconst newTargetId = targetProbe.pos.blockId;\n\tconst newSourceId = sourceProbe.pos.blockId;\n\tif (newTargetId === newSourceId) return null;\n\n\t// Recompute targetLengthBefore from current doc — intervening edits inside\n\t// the target block changed its length, and applyMergeBlocks doesn't use\n\t// this field (it merges by ID), but the inverse split step does, and a\n\t// stale length would split at the wrong offset on redo.\n\tconst target = findNode(doc, newTargetId);\n\tif (!target) return null;\n\tconst targetLengthBefore = getBlockLength(target);\n\n\tif (\n\t\tnewTargetId === step.targetBlockId &&\n\t\tnewSourceId === step.sourceBlockId &&\n\t\ttargetLengthBefore === step.targetLengthBefore\n\t) {\n\t\treturn step;\n\t}\n\n\treturn {\n\t\ttype: 'mergeBlocks',\n\t\ttargetBlockId: newTargetId,\n\t\tsourceBlockId: newSourceId,\n\t\ttargetLengthBefore,\n\t\t...(step.sourceType !== undefined ? { sourceType: step.sourceType } : {}),\n\t\t...(step.sourceAttrs ? { sourceAttrs: step.sourceAttrs } : {}),\n\t\t...preservedPath(step.targetBlockId, newTargetId, step.path),\n\t};\n}\n\n// --- Mark steps ---\n\nexport function mapAddMark(step: AddMarkStep, mapping: Mapping, _doc: Document): Step | null {\n\tconst mapped = mapInBlockRange(step.blockId, step.from, step.to, mapping);\n\tif (!mapped) return null;\n\tif (isRangeUnchanged({ blockId: step.blockId, from: step.from, to: step.to }, mapped)) {\n\t\treturn step;\n\t}\n\treturn {\n\t\ttype: 'addMark',\n\t\tblockId: mapped.blockId,\n\t\tfrom: mapped.from,\n\t\tto: mapped.to,\n\t\tmark: step.mark,\n\t\t...preservedPath(step.blockId, mapped.blockId, step.path),\n\t};\n}\n\nexport function mapRemoveMark(step: RemoveMarkStep, mapping: Mapping, _doc: Document): Step | null {\n\tconst mapped = mapInBlockRange(step.blockId, step.from, step.to, mapping);\n\tif (!mapped) return null;\n\tif (isRangeUnchanged({ blockId: step.blockId, from: step.from, to: step.to }, mapped)) {\n\t\treturn step;\n\t}\n\treturn {\n\t\ttype: 'removeMark',\n\t\tblockId: mapped.blockId,\n\t\tfrom: mapped.from,\n\t\tto: mapped.to,\n\t\tmark: step.mark,\n\t\t...preservedPath(step.blockId, mapped.blockId, step.path),\n\t};\n}\n\n// --- Identity / attribute steps ---\n\nexport function mapSetStoredMarks(\n\tstep: SetStoredMarksStep,\n\t_mapping: Mapping,\n\t_doc: Document,\n): Step | null {\n\t// State-level only, no document coordinates to rebase.\n\treturn step;\n}\n\nexport function mapSetBlockType(\n\tstep: SetBlockTypeStep,\n\tmapping: Mapping,\n\tdoc: Document,\n): Step | null {\n\tif (mapping.isEmpty) return step;\n\tconst probe = mapping.mapResult({ blockId: step.blockId, offset: 0 }, -1);\n\tif (probe.deleted) return null;\n\tconst newBlockId = probe.pos.blockId;\n\n\t// Re-snapshot the previous type / attrs from the current doc so the inverse\n\t// step restores what was actually there post-intervening, not what was there\n\t// when the original step was emitted.\n\tconst block: BlockNode | undefined = findNode(doc, newBlockId);\n\tif (!block) return null;\n\n\tif (\n\t\tnewBlockId === step.blockId &&\n\t\tblock.type === step.previousNodeType &&\n\t\tblockAttrsEqual(block.attrs, step.previousAttrs)\n\t) {\n\t\treturn step;\n\t}\n\n\treturn {\n\t\ttype: 'setBlockType',\n\t\tblockId: newBlockId,\n\t\tnodeType: step.nodeType,\n\t\t...(step.attrs ? { attrs: step.attrs } : {}),\n\t\tpreviousNodeType: block.type,\n\t\t...(block.attrs ? { previousAttrs: block.attrs } : {}),\n\t\t...preservedPath(step.blockId, newBlockId, step.path),\n\t};\n}\n\nexport function mapSetNodeAttr(\n\tstep: SetNodeAttrStep,\n\tmapping: Mapping,\n\tdoc: Document,\n): Step | null {\n\tif (mapping.isEmpty) return step;\n\tif (!parentPathStillValid(step.path, mapping)) return null;\n\tconst node = resolveNodeByPath(doc, step.path);\n\tif (!node) return null;\n\treturn {\n\t\ttype: 'setNodeAttr',\n\t\tpath: step.path,\n\t\tattrs: step.attrs,\n\t\t...(node.attrs ? { previousAttrs: node.attrs } : {}),\n\t};\n}\n\nexport function mapSetInlineNodeAttr(\n\tstep: SetInlineNodeAttrStep,\n\tmapping: Mapping,\n\tdoc: Document,\n): Step | null {\n\tconst mapped = mapInBlockRange(step.blockId, step.offset, step.offset + 1, mapping, 1, 1);\n\tif (!mapped) return null;\n\tif (mapped.to - mapped.from !== 1) return null;\n\tif (mapped.blockId === step.blockId && mapped.from === step.offset) {\n\t\treturn step;\n\t}\n\n\tconst block = findNode(doc, mapped.blockId);\n\tif (!block) return null;\n\tconst content = getContentAtOffset(block, mapped.from);\n\tif (!content || content.kind !== 'inline' || !isInlineNode(content.node)) return null;\n\treturn {\n\t\ttype: 'setInlineNodeAttr',\n\t\tblockId: mapped.blockId,\n\t\toffset: mapped.from,\n\t\tattrs: step.attrs,\n\t\tpreviousAttrs: content.node.attrs,\n\t\t...preservedPath(step.blockId, mapped.blockId, step.path),\n\t};\n}\n\n// --- Tree-structural steps ---\n\nexport function mapInsertNode(step: InsertNodeStep, mapping: Mapping, _doc: Document): Step | null {\n\tif (!parentPathStillValid(step.parentPath, mapping)) return null;\n\t// Insertion-slot semantics: the slot survives even when the block\n\t// previously at this index was removed by an intervening edit. The slot\n\t// is *where to insert*, not a reference to an existing child.\n\tconst rebasedIndex: number = mapInsertionIndex(step.parentPath, step.index, mapping);\n\tif (rebasedIndex === step.index) return step;\n\treturn {\n\t\ttype: 'insertNode',\n\t\tparentPath: step.parentPath,\n\t\tindex: rebasedIndex,\n\t\tnode: step.node,\n\t};\n}\n\nexport function mapRemoveNode(step: RemoveNodeStep, mapping: Mapping, doc: Document): Step | null {\n\tif (!parentPathStillValid(step.parentPath, mapping)) return null;\n\t// The to-be-removed block itself must still exist as a distinct block.\n\tconst probe = mapping.mapResult({ blockId: step.removedNode.id, offset: 0 }, -1);\n\tif (probe.deleted) return null;\n\tif (probe.pos.blockId !== step.removedNode.id) return null;\n\n\tconst rebasedIndex: number | null = mapChildIndex(step.parentPath, step.index, mapping);\n\t// `null` means an intervening edit already removed the exact slot this\n\t// step targets; the inverse cannot meaningfully proceed.\n\tif (rebasedIndex === null) return null;\n\n\t// Re-snapshot the removed subtree from the current doc — intervening edits\n\t// may have modified the block's content (text inserted, marks toggled,\n\t// child blocks added) after the original step was recorded. Without the\n\t// refresh, the rebased step's inverse `insertNode` would restore the stale\n\t// payload and silently lose those edits on a subsequent undo. Same class\n\t// of bug as the inline identity check in {@link mapRemoveInlineNode}.\n\tconst block = resolveChildAt(doc, step.parentPath, rebasedIndex);\n\tif (!block) return null;\n\t// Defensive structural-integrity check: the rebased index must point at\n\t// the block we expect. A mismatch indicates either a mapping inconsistency\n\t// or that the slot is now occupied by a different block — either way we\n\t// must not remove an unrelated subtree.\n\tif (block.id !== step.removedNode.id) return null;\n\n\tif (rebasedIndex === step.index && block === step.removedNode) return step;\n\treturn {\n\t\ttype: 'removeNode',\n\t\tparentPath: step.parentPath,\n\t\tindex: rebasedIndex,\n\t\tremovedNode: block,\n\t};\n}\n\n// --- Local utilities ---\n\nfunction blockAttrsEqual(\n\ta: Readonly<Record<string, unknown>> | undefined,\n\tb: Readonly<Record<string, unknown>> | undefined,\n): boolean {\n\tif (a === b) return true;\n\tif (!a || !b) return false;\n\tconst aKeys = Object.keys(a);\n\tconst bKeys = Object.keys(b);\n\tif (aKeys.length !== bKeys.length) return false;\n\tfor (const k of aKeys) {\n\t\tif (a[k] !== b[k]) return false;\n\t}\n\treturn true;\n}\n\nfunction inlineNodesEqual(a: InlineNode, b: InlineNode): boolean {\n\tif (a === b) return true;\n\tif (a.inlineType !== b.inlineType) return false;\n\treturn blockAttrsEqual(a.attrs, b.attrs);\n}\n","/**\n * Per-step {@link StepMap} producers. Each function consumes the step plus\n * the document state **before** the step is applied (when needed) and\n * returns the StepMap that describes the position-space change.\n *\n * Dispatch is performed by `StepHandlers.ts` through the\n * `StepHandlerRegistry`, which co-locates `apply`, `invert`, and `getMap`\n * so adding a new step type is a single registry edit.\n */\n\nimport type { Document } from '../model/Document.js';\nimport {\n\ttype BlockRemovalMap,\n\ttype ChildIndexShiftMap,\n\tIDENTITY_MAP,\n\ttype MergeMap,\n\ttype ShiftMap,\n\ttype SplitMap,\n\ttype StepMap,\n\tcollectRemovedBlockIds,\n} from './Mapping.js';\nimport { insertTextStepWidth } from './Steps.js';\nimport type {\n\tAddMarkStep,\n\tDeleteTextStep,\n\tInsertInlineNodeStep,\n\tInsertNodeStep,\n\tInsertTextStep,\n\tMergeBlocksStep,\n\tRemoveInlineNodeStep,\n\tRemoveMarkStep,\n\tRemoveNodeStep,\n\tSetBlockTypeStep,\n\tSetInlineNodeAttrStep,\n\tSetNodeAttrStep,\n\tSetStoredMarksStep,\n\tSplitBlockStep,\n} from './Steps.js';\n\n// --- Content-shifting steps ---\n\nexport function getMapInsertText(_doc: Document, step: InsertTextStep): ShiftMap {\n\treturn {\n\t\ttype: 'shift',\n\t\tblockId: step.blockId,\n\t\tfrom: step.offset,\n\t\tto: step.offset,\n\t\tnewLen: insertTextStepWidth(step),\n\t};\n}\n\nexport function getMapDeleteText(_doc: Document, step: DeleteTextStep): ShiftMap {\n\treturn {\n\t\ttype: 'shift',\n\t\tblockId: step.blockId,\n\t\tfrom: step.from,\n\t\tto: step.to,\n\t\tnewLen: 0,\n\t};\n}\n\nexport function getMapInsertInlineNode(_doc: Document, step: InsertInlineNodeStep): ShiftMap {\n\treturn {\n\t\ttype: 'shift',\n\t\tblockId: step.blockId,\n\t\tfrom: step.offset,\n\t\tto: step.offset,\n\t\tnewLen: 1,\n\t};\n}\n\nexport function getMapRemoveInlineNode(_doc: Document, step: RemoveInlineNodeStep): ShiftMap {\n\treturn {\n\t\ttype: 'shift',\n\t\tblockId: step.blockId,\n\t\tfrom: step.offset,\n\t\tto: step.offset + 1,\n\t\tnewLen: 0,\n\t};\n}\n\n// --- Structural steps ---\n\nexport function getMapSplitBlock(_doc: Document, step: SplitBlockStep): SplitMap {\n\treturn {\n\t\ttype: 'split',\n\t\tblockId: step.blockId,\n\t\toffset: step.offset,\n\t\tnewBlockId: step.newBlockId,\n\t};\n}\n\nexport function getMapMergeBlocks(_doc: Document, step: MergeBlocksStep): MergeMap {\n\treturn {\n\t\ttype: 'merge',\n\t\ttargetBlockId: step.targetBlockId,\n\t\tsourceBlockId: step.sourceBlockId,\n\t\ttargetLengthBefore: step.targetLengthBefore,\n\t};\n}\n\nexport function getMapRemoveNode(_doc: Document, step: RemoveNodeStep): BlockRemovalMap {\n\treturn {\n\t\ttype: 'blockRemoval',\n\t\tremovedBlockIds: collectRemovedBlockIds(step.removedNode),\n\t\tparentPath: step.parentPath,\n\t\tindex: step.index,\n\t};\n}\n\n// --- Structural sibling shifts ---\n\n/**\n * Inserting a block at `step.index` in `step.parentPath`'s child list does\n * not move any position in `{blockId, offset}` space, but it shifts every\n * sibling index `≥ step.index` up by 1. {@link mapChildIndex} consumes this\n * to rebase later `insertNode` / `removeNode` steps that target the same\n * parent.\n */\nexport function getMapInsertNode(_doc: Document, step: InsertNodeStep): ChildIndexShiftMap {\n\treturn {\n\t\ttype: 'childIndexShift',\n\t\tparentPath: step.parentPath,\n\t\tfromIndex: step.index,\n\t\tdelta: 1,\n\t};\n}\n\n// --- Identity steps (positions unchanged) ---\n//\n// The following step types do not move offsets or child indices:\n// - addMark / removeMark: annotation only\n// - setStoredMarks: state-only\n// - setBlockType: type/attrs change, children unchanged\n// - setNodeAttr / setInlineNodeAttr: attribute-only\n\nexport function getMapAddMark(_doc: Document, _step: AddMarkStep): StepMap {\n\treturn IDENTITY_MAP;\n}\n\nexport function getMapRemoveMark(_doc: Document, _step: RemoveMarkStep): StepMap {\n\treturn IDENTITY_MAP;\n}\n\nexport function getMapSetStoredMarks(_doc: Document, _step: SetStoredMarksStep): StepMap {\n\treturn IDENTITY_MAP;\n}\n\nexport function getMapSetBlockType(_doc: Document, _step: SetBlockTypeStep): StepMap {\n\treturn IDENTITY_MAP;\n}\n\nexport function getMapSetNodeAttr(_doc: Document, _step: SetNodeAttrStep): StepMap {\n\treturn IDENTITY_MAP;\n}\n\nexport function getMapSetInlineNodeAttr(_doc: Document, _step: SetInlineNodeAttrStep): StepMap {\n\treturn IDENTITY_MAP;\n}\n","/**\n * Single source of truth that pairs each `Step` discriminator with the\n * functions that apply, invert, and map it. The registry's mapped type\n * makes exhaustiveness a compile-time guarantee: introducing a new member\n * of the `Step` union without registering a handler is a type error here.\n *\n * Public dispatch (`applyStep`, `invertStep`, `getStepMap`,\n * `invertTransaction`) lives in this module; per-step logic lives in\n * `StepApplication.ts`, `StepInversion.ts`, and `StepMaps.ts`.\n */\n\nimport type { Document } from '../model/Document.js';\nimport { IDENTITY_MAP, Mapping, type StepMap } from './Mapping.js';\nimport {\n\tapplyAddMark,\n\tapplyDeleteText,\n\tapplyInsertInlineNode,\n\tapplyInsertNode,\n\tapplyInsertText,\n\tapplyMergeBlocks,\n\tapplyRemoveInlineNode,\n\tapplyRemoveMark,\n\tapplyRemoveNode,\n\tapplySetBlockType,\n\tapplySetInlineNodeAttr,\n\tapplySetNodeAttr,\n\tapplySetStoredMarks,\n\tapplySplitBlock,\n} from './StepApplication.js';\nimport {\n\tderiveStoredMarksBefore,\n\tinvertAddMark,\n\tinvertDeleteText,\n\tinvertInsertInlineNode,\n\tinvertInsertNode,\n\tinvertInsertText,\n\tinvertMergeBlocks,\n\tinvertRemoveInlineNode,\n\tinvertRemoveMark,\n\tinvertRemoveNode,\n\tinvertSetBlockType,\n\tinvertSetInlineNodeAttr,\n\tinvertSetNodeAttr,\n\tinvertSetStoredMarks,\n\tinvertSplitBlock,\n} from './StepInversion.js';\nimport {\n\tmapAddMark,\n\tmapDeleteText,\n\tmapInsertInlineNode,\n\tmapInsertNode,\n\tmapInsertText,\n\tmapMergeBlocks,\n\tmapRemoveInlineNode,\n\tmapRemoveMark,\n\tmapRemoveNode,\n\tmapSetBlockType,\n\tmapSetInlineNodeAttr,\n\tmapSetNodeAttr,\n\tmapSetStoredMarks,\n\tmapSplitBlock,\n} from './StepMapping.js';\nimport {\n\tgetMapAddMark,\n\tgetMapDeleteText,\n\tgetMapInsertInlineNode,\n\tgetMapInsertNode,\n\tgetMapInsertText,\n\tgetMapMergeBlocks,\n\tgetMapRemoveInlineNode,\n\tgetMapRemoveMark,\n\tgetMapRemoveNode,\n\tgetMapSetBlockType,\n\tgetMapSetInlineNodeAttr,\n\tgetMapSetNodeAttr,\n\tgetMapSetStoredMarks,\n\tgetMapSplitBlock,\n} from './StepMaps.js';\nimport type { Step } from './Steps.js';\nimport type { Transaction } from './Transaction.js';\n\n/**\n * Forward, inverse, position-mapping, and step-rebase behavior of one step\n * subtype, co-located so a new step type is one registry entry.\n *\n * - `apply` / `invert` / `getMap` cover the existing step pipeline.\n * - `map` rebases the step itself through a {@link Mapping} describing\n *   intervening changes; returns `null` when the step can no longer be\n *   applied meaningfully (block removed, range fragmented, range fully\n *   eaten). See {@link StepMapping.ts} for per-step semantics.\n *\n * `getMap` and `map` both receive the document at the step's \"current\"\n * frame: `getMap` against the pre-apply doc, `map` against the doc that\n * the rebased step will be applied to. The latter is needed to re-snapshot\n * inverse-payload fields (`deletedText`, `previousAttrs`, etc.) so the\n * rebased step inverts correctly on redo.\n */\nexport interface StepHandler<S extends Step> {\n\treadonly apply: (doc: Document, step: S) => Document;\n\treadonly invert: (step: S) => Step;\n\treadonly getMap: (doc: Document, step: S) => StepMap;\n\treadonly map: (step: S, mapping: Mapping, doc: Document) => Step | null;\n}\n\n/**\n * Registry shape: every member of the `Step` union must have a matching\n * handler. If a new step type is added to the union without a handler,\n * the literal below fails to type-check.\n */\ntype StepHandlerRegistry = {\n\treadonly [K in Step['type']]: StepHandler<Extract<Step, { readonly type: K }>>;\n};\n\nconst STEP_HANDLERS: StepHandlerRegistry = {\n\tinsertText: {\n\t\tapply: applyInsertText,\n\t\tinvert: invertInsertText,\n\t\tgetMap: getMapInsertText,\n\t\tmap: mapInsertText,\n\t},\n\tdeleteText: {\n\t\tapply: applyDeleteText,\n\t\tinvert: invertDeleteText,\n\t\tgetMap: getMapDeleteText,\n\t\tmap: mapDeleteText,\n\t},\n\tsplitBlock: {\n\t\tapply: applySplitBlock,\n\t\tinvert: invertSplitBlock,\n\t\tgetMap: getMapSplitBlock,\n\t\tmap: mapSplitBlock,\n\t},\n\tmergeBlocks: {\n\t\tapply: applyMergeBlocks,\n\t\tinvert: invertMergeBlocks,\n\t\tgetMap: getMapMergeBlocks,\n\t\tmap: mapMergeBlocks,\n\t},\n\taddMark: {\n\t\tapply: applyAddMark,\n\t\tinvert: invertAddMark,\n\t\tgetMap: getMapAddMark,\n\t\tmap: mapAddMark,\n\t},\n\tremoveMark: {\n\t\tapply: applyRemoveMark,\n\t\tinvert: invertRemoveMark,\n\t\tgetMap: getMapRemoveMark,\n\t\tmap: mapRemoveMark,\n\t},\n\tsetStoredMarks: {\n\t\tapply: applySetStoredMarks,\n\t\tinvert: invertSetStoredMarks,\n\t\tgetMap: getMapSetStoredMarks,\n\t\tmap: mapSetStoredMarks,\n\t},\n\tsetBlockType: {\n\t\tapply: applySetBlockType,\n\t\tinvert: invertSetBlockType,\n\t\tgetMap: getMapSetBlockType,\n\t\tmap: mapSetBlockType,\n\t},\n\tinsertNode: {\n\t\tapply: applyInsertNode,\n\t\tinvert: invertInsertNode,\n\t\tgetMap: getMapInsertNode,\n\t\tmap: mapInsertNode,\n\t},\n\tremoveNode: {\n\t\tapply: applyRemoveNode,\n\t\tinvert: invertRemoveNode,\n\t\tgetMap: getMapRemoveNode,\n\t\tmap: mapRemoveNode,\n\t},\n\tsetNodeAttr: {\n\t\tapply: applySetNodeAttr,\n\t\tinvert: invertSetNodeAttr,\n\t\tgetMap: getMapSetNodeAttr,\n\t\tmap: mapSetNodeAttr,\n\t},\n\tinsertInlineNode: {\n\t\tapply: applyInsertInlineNode,\n\t\tinvert: invertInsertInlineNode,\n\t\tgetMap: getMapInsertInlineNode,\n\t\tmap: mapInsertInlineNode,\n\t},\n\tremoveInlineNode: {\n\t\tapply: applyRemoveInlineNode,\n\t\tinvert: invertRemoveInlineNode,\n\t\tgetMap: getMapRemoveInlineNode,\n\t\tmap: mapRemoveInlineNode,\n\t},\n\tsetInlineNodeAttr: {\n\t\tapply: applySetInlineNodeAttr,\n\t\tinvert: invertSetInlineNodeAttr,\n\t\tgetMap: getMapSetInlineNodeAttr,\n\t\tmap: mapSetInlineNodeAttr,\n\t},\n};\n\n/**\n * Looks up the handler for a step. The cast is bounded — `STEP_HANDLERS`\n * is typed such that `step.type` always selects a handler whose parameter\n * type matches `S`. TypeScript cannot narrow indexed access through a\n * discriminator without help, so we assert the relationship once here.\n */\nfunction getHandler<S extends Step>(step: S): StepHandler<S> {\n\treturn STEP_HANDLERS[step.type] as unknown as StepHandler<S>;\n}\n\n/** Applies a single step to a document and returns the new document. */\nexport function applyStep(doc: Document, step: Step): Document {\n\treturn getHandler(step).apply(doc, step);\n}\n\n/** Returns the inverse of a step, used for undo/redo. */\nexport function invertStep(step: Step): Step {\n\treturn getHandler(step).invert(step);\n}\n\n/**\n * Returns the position-space {@link StepMap} for a step, computed against\n * the document state **before** the step was applied.\n */\nexport function getStepMap(doc: Document, step: Step): StepMap {\n\treturn getHandler(step).getMap(doc, step);\n}\n\n/**\n * Rebases a step through a {@link Mapping} describing intervening edits in\n * position space, returning either the rebased step or `null` when the\n * step can no longer be applied meaningfully (block removed, range fully\n * eaten, range fragmented across blocks, structural ancestor migrated).\n *\n * `doc` must be the document at the frame the rebased step will run\n * against — `map` re-snapshots inverse-payload fields (`deletedText`,\n * `previousAttrs`, …) from it so the rebased step inverts correctly on\n * redo.\n *\n * Callers (e.g. {@link HistoryManager.undo}) treat a `null` as a signal to\n * abandon the entire undo/redo group rather than apply a partial rebase\n * that would silently corrupt the document.\n */\nexport function mapStep(step: Step, mapping: Mapping, doc: Document): Step | null {\n\tif (mapping.isEmpty) return step;\n\treturn getHandler(step).map(step, mapping, doc);\n}\n\n/**\n * Inverts an entire transaction (reverses step order and swaps selections).\n *\n * The returned transaction's `mapping` is {@link Mapping.empty}: producing a\n * faithful mapping for inverted steps requires the pre-apply document at\n * each inverse step (e.g. `removeNode` needs to walk the subtree, which is\n * only present in the forward step's payload, not its inverse). Callers\n * that need a real mapping for the inverted transaction should accumulate\n * step maps via {@link getStepMap} as they apply each inverse step.\n *\n * `forwardStepMaps` is set to identity placeholders for the same reason —\n * the inverse-step forward effect is only computable against the document\n * state at each inverse, which the caller (e.g. `HistoryManager.undo`)\n * tracks while walking.\n */\nexport function invertTransaction(tr: Transaction): Transaction {\n\tconst invertedSteps: Step[] = tr.steps.map(invertStep).reverse();\n\treturn {\n\t\tsteps: invertedSteps,\n\t\tselectionBefore: tr.selectionAfter,\n\t\tselectionAfter: tr.selectionBefore,\n\t\tstoredMarksAfter: deriveStoredMarksBefore(tr),\n\t\tmapping: Mapping.empty,\n\t\tforwardStepMaps: invertedSteps.map(() => IDENTITY_MAP),\n\t\tmetadata: {\n\t\t\torigin: 'history',\n\t\t\ttimestamp: Date.now(),\n\t\t},\n\t};\n}\n","/**\n * Thin decoration-specific adapters over the generic {@link StepMap}\n * primitive. Position-shift arithmetic lives in `state/Mapping.ts`; this\n * module only contains the decoration-shape concerns:\n *\n * - splitting an {@link InlineDecoration} into two when a `splitBlock`\n *   crosses its range,\n * - dropping a {@link NodeDecoration} when its block disappears\n *   (`removeNode`) or is absorbed by a merge,\n * - applying widget `side` as the mapping `assoc`.\n *\n * The legacy entry point `mapDecorationThroughStep(deco, step)` is\n * preserved as a thin shim over `mapDecorationThroughStepMap` so existing\n * tests keep working; new consumers should reach for `Transaction.mapping`\n * directly via `DecorationSet.map(tr)`.\n */\n\nimport type { Document } from '../model/Document.js';\nimport { createPosition } from '../model/Selection.js';\nimport type { MergeMap, ShiftMap, SplitMap, StepMap } from '../state/Mapping.js';\nimport { mapPositionThroughStep } from '../state/Mapping.js';\nimport { getStepMap } from '../state/StepHandlers.js';\nimport type { Step } from '../state/Transaction.js';\nimport type {\n\tDecoration,\n\tInlineDecoration,\n\tNodeDecoration,\n\tWidgetDecoration,\n} from './Decoration.js';\n\nconst EMPTY_DOC: Document = { children: [] };\n\n/**\n * Maps a decoration through a single {@link StepMap}. Returns:\n * - the (possibly identical) decoration,\n * - an array of two decorations when a `splitBlock` cuts an inline range,\n * - or `null` when the decoration was deleted.\n */\nexport function mapDecorationThroughStepMap(\n\tdeco: Decoration,\n\tstepMap: StepMap,\n): Decoration | readonly Decoration[] | null {\n\tswitch (deco.type) {\n\t\tcase 'inline':\n\t\t\treturn mapInline(deco, stepMap);\n\t\tcase 'widget':\n\t\t\treturn mapWidget(deco, stepMap);\n\t\tcase 'node':\n\t\t\treturn mapNode(deco, stepMap);\n\t}\n}\n\n/**\n * Legacy entry point — kept for backward compatibility with callers and\n * tests that hold a {@link Step} rather than a {@link StepMap}. Internally\n * converts step → StepMap (cheap, no doc state needed for any of the\n * shape categories used here) and delegates to\n * {@link mapDecorationThroughStepMap}.\n */\nexport function mapDecorationThroughStep(\n\tdeco: Decoration,\n\tstep: Step,\n): Decoration | readonly Decoration[] | null {\n\treturn mapDecorationThroughStepMap(deco, getStepMap(EMPTY_DOC, step));\n}\n\n// --- Inline ---\n\nfunction mapInline(\n\tdeco: InlineDecoration,\n\tstepMap: StepMap,\n): InlineDecoration | readonly InlineDecoration[] | null {\n\tswitch (stepMap.type) {\n\t\tcase 'identity':\n\t\t\treturn deco;\n\t\tcase 'shift':\n\t\t\treturn mapInlineShift(deco, stepMap);\n\t\tcase 'split':\n\t\t\treturn mapInlineSplit(deco, stepMap);\n\t\tcase 'merge':\n\t\t\treturn mapInlineMerge(deco, stepMap);\n\t\tcase 'blockRemoval':\n\t\t\treturn stepMap.removedBlockIds.has(deco.blockId) ? null : deco;\n\t\tcase 'childIndexShift':\n\t\t\t// Sibling-index shifts don't move text positions.\n\t\t\treturn deco;\n\t}\n}\n\nfunction mapInlineShift(deco: InlineDecoration, map: ShiftMap): InlineDecoration | null {\n\tif (deco.blockId !== map.blockId) return deco;\n\n\tconst fromPos = mapPositionThroughStep(createPosition(deco.blockId, deco.from), map, -1).pos;\n\tconst toPos = mapPositionThroughStep(createPosition(deco.blockId, deco.to), map, 1).pos;\n\n\tif (fromPos.offset >= toPos.offset) return null;\n\tif (fromPos.offset === deco.from && toPos.offset === deco.to) return deco;\n\treturn { ...deco, from: fromPos.offset, to: toPos.offset };\n}\n\nfunction mapInlineSplit(\n\tdeco: InlineDecoration,\n\tmap: SplitMap,\n): InlineDecoration | readonly InlineDecoration[] {\n\tif (deco.blockId !== map.blockId) return deco;\n\n\tif (deco.to <= map.offset) return deco;\n\n\tif (deco.from >= map.offset) {\n\t\treturn {\n\t\t\t...deco,\n\t\t\tblockId: map.newBlockId,\n\t\t\tfrom: deco.from - map.offset,\n\t\t\tto: deco.to - map.offset,\n\t\t};\n\t}\n\n\t// Spans the split — return both halves\n\tconst left: InlineDecoration = { ...deco, to: map.offset };\n\tconst right: InlineDecoration = {\n\t\t...deco,\n\t\tblockId: map.newBlockId,\n\t\tfrom: 0,\n\t\tto: deco.to - map.offset,\n\t};\n\treturn [left, right];\n}\n\nfunction mapInlineMerge(deco: InlineDecoration, map: MergeMap): InlineDecoration {\n\tif (deco.blockId !== map.sourceBlockId) return deco;\n\treturn {\n\t\t...deco,\n\t\tblockId: map.targetBlockId,\n\t\tfrom: deco.from + map.targetLengthBefore,\n\t\tto: deco.to + map.targetLengthBefore,\n\t};\n}\n\n// --- Widget ---\n\nfunction mapWidget(deco: WidgetDecoration, stepMap: StepMap): WidgetDecoration | null {\n\tswitch (stepMap.type) {\n\t\tcase 'identity':\n\t\t\treturn deco;\n\t\tcase 'shift':\n\t\t\treturn mapWidgetShift(deco, stepMap);\n\t\tcase 'split':\n\t\t\treturn mapWidgetSplit(deco, stepMap);\n\t\tcase 'merge':\n\t\t\treturn mapWidgetMerge(deco, stepMap);\n\t\tcase 'blockRemoval':\n\t\t\treturn stepMap.removedBlockIds.has(deco.blockId) ? null : deco;\n\t\tcase 'childIndexShift':\n\t\t\treturn deco;\n\t}\n}\n\nfunction mapWidgetShift(deco: WidgetDecoration, map: ShiftMap): WidgetDecoration | null {\n\tif (deco.blockId !== map.blockId) return deco;\n\n\tconst result = mapPositionThroughStep(createPosition(deco.blockId, deco.offset), map, deco.side);\n\t// A widget that lands strictly inside removed content is deleted.\n\tif (result.deleted) return null;\n\tif (result.pos.offset === deco.offset) return deco;\n\treturn { ...deco, offset: result.pos.offset };\n}\n\nfunction mapWidgetSplit(deco: WidgetDecoration, map: SplitMap): WidgetDecoration {\n\tif (deco.blockId !== map.blockId) return deco;\n\tconst result = mapPositionThroughStep(createPosition(deco.blockId, deco.offset), map, deco.side);\n\tif (result.pos.blockId === deco.blockId && result.pos.offset === deco.offset) return deco;\n\treturn { ...deco, blockId: result.pos.blockId, offset: result.pos.offset };\n}\n\nfunction mapWidgetMerge(deco: WidgetDecoration, map: MergeMap): WidgetDecoration {\n\tif (deco.blockId !== map.sourceBlockId) return deco;\n\treturn {\n\t\t...deco,\n\t\tblockId: map.targetBlockId,\n\t\toffset: deco.offset + map.targetLengthBefore,\n\t};\n}\n\n// --- Node ---\n\nfunction mapNode(deco: NodeDecoration, stepMap: StepMap): NodeDecoration | null {\n\tswitch (stepMap.type) {\n\t\tcase 'identity':\n\t\tcase 'shift':\n\t\tcase 'split':\n\t\t\t// Node decorations are bound to a block; in-block content edits\n\t\t\t// and splits don't affect them. Splits keep the decoration on the\n\t\t\t// original block (the new block has no decoration of its own).\n\t\t\treturn deco;\n\t\tcase 'merge':\n\t\t\t// Source block disappears as a separate block → its decoration is dropped.\n\t\t\treturn deco.blockId === stepMap.sourceBlockId ? null : deco;\n\t\tcase 'blockRemoval':\n\t\t\treturn stepMap.removedBlockIds.has(deco.blockId) ? null : deco;\n\t\tcase 'childIndexShift':\n\t\t\treturn deco;\n\t}\n}\n","/**\n * Decoration types and DecorationSet for transient, view-only annotations.\n * Decorations are NOT part of the document model and do NOT affect undo/redo.\n */\n\nimport type { BlockId } from '../model/TypeBrands.js';\nimport type { Transaction } from '../state/Transaction.js';\nimport { mapDecorationThroughStepMap } from './PositionMapping.js';\n\n// --- Decoration Attrs ---\n\nexport interface DecorationAttrs {\n\treadonly class?: string;\n\treadonly style?: string;\n\treadonly nodeName?: string;\n\treadonly [key: string]: string | undefined;\n}\n\n// --- Decoration Types ---\n\nexport interface InlineDecoration {\n\treadonly type: 'inline';\n\treadonly blockId: BlockId;\n\treadonly from: number;\n\treadonly to: number;\n\treadonly attrs: DecorationAttrs;\n}\n\nexport interface NodeDecoration {\n\treadonly type: 'node';\n\treadonly blockId: BlockId;\n\treadonly attrs: DecorationAttrs;\n}\n\nexport interface WidgetDecoration {\n\treadonly type: 'widget';\n\treadonly blockId: BlockId;\n\treadonly offset: number;\n\treadonly toDOM: () => HTMLElement;\n\treadonly side: -1 | 1;\n\treadonly key?: string;\n}\n\nexport type Decoration = InlineDecoration | NodeDecoration | WidgetDecoration;\n\n// --- Factory Functions ---\n\n/** Creates an inline decoration for a text range within a block. */\nexport function inline(\n\tblockId: BlockId,\n\tfrom: number,\n\tto: number,\n\tattrs: DecorationAttrs,\n): InlineDecoration {\n\treturn { type: 'inline', blockId, from, to, attrs };\n}\n\n/** Creates a node decoration that applies to a whole block element. */\nexport function node(blockId: BlockId, attrs: DecorationAttrs): NodeDecoration {\n\treturn { type: 'node', blockId, attrs };\n}\n\n/** Creates a widget decoration that inserts a DOM element at a position. */\nexport function widget(\n\tblockId: BlockId,\n\toffset: number,\n\ttoDOM: () => HTMLElement,\n\toptions?: { readonly side?: -1 | 1; readonly key?: string },\n): WidgetDecoration {\n\treturn {\n\t\ttype: 'widget',\n\t\tblockId,\n\t\toffset,\n\t\ttoDOM,\n\t\tside: options?.side ?? -1,\n\t\tkey: options?.key,\n\t};\n}\n\n// --- DecorationSet ---\n\n/**\n * Immutable set of decorations indexed by block ID.\n * Provides efficient lookup and merging of decoration collections.\n */\nexport class DecorationSet {\n\tstatic readonly empty: DecorationSet = new DecorationSet(new Map());\n\n\tprivate constructor(private readonly byBlock: ReadonlyMap<BlockId, readonly Decoration[]>) {}\n\n\t/** Creates a DecorationSet from a flat array of decorations. */\n\tstatic create(decorations: readonly Decoration[]): DecorationSet {\n\t\tif (decorations.length === 0) return DecorationSet.empty;\n\n\t\tconst map = new Map<BlockId, Decoration[]>();\n\t\tfor (const deco of decorations) {\n\t\t\tconst existing = map.get(deco.blockId);\n\t\t\tif (existing) {\n\t\t\t\texisting.push(deco);\n\t\t\t} else {\n\t\t\t\tmap.set(deco.blockId, [deco]);\n\t\t\t}\n\t\t}\n\t\treturn new DecorationSet(map);\n\t}\n\n\t/** Returns all decorations for a given block. */\n\tfind(blockId: BlockId): readonly Decoration[] {\n\t\treturn this.byBlock.get(blockId) ?? [];\n\t}\n\n\t/** Returns only inline decorations for a given block. */\n\tfindInline(blockId: BlockId): readonly InlineDecoration[] {\n\t\tconst decos = this.byBlock.get(blockId);\n\t\tif (!decos) return [];\n\t\treturn decos.filter((d): d is InlineDecoration => d.type === 'inline');\n\t}\n\n\t/** Returns only node decorations for a given block. */\n\tfindNode(blockId: BlockId): readonly NodeDecoration[] {\n\t\tconst decos = this.byBlock.get(blockId);\n\t\tif (!decos) return [];\n\t\treturn decos.filter((d): d is NodeDecoration => d.type === 'node');\n\t}\n\n\t/** Returns only widget decorations for a given block. */\n\tfindWidget(blockId: BlockId): readonly WidgetDecoration[] {\n\t\tconst decos = this.byBlock.get(blockId);\n\t\tif (!decos) return [];\n\t\treturn decos.filter((d): d is WidgetDecoration => d.type === 'widget');\n\t}\n\n\t/** Returns a new DecorationSet with the given decorations added. */\n\tadd(decorations: readonly Decoration[]): DecorationSet {\n\t\tif (decorations.length === 0) return this;\n\t\tif (this.isEmpty) return DecorationSet.create(decorations);\n\n\t\tconst map = new Map<BlockId, Decoration[]>();\n\t\tfor (const [bid, decos] of this.byBlock) {\n\t\t\tmap.set(bid, [...decos]);\n\t\t}\n\t\tfor (const deco of decorations) {\n\t\t\tconst existing = map.get(deco.blockId);\n\t\t\tif (existing) {\n\t\t\t\texisting.push(deco);\n\t\t\t} else {\n\t\t\t\tmap.set(deco.blockId, [deco]);\n\t\t\t}\n\t\t}\n\t\treturn new DecorationSet(map);\n\t}\n\n\t/** Returns a new DecorationSet with decorations matching the predicate removed. */\n\tremove(predicate: (d: Decoration) => boolean): DecorationSet {\n\t\tconst map = new Map<BlockId, Decoration[]>();\n\t\tlet changed = false;\n\n\t\tfor (const [bid, decos] of this.byBlock) {\n\t\t\tconst filtered = decos.filter((d) => !predicate(d));\n\t\t\tif (filtered.length !== decos.length) changed = true;\n\t\t\tif (filtered.length > 0) {\n\t\t\t\tmap.set(bid, filtered);\n\t\t\t}\n\t\t}\n\n\t\tif (!changed) return this;\n\t\tif (map.size === 0) return DecorationSet.empty;\n\t\treturn new DecorationSet(map);\n\t}\n\n\t/** Returns a new DecorationSet merging this set with another. */\n\tmerge(other: DecorationSet): DecorationSet {\n\t\tif (other.isEmpty) return this;\n\t\tif (this.isEmpty) return other;\n\n\t\tconst map = new Map<BlockId, Decoration[]>();\n\t\tfor (const [bid, decos] of this.byBlock) {\n\t\t\tmap.set(bid, [...decos]);\n\t\t}\n\t\tfor (const [bid, decos] of other.byBlock) {\n\t\t\tconst existing = map.get(bid);\n\t\t\tif (existing) {\n\t\t\t\texisting.push(...decos);\n\t\t\t} else {\n\t\t\t\tmap.set(bid, [...decos]);\n\t\t\t}\n\t\t}\n\t\treturn new DecorationSet(map);\n\t}\n\n\t/** Checks equality — reference first, then structural comparison. */\n\tequals(other: DecorationSet): boolean {\n\t\tif (this === other) return true;\n\t\tif (this.byBlock.size !== other.byBlock.size) return false;\n\n\t\tfor (const [bid, decos] of this.byBlock) {\n\t\t\tconst otherDecos = other.byBlock.get(bid);\n\t\t\tif (!otherDecos) return false;\n\t\t\tif (!decorationArraysEqual(decos, otherDecos)) return false;\n\t\t}\n\t\treturn true;\n\t}\n\n\t/** True if the set contains no decorations. */\n\tget isEmpty(): boolean {\n\t\treturn this.byBlock.size === 0;\n\t}\n\n\t/**\n\t * Maps decorations through document changes described by a transaction.\n\t * Decorations that become invalid (e.g. fully deleted range) are removed.\n\t * Decorations that span a split point are split into two.\n\t *\n\t * Iterates over `tr.mapping.maps` (the position-space {@link StepMap}s)\n\t * rather than `tr.steps`. This means selection-only or other identity\n\t * transactions short-circuit (`tr.mapping.isEmpty`) without rebuilding\n\t * the set, and the decoration-specific shape concerns (split-into-two,\n\t * drop-on-block-removal) are the only logic that lives here.\n\t */\n\tmap(tr: Transaction): DecorationSet {\n\t\tif (this.isEmpty || tr.mapping.isEmpty) return this;\n\n\t\tlet mapped: Decoration[] = [];\n\t\tfor (const decos of this.byBlock.values()) {\n\t\t\tfor (const d of decos) {\n\t\t\t\tmapped.push(d);\n\t\t\t}\n\t\t}\n\n\t\tfor (const stepMap of tr.mapping.maps) {\n\t\t\tconst next: Decoration[] = [];\n\t\t\tfor (const deco of mapped) {\n\t\t\t\tconst result = mapDecorationThroughStepMap(deco, stepMap);\n\t\t\t\tif (result === null) continue;\n\t\t\t\tif (Array.isArray(result)) {\n\t\t\t\t\tfor (const r of result) {\n\t\t\t\t\t\tnext.push(r);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tnext.push(result as Decoration);\n\t\t\t\t}\n\t\t\t}\n\t\t\tmapped = next;\n\t\t}\n\n\t\tif (mapped.length === 0) return DecorationSet.empty;\n\t\treturn DecorationSet.create(mapped);\n\t}\n}\n\n// --- Helpers ---\n\n/** Compares two decoration arrays for structural equality. */\nexport function decorationArraysEqual(a: readonly Decoration[], b: readonly Decoration[]): boolean {\n\tif (a === b) return true;\n\tif (a.length !== b.length) return false;\n\n\tfor (let i = 0; i < a.length; i++) {\n\t\tconst ai = a[i];\n\t\tconst bi = b[i];\n\t\tif (!ai || !bi || !decorationsEqual(ai, bi)) return false;\n\t}\n\treturn true;\n}\n\n/** Compares two individual decorations for structural equality. */\nfunction decorationsEqual(a: Decoration, b: Decoration): boolean {\n\tif (a.type !== b.type) return false;\n\tif (a.blockId !== b.blockId) return false;\n\n\tswitch (a.type) {\n\t\tcase 'inline': {\n\t\t\tconst bi = b as InlineDecoration;\n\t\t\treturn a.from === bi.from && a.to === bi.to && attrsEqual(a.attrs, bi.attrs);\n\t\t}\n\t\tcase 'node': {\n\t\t\tconst bn = b as NodeDecoration;\n\t\t\treturn attrsEqual(a.attrs, bn.attrs);\n\t\t}\n\t\tcase 'widget': {\n\t\t\tconst bw = b as WidgetDecoration;\n\t\t\treturn (\n\t\t\t\ta.offset === bw.offset && a.side === bw.side && a.key === bw.key && a.toDOM === bw.toDOM\n\t\t\t);\n\t\t}\n\t}\n}\n\n/** Compares two DecorationAttrs objects. */\nfunction attrsEqual(a: DecorationAttrs, b: DecorationAttrs): boolean {\n\tif (a === b) return true;\n\tconst aKeys = Object.keys(a);\n\tconst bKeys = Object.keys(b);\n\tif (aKeys.length !== bKeys.length) return false;\n\tfor (const key of aKeys) {\n\t\tif (a[key] !== b[key]) return false;\n\t}\n\treturn true;\n}\n"],"mappings":"2SA6LA,IAAa,EAA4B,CAAE,KAAM,YAMjD,SAAgB,EAAuB,GACtC,MAAM,iBAAM,IAAI,IACV,EAAQ,IACb,EAAI,IAAI,EAAE,IACV,IAAK,MAAM,KAAS,EAAE,SACjB,EAAY,IAAQ,EAAK,IAI/B,OADA,EAAK,GACE,CACR,CAaA,SAAgB,EAAuB,EAAe,EAAc,GAAe,GAClF,OAAQ,EAAI,MACX,IAAK,WAUL,IAAK,kBAKJ,MAAO,CAAE,MAAK,SAAS,GAbxB,IAAK,QACJ,OAgBH,SAAiC,EAAe,EAAe,GAC9D,GAAI,EAAI,UAAY,EAAI,QAAS,MAAO,CAAE,MAAK,SAAS,GAExD,MAAM,EAAgB,EAAI,QAAU,EAAI,GAAK,EAAI,MAC3C,EAAc,EAAI,OAGxB,GAAI,EAAM,EAAI,KAAM,MAAO,CAAE,MAAK,SAAS,GAG3C,GAAI,IAAQ,EAAI,KAAM,CAGrB,GAAI,EAAI,OAAS,EAAI,GAAI,CACxB,MAAM,EAA2B,IAAV,EAAc,EAAI,KAAO,EAAI,OAAS,EAAI,KACjE,OAAO,IAAW,EACf,CAAE,MAAK,SAAS,GAChB,CAAE,IAAK,EAAW,EAAK,GAAS,SAAS,EAC7C,CAGA,MAAO,CAAE,MAAK,SAAS,EACxB,CAGA,GAAI,EAAM,EAAI,GAEb,MAAO,CAAE,IAAK,EAAW,EADQ,IAAV,EAAc,EAAI,KAAO,EAAI,OAAS,EAAI,MAC1B,SAAS,GAIjD,MAAM,EAAiB,EAAM,EAC7B,OAAO,IAAW,EACf,CAAE,MAAK,SAAS,GAChB,CAAE,IAAK,EAAW,EAAK,GAAS,SAAS,EAC7C,CAnDU,CAAwB,EAAK,EAAK,GAC1C,IAAK,QACJ,OAmDH,SAAiC,EAAe,EAAe,GAC9D,OAAI,EAAI,UAAY,EAAI,SAEpB,EAAI,OAAS,EAAI,OAFmB,CAAE,MAAK,SAAS,GAIpD,EAAI,OAAS,EAAI,OACb,CACN,IAAK,EAAe,EAAI,WAAY,EAAI,OAAS,EAAI,QACrD,SAAS,GAKG,IAAV,EACI,CAAE,IAAK,EAAe,EAAI,WAAY,GAAI,SAAS,GAEpD,CAAE,MAAK,SAAS,EACxB,CApEU,CAAwB,EAAK,EAAK,GAC1C,IAAK,QACJ,OAoEH,SAAiC,EAAe,GAC/C,OAAI,EAAI,UAAY,EAAI,cAAsB,CAAE,MAAK,SAAS,GACvD,CACN,IAAK,EAAe,EAAI,cAAe,EAAI,OAAS,EAAI,oBACxD,SAAS,EAEX,CA1EU,CAAwB,EAAK,GACrC,IAAK,eACJ,OA0EH,SAAwC,EAAe,GACtD,OAAI,EAAI,gBAAgB,IAAI,EAAI,SACxB,CAAE,MAAK,SAAS,GAEjB,CAAE,MAAK,SAAS,EACxB,CA/EU,CAA+B,EAAK,GAQ9C,CA0EA,SAAS,EAAW,EAAoB,GACvC,OAAO,EAAe,EAAS,QAAS,EAAW,EAAS,KAC7D,CAYA,IAAa,EAAb,MAAa,EAEZ,aAAiC,IAAI,EAAQ,IAE7C,KAEA,WAAA,CAAoB,GACnB,KAAK,KAAO,CACb,CAGA,WAAO,CAAK,GACX,MAAM,EAAsB,GAC5B,IAAK,MAAM,KAAK,EACA,aAAX,EAAE,MAAqB,EAAS,KAAK,GAE1C,OAAwB,IAApB,EAAS,OAAqB,EAAQ,MACnC,IAAI,EAAQ,EACpB,CAGA,SAAA,CAAU,GACT,MAAiB,aAAb,EAAI,KAA4B,KAC7B,IAAI,EAAQ,IAAI,KAAK,KAAM,GACnC,CAGA,aAAA,CAAc,GACb,OAA0B,IAAtB,EAAM,KAAK,OAAqB,KACX,IAArB,KAAK,KAAK,OAAqB,EAC5B,IAAI,EAAQ,IAAI,KAAK,QAAS,EAAM,MAC5C,CAGA,WAAI,GACH,OAA4B,IAArB,KAAK,KAAK,MAClB,CAOA,GAAA,CAAI,EAAe,GAAe,GACjC,OAAO,KAAK,UAAU,EAAK,GAAO,GACnC,CAOA,SAAA,CAAU,EAAe,GAAe,GACvC,IAAI,EAAoB,EACpB,GAAU,EACd,IAAK,MAAM,KAAK,KAAK,KAAM,CAC1B,MAAM,EAAoB,EAAuB,EAAS,EAAG,GAC7D,EAAU,EAAO,IACb,EAAO,UAAS,GAAU,EAC/B,CACA,MAAO,CAAE,IAAK,EAAS,UACxB,CAeA,QAAA,CAAS,EAAsB,GAAmB,EAAI,EAAiB,GACtE,MAAM,EAAkB,KAAK,UAAU,EAAM,KAAM,GAC7C,EAAgB,KAAK,UAAU,EAAM,GAAI,GAE/C,OAAI,EAAK,SAAW,EAAG,SAClB,EAAK,IAAI,UAAY,EAAG,IAAI,SAAW,EAAK,IAAI,QAAU,EAAG,IAAI,OAC7D,KAGF,CAAE,KAAM,EAAK,IAAK,GAAI,EAAG,IACjC,GA0BD,SAAgB,EACf,EACA,EACA,EACA,EACA,EAAmB,EACnB,GAAiB,GAEjB,GAAI,EAAQ,QAAS,MAAO,CAAE,UAAS,OAAM,MAE7C,MAAM,EAAoB,EAAe,EAAS,GAC5C,EAAkB,EAAe,EAAS,GAC1C,EAAwB,EAAQ,UAAU,EAAS,GACnD,EAAsB,EAAQ,UAAU,EAAO,GAKrD,OAAI,EAAW,SAAW,EAAS,SAK/B,EAAW,IAAI,UAAY,EAAS,IAAI,SAKxC,EAAW,IAAI,OAAS,EAAS,IAAI,OAVU,KAY5C,CACN,QAAS,EAAW,IAAI,QACxB,KAAM,EAAW,IAAI,OACrB,GAAI,EAAS,IAAI,OAEnB,CASA,SAAgB,EACf,EACA,EACA,EACA,GAAe,GAEf,GAAI,EAAQ,QAAS,MAAO,CAAE,UAAS,KAAM,EAAQ,GAAI,GAEzD,MAAM,EAAgB,EAAe,EAAS,GACxC,EAAoB,EAAQ,UAAU,EAAK,GACjD,OAAI,EAAO,QAAgB,KACpB,CAAE,QAAS,EAAO,IAAI,QAAS,KAAM,EAAO,IAAI,OAAQ,GAAI,EAAO,IAAI,OAC/E,CA2BA,SAAgB,EACf,EACA,EACA,GAEA,OAAO,EAAe,EAAY,EAAO,EAAS,WACnD,CAeA,SAAgB,EACf,EACA,EACA,GAMA,OAAO,EAAe,EAAY,EAAO,EAAS,YACnD,CAgBA,SAAS,EACR,EACA,EACA,EACA,GAEA,GAAI,EAAQ,QAAS,OAAO,EAE5B,IAAI,EAAkB,EACtB,IAAK,MAAM,KAAK,EAAQ,KAAM,CAC7B,MAAM,EAAsB,EAAyB,EAAY,EAAS,EAAG,GAC7E,GAAa,OAAT,EAAe,OAAO,KAC1B,EAAU,CACX,CACA,OAAO,CACR,CAEA,SAAS,EACR,EACA,EACA,EACA,GAEA,OAAQ,EAAI,MACX,IAAK,WACL,IAAK,QACL,IAAK,QACL,IAAK,QACJ,OAAO,EACR,IAAK,eACJ,OAAK,EAAe,EAAY,EAAI,YAChC,IAAU,EAAI,MAKD,aAAT,EAAsB,KAAO,EAEjC,EAAQ,EAAI,MAAc,EAAQ,EAC/B,EATiD,EAUzD,IAAK,kBACJ,OAAK,EAAe,EAAY,EAAI,aAChC,GAAS,EAAI,UAAkB,EAAQ,EAAI,MADS,EAI3D,CAEA,SAAS,EAAe,EAAuB,GAC9C,GAAI,IAAM,EAAG,OAAO,EACpB,GAAI,EAAE,SAAW,EAAE,OAAQ,OAAO,EAClC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAE,OAAQ,IAC7B,GAAI,EAAE,KAAO,EAAE,GAAI,OAAO,EAE3B,OAAO,CACR,CAqBA,SAAgB,EAAc,GAC7B,OAAQ,EAAI,MACX,IAAK,WAwBL,IAAK,eAQL,IAAK,kBASJ,OAAO,EAvCR,IAAK,QACJ,MAAO,CACN,KAAM,QACN,QAAS,EAAI,QACb,KAAM,EAAI,KACV,GAAI,EAAI,KAAO,EAAI,OACnB,OAAQ,EAAI,GAAK,EAAI,MAEvB,IAAK,QACJ,MAAO,CACN,KAAM,QACN,cAAe,EAAI,QACnB,cAAe,EAAI,WACnB,mBAAoB,EAAI,QAE1B,IAAK,QACJ,MAAO,CACN,KAAM,QACN,QAAS,EAAI,cACb,OAAQ,EAAI,mBACZ,WAAY,EAAI,eAqBpB,CAMA,SAAgB,EAAc,EAAY,GACzC,GAAI,EAAE,OAAS,EAAE,KAAM,OAAO,EAC9B,OAAQ,EAAE,MACT,IAAK,WACJ,OAAO,EACR,IAAK,QAAS,CACb,MAAM,EAAK,EACX,OACC,EAAE,UAAY,EAAG,SAAW,EAAE,OAAS,EAAG,MAAQ,EAAE,KAAO,EAAG,IAAM,EAAE,SAAW,EAAG,MAEtF,CACA,IAAK,QAAS,CACb,MAAM,EAAK,EACX,OAAO,EAAE,UAAY,EAAG,SAAW,EAAE,SAAW,EAAG,QAAU,EAAE,aAAe,EAAG,UAClF,CACA,IAAK,QAAS,CACb,MAAM,EAAK,EACX,OACC,EAAE,gBAAkB,EAAG,eACvB,EAAE,gBAAkB,EAAG,eACvB,EAAE,qBAAuB,EAAG,kBAE9B,CACA,IAAK,eAAgB,CACpB,MAAM,EAAK,EACX,GAAI,EAAE,QAAU,EAAG,MAAO,OAAO,EACjC,IAAK,EAAe,EAAE,WAAY,EAAG,YAAa,OAAO,EACzD,GAAI,EAAE,gBAAgB,OAAS,EAAG,gBAAgB,KAAM,OAAO,EAC/D,IAAK,MAAM,KAAM,EAAE,gBAClB,IAAK,EAAG,gBAAgB,IAAI,GAAK,OAAO,EAEzC,OAAO,CACR,CACA,IAAK,kBAAmB,CACvB,MAAM,EAAK,EACX,OACC,EAAE,YAAc,EAAG,WACnB,EAAE,QAAU,EAAG,OACf,EAAe,EAAE,WAAY,EAAG,WAElC,EAEF,CCvtBA,SAAgB,EACf,EACA,EACA,GAEA,MAAO,CACN,SAAU,EAAmB,EAAI,SAAU,EAAS,GAEtD,CAUA,SAAgB,EACf,EACA,EACA,GAEA,IAAI,GAAU,EACd,MAAM,EAAsB,EAAS,IAAK,IACzC,IAAK,EAAY,GAAQ,OAAO,EAChC,GAAI,EAAM,KAAO,EAEhB,OADA,GAAU,EACH,EAAG,GAIX,MAAM,EAA8B,EAAmB,EAAM,SAAU,EAAS,GAChF,OAAI,IAAmB,EAAM,SAAiB,GAC9C,GAAU,EACH,IAAK,EAAO,SAAU,MAE9B,OAAO,EAAU,EAAU,CAC5B,CAMA,SAAgB,EACf,EACA,EACA,GAEA,GAAoB,IAAhB,EAAK,OAAc,OAAO,EAE9B,MAAM,EAA6B,EAAK,GACxC,OAAK,EACE,CACN,SAAU,EAAI,SAAS,IAAK,GACtB,EAAY,IAAU,EAAM,KAAO,EACpB,IAAhB,EAAK,OAAqB,EAAG,GAC1B,EAAuB,EAAO,EAAM,EAAG,GAFS,IAHrC,CAQrB,CAGA,SAAgB,EACf,EACA,EACA,EACA,GAEA,MAAM,EAA+B,EAAK,GAC1C,IAAK,EAAU,OAAO,EACtB,MAAM,EAA2B,EAAK,SAAS,IAAK,GAC9C,EAAY,IAAU,EAAM,KAAO,EACpC,IAAU,EAAK,OAAS,EAAU,EAAG,GAClC,EAAuB,EAAO,EAAM,EAAQ,EAAG,GAFG,GAI1D,MAAO,IAAK,EAAM,SAAU,EAC7B,CASA,SAAgB,EACf,EACA,EACA,GAEA,GAAI,EAAU,GACb,OAAO,EAAU,GAGlB,IAAI,GAAU,EACd,MAAM,EAA2B,EAAS,IAAK,IAC9C,IAAK,EAAY,GAAQ,OAAO,EAChC,MAAM,EAAsC,EAC3C,EAAM,SACN,EACA,GAED,OAAI,GACH,GAAU,EACH,IAAK,EAAO,SAAU,IAEvB,IAGR,OAAO,EAAU,EAAc,IAChC,CCvEA,SAAS,EACR,EACA,EACA,GAEA,MAAM,EAAoC,GAC1C,IAAI,EAAM,EACN,GAAW,EAEf,IAAK,MAAM,KAAQ,EAAO,CACzB,GAAI,EAAa,GAAO,CAClB,GAAY,IAAW,IAC3B,EAAO,QAAQ,KACf,GAAW,GAEZ,EAAO,KAAK,GACZ,GAAO,EACP,QACD,CAEA,MAAM,EAAkB,EAAM,EAAK,KAAK,OAExC,IAAK,GAAY,GAAU,GAAO,GAAU,EAAS,CACpD,MAAM,EAAsB,EAAS,EAC/B,EAAiB,EAAK,KAAK,MAAM,EAAG,GACpC,EAAgB,EAAK,KAAK,MAAM,GAElC,GAAQ,EAAO,KAAK,EAAe,EAAQ,EAAK,QACpD,EAAO,QAAQ,KACX,GAAO,EAAO,KAAK,EAAe,EAAO,EAAK,QAClD,GAAW,CACZ,MACC,EAAO,KAAK,GAGb,EAAM,CACP,CAMA,OAJK,GACJ,EAAO,QAAQ,KAGT,CACR,CAgDA,SAAgB,EACf,EACA,EACA,GAEA,MAAM,EAAoC,GAC1C,IAAI,EAAM,EAEV,IAAK,MAAM,KAAQ,EAAO,CACzB,GAAI,EAAa,GAAO,CACvB,MAAM,EAAkB,EAAM,EAC1B,EAAU,GAAQ,EAAM,GAC3B,EAAO,KAAK,GAEb,EAAM,EACN,QACD,CAEA,MAAM,EAAkB,EAAM,EAAK,KAAK,OAExC,GAAI,GAAW,GAAQ,GAAO,OAEvB,CACN,MAAM,EAAoB,KAAK,IAAI,EAAG,EAAO,GACvC,EAAkB,KAAK,IAAI,EAAK,KAAK,OAAQ,EAAK,GAClD,EAAe,EAAK,KAAK,MAAM,EAAW,GAC5C,EAAK,OAAS,GACjB,EAAO,KAAK,EAAe,EAAM,EAAK,OAExC,CAEA,EAAM,CACP,CAMA,OAJsB,IAAlB,EAAO,QACV,EAAO,KAAK,EAAe,KAGrB,CACR,CAMA,SAAgB,EACf,EACA,EACA,EACA,EACA,GAEA,MAAM,EAAoC,GAC1C,IAAI,EAAM,EAEV,IAAK,MAAM,KAAQ,EAAO,CACzB,GAAI,EAAa,GAAO,CACvB,EAAO,KAAK,GACZ,GAAO,EACP,QACD,CAEA,MAAM,EAAkB,EAAM,EAAK,KAAK,OAExC,GAAI,GAAW,GAAQ,GAAO,EAC7B,EAAO,KAAK,QACN,GAAI,GAAO,GAAQ,GAAW,EAAI,CACxC,MAAM,EAA4B,EAC/B,EAAa,EAAK,MAAO,GACzB,EAAkB,EAAK,MAAO,EAAK,MACtC,EAAO,KAAK,EAAe,EAAK,KAAM,GACvC,KAAO,CACN,MAAM,EAAuB,KAAK,IAAI,EAAG,EAAO,GAC1C,EAAqB,KAAK,IAAI,EAAK,KAAK,OAAQ,EAAK,GAErD,EAAqB,EAAK,KAAK,MAAM,EAAG,GACxC,EAAqB,EAAK,KAAK,MAAM,EAAc,GACnD,EAAoB,EAAK,KAAK,MAAM,GAG1C,GADI,GAAY,EAAO,KAAK,EAAe,EAAY,EAAK,QACxD,EAAY,CACf,MAAM,EAA4B,EAC/B,EAAa,EAAK,MAAO,GACzB,EAAkB,EAAK,MAAO,EAAK,MACtC,EAAO,KAAK,EAAe,EAAY,GACxC,CACI,GAAW,EAAO,KAAK,EAAe,EAAW,EAAK,OAC3D,CAEA,EAAM,CACP,CAEA,OAAO,CACR,CAWA,SAAgB,EACf,EACA,EACA,EACA,GAEA,MAAM,EAAyC,GAC/C,GAAI,GAAQ,EAAI,OAAO,EACvB,IAAI,EAA+C,KAC/C,EAAM,EAEV,MAAM,EAAA,KACD,IACH,EAAO,KAAK,GACZ,EAAU,OAIZ,IAAK,MAAM,KAAQ,EAAO,CACzB,MACM,EAAkB,GADG,EAAa,GAAQ,EAAI,EAAK,KAAK,QAG9D,GAAI,GAAW,GAAQ,GAAO,EAAI,CACjC,EAAM,EACN,QACD,CAEA,MAAM,EAAuB,KAAK,IAAI,EAAK,GACrC,EAAqB,KAAK,IAAI,EAAS,GAEzC,EAAa,GACZ,IAAS,EAAQ,GAAK,GAChB,EAAK,MAAM,KAAM,GAAM,EAAE,OAAS,GAC5C,IACU,EACV,EAAQ,GAAK,EAEb,EAAU,CAAE,KAAM,EAAc,GAAI,GAGrC,EAAM,CACP,CAGA,OADA,IACO,CACR,CAaA,SAAgB,EACf,EACA,EACA,EACA,GAEA,MAAM,EAAqD,GAC3D,GAAI,GAAQ,EAAI,OAAO,EACvB,IAAI,EAA2D,KAC3D,EAAM,EAEV,MAAM,EAAA,KACD,IACH,EAAO,KAAK,GACZ,EAAU,OAIZ,IAAK,MAAM,KAAQ,EAAO,CACzB,MACM,EAAkB,GADG,EAAa,GAAQ,EAAI,EAAK,KAAK,QAG9D,GAAI,GAAW,GAAQ,GAAO,EAAI,CACjC,EAAM,EACN,QACD,CAEA,MAAM,EAAuB,KAAK,IAAI,EAAK,GACrC,EAAqB,KAAK,IAAI,EAAS,GAE7C,GAAI,EAAa,GACZ,IAAS,EAAQ,GAAK,OACpB,CACN,MAAM,EAA2B,EAAK,MAAM,KAAM,GAAM,EAAE,OAAS,GAC9D,EAEM,GAAW,EAAW,EAAQ,KAAM,GAC9C,EAAQ,GAAK,GAEb,IACA,EAAU,CAAE,KAAM,EAAc,GAAI,EAAY,KAAM,IALtD,GAOF,CAEA,EAAM,CACP,CAGA,OADA,IACO,CACR,CAqGA,SAAgB,EACf,EACA,GAGA,GAAI,EAAS,MAAO,GAAM,EAAW,IAAM,EAAa,IACvD,OAAO,EAGR,MAAM,EAA6B,EAAS,OAAQ,IAAO,EAAW,KAAO,EAAa,IAC1F,MAAO,IAAI,KAAsB,EAClC,CCrQA,SAAS,EACR,EACA,EACA,EACA,GAAY,GAEZ,OAAO,EAAS,EAAK,EAAU,IAE9B,MAAM,EAAyC,EADY,EAAkB,IAE7E,MAAO,IACH,EACH,SAAU,EACT,EAAM,SACN,EAAY,EAAuB,GAAe,KAItD,CCpMA,SAAgB,EAAe,GAC9B,OAAO,EAAS,OAAA,CACd,EAAa,IAAsB,GAAkB,WAAX,EAAE,KAAoB,EAAI,EAAE,KAAK,QAC5E,EAEF,CAGA,SAAgB,EAAe,GAE9B,MAAO,CACN,OAFgC,EAAK,MAAM,SAE7B,IACZ,IAAA,CACA,KAAM,EAAS,aACf,SAAU,CAAC,EAAY,OAI3B,CCkKA,SAAgB,EAAoB,GACnC,OAAO,EAAK,SAAW,EAAe,EAAK,UAAY,EAAK,KAAK,MAClE,CC7KA,SAAS,EAAa,GAGrB,OAAO,EAAK,KAAO,CAAE,KAAM,EAAK,MAAS,CAAC,CAC3C,CA4JA,SAAgB,EAAwB,GACvC,IAAK,MAAM,KAAQ,EAAG,MACrB,GAAkB,mBAAd,EAAK,KACR,OAAO,EAAK,cAGd,OAAO,EAAG,gBACX,CCvHA,SAAS,EACR,EACA,EACA,GAEA,OAAK,EACD,IAAoB,EAAmB,CAAC,EACrC,CAAE,QAFS,CAAC,CAGpB,CASA,SAAS,GAAqB,EAAgC,GAC7D,GAAI,EAAQ,QAAS,OAAO,EAC5B,IAAK,MAAM,KAAM,EAAY,CAC5B,MAAM,EAAS,EAAQ,UAAU,CAAE,QAAS,EAAI,OAAQ,IAAK,GAC7D,GAAI,EAAO,QAAS,OAAO,EAC3B,GAAI,EAAO,IAAI,UAAY,EAAI,OAAO,CACvC,CACA,OAAO,CACR,CAOA,SAAS,GACR,EACA,GAEA,OACC,EAAO,UAAY,EAAS,SAC5B,EAAO,OAAS,EAAS,MACzB,EAAO,KAAO,EAAS,EAEzB,CAgVA,SAAS,GACR,EACA,GAEA,GAAI,IAAM,EAAG,OAAO,EACpB,IAAK,IAAM,EAAG,OAAO,EACrB,MAAM,EAAQ,OAAO,KAAK,GACpB,EAAQ,OAAO,KAAK,GAC1B,GAAI,EAAM,SAAW,EAAM,OAAQ,OAAO,EAC1C,IAAK,MAAM,KAAK,EACf,GAAI,EAAE,KAAO,EAAE,GAAI,OAAO,EAE3B,OAAO,CACR,CEpWA,IAAM,GAAqC,CAC1C,WAAY,CACX,MNnEF,SAAgC,EAAe,GAC9C,OAAO,EAAsB,EAAK,EAAK,QAAU,IAChD,SAAK,UDVN,ECWoC,EDVpC,ECU4C,EAAK,ODTjD,ECSyD,EAAK,SDPvD,EAAwB,EAAO,EAAA,IAAc,EAAS,IAAI,KAnBlE,SACC,EACA,EACA,EACA,GAEA,OAAO,EAAwB,EAAO,EAAA,IAAc,CAAC,EAAe,EAAM,IAC3E,CCoBK,CAA4B,EAAQ,EAAK,OAAQ,EAAK,KAAM,EAAK,ODbtE,IACC,EACA,EACA,GCYD,EM8DE,OH/EF,SAAiC,GAChC,MAAO,CACN,KAAM,aACN,QAAS,EAAK,QACd,KAAM,EAAK,OACX,GAAI,EAAK,OAAS,EAAoB,GACtC,YAAa,EAAK,KAClB,aAAc,EAAK,MACnB,gBAAiB,EAAK,UAAY,CAAC,EAAY,EAAK,KAAM,IAAI,EAAK,YAChE,EAAa,GAElB,EGqEE,OD5EF,SAAiC,EAAgB,GAChD,MAAO,CACN,KAAM,QACN,QAAS,EAAK,QACd,KAAM,EAAK,OACX,GAAI,EAAK,OACT,OAAQ,EAAoB,GAE9B,ECqEE,IFMF,SAA8B,EAAsB,EAAkB,GACrE,MAAM,EAAS,EAAiB,EAAK,QAAS,EAAK,OAAQ,GAAS,GACpE,OAAK,EACD,EAAO,UAAY,EAAK,SAAW,EAAO,OAAS,EAAK,OAAe,EACpE,CACN,KAAM,aACN,QAAS,EAAO,QAChB,OAAQ,EAAO,KACf,KAAM,EAAK,KACX,MAAO,EAAK,SACR,EAAK,SAAW,CAAE,SAAU,EAAK,UAAa,CAAC,KAChD,EAAc,EAAK,QAAS,EAAO,QAAS,EAAK,OATjC,IAWrB,GEjBC,WAAY,CACX,MNjEF,SAAgC,EAAe,GAC9C,OAAO,EAAsB,EAAK,EAAK,QAAU,GDwClD,SACC,EACA,EACA,GAEA,MAAM,EAAoC,GAC1C,IAAI,EAAM,EAEV,IAAK,MAAM,KAAQ,EAAO,CACzB,GAAI,EAAa,GAAO,CACvB,MAAM,EAAkB,EAAM,GAE1B,GAAW,GAAQ,GAAO,IAC7B,EAAO,KAAK,GAEb,EAAM,EACN,QACD,CAEA,MAAM,EAAkB,EAAM,EAAK,KAAK,OAExC,GAAI,GAAW,GAAQ,GAAO,EAC7B,EAAO,KAAK,OACN,CACN,MAAM,EAAqB,KAAK,IAAI,EAAG,EAAO,GACxC,EAAmB,KAAK,IAAI,EAAK,KAAK,OAAQ,EAAK,GACnD,EAAoB,EAAK,KAAK,MAAM,EAAG,GAAc,EAAK,KAAK,MAAM,GACvE,EAAU,OAAS,GACtB,EAAO,KAAK,EAAe,EAAW,EAAK,OAE7C,CAEA,EAAM,CACP,CAEA,OAAO,CACR,CC3EE,CAAwB,EAAQ,EAAK,KAAM,EAAK,IAElD,EM8DE,OHxEF,SAAiC,GAChC,MAAO,CACN,KAAM,aACN,QAAS,EAAK,QACd,OAAQ,EAAK,KACb,KAAM,EAAK,YACX,MAAO,EAAK,aACZ,SAAU,EAAK,mBACZ,EAAa,GAElB,EG+DE,ODxEF,SAAiC,EAAgB,GAChD,MAAO,CACN,KAAM,QACN,QAAS,EAAK,QACd,KAAM,EAAK,KACX,GAAI,EAAK,GACT,OAAQ,EAEV,ECiEE,IFeF,SAA8B,EAAsB,EAAkB,GACrE,MAAM,EAAS,EAAgB,EAAK,QAAS,EAAK,KAAM,EAAK,GAAI,GACjE,IAAK,EAAQ,OAAO,KACpB,GAAI,GAAiB,CAAE,QAAS,EAAK,QAAS,KAAM,EAAK,KAAM,GAAI,EAAK,IAAM,GAC7E,OAAO,EAOR,MAAM,EAAQ,EAAS,EAAK,EAAO,SACnC,IAAK,EAAO,OAAO,KACnB,MAAM,EAAc,EAAa,GAAO,MAAM,EAAO,KAAM,EAAO,IAC5D,EAAe,EAAsB,EAAO,EAAO,MACnD,EAAkB,EAA+B,EAAO,EAAO,KAAM,EAAO,IAElF,MAAO,CACN,KAAM,aACN,QAAS,EAAO,QAChB,KAAM,EAAO,KACb,GAAI,EAAO,GACX,cACA,eACA,qBACG,EAAc,EAAK,QAAS,EAAO,QAAS,EAAK,MAEtD,GExCC,WAAY,CACX,MNjEF,SAAgC,EAAe,GAC9C,MA+CM,EAA2C,EAChD,EAAI,SAJc,GAClB,EAAS,KAAM,GAAM,EAAY,IAAM,EAAE,KAAO,EAAK,SA7ChC,IACrB,MAAM,EAAqB,EAAS,UAAW,GAAM,EAAY,IAAM,EAAE,KAAO,EAAK,SACrF,IAAmB,IAAf,EAAmB,OAAO,EAE9B,MAAM,EAAmB,EAAS,GAC5B,EAAqD,EAAkB,GACvE,EAAc,EAAe,GAC7B,EAA8C,EACnD,EACA,EACA,EAAK,QAEA,EAA6C,EAClD,EACA,EAAK,OACL,GAGK,EAA0B,IAC5B,EACH,SAAU,EAAuB,IAQ5B,OAA6C,IAAtB,EAAK,aAC5B,EAAwB,EAAK,cAAgB,EAAM,KACnD,EAAmC,EAAc,EAAK,cAAgB,EAAM,MAE5E,EAAsB,EAC3B,EACA,EAAuB,GACvB,EAAK,WACL,GAGK,EAAsB,IAAI,GAEhC,OADA,EAAO,OAAO,EAAY,EAAG,EAAc,GACpC,IAWR,OAAO,EAAc,CAAE,SAAU,GAA+B,CACjE,EMYE,OHlEF,SAAiC,GAChC,MAAO,CACN,KAAM,cACN,cAAe,EAAK,QACpB,cAAe,EAAK,WACpB,mBAAoB,EAAK,eACC,IAAtB,EAAK,aAA6B,CAAE,WAAY,EAAK,cAAiB,CAAC,KACvE,EAAK,cAAgB,CAAE,YAAa,EAAK,eAAkB,CAAC,KAC7D,EAAa,GAElB,EGyDE,OD9CF,SAAiC,EAAgB,GAChD,MAAO,CACN,KAAM,QACN,QAAS,EAAK,QACd,OAAQ,EAAK,OACb,WAAY,EAAK,WAEnB,ECwCE,IF4FF,SAA8B,EAAsB,EAAkB,GACrE,MAAM,EAAS,EAAiB,EAAK,QAAS,EAAK,OAAQ,GAAS,GACpE,OAAK,EACD,EAAO,UAAY,EAAK,SAAW,EAAO,OAAS,EAAK,OAAe,EACpE,CACN,KAAM,aACN,QAAS,EAAO,QAChB,OAAQ,EAAO,KACf,WAAY,EAAK,mBACS,IAAtB,EAAK,aAA6B,CAAE,aAAc,EAAK,cAAiB,CAAC,KACzE,EAAK,cAAgB,CAAE,cAAe,EAAK,eAAkB,CAAC,KAC/D,EAAc,EAAK,QAAS,EAAO,QAAS,EAAK,OATjC,IAWrB,GEvGC,YAAa,CACZ,MNfF,SAAiC,EAAe,GAC/C,MA6BM,EAA2C,EAChD,EAAI,SALuB,GAC3B,EAAS,KAAM,GAAM,EAAY,IAAM,EAAE,KAAO,EAAK,gBACrD,EAAS,KAAM,GAAM,EAAY,IAAM,EAAE,KAAO,EAAK,eA3BhC,IACrB,MAAM,EAAoB,EAAS,UACjC,GAAM,EAAY,IAAM,EAAE,KAAO,EAAK,eAElC,EAAoB,EAAS,UACjC,GAAM,EAAY,IAAM,EAAE,KAAO,EAAK,eAExC,IAAkB,IAAd,IAAkC,IAAd,EAAkB,OAAO,EAEjD,MAAM,EAAoB,EAAS,GAC7B,EAAoB,EAAS,GAC7B,EAAmD,EAAkB,GACrE,EAAmD,EAAkB,GACrE,EAAqD,EAAuB,IAC9E,KACA,IAEE,EAAyB,IAAK,EAAQ,SAAU,GAKtD,OAH8B,EAAS,OACrC,IAAO,EAAY,IAAM,EAAE,KAAO,EAAK,eAEzB,IAAK,GAAO,EAAY,IAAM,EAAE,KAAO,EAAK,cAAgB,EAAc,KAY3F,OAAO,EAAc,CAAE,SAAU,GAA+B,CACjE,EMpBE,OH5DF,SAAkC,GACjC,MAAO,CACN,KAAM,aACN,QAAS,EAAK,cACd,OAAQ,EAAK,mBACb,WAAY,EAAK,sBACO,IAApB,EAAK,WAA2B,CAAE,aAAc,EAAK,YAAe,CAAC,KACrE,EAAK,YAAc,CAAE,cAAe,EAAK,aAAgB,CAAC,KAC3D,EAAa,GAElB,EGmDE,OD3CF,SAAkC,EAAgB,GACjD,MAAO,CACN,KAAM,QACN,cAAe,EAAK,cACpB,cAAe,EAAK,cACpB,mBAAoB,EAAK,mBAE3B,ECqCE,IFqGF,SACC,EACA,EACA,GAEA,GAAI,EAAQ,QAAS,OAAO,EAG5B,MAAM,EAAc,EAAQ,UAAU,CAAE,QAAS,EAAK,cAAe,OAAQ,IAAK,GAC5E,EAAc,EAAQ,UAAU,CAAE,QAAS,EAAK,cAAe,OAAQ,IAAK,GAClF,GAAI,EAAY,SAAW,EAAY,QAAS,OAAO,KACvD,MAAM,EAAc,EAAY,IAAI,QAC9B,EAAc,EAAY,IAAI,QACpC,GAAI,IAAgB,EAAa,OAAO,KAMxC,MAAM,EAAS,EAAS,EAAK,GAC7B,IAAK,EAAQ,OAAO,KACpB,MAAM,EAAqB,EAAe,GAE1C,OACC,IAAgB,EAAK,eACrB,IAAgB,EAAK,eACrB,IAAuB,EAAK,mBAErB,EAGD,CACN,KAAM,cACN,cAAe,EACf,cAAe,EACf,6BACwB,IAApB,EAAK,WAA2B,CAAE,WAAY,EAAK,YAAe,CAAC,KACnE,EAAK,YAAc,CAAE,YAAa,EAAK,aAAgB,CAAC,KACzD,EAAc,EAAK,cAAe,EAAa,EAAK,MAEzD,GE3IC,QAAS,CACR,MNiBF,SAA6B,EAAe,GAC3C,OAAO,EAAsB,EAAK,EAAK,QAAU,GAChD,EAAyB,EAAQ,EAAK,KAAM,EAAK,GAAI,EAAK,MAAM,GAElE,EMpBE,OHtDF,SAA8B,GAC7B,MAAO,CACN,KAAM,aACN,QAAS,EAAK,QACd,KAAM,EAAK,KACX,GAAI,EAAK,GACT,KAAM,EAAK,QACR,EAAa,GAElB,EG8CE,ODLF,SAA8B,EAAgB,GAC7C,OAAO,CACR,ECIE,IF2IF,SAA2B,EAAmB,EAAkB,GAC/D,MAAM,EAAS,EAAgB,EAAK,QAAS,EAAK,KAAM,EAAK,GAAI,GACjE,OAAK,EACD,GAAiB,CAAE,QAAS,EAAK,QAAS,KAAM,EAAK,KAAM,GAAI,EAAK,IAAM,GACtE,EAED,CACN,KAAM,UACN,QAAS,EAAO,QAChB,KAAM,EAAO,KACb,GAAI,EAAO,GACX,KAAM,EAAK,QACR,EAAc,EAAK,QAAS,EAAO,QAAS,EAAK,OAVjC,IAYrB,GEvJC,WAAY,CACX,MNiBF,SAAgC,EAAe,GAC9C,OAAO,EAAsB,EAAK,EAAK,QAAU,GAChD,EAAyB,EAAQ,EAAK,KAAM,EAAK,GAAI,EAAK,MAAM,GAElE,EMpBE,OHjDF,SAAiC,GAChC,MAAO,CACN,KAAM,UACN,QAAS,EAAK,QACd,KAAM,EAAK,KACX,GAAI,EAAK,GACT,KAAM,EAAK,QACR,EAAa,GAElB,EGyCE,ODPF,SAAiC,EAAgB,GAChD,OAAO,CACR,ECME,IFqJF,SAA8B,EAAsB,EAAkB,GACrE,MAAM,EAAS,EAAgB,EAAK,QAAS,EAAK,KAAM,EAAK,GAAI,GACjE,OAAK,EACD,GAAiB,CAAE,QAAS,EAAK,QAAS,KAAM,EAAK,KAAM,GAAI,EAAK,IAAM,GACtE,EAED,CACN,KAAM,aACN,QAAS,EAAO,QAChB,KAAM,EAAO,KACb,GAAI,EAAO,GACX,KAAM,EAAK,QACR,EAAc,EAAK,QAAS,EAAO,QAAS,EAAK,OAVjC,IAYrB,GEjKC,eAAgB,CACf,MNsBF,SAAoC,GACnC,OAAO,CACR,EMvBE,OH5CF,SAAqC,GACpC,MAAO,CACN,KAAM,iBACN,MAAO,EAAK,cACZ,cAAe,EAAK,MAEtB,EGuCE,ODTF,SAAqC,EAAgB,GACpD,OAAO,CACR,ECQE,IFiKF,SACC,EACA,EACA,GAGA,OAAO,CACR,GEtKC,aAAc,CACb,MN+DF,SAAkC,EAAe,GAChD,OAAO,EAAS,EAAK,EAAK,QAAU,IACnC,MAAQ,MAAO,KAAmB,GAAS,EAC3C,MAAO,IACH,EACH,KAAM,EAAK,YACP,EAAK,MAAQ,CAAE,MAAO,EAAK,OAAU,CAAC,IAG7C,EMvEE,OH1CF,SAAmC,GAClC,MAAO,CACN,KAAM,eACN,QAAS,EAAK,QACd,SAAU,EAAK,iBACf,MAAO,EAAK,cACZ,iBAAkB,EAAK,SACvB,cAAe,EAAK,SACjB,EAAa,GAElB,EGiCE,ODXF,SAAmC,EAAgB,GAClD,OAAO,CACR,ECUE,IFoKF,SACC,EACA,EACA,GAEA,GAAI,EAAQ,QAAS,OAAO,EAC5B,MAAM,EAAQ,EAAQ,UAAU,CAAE,QAAS,EAAK,QAAS,OAAQ,IAAK,GACtE,GAAI,EAAM,QAAS,OAAO,KAC1B,MAAM,EAAa,EAAM,IAAI,QAKvB,EAA+B,EAAS,EAAK,GACnD,OAAK,EAGJ,IAAe,EAAK,SACpB,EAAM,OAAS,EAAK,kBACpB,GAAgB,EAAM,MAAO,EAAK,eAE3B,EAGD,CACN,KAAM,eACN,QAAS,EACT,SAAU,EAAK,YACX,EAAK,MAAQ,CAAE,MAAO,EAAK,OAAU,CAAC,EAC1C,iBAAkB,EAAM,QACpB,EAAM,MAAQ,CAAE,cAAe,EAAM,OAAU,CAAC,KACjD,EAAc,EAAK,QAAS,EAAY,EAAK,OAjB9B,IAmBpB,GEnMC,WAAY,CACX,MNsEF,SAAgC,EAAe,GAC9C,GAA+B,IAA3B,EAAK,WAAW,OAAc,CAEjC,MAAM,EAA2B,IAAI,EAAI,UAEzC,OADA,EAAY,OAAO,EAAK,MAAO,EAAG,EAAK,MAChC,CAAE,SAAU,EACpB,CAEA,OAAO,EAAc,EAAK,EAAK,WAAa,IAC3C,MAAM,EAA2B,IAAI,EAAO,UAE5C,OADA,EAAY,OAAO,EAAK,MAAO,EAAG,EAAK,MAChC,IAAK,EAAQ,SAAU,IAEhC,EMlFE,OHpCF,SAAiC,GAChC,MAAO,CACN,KAAM,aACN,WAAY,EAAK,WACjB,MAAO,EAAK,MACZ,YAAa,EAAK,KAEpB,EG8BE,OD9CF,SAAiC,EAAgB,GAChD,MAAO,CACN,KAAM,kBACN,WAAY,EAAK,WACjB,UAAW,EAAK,MAChB,MAAO,EAET,ECwCE,IF8OF,SAA8B,EAAsB,EAAkB,GACrE,IAAK,GAAqB,EAAK,WAAY,GAAU,OAAO,KAI5D,MAAM,EAAuB,EAAkB,EAAK,WAAY,EAAK,MAAO,GAC5E,OAAI,IAAiB,EAAK,MAAc,EACjC,CACN,KAAM,aACN,WAAY,EAAK,WACjB,MAAO,EACP,KAAM,EAAK,KAEb,GEzPC,WAAY,CACX,MN+EF,SAAgC,EAAe,GAC9C,GAA+B,IAA3B,EAAK,WAAW,OAAc,CAEjC,MAAM,EAA2B,IAAI,EAAI,UAEzC,OADA,EAAY,OAAO,EAAK,MAAO,GACxB,CAAE,SAAU,EACpB,CAEA,OAAO,EAAc,EAAK,EAAK,WAAa,IAC3C,MAAM,EAA2B,IAAI,EAAO,UAE5C,OADA,EAAY,OAAO,EAAK,MAAO,GACxB,IAAK,EAAQ,SAAU,IAEhC,EM3FE,OHjCF,SAAiC,GAChC,MAAO,CACN,KAAM,aACN,WAAY,EAAK,WACjB,MAAO,EAAK,MACZ,KAAM,EAAK,YAEb,EG2BE,ODtEF,SAAiC,EAAgB,GAChD,MAAO,CACN,KAAM,eACN,gBAAiB,EAAuB,EAAK,aAC7C,WAAY,EAAK,WACjB,MAAO,EAAK,MAEd,ECgEE,IFuPF,SAA8B,EAAsB,EAAkB,GACrE,IAAK,GAAqB,EAAK,WAAY,GAAU,OAAO,KAE5D,MAAM,EAAQ,EAAQ,UAAU,CAAE,QAAS,EAAK,YAAY,GAAI,OAAQ,IAAK,GAC7E,GAAI,EAAM,QAAS,OAAO,KAC1B,GAAI,EAAM,IAAI,UAAY,EAAK,YAAY,GAAI,OAAO,KAEtD,MAAM,EAA8B,EAAc,EAAK,WAAY,EAAK,MAAO,GAG/E,GAAqB,OAAjB,EAAuB,OAAO,KAQlC,MAAM,EAAQ,EAAe,EAAK,EAAK,WAAY,GACnD,OAAK,EAKD,EAAM,KAAO,EAAK,YAAY,GAAW,KAEzC,IAAiB,EAAK,OAAS,IAAU,EAAK,YAAoB,EAC/D,CACN,KAAM,aACN,WAAY,EAAK,WACjB,MAAO,EACP,YAAa,GAZK,IAcpB,GEtRC,YAAa,CACZ,MNwFF,SAAiC,EAAe,GAC/C,MAAM,EAA6B,EAAK,KAAK,EAAK,KAAK,OAAS,GAChE,OAAK,EAEE,EAAS,EAAK,EAAS,IAAA,IAC1B,EACH,MAAO,EAAK,SAJO,CAMrB,EM/FE,OH9BF,SAAkC,GACjC,MAAO,CACN,KAAM,cACN,KAAM,EAAK,KACX,MAAO,EAAK,cACZ,cAAe,EAAK,MAEtB,EGwBE,ODzBF,SAAkC,EAAgB,GACjD,OAAO,CACR,ECwBE,IFqLF,SACC,EACA,EACA,GAEA,GAAI,EAAQ,QAAS,OAAO,EAC5B,IAAK,GAAqB,EAAK,KAAM,GAAU,OAAO,KACtD,MAAM,EAAO,EAAkB,EAAK,EAAK,MACzC,OAAK,EACE,CACN,KAAM,cACN,KAAM,EAAK,KACX,MAAO,EAAK,SACR,EAAK,MAAQ,CAAE,cAAe,EAAK,OAAU,CAAC,GALjC,IAOnB,GElMC,iBAAkB,CACjB,MNFF,SAAsC,EAAe,GACpD,OAAO,EAAsB,EAAK,EAAK,QAAU,GD6KlD,SACC,EACA,EACA,GAEA,MAAM,EAAoC,GAC1C,IAAI,EAAM,EACN,GAAW,EAEf,IAAK,MAAM,KAAQ,EAAO,CACzB,GAAI,EAAa,GAAO,CAClB,GAAY,IAAW,IAC3B,EAAO,KAAK,GACZ,GAAW,GAEZ,EAAO,KAAK,GACZ,GAAO,EACP,QACD,CAEA,MAAM,EAAkB,EAAM,EAAK,KAAK,OAExC,IAAK,GAAY,GAAU,GAAO,GAAU,EAAS,CACpD,MAAM,EAAsB,EAAS,EAC/B,EAAiB,EAAK,KAAK,MAAM,EAAG,GACpC,EAAgB,EAAK,KAAK,MAAM,GAElC,GAAQ,EAAO,KAAK,EAAe,EAAQ,EAAK,QACpD,EAAO,KAAK,GACR,GAAO,EAAO,KAAK,EAAe,EAAO,EAAK,QAClD,GAAW,CACZ,MACC,EAAO,KAAK,GAGb,EAAM,CACP,CAMA,OAJK,GACJ,EAAO,KAAK,GAGN,CACR,CCvNE,CAAyB,EAAQ,EAAK,OAAQ,EAAK,MAErD,EMDE,OH3BF,SAAuC,GACtC,MAAO,CACN,KAAM,mBACN,QAAS,EAAK,QACd,OAAQ,EAAK,OACb,YAAa,EAAK,QACf,EAAa,GAElB,EGoBE,OD1HF,SAAuC,EAAgB,GACtD,MAAO,CACN,KAAM,QACN,QAAS,EAAK,QACd,KAAM,EAAK,OACX,GAAI,EAAK,OACT,OAAQ,EAEV,ECmHE,IFhBF,SACC,EACA,EACA,GAEA,MAAM,EAAS,EAAiB,EAAK,QAAS,EAAK,OAAQ,GAAS,GACpE,OAAK,EACD,EAAO,UAAY,EAAK,SAAW,EAAO,OAAS,EAAK,OAAe,EACpE,CACN,KAAM,mBACN,QAAS,EAAO,QAChB,OAAQ,EAAO,KACf,KAAM,EAAK,QACR,EAAc,EAAK,QAAS,EAAO,QAAS,EAAK,OAPjC,IASrB,GEGC,iBAAkB,CACjB,MNFF,SAAsC,EAAe,GACpD,OAAO,EAAsB,EAAK,EAAK,QAAU,GDqNlD,SACC,EACA,GAEA,MAAM,EAAoC,GAC1C,IAAI,EAAM,EAEV,IAAK,MAAM,KAAQ,EACd,EAAa,IACZ,IAAQ,GACX,EAAO,KAAK,GAEb,GAAO,IAGR,EAAO,KAAK,GACZ,GAAO,EAAK,KAAK,QAGlB,OAAO,CACR,CCxOE,CAAyB,EAAQ,EAAK,QAExC,EMDE,OHvBF,SAAuC,GACtC,MAAO,CACN,KAAM,mBACN,QAAS,EAAK,QACd,OAAQ,EAAK,OACb,KAAM,EAAK,eACR,EAAa,GAElB,EGgBE,ODtHF,SAAuC,EAAgB,GACtD,MAAO,CACN,KAAM,QACN,QAAS,EAAK,QACd,KAAM,EAAK,OACX,GAAI,EAAK,OAAS,EAClB,OAAQ,EAEV,EC+GE,IFLF,SACC,EACA,EACA,GAMA,MAAM,EAAS,EAAgB,EAAK,QAAS,EAAK,OAAQ,EAAK,OAAS,EAAG,EAAS,EAAG,GACvF,IAAK,EAAQ,OAAO,KACpB,GAAI,EAAO,GAAK,EAAO,OAAS,EAAG,OAAO,KAQ1C,MAAM,EAAQ,EAAS,EAAK,EAAO,SACnC,IAAK,EAAO,OAAO,KACnB,MAAM,EAAU,EAAmB,EAAO,EAAO,MACjD,OAAK,GAA4B,WAAjB,EAAQ,MAAsB,EAAa,EAAQ,OAwQ1C,EAvQH,EAAK,gBAuQa,EAvQA,EAAQ,OAyQ5C,EAAE,aAAe,EAAE,YAChB,GAAgB,EAAE,MAAO,EAAE,OAxQ9B,EAAO,UAAY,EAAK,SAAW,EAAO,OAAS,EAAK,OAAe,EACpE,CACN,KAAM,mBACN,QAAS,EAAO,QAChB,OAAQ,EAAO,KACf,YAAa,EAAQ,QAClB,EAAc,EAAK,QAAS,EAAO,QAAS,EAAK,OARS,KADmB,KAwQlF,IAA0B,EAAe,CA7PzC,GE1BC,kBAAmB,CAClB,MNFF,SAAuC,EAAe,GACrD,OAAO,EACN,EACA,EAAK,QACJ,GDmOH,SACC,EACA,EACA,GAEA,MAAM,EAAoC,GAC1C,IAAI,EAAM,EAEV,IAAK,MAAM,KAAQ,EACd,EAAa,IACZ,IAAQ,EACX,EAAO,KAAK,IAAK,EAAM,UAEvB,EAAO,KAAK,GAEb,GAAO,IAGR,EAAO,KAAK,GACZ,GAAO,EAAK,KAAK,QAGlB,OAAO,CACR,CC1Pc,CAA2B,EAAQ,EAAK,OAAQ,EAAK,QACjE,EAEF,EMJE,OHnBF,SAAwC,GACvC,MAAO,CACN,KAAM,oBACN,QAAS,EAAK,QACd,OAAQ,EAAK,OACb,MAAO,EAAK,cACZ,cAAe,EAAK,SACjB,EAAa,GAElB,EGWE,ODvCF,SAAwC,EAAgB,GACvD,OAAO,CACR,ECsCE,IFoLF,SACC,EACA,EACA,GAEA,MAAM,EAAS,EAAgB,EAAK,QAAS,EAAK,OAAQ,EAAK,OAAS,EAAG,EAAS,EAAG,GACvF,IAAK,EAAQ,OAAO,KACpB,GAAI,EAAO,GAAK,EAAO,OAAS,EAAG,OAAO,KAC1C,GAAI,EAAO,UAAY,EAAK,SAAW,EAAO,OAAS,EAAK,OAC3D,OAAO,EAGR,MAAM,EAAQ,EAAS,EAAK,EAAO,SACnC,IAAK,EAAO,OAAO,KACnB,MAAM,EAAU,EAAmB,EAAO,EAAO,MACjD,OAAK,GAA4B,WAAjB,EAAQ,MAAsB,EAAa,EAAQ,MAC5D,CACN,KAAM,oBACN,QAAS,EAAO,QAChB,OAAQ,EAAO,KACf,MAAO,EAAK,MACZ,cAAe,EAAQ,KAAK,SACzB,EAAc,EAAK,QAAS,EAAO,QAAS,EAAK,OAP4B,IASlF,IElMA,SAAS,GAA2B,GACnC,OAAO,GAAc,EAAK,KAC3B,CAGA,SAAgB,GAAU,EAAe,GACxC,OAAO,GAAW,GAAM,MAAM,EAAK,EACpC,CAGA,SAAgB,GAAW,GAC1B,OAAO,GAAW,GAAM,OAAO,EAChC,CAMA,SAAgB,GAAW,EAAe,GACzC,OAAO,GAAW,GAAM,OAAO,EAAK,EACrC,CAiBA,SAAgB,GAAQ,EAAY,EAAkB,GACrD,OAAI,EAAQ,QAAgB,EACrB,GAAW,GAAM,IAAI,EAAM,EAAS,EAC5C,CAiBA,SAAgB,GAAkB,GACjC,MAAM,EAAwB,EAAG,MAAM,IAAI,IAAY,UACvD,MAAO,CACN,MAAO,EACP,gBAAiB,EAAG,eACpB,eAAgB,EAAG,gBACnB,iBAAkB,EAAwB,GAC1C,QAAS,EAAQ,MACjB,gBAAiB,EAAc,IAAA,IAAU,GACzC,SAAU,CACT,OAAQ,UACR,UAAW,KAAK,OAGnB,CC/OA,SAAgB,GACf,EACA,GAEA,OAAQ,EAAK,MACZ,IAAK,SACJ,OAwBH,SACC,EACA,GAEA,OAAQ,EAAQ,MACf,IAAK,WAUL,IAAK,kBAEJ,OAAO,EAVR,IAAK,QACJ,OAaH,SAAwB,EAAwB,GAC/C,GAAI,EAAK,UAAY,EAAI,QAAS,OAAO,EAEzC,MAAM,EAAU,EAAuB,EAAe,EAAK,QAAS,EAAK,MAAO,GAAK,GAAI,IACnF,EAAQ,EAAuB,EAAe,EAAK,QAAS,EAAK,IAAK,EAAK,GAAG,IAEpF,OAAI,EAAQ,QAAU,EAAM,OAAe,KACvC,EAAQ,SAAW,EAAK,MAAQ,EAAM,SAAW,EAAK,GAAW,EAC9D,IAAK,EAAM,KAAM,EAAQ,OAAQ,GAAI,EAAM,OACnD,CAtBU,CAAe,EAAM,GAC7B,IAAK,QACJ,OAsBH,SACC,EACA,GAEA,OAAI,EAAK,UAAY,EAAI,SAErB,EAAK,IAAM,EAAI,OAFsB,EAIrC,EAAK,MAAQ,EAAI,OACb,IACH,EACH,QAAS,EAAI,WACb,KAAM,EAAK,KAAO,EAAI,OACtB,GAAI,EAAK,GAAK,EAAI,QAYb,CAAC,IAP4B,EAAM,GAAI,EAAI,QAOpC,IALV,EACH,QAAS,EAAI,WACb,KAAM,EACN,GAAI,EAAK,GAAK,EAAI,QAGpB,CAhDU,CAAe,EAAM,GAC7B,IAAK,QACJ,OAgDH,SAAwB,EAAwB,GAC/C,OAAI,EAAK,UAAY,EAAI,cAAsB,EACxC,IACH,EACH,QAAS,EAAI,cACb,KAAM,EAAK,KAAO,EAAI,mBACtB,GAAI,EAAK,GAAK,EAAI,mBAEpB,CAxDU,CAAe,EAAM,GAC7B,IAAK,eACJ,OAAO,EAAQ,gBAAgB,IAAI,EAAK,SAAW,KAAO,EAK7D,CA3CU,CAAU,EAAM,GACxB,IAAK,SACJ,OA8FH,SAAmB,EAAwB,GAC1C,OAAQ,EAAQ,MACf,IAAK,WAUL,IAAK,kBACJ,OAAO,EATR,IAAK,QACJ,OAYH,SAAwB,EAAwB,GAC/C,GAAI,EAAK,UAAY,EAAI,QAAS,OAAO,EAEzC,MAAM,EAAS,EAAuB,EAAe,EAAK,QAAS,EAAK,QAAS,EAAK,EAAK,MAE3F,OAAI,EAAO,QAAgB,KACvB,EAAO,IAAI,SAAW,EAAK,OAAe,EACvC,IAAK,EAAM,OAAQ,EAAO,IAAI,OACtC,CApBU,CAAe,EAAM,GAC7B,IAAK,QACJ,OAoBH,SAAwB,EAAwB,GAC/C,GAAI,EAAK,UAAY,EAAI,QAAS,OAAO,EACzC,MAAM,EAAS,EAAuB,EAAe,EAAK,QAAS,EAAK,QAAS,EAAK,EAAK,MAC3F,OAAI,EAAO,IAAI,UAAY,EAAK,SAAW,EAAO,IAAI,SAAW,EAAK,OAAe,EAC9E,IAAK,EAAM,QAAS,EAAO,IAAI,QAAS,OAAQ,EAAO,IAAI,OACnE,CAzBU,CAAe,EAAM,GAC7B,IAAK,QACJ,OAyBH,SAAwB,EAAwB,GAC/C,OAAI,EAAK,UAAY,EAAI,cAAsB,EACxC,IACH,EACH,QAAS,EAAI,cACb,OAAQ,EAAK,OAAS,EAAI,mBAE5B,CAhCU,CAAe,EAAM,GAC7B,IAAK,eACJ,OAAO,EAAQ,gBAAgB,IAAI,EAAK,SAAW,KAAO,EAI7D,CA7GU,CAAU,EAAM,GACxB,IAAK,OACJ,OAyIH,SAAiB,EAAsB,GACtC,OAAQ,EAAQ,MACf,IAAK,WACL,IAAK,QACL,IAAK,QAUL,IAAK,kBACJ,OAAO,EANR,IAAK,QAEJ,OAAO,EAAK,UAAY,EAAQ,cAAgB,KAAO,EACxD,IAAK,eACJ,OAAO,EAAQ,gBAAgB,IAAI,EAAK,SAAW,KAAO,EAI7D,CA1JU,CAAQ,EAAM,GAExB,CCFA,SAAgB,GACf,EACA,EACA,EACA,GAEA,MAAO,CAAE,KAAM,SAAU,UAAS,OAAM,KAAI,QAC7C,CAGA,SAAgB,GAAK,EAAkB,GACtC,MAAO,CAAE,KAAM,OAAQ,UAAS,QACjC,CAGA,SAAgB,GACf,EACA,EACA,EACA,GAEA,MAAO,CACN,KAAM,SACN,UACA,SACA,QACA,KAAM,GAAS,OAAQ,EACvB,IAAK,GAAS,IAEhB,CAQA,IAAa,GAAb,MAAa,EAGyB,QAFrC,aAAuC,IAAI,iBAAc,IAAI,KAE7D,WAAA,CAAoB,GAAiB,KAAA,QAAA,CAAuD,CAG5F,aAAO,CAAO,GACb,GAA2B,IAAvB,EAAY,OAAc,OAAO,EAAc,MAEnD,MAAM,iBAAM,IAAI,IAChB,IAAK,MAAM,KAAQ,EAAa,CAC/B,MAAM,EAAW,EAAI,IAAI,EAAK,SAC1B,EACH,EAAS,KAAK,GAEd,EAAI,IAAI,EAAK,QAAS,CAAC,GAEzB,CACA,OAAO,IAAI,EAAc,EAC1B,CAGA,IAAA,CAAK,GACJ,OAAO,KAAK,QAAQ,IAAI,IAAY,EACrC,CAGA,UAAA,CAAW,GACV,MAAM,EAAQ,KAAK,QAAQ,IAAI,GAC/B,OAAK,EACE,EAAM,OAAQ,GAAwC,WAAX,EAAE,MADjC,EAEpB,CAGA,QAAA,CAAS,GACR,MAAM,EAAQ,KAAK,QAAQ,IAAI,GAC/B,OAAK,EACE,EAAM,OAAQ,GAAsC,SAAX,EAAE,MAD/B,EAEpB,CAGA,UAAA,CAAW,GACV,MAAM,EAAQ,KAAK,QAAQ,IAAI,GAC/B,OAAK,EACE,EAAM,OAAQ,GAAwC,WAAX,EAAE,MADjC,EAEpB,CAGA,GAAA,CAAI,GACH,GAA2B,IAAvB,EAAY,OAAc,OAAO,KACrC,GAAI,KAAK,QAAS,OAAO,EAAc,OAAO,GAE9C,MAAM,iBAAM,IAAI,IAChB,IAAK,MAAO,EAAK,KAAU,KAAK,QAC/B,EAAI,IAAI,EAAK,IAAI,IAElB,IAAK,MAAM,KAAQ,EAAa,CAC/B,MAAM,EAAW,EAAI,IAAI,EAAK,SAC1B,EACH,EAAS,KAAK,GAEd,EAAI,IAAI,EAAK,QAAS,CAAC,GAEzB,CACA,OAAO,IAAI,EAAc,EAC1B,CAGA,MAAA,CAAO,GACN,MAAM,iBAAM,IAAI,IAChB,IAAI,GAAU,EAEd,IAAK,MAAO,EAAK,KAAU,KAAK,QAAS,CACxC,MAAM,EAAW,EAAM,OAAQ,IAAO,EAAU,IAC5C,EAAS,SAAW,EAAM,SAAQ,GAAU,GAC5C,EAAS,OAAS,GACrB,EAAI,IAAI,EAAK,EAEf,CAEA,OAAK,EACY,IAAb,EAAI,KAAmB,EAAc,MAClC,IAAI,EAAc,GAFJ,IAGtB,CAGA,KAAA,CAAM,GACL,GAAI,EAAM,QAAS,OAAO,KAC1B,GAAI,KAAK,QAAS,OAAO,EAEzB,MAAM,iBAAM,IAAI,IAChB,IAAK,MAAO,EAAK,KAAU,KAAK,QAC/B,EAAI,IAAI,EAAK,IAAI,IAElB,IAAK,MAAO,EAAK,KAAU,EAAM,QAAS,CACzC,MAAM,EAAW,EAAI,IAAI,GACrB,EACH,EAAS,QAAQ,GAEjB,EAAI,IAAI,EAAK,IAAI,GAEnB,CACA,OAAO,IAAI,EAAc,EAC1B,CAGA,MAAA,CAAO,GACN,GAAI,OAAS,EAAO,OAAO,EAC3B,GAAI,KAAK,QAAQ,OAAS,EAAM,QAAQ,KAAM,OAAO,EAErD,IAAK,MAAO,EAAK,KAAU,KAAK,QAAS,CACxC,MAAM,EAAa,EAAM,QAAQ,IAAI,GACrC,IAAK,EAAY,OAAO,EACxB,IAAK,GAAsB,EAAO,GAAa,OAAO,CACvD,CACA,OAAO,CACR,CAGA,WAAI,GACH,OAA6B,IAAtB,KAAK,QAAQ,IACrB,CAaA,GAAA,CAAI,GACH,GAAI,KAAK,SAAW,EAAG,QAAQ,QAAS,OAAO,KAE/C,IAAI,EAAuB,GAC3B,IAAK,MAAM,KAAS,KAAK,QAAQ,SAChC,IAAK,MAAM,KAAK,EACf,EAAO,KAAK,GAId,IAAK,MAAM,KAAW,EAAG,QAAQ,KAAM,CACtC,MAAM,EAAqB,GAC3B,IAAK,MAAM,KAAQ,EAAQ,CAC1B,MAAM,EAAS,GAA4B,EAAM,GACjD,GAAe,OAAX,EACJ,GAAI,MAAM,QAAQ,GACjB,IAAK,MAAM,KAAK,EACf,EAAK,KAAK,QAGX,EAAK,KAAK,EAEZ,CACA,EAAS,CACV,CAEA,OAAsB,IAAlB,EAAO,OAAqB,EAAc,MACvC,EAAc,OAAO,EAC7B,GAMD,SAAgB,GAAsB,EAA0B,GAC/D,GAAI,IAAM,EAAG,OAAO,EACpB,GAAI,EAAE,SAAW,EAAE,OAAQ,OAAO,EAElC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAE,OAAQ,IAAK,CAClC,MAAM,EAAK,EAAE,GACP,EAAK,EAAE,GACb,IAAK,IAAO,IAAO,GAAiB,EAAI,GAAK,OAAO,CACrD,CACA,OAAO,CACR,CAGA,SAAS,GAAiB,EAAe,GACxC,GAAI,EAAE,OAAS,EAAE,KAAM,OAAO,EAC9B,GAAI,EAAE,UAAY,EAAE,QAAS,OAAO,EAEpC,OAAQ,EAAE,MACT,IAAK,SAAU,CACd,MAAM,EAAK,EACX,OAAO,EAAE,OAAS,EAAG,MAAQ,EAAE,KAAO,EAAG,IAAM,GAAW,EAAE,MAAO,EAAG,MACvE,CACA,IAAK,OAAQ,CACZ,MAAM,EAAK,EACX,OAAO,GAAW,EAAE,MAAO,EAAG,MAC/B,CACA,IAAK,SAAU,CACd,MAAM,EAAK,EACX,OACC,EAAE,SAAW,EAAG,QAAU,EAAE,OAAS,EAAG,MAAQ,EAAE,MAAQ,EAAG,KAAO,EAAE,QAAU,EAAG,KAErF,EAEF,CAGA,SAAS,GAAW,EAAoB,GACvC,GAAI,IAAM,EAAG,OAAO,EACpB,MAAM,EAAQ,OAAO,KAAK,GACpB,EAAQ,OAAO,KAAK,GAC1B,GAAI,EAAM,SAAW,EAAM,OAAQ,OAAO,EAC1C,IAAK,MAAM,KAAO,EACjB,GAAI,EAAE,KAAS,EAAE,GAAM,OAAO,EAE/B,OAAO,CACR"}

package/dist/chunks/DirectionDetection-C7XE0nxW.mjs

@@ -0,0 +1,2 @@
+import{S as r}from"./Document-r7vLOAGA.mjs";var t=/[\p{Script=Hebrew}\p{Script=Arabic}\p{Script=Syriac}\p{Script=Thaana}\p{Script=Mandaic}\p{Script=Nko}\p{Script=Samaritan}\p{Script=Adlam}\p{Script=Hanifi_Rohingya}\p{Script=Mende_Kikakui}\p{Script=Yezidi}\p{Script=Old_South_Arabian}\p{Script=Old_North_Arabian}\p{Script=Avestan}\p{Script=Imperial_Aramaic}\p{Script=Phoenician}\p{Script=Lydian}\u200F\u061C]/u,i=/[\p{Script=Latin}\p{Script=Greek}\p{Script=Cyrillic}\p{Script=Armenian}\p{Script=Devanagari}\p{Script=Bengali}\p{Script=Gurmukhi}\p{Script=Gujarati}\p{Script=Oriya}\p{Script=Tamil}\p{Script=Telugu}\p{Script=Kannada}\p{Script=Malayalam}\p{Script=Sinhala}\p{Script=Thai}\p{Script=Lao}\p{Script=Tibetan}\p{Script=Myanmar}\p{Script=Georgian}\p{Script=Hangul}\p{Script=Hiragana}\p{Script=Katakana}\p{Script=Han}\p{Script=Ethiopic}\p{Script=Cherokee}\p{Script=Khmer}\u200E]/u;function p(r){const p=r.search(t),a=r.search(i);return-1===p&&-1===a?null:-1===p?"ltr":-1===a||p<a?"rtl":"ltr"}function a(r){const t=r.attrs?.dir;return"ltr"===t||"rtl"===t?t:"auto"}function c(t,i,p){const a=function(t,i){if(0===i.length)return t.doc.children;const p=i[i.length-1];if(!p)return[];const a=t.getBlock(p);return a?a.children.filter(r):[]}(t,i);for(let r=p-1;r>=0;r--){const t=a[r]?.attrs?.dir;if("ltr"===t||"rtl"===t)return t}for(let r=p;r<a.length;r++){const t=a[r]?.attrs?.dir;if("ltr"===t||"rtl"===t)return t}}export{c as n,a as r,p as t};
+//# sourceMappingURL=DirectionDetection-C7XE0nxW.mjs.map