@intlayer/core 9.4.1 → 9.4.3

package/dist/cjs/markdown/constants.cjs

@@ -63,8 +63,6 @@ const Priority = {
 	/** bare text and stuff that is considered leftovers */
 	MIN: 4
 };
-/** Threshold for performance logging (in milliseconds) */
-const DURATION_DELAY_TRIGGER = 20;
 /**
 * Map of HTML attributes to their JSX prop equivalents.
 * Some renderers use camelCase for certain attributes.
@@ -222,14 +220,23 @@ const PARAGRAPH_R = /^[^\n]+(?: {2}\n|\n{2,})/;
 const REFERENCE_IMAGE_OR_LINK = /^\[([^\]]*)\]:\s+<?([^\s>]+)>?\s*("([^"]*)")?/;
 const REFERENCE_IMAGE_R = /^!\[([^\]]*)\] ?\[([^\]]*)\]/;
 const REFERENCE_LINK_R = /^\[([^\]]*)\] ?\[([^\]]*)\]/;
+/**
+* Cheap prefix probes used to reject a rule before its full (and far more
+* expensive) block regex runs. Kept as module constants so the parser's inner
+* loop never allocates a `RegExp` per candidate position.
+*/
+const HTML_BLOCK_OPENING_TAG_R = /^ *<([a-z][a-z0-9:-]*)\b/i;
+const HTML_SELF_CLOSING_OPENING_TAG_R = /^ *<([a-zA-Z][a-zA-Z0-9:]*)[\s>/]/;
+const CUSTOM_COMPONENT_OPENING_TAG_R = /^ *<([A-Z][a-zA-Z0-9]*)/;
 /** Block detection */
 const SHOULD_RENDER_AS_BLOCK_R = /(\n|^[-*]\s|^#|^ {2,}|^-{2,}|^>\s)/;
 /** Tab and whitespace */
 const TAB_R = /\t/g;
+/** Every character `normalizeWhitespace` rewrites, so it needs a single pass. */
+const NORMALIZE_WHITESPACE_R = /\r\n?|\f|\t/g;
 const TRIM_STARTING_NEWLINES = /^\n+/;
 const HTML_LEFT_TRIM_AMOUNT_R = /^\n*([ \t]*)/;
 /** List patterns */
-const LIST_LOOKBEHIND_R = /(?:^|\n)( *)$/;
 const ORDERED_LIST_BULLET = "(?:\\d+\\.)";
 const UNORDERED_LIST_BULLET = "(?:[*+-])";
 /** Text formatting patterns */
@@ -296,9 +303,9 @@ exports.CODE_BLOCK_R = CODE_BLOCK_R;
 exports.CODE_INLINE_R = CODE_INLINE_R;
 exports.CONSECUTIVE_NEWLINE_R = CONSECUTIVE_NEWLINE_R;
 exports.CR_NEWLINE_R = CR_NEWLINE_R;
+exports.CUSTOM_COMPONENT_OPENING_TAG_R = CUSTOM_COMPONENT_OPENING_TAG_R;
 exports.CUSTOM_COMPONENT_R = CUSTOM_COMPONENT_R;
 exports.DO_NOT_PROCESS_HTML_ELEMENTS = DO_NOT_PROCESS_HTML_ELEMENTS;
-exports.DURATION_DELAY_TRIGGER = DURATION_DELAY_TRIGGER;
 exports.FENCE_DELIMITER_R = FENCE_DELIMITER_R;
 exports.FOOTNOTE_R = FOOTNOTE_R;
 exports.FOOTNOTE_REFERENCE_R = FOOTNOTE_REFERENCE_R;
@@ -309,18 +316,20 @@ exports.HEADING_ATX_COMPLIANT_R = HEADING_ATX_COMPLIANT_R;
 exports.HEADING_R = HEADING_R;
 exports.HEADING_SETEXT_R = HEADING_SETEXT_R;
 exports.HTML_BLOCK_ELEMENT_R = HTML_BLOCK_ELEMENT_R;
+exports.HTML_BLOCK_OPENING_TAG_R = HTML_BLOCK_OPENING_TAG_R;
 exports.HTML_CHAR_CODE_R = HTML_CHAR_CODE_R;
 exports.HTML_COMMENT_R = HTML_COMMENT_R;
 exports.HTML_CUSTOM_ATTR_R = HTML_CUSTOM_ATTR_R;
 exports.HTML_LEFT_TRIM_AMOUNT_R = HTML_LEFT_TRIM_AMOUNT_R;
 exports.HTML_SELF_CLOSING_ELEMENT_R = HTML_SELF_CLOSING_ELEMENT_R;
+exports.HTML_SELF_CLOSING_OPENING_TAG_R = HTML_SELF_CLOSING_OPENING_TAG_R;
 exports.INLINE_SKIP_R = INLINE_SKIP_R;
 exports.INTERPOLATION_R = INTERPOLATION_R;
 exports.LINK_AUTOLINK_BARE_URL_R = LINK_AUTOLINK_BARE_URL_R;
 exports.LINK_AUTOLINK_R = LINK_AUTOLINK_R;
-exports.LIST_LOOKBEHIND_R = LIST_LOOKBEHIND_R;
 exports.LOOKAHEAD = LOOKAHEAD;
 exports.NAMED_CODES_TO_UNICODE = NAMED_CODES_TO_UNICODE;
+exports.NORMALIZE_WHITESPACE_R = NORMALIZE_WHITESPACE_R;
 exports.NP_TABLE_R = NP_TABLE_R;
 exports.ORDERED = ORDERED;
 exports.ORDERED_LIST_BULLET = ORDERED_LIST_BULLET;

package/dist/cjs/markdown/constants.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"constants.cjs","names":[],"sources":["../../../src/markdown/constants.ts"],"sourcesContent":["// ============================================================================\n// RULE TYPES\n// ============================================================================\n\n/**\n * Analogous to `node.type`. Please note that the values here may change at any time,\n * so do not hard code against the value directly.\n */\nexport const RuleType = {\n  blockQuote: '0',\n  breakLine: '1',\n  breakThematic: '2',\n  codeBlock: '3',\n  codeFenced: '4',\n  codeInline: '5',\n  footnote: '6',\n  footnoteReference: '7',\n  gfmTask: '8',\n  heading: '9',\n  headingSetext: '10',\n  /** only available if not `disableHTMLParsing` */\n  htmlBlock: '11',\n  htmlComment: '12',\n  /** only available if not `disableHTMLParsing` */\n  htmlSelfClosing: '13',\n  /** Custom components like <Tabs>, <TabItem> */\n  customComponent: '34',\n  image: '14',\n  link: '15',\n  /** emits a `link` 'node', does not render directly */\n  linkAngleBraceStyleDetector: '16',\n  /** emits a `link` 'node', does not render directly */\n  linkBareUrlDetector: '17',\n  newlineCoalescer: '19',\n  orderedList: '20',\n  paragraph: '21',\n  ref: '22',\n  refImage: '23',\n  refLink: '24',\n  table: '25',\n  tableSeparator: '26',\n  text: '27',\n  textBolded: '28',\n  textEmphasized: '29',\n  textEscaped: '30',\n  textMarked: '31',\n  textStrikethroughed: '32',\n  unorderedList: '33',\n} as const;\n\n// In test environment, use human-readable keys for easier debugging\nif (process.env.NODE_ENV === 'test') {\n  Object.keys(RuleType).forEach((key) => {\n    (RuleType as any)[key] = key;\n  });\n}\n\nexport type RuleTypeValue = (typeof RuleType)[keyof typeof RuleType];\n\n// ============================================================================\n// PRIORITY LEVELS\n// ============================================================================\n\n/**\n * Priority levels for rule ordering.\n */\nexport const Priority = {\n  /** anything that must scan the tree before everything else */\n  MAX: 0,\n  /** scans for block-level constructs */\n  HIGH: 1,\n  /** inline w/ more priority than other inline */\n  MED: 2,\n  /** inline elements */\n  LOW: 3,\n  /** bare text and stuff that is considered leftovers */\n  MIN: 4,\n} as const;\n\nexport type PriorityValue = (typeof Priority)[keyof typeof Priority];\n\n// ============================================================================\n// PERFORMANCE CONSTANTS\n// ============================================================================\n\n/** Threshold for performance logging (in milliseconds) */\nexport const DURATION_DELAY_TRIGGER = 20;\n\n// ============================================================================\n// ATTRIBUTE MAPPING\n// ============================================================================\n\n/**\n * Map of HTML attributes to their JSX prop equivalents.\n * Some renderers use camelCase for certain attributes.\n */\nexport const ATTRIBUTE_TO_NODE_PROP_MAP: Record<string, string> = [\n  'allowFullScreen',\n  'allowTransparency',\n  'autoComplete',\n  'autoFocus',\n  'autoPlay',\n  'cellPadding',\n  'cellSpacing',\n  'charSet',\n  'classId',\n  'colSpan',\n  'contentEditable',\n  'contextMenu',\n  'crossOrigin',\n  'encType',\n  'formAction',\n  'formEncType',\n  'formMethod',\n  'formNoValidate',\n  'formTarget',\n  'frameBorder',\n  'hrefLang',\n  'inputMode',\n  'keyParams',\n  'keyType',\n  'marginHeight',\n  'marginWidth',\n  'maxLength',\n  'mediaGroup',\n  'minLength',\n  'noValidate',\n  'radioGroup',\n  'readOnly',\n  'rowSpan',\n  'spellCheck',\n  'srcDoc',\n  'srcLang',\n  'srcSet',\n  'tabIndex',\n  'useMap',\n].reduce(\n  (obj: Record<string, string>, x) => {\n    obj[x.toLowerCase()] = x;\n    return obj;\n  },\n  { class: 'className', for: 'htmlFor' }\n);\n\n// ============================================================================\n// NAMED CODES TO UNICODE\n// ============================================================================\n\n/**\n * Default HTML entity to unicode mappings.\n */\nexport const NAMED_CODES_TO_UNICODE: Record<string, string> = {\n  amp: '\\u0026',\n  apos: '\\u0027',\n  gt: '\\u003e',\n  lt: '\\u003c',\n  nbsp: '\\u00a0',\n  quot: '\\u201c',\n};\n\n// ============================================================================\n// SPECIAL ELEMENTS\n// ============================================================================\n\n/** HTML elements that should not have their content processed */\nexport const DO_NOT_PROCESS_HTML_ELEMENTS = ['style', 'script', 'pre'];\n\n/** Attributes that require URL sanitization */\nexport const ATTRIBUTES_TO_SANITIZE = [\n  'src',\n  'href',\n  'data',\n  'formAction',\n  'srcDoc',\n  'action',\n];\n\n// ============================================================================\n// REGEX PATTERNS\n// ============================================================================\n\n/** Attribute extractor regex */\nexport const ATTR_EXTRACTOR_R =\n  /([-A-Z0-9_:]+)(?:\\s*=\\s*(?:(?:\"((?:\\\\.|[^\"])*)\")|(?:'((?:\\\\.|[^'])*)')|(?:\\{((?:\\\\.|{[^}]*?}|[^}])*)\\})))?/gi;\n\n/** Block end detection */\nexport const BLOCK_END_R = /\\n{2,}$/;\n\n/** Blockquote patterns */\nexport const BLOCKQUOTE_R = /^(\\s*>[\\s\\S]*?)(?=\\n\\n|$)/;\nexport const BLOCKQUOTE_TRIM_LEFT_MULTILINE_R = /^ *> ?/gm;\nexport const BLOCKQUOTE_ALERT_R = /^(?:\\[!([^\\]]*)\\]\\n)?([\\s\\S]*)/;\n\n/** Line break patterns */\nexport const BREAK_LINE_R = /^ {2,}\\n/;\nexport const BREAK_THEMATIC_R = /^(?:([-*_])( *\\1){2,}) *(?:\\n *)+\\n/;\n\n/** Code block patterns */\nexport const CODE_BLOCK_FENCED_R =\n  /^(?: {1,3})?(`{3,}|~{3,}) *(\\S+)? *([^\\n]*?)?\\n([\\s\\S]*?)(?:\\1\\n?|$)/;\nexport const CODE_BLOCK_R = /^(?: {4}[^\\n]+\\n*)+(?:\\n *)+\\n?/;\n/** A single line opening or closing a fenced code block, with its indentation. */\nexport const FENCE_DELIMITER_R = /^([ \\t]*)(`{3,}|~{3,})/;\nexport const CODE_INLINE_R = /^(`+)((?:\\\\`|(?!\\1)`|[^`])+)\\1/;\n\n/** Newline patterns */\nexport const CONSECUTIVE_NEWLINE_R = /^(?:\\n *)*\\n/;\nexport const CR_NEWLINE_R = /\\r\\n?/g;\n\n/** Footnote patterns */\nexport const FOOTNOTE_R = /^\\[\\^([^\\]]+)](:(.*)((\\n+ {4,}.*)|(\\n(?!\\[\\^).+))*)/;\nexport const FOOTNOTE_REFERENCE_R = /^\\[\\^([^\\]]+)]/;\n\n/** Form feed */\nexport const FORMFEED_R = /\\f/g;\n\n/** Front matter */\nexport const FRONT_MATTER_R = /^---[ \\t]*\\n(.|\\n)*?\\n---[ \\t]*\\n/;\n\n/** GFM task */\nexport const GFM_TASK_R = /^\\s*?\\[(x|\\s)\\]/;\n\n/** Heading patterns */\nexport const HEADING_R = /^ *(#{1,6}) *([^\\n]+?)(?: +#*)?(?:\\n *)*(?:\\n|$)/;\nexport const HEADING_ATX_COMPLIANT_R =\n  /^ *(#{1,6}) +([^\\n]+?)(?: +#*)?(?:\\n *)*(?:\\n|$)/;\nexport const HEADING_SETEXT_R = /^([^\\n]+)\\n *(=|-)\\2{2,} *\\n/;\n\n/** HTML patterns */\n\n/**\n * Run of characters carrying no meaning inside an opening tag: neither a quote\n * opening a value nor an angle bracket delimiting a tag.\n */\nconst TAG_PLAIN_RUN = `[^>\"'<]*`;\n\n/**\n * Quoted attribute value. It may hold an angle bracket —\n * `<Tab label='Intlayer >=9.4'>` — but not a line break, which keeps a tag that\n * turns out not to match from trying every later quote of the document as its\n * closing one.\n */\nconst TAG_QUOTED_VALUE = `\"[^\"\\\\n]*\"|'[^'\\\\n]*'`;\n\n/**\n * Attribute list of an opening tag, written as a plain run followed by\n * quote-or-bracket-led segments so that each character has a single way to be\n * read. A lone quote is allowed last so a tag holding an unbalanced one still\n * parses, as it did before quoted values were recognised.\n */\nconst TAG_ATTRIBUTES = `${TAG_PLAIN_RUN}(?:(?:${TAG_QUOTED_VALUE}|<.*?>|[\"'])${TAG_PLAIN_RUN})*`;\n\n/** Rejects the opening tag of a self-closing element, `<div class=\"a\"/>`. */\nconst NOT_SELF_CLOSING = `(?![^>]*/>)`;\n\n/**\n * Opening tag of a nested element bearing the same name as the outer one. This\n * one stays a plain scan up to the first `>`: it is tried at every character of\n * the element's content, and a richer pattern here costs an order of magnitude\n * on documents whose tag never closes.\n */\nconst NESTED_SAME_TAG_OPENING = `<\\\\1[^>]*?>`;\n\nexport const HTML_BLOCK_ELEMENT_R = new RegExp(\n  `^ *(?!<[a-zA-Z][^ >/]* ?/>)<([a-zA-Z][^ >/]*) ?(${NOT_SELF_CLOSING}${TAG_ATTRIBUTES})>\\\\n?(\\\\s*(?:${NESTED_SAME_TAG_OPENING}[\\\\s\\\\S]*?</\\\\1>|(?!<\\\\1\\\\b)[\\\\s\\\\S])*?)</\\\\1>(?!</\\\\1>)\\\\n*`,\n  'i'\n);\nexport const HTML_CHAR_CODE_R =\n  /&([a-z0-9]+|#[0-9]{1,6}|#x[0-9a-fA-F]{1,6});/gi;\nexport const HTML_COMMENT_R = /^<!--[\\s\\S]*?(?:-->)/;\nexport const HTML_CUSTOM_ATTR_R = /^(data|aria|x)-[a-z_][a-z\\d_.-]*$/;\nexport const HTML_SELF_CLOSING_ELEMENT_R = new RegExp(\n  `^ *<([a-zA-Z][a-zA-Z0-9:]*)(?:\\\\s+(${TAG_ATTRIBUTES}))?/?>(?!</\\\\1>)(\\\\s*\\\\n)?`,\n  'i'\n);\n\n/** Custom component pattern */\nexport const CUSTOM_COMPONENT_R = new RegExp(\n  `^ *<([A-Z][a-zA-Z0-9]*)(?:\\\\s+(${TAG_ATTRIBUTES}))?>\\\\n?(\\\\s*(?:${NESTED_SAME_TAG_OPENING}[\\\\s\\\\S]*?</\\\\1>|(?!<\\\\1\\\\b)[\\\\s\\\\S])*?)</\\\\1>(?!</\\\\1>)\\\\n*`\n);\n\n/** Interpolation */\nexport const INTERPOLATION_R = /^\\{.*\\}$/;\n\n/** Link patterns */\nexport const LINK_AUTOLINK_BARE_URL_R = /^(https?:\\/\\/[^\\s<]+[^<.,:;\"')\\]\\s])/;\nexport const LINK_AUTOLINK_R = /^<([^ >]+[:@/][^ >]+)>/;\nexport const CAPTURE_LETTER_AFTER_HYPHEN = /-([a-z])?/gi;\n\n/** Table patterns */\nexport const NP_TABLE_R =\n  /^(\\|.*)\\n(?: *(\\|? *[-:]+ *\\|[-| :]*)\\n((?:.*\\|.*\\n)*))?\\n?/;\nexport const TABLE_TRIM_PIPES = /(^ *\\||\\| *$)/g;\nexport const TABLE_CENTER_ALIGN = /^ *:-+: *$/;\nexport const TABLE_LEFT_ALIGN = /^ *:-+ *$/;\nexport const TABLE_RIGHT_ALIGN = /^ *-+: *$/;\n\n/** Paragraph */\nexport const PARAGRAPH_R = /^[^\\n]+(?: {2}\\n|\\n{2,})/;\n\n/** Reference patterns */\nexport const REFERENCE_IMAGE_OR_LINK =\n  /^\\[([^\\]]*)\\]:\\s+<?([^\\s>]+)>?\\s*(\"([^\"]*)\")?/;\nexport const REFERENCE_IMAGE_R = /^!\\[([^\\]]*)\\] ?\\[([^\\]]*)\\]/;\nexport const REFERENCE_LINK_R = /^\\[([^\\]]*)\\] ?\\[([^\\]]*)\\]/;\n\n/** Block detection */\nexport const SHOULD_RENDER_AS_BLOCK_R = /(\\n|^[-*]\\s|^#|^ {2,}|^-{2,}|^>\\s)/;\n\n/** Tab and whitespace */\nexport const TAB_R = /\\t/g;\nexport const TRIM_STARTING_NEWLINES = /^\\n+/;\nexport const HTML_LEFT_TRIM_AMOUNT_R = /^\\n*([ \\t]*)/;\n\n/** List patterns */\nexport const LIST_LOOKBEHIND_R = /(?:^|\\n)( *)$/;\nexport const ORDERED_LIST_BULLET = '(?:\\\\d+\\\\.)';\nexport const UNORDERED_LIST_BULLET = '(?:[*+-])';\n\n/** Text formatting patterns */\nexport const TEXT_ESCAPED_R = /^\\\\([^0-9A-Za-z\\s])/;\nexport const UNESCAPE_R = /\\\\([^0-9A-Za-z\\s])/g;\nexport const TEXT_PLAIN_R =\n  /^[\\s\\S](?:(?! {2}\\n|[0-9]\\.|http)[^=*_~\\-\\n:<`\\\\[!])*/;\n\n/** Shortcode pattern */\nexport const SHORTCODE_R = /^(:[a-zA-Z0-9-_]+:)/;\n\n// ============================================================================\n// LIST TYPE CONSTANTS\n// ============================================================================\n\nexport type ListType = 1 | 2;\nexport const ORDERED: ListType = 1;\nexport const UNORDERED: ListType = 2;\n\n// ============================================================================\n// INLINE PATTERN HELPERS\n// ============================================================================\n\n/**\n * Ensure there's at least one more instance of the delimiter later\n * in the current sequence.\n */\nexport const LOOKAHEAD = (double: number): string =>\n  `(?=[\\\\s\\\\S]+?\\\\1${double ? '\\\\1' : ''})`;\n\n/**\n * For inline formatting, this partial attempts to ignore characters that\n * may appear in nested formatting.\n */\nexport const INLINE_SKIP_R =\n  '((?:\\\\[.*?\\\\][([].*?[)\\\\]]|<.*?>(?:.*?<.*?>)?|`.*?`|\\\\\\\\[^\\\\s]|[\\\\s\\\\S])+?)';\n\n/** Bold text pattern */\nexport const TEXT_BOLD_R = new RegExp(\n  `^([*_])\\\\1${LOOKAHEAD(1)}${INLINE_SKIP_R}\\\\1\\\\1(?!\\\\1)`\n);\n\n/** Emphasized text pattern */\nexport const TEXT_EMPHASIZED_R = new RegExp(\n  `^([*_])${LOOKAHEAD(0)}${INLINE_SKIP_R}\\\\1(?!\\\\1)`\n);\n\n/** Marked text pattern */\nexport const TEXT_MARKED_R = new RegExp(\n  `^(==)${LOOKAHEAD(0)}${INLINE_SKIP_R}\\\\1`\n);\n\n/** Strikethrough text pattern */\nexport const TEXT_STRIKETHROUGHED_R = new RegExp(\n  `^(~~)${LOOKAHEAD(0)}${INLINE_SKIP_R}\\\\1`\n);\n\n// ============================================================================\n// LIST REGEX GENERATORS\n// ============================================================================\n\nexport const generateListItemPrefix = (type: ListType): string => {\n  return (\n    '( *)(' +\n    (type === ORDERED ? ORDERED_LIST_BULLET : UNORDERED_LIST_BULLET) +\n    ') +'\n  );\n};\n\nexport const ORDERED_LIST_ITEM_PREFIX = generateListItemPrefix(ORDERED);\nexport const UNORDERED_LIST_ITEM_PREFIX = generateListItemPrefix(UNORDERED);\n\nexport const generateListItemPrefixRegex = (type: ListType): RegExp => {\n  return new RegExp(\n    '^' +\n      (type === ORDERED ? ORDERED_LIST_ITEM_PREFIX : UNORDERED_LIST_ITEM_PREFIX)\n  );\n};\n\nexport const ORDERED_LIST_ITEM_PREFIX_R = generateListItemPrefixRegex(ORDERED);\nexport const UNORDERED_LIST_ITEM_PREFIX_R =\n  generateListItemPrefixRegex(UNORDERED);\n\nexport const generateListItemRegex = (type: ListType): RegExp => {\n  return new RegExp(\n    '^' +\n      (type === ORDERED\n        ? ORDERED_LIST_ITEM_PREFIX\n        : UNORDERED_LIST_ITEM_PREFIX) +\n      '[^\\\\n]*(?:\\\\n' +\n      '(?!\\\\1' +\n      (type === ORDERED ? ORDERED_LIST_BULLET : UNORDERED_LIST_BULLET) +\n      ' )[^\\\\n]*)*(\\\\n|$)',\n    'gm'\n  );\n};\n\nexport const ORDERED_LIST_ITEM_R = generateListItemRegex(ORDERED);\nexport const UNORDERED_LIST_ITEM_R = generateListItemRegex(UNORDERED);\n\nexport const generateListRegex = (type: ListType): RegExp => {\n  const bullet = type === ORDERED ? ORDERED_LIST_BULLET : UNORDERED_LIST_BULLET;\n\n  return new RegExp(\n    '^( *)(' +\n      bullet +\n      ') ' +\n      '[\\\\s\\\\S]+?(?:\\\\n{2,}(?! )' +\n      '(?!\\\\1' +\n      bullet +\n      ' (?!' +\n      bullet +\n      ' ))\\\\n*' +\n      '|\\\\s*\\\\n*$)'\n  );\n};\n\nexport const ORDERED_LIST_R = generateListRegex(ORDERED);\nexport const UNORDERED_LIST_R = generateListRegex(UNORDERED);\n"],"mappings":";;;;;;AAQA,MAAa,WAAW;CACtB,YAAY;CACZ,WAAW;CACX,eAAe;CACf,WAAW;CACX,YAAY;CACZ,YAAY;CACZ,UAAU;CACV,mBAAmB;CACnB,SAAS;CACT,SAAS;CACT,eAAe;;CAEf,WAAW;CACX,aAAa;;CAEb,iBAAiB;;CAEjB,iBAAiB;CACjB,OAAO;CACP,MAAM;;CAEN,6BAA6B;;CAE7B,qBAAqB;CACrB,kBAAkB;CAClB,aAAa;CACb,WAAW;CACX,KAAK;CACL,UAAU;CACV,SAAS;CACT,OAAO;CACP,gBAAgB;CAChB,MAAM;CACN,YAAY;CACZ,gBAAgB;CAChB,aAAa;CACb,YAAY;CACZ,qBAAqB;CACrB,eAAe;AACjB;AAGA,IAAI,QAAQ,IAAI,aAAa,QAC3B,OAAO,KAAK,QAAQ,CAAC,CAAC,SAAS,QAAQ;CACrC,AAAC,SAAiB,OAAO;AAC3B,CAAC;;;;AAYH,MAAa,WAAW;;CAEtB,KAAK;;CAEL,MAAM;;CAEN,KAAK;;CAEL,KAAK;;CAEL,KAAK;AACP;;AASA,MAAa,yBAAyB;;;;;AAUtC,MAAa,6BAAqD;CAChE;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC,CAAC,QACC,KAA6B,MAAM;CAClC,IAAI,EAAE,YAAY,KAAK;CACvB,OAAO;AACT,GACA;CAAE,OAAO;CAAa,KAAK;AAAU,CACvC;;;;AASA,MAAa,yBAAiD;CAC5D,KAAK;CACL,MAAM;CACN,IAAI;CACJ,IAAI;CACJ,MAAM;CACN,MAAM;AACR;;AAOA,MAAa,+BAA+B;CAAC;CAAS;CAAU;AAAK;;AAGrE,MAAa,yBAAyB;CACpC;CACA;CACA;CACA;CACA;CACA;AACF;;AAOA,MAAa,mBACX;;AAGF,MAAa,cAAc;;AAG3B,MAAa,eAAe;AAC5B,MAAa,mCAAmC;AAChD,MAAa,qBAAqB;;AAGlC,MAAa,eAAe;AAC5B,MAAa,mBAAmB;;AAGhC,MAAa,sBACX;AACF,MAAa,eAAe;;AAE5B,MAAa,oBAAoB;AACjC,MAAa,gBAAgB;;AAG7B,MAAa,wBAAwB;AACrC,MAAa,eAAe;;AAG5B,MAAa,aAAa;AAC1B,MAAa,uBAAuB;;AAGpC,MAAa,aAAa;;AAG1B,MAAa,iBAAiB;;AAG9B,MAAa,aAAa;;AAG1B,MAAa,YAAY;AACzB,MAAa,0BACX;AACF,MAAa,mBAAmB;;;;;;AAQhC,MAAM,gBAAgB;;;;;;;AAgBtB,MAAM,iBAAiB,GAAG,cAAc,yCAAuC,cAAc;;AAG7F,MAAM,mBAAmB;;;;;;;AAQzB,MAAM,0BAA0B;AAEhC,MAAa,uBAAuB,IAAI,OACtC,mDAAmD,mBAAmB,eAAe,gBAAgB,wBAAwB,+DAC7H,GACF;AACA,MAAa,mBACX;AACF,MAAa,iBAAiB;AAC9B,MAAa,qBAAqB;AAClC,MAAa,8BAA8B,IAAI,OAC7C,sCAAsC,eAAe,6BACrD,GACF;;AAGA,MAAa,qBAAqB,IAAI,OACpC,kCAAkC,eAAe,kBAAkB,wBAAwB,6DAC7F;;AAGA,MAAa,kBAAkB;;AAG/B,MAAa,2BAA2B;AACxC,MAAa,kBAAkB;AAC/B,MAAa,8BAA8B;;AAG3C,MAAa,aACX;AACF,MAAa,mBAAmB;AAChC,MAAa,qBAAqB;AAClC,MAAa,mBAAmB;AAChC,MAAa,oBAAoB;;AAGjC,MAAa,cAAc;;AAG3B,MAAa,0BACX;AACF,MAAa,oBAAoB;AACjC,MAAa,mBAAmB;;AAGhC,MAAa,2BAA2B;;AAGxC,MAAa,QAAQ;AACrB,MAAa,yBAAyB;AACtC,MAAa,0BAA0B;;AAGvC,MAAa,oBAAoB;AACjC,MAAa,sBAAsB;AACnC,MAAa,wBAAwB;;AAGrC,MAAa,iBAAiB;AAC9B,MAAa,aAAa;AAC1B,MAAa,eACX;;AAGF,MAAa,cAAc;AAO3B,MAAa,UAAoB;AACjC,MAAa,YAAsB;;;;;AAUnC,MAAa,aAAa,WACxB,mBAAmB,SAAS,QAAQ,GAAG;;;;;AAMzC,MAAa,gBACX;;AAGF,MAAa,cAAc,IAAI,OAC7B,aAAa,UAAU,CAAC,IAAI,cAAc,cAC5C;;AAGA,MAAa,oBAAoB,IAAI,OACnC,UAAU,UAAU,CAAC,IAAI,cAAc,WACzC;;AAGA,MAAa,gBAAgB,IAAI,OAC/B,QAAQ,UAAU,CAAC,IAAI,cAAc,IACvC;;AAGA,MAAa,yBAAyB,IAAI,OACxC,QAAQ,UAAU,CAAC,IAAI,cAAc,IACvC;AAMA,MAAa,0BAA0B,SAA2B;CAChE,OACE,WACC,aAAmB,sBAAsB,yBAC1C;AAEJ;AAEA,MAAa,2BAA2B,wBAA8B;AACtE,MAAa,6BAA6B,wBAAgC;AAE1E,MAAa,+BAA+B,SAA2B;CACrE,OAAO,IAAI,OACT,OACG,aAAmB,2BAA2B,2BACnD;AACF;AAEA,MAAa,6BAA6B,6BAAmC;AAC7E,MAAa,+BACX,6BAAqC;AAEvC,MAAa,yBAAyB,SAA2B;CAC/D,OAAO,IAAI,OACT,OACG,aACG,2BACA,8BACJ,yBAEC,aAAmB,sBAAsB,yBAC1C,sBACF,IACF;AACF;AAEA,MAAa,sBAAsB,uBAA6B;AAChE,MAAa,wBAAwB,uBAA+B;AAEpE,MAAa,qBAAqB,SAA2B;CAC3D,MAAM,SAAS,aAAmB,sBAAsB;CAExD,OAAO,IAAI,OACT,WACE,SACA,sCAGA,SACA,SACA,SACA,oBAEJ;AACF;AAEA,MAAa,iBAAiB,mBAAyB;AACvD,MAAa,mBAAmB,mBAA2B"}
+{"version":3,"file":"constants.cjs","names":[],"sources":["../../../src/markdown/constants.ts"],"sourcesContent":["// ============================================================================\n// RULE TYPES\n// ============================================================================\n\n/**\n * Analogous to `node.type`. Please note that the values here may change at any time,\n * so do not hard code against the value directly.\n */\nexport const RuleType = {\n  blockQuote: '0',\n  breakLine: '1',\n  breakThematic: '2',\n  codeBlock: '3',\n  codeFenced: '4',\n  codeInline: '5',\n  footnote: '6',\n  footnoteReference: '7',\n  gfmTask: '8',\n  heading: '9',\n  headingSetext: '10',\n  /** only available if not `disableHTMLParsing` */\n  htmlBlock: '11',\n  htmlComment: '12',\n  /** only available if not `disableHTMLParsing` */\n  htmlSelfClosing: '13',\n  /** Custom components like <Tabs>, <TabItem> */\n  customComponent: '34',\n  image: '14',\n  link: '15',\n  /** emits a `link` 'node', does not render directly */\n  linkAngleBraceStyleDetector: '16',\n  /** emits a `link` 'node', does not render directly */\n  linkBareUrlDetector: '17',\n  newlineCoalescer: '19',\n  orderedList: '20',\n  paragraph: '21',\n  ref: '22',\n  refImage: '23',\n  refLink: '24',\n  table: '25',\n  tableSeparator: '26',\n  text: '27',\n  textBolded: '28',\n  textEmphasized: '29',\n  textEscaped: '30',\n  textMarked: '31',\n  textStrikethroughed: '32',\n  unorderedList: '33',\n} as const;\n\n// In test environment, use human-readable keys for easier debugging\nif (process.env.NODE_ENV === 'test') {\n  Object.keys(RuleType).forEach((key) => {\n    (RuleType as any)[key] = key;\n  });\n}\n\nexport type RuleTypeValue = (typeof RuleType)[keyof typeof RuleType];\n\n// ============================================================================\n// PRIORITY LEVELS\n// ============================================================================\n\n/**\n * Priority levels for rule ordering.\n */\nexport const Priority = {\n  /** anything that must scan the tree before everything else */\n  MAX: 0,\n  /** scans for block-level constructs */\n  HIGH: 1,\n  /** inline w/ more priority than other inline */\n  MED: 2,\n  /** inline elements */\n  LOW: 3,\n  /** bare text and stuff that is considered leftovers */\n  MIN: 4,\n} as const;\n\nexport type PriorityValue = (typeof Priority)[keyof typeof Priority];\n\n// ============================================================================\n// ATTRIBUTE MAPPING\n// ============================================================================\n\n/**\n * Map of HTML attributes to their JSX prop equivalents.\n * Some renderers use camelCase for certain attributes.\n */\nexport const ATTRIBUTE_TO_NODE_PROP_MAP: Record<string, string> = [\n  'allowFullScreen',\n  'allowTransparency',\n  'autoComplete',\n  'autoFocus',\n  'autoPlay',\n  'cellPadding',\n  'cellSpacing',\n  'charSet',\n  'classId',\n  'colSpan',\n  'contentEditable',\n  'contextMenu',\n  'crossOrigin',\n  'encType',\n  'formAction',\n  'formEncType',\n  'formMethod',\n  'formNoValidate',\n  'formTarget',\n  'frameBorder',\n  'hrefLang',\n  'inputMode',\n  'keyParams',\n  'keyType',\n  'marginHeight',\n  'marginWidth',\n  'maxLength',\n  'mediaGroup',\n  'minLength',\n  'noValidate',\n  'radioGroup',\n  'readOnly',\n  'rowSpan',\n  'spellCheck',\n  'srcDoc',\n  'srcLang',\n  'srcSet',\n  'tabIndex',\n  'useMap',\n].reduce(\n  (obj: Record<string, string>, x) => {\n    obj[x.toLowerCase()] = x;\n    return obj;\n  },\n  { class: 'className', for: 'htmlFor' }\n);\n\n// ============================================================================\n// NAMED CODES TO UNICODE\n// ============================================================================\n\n/**\n * Default HTML entity to unicode mappings.\n */\nexport const NAMED_CODES_TO_UNICODE: Record<string, string> = {\n  amp: '\\u0026',\n  apos: '\\u0027',\n  gt: '\\u003e',\n  lt: '\\u003c',\n  nbsp: '\\u00a0',\n  quot: '\\u201c',\n};\n\n// ============================================================================\n// SPECIAL ELEMENTS\n// ============================================================================\n\n/** HTML elements that should not have their content processed */\nexport const DO_NOT_PROCESS_HTML_ELEMENTS = ['style', 'script', 'pre'];\n\n/** Attributes that require URL sanitization */\nexport const ATTRIBUTES_TO_SANITIZE = [\n  'src',\n  'href',\n  'data',\n  'formAction',\n  'srcDoc',\n  'action',\n];\n\n// ============================================================================\n// REGEX PATTERNS\n// ============================================================================\n\n/** Attribute extractor regex */\nexport const ATTR_EXTRACTOR_R =\n  /([-A-Z0-9_:]+)(?:\\s*=\\s*(?:(?:\"((?:\\\\.|[^\"])*)\")|(?:'((?:\\\\.|[^'])*)')|(?:\\{((?:\\\\.|{[^}]*?}|[^}])*)\\})))?/gi;\n\n/** Block end detection */\nexport const BLOCK_END_R = /\\n{2,}$/;\n\n/** Blockquote patterns */\nexport const BLOCKQUOTE_R = /^(\\s*>[\\s\\S]*?)(?=\\n\\n|$)/;\nexport const BLOCKQUOTE_TRIM_LEFT_MULTILINE_R = /^ *> ?/gm;\nexport const BLOCKQUOTE_ALERT_R = /^(?:\\[!([^\\]]*)\\]\\n)?([\\s\\S]*)/;\n\n/** Line break patterns */\nexport const BREAK_LINE_R = /^ {2,}\\n/;\nexport const BREAK_THEMATIC_R = /^(?:([-*_])( *\\1){2,}) *(?:\\n *)+\\n/;\n\n/** Code block patterns */\nexport const CODE_BLOCK_FENCED_R =\n  /^(?: {1,3})?(`{3,}|~{3,}) *(\\S+)? *([^\\n]*?)?\\n([\\s\\S]*?)(?:\\1\\n?|$)/;\nexport const CODE_BLOCK_R = /^(?: {4}[^\\n]+\\n*)+(?:\\n *)+\\n?/;\n/** A single line opening or closing a fenced code block, with its indentation. */\nexport const FENCE_DELIMITER_R = /^([ \\t]*)(`{3,}|~{3,})/;\nexport const CODE_INLINE_R = /^(`+)((?:\\\\`|(?!\\1)`|[^`])+)\\1/;\n\n/** Newline patterns */\nexport const CONSECUTIVE_NEWLINE_R = /^(?:\\n *)*\\n/;\nexport const CR_NEWLINE_R = /\\r\\n?/g;\n\n/** Footnote patterns */\nexport const FOOTNOTE_R = /^\\[\\^([^\\]]+)](:(.*)((\\n+ {4,}.*)|(\\n(?!\\[\\^).+))*)/;\nexport const FOOTNOTE_REFERENCE_R = /^\\[\\^([^\\]]+)]/;\n\n/** Form feed */\nexport const FORMFEED_R = /\\f/g;\n\n/** Front matter */\nexport const FRONT_MATTER_R = /^---[ \\t]*\\n(.|\\n)*?\\n---[ \\t]*\\n/;\n\n/** GFM task */\nexport const GFM_TASK_R = /^\\s*?\\[(x|\\s)\\]/;\n\n/** Heading patterns */\nexport const HEADING_R = /^ *(#{1,6}) *([^\\n]+?)(?: +#*)?(?:\\n *)*(?:\\n|$)/;\nexport const HEADING_ATX_COMPLIANT_R =\n  /^ *(#{1,6}) +([^\\n]+?)(?: +#*)?(?:\\n *)*(?:\\n|$)/;\nexport const HEADING_SETEXT_R = /^([^\\n]+)\\n *(=|-)\\2{2,} *\\n/;\n\n/** HTML patterns */\n\n/**\n * Run of characters carrying no meaning inside an opening tag: neither a quote\n * opening a value nor an angle bracket delimiting a tag.\n */\nconst TAG_PLAIN_RUN = `[^>\"'<]*`;\n\n/**\n * Quoted attribute value. It may hold an angle bracket —\n * `<Tab label='Intlayer >=9.4'>` — but not a line break, which keeps a tag that\n * turns out not to match from trying every later quote of the document as its\n * closing one.\n */\nconst TAG_QUOTED_VALUE = `\"[^\"\\\\n]*\"|'[^'\\\\n]*'`;\n\n/**\n * Attribute list of an opening tag, written as a plain run followed by\n * quote-or-bracket-led segments so that each character has a single way to be\n * read. A lone quote is allowed last so a tag holding an unbalanced one still\n * parses, as it did before quoted values were recognised.\n */\nconst TAG_ATTRIBUTES = `${TAG_PLAIN_RUN}(?:(?:${TAG_QUOTED_VALUE}|<.*?>|[\"'])${TAG_PLAIN_RUN})*`;\n\n/** Rejects the opening tag of a self-closing element, `<div class=\"a\"/>`. */\nconst NOT_SELF_CLOSING = `(?![^>]*/>)`;\n\n/**\n * Opening tag of a nested element bearing the same name as the outer one. This\n * one stays a plain scan up to the first `>`: it is tried at every character of\n * the element's content, and a richer pattern here costs an order of magnitude\n * on documents whose tag never closes.\n */\nconst NESTED_SAME_TAG_OPENING = `<\\\\1[^>]*?>`;\n\nexport const HTML_BLOCK_ELEMENT_R = new RegExp(\n  `^ *(?!<[a-zA-Z][^ >/]* ?/>)<([a-zA-Z][^ >/]*) ?(${NOT_SELF_CLOSING}${TAG_ATTRIBUTES})>\\\\n?(\\\\s*(?:${NESTED_SAME_TAG_OPENING}[\\\\s\\\\S]*?</\\\\1>|(?!<\\\\1\\\\b)[\\\\s\\\\S])*?)</\\\\1>(?!</\\\\1>)\\\\n*`,\n  'i'\n);\nexport const HTML_CHAR_CODE_R =\n  /&([a-z0-9]+|#[0-9]{1,6}|#x[0-9a-fA-F]{1,6});/gi;\nexport const HTML_COMMENT_R = /^<!--[\\s\\S]*?(?:-->)/;\nexport const HTML_CUSTOM_ATTR_R = /^(data|aria|x)-[a-z_][a-z\\d_.-]*$/;\nexport const HTML_SELF_CLOSING_ELEMENT_R = new RegExp(\n  `^ *<([a-zA-Z][a-zA-Z0-9:]*)(?:\\\\s+(${TAG_ATTRIBUTES}))?/?>(?!</\\\\1>)(\\\\s*\\\\n)?`,\n  'i'\n);\n\n/** Custom component pattern */\nexport const CUSTOM_COMPONENT_R = new RegExp(\n  `^ *<([A-Z][a-zA-Z0-9]*)(?:\\\\s+(${TAG_ATTRIBUTES}))?>\\\\n?(\\\\s*(?:${NESTED_SAME_TAG_OPENING}[\\\\s\\\\S]*?</\\\\1>|(?!<\\\\1\\\\b)[\\\\s\\\\S])*?)</\\\\1>(?!</\\\\1>)\\\\n*`\n);\n\n/** Interpolation */\nexport const INTERPOLATION_R = /^\\{.*\\}$/;\n\n/** Link patterns */\nexport const LINK_AUTOLINK_BARE_URL_R = /^(https?:\\/\\/[^\\s<]+[^<.,:;\"')\\]\\s])/;\nexport const LINK_AUTOLINK_R = /^<([^ >]+[:@/][^ >]+)>/;\nexport const CAPTURE_LETTER_AFTER_HYPHEN = /-([a-z])?/gi;\n\n/** Table patterns */\nexport const NP_TABLE_R =\n  /^(\\|.*)\\n(?: *(\\|? *[-:]+ *\\|[-| :]*)\\n((?:.*\\|.*\\n)*))?\\n?/;\nexport const TABLE_TRIM_PIPES = /(^ *\\||\\| *$)/g;\nexport const TABLE_CENTER_ALIGN = /^ *:-+: *$/;\nexport const TABLE_LEFT_ALIGN = /^ *:-+ *$/;\nexport const TABLE_RIGHT_ALIGN = /^ *-+: *$/;\n\n/** Paragraph */\nexport const PARAGRAPH_R = /^[^\\n]+(?: {2}\\n|\\n{2,})/;\n\n/** Reference patterns */\nexport const REFERENCE_IMAGE_OR_LINK =\n  /^\\[([^\\]]*)\\]:\\s+<?([^\\s>]+)>?\\s*(\"([^\"]*)\")?/;\nexport const REFERENCE_IMAGE_R = /^!\\[([^\\]]*)\\] ?\\[([^\\]]*)\\]/;\nexport const REFERENCE_LINK_R = /^\\[([^\\]]*)\\] ?\\[([^\\]]*)\\]/;\n\n/**\n * Cheap prefix probes used to reject a rule before its full (and far more\n * expensive) block regex runs. Kept as module constants so the parser's inner\n * loop never allocates a `RegExp` per candidate position.\n */\nexport const HTML_BLOCK_OPENING_TAG_R = /^ *<([a-z][a-z0-9:-]*)\\b/i;\nexport const HTML_SELF_CLOSING_OPENING_TAG_R =\n  /^ *<([a-zA-Z][a-zA-Z0-9:]*)[\\s>/]/;\nexport const CUSTOM_COMPONENT_OPENING_TAG_R = /^ *<([A-Z][a-zA-Z0-9]*)/;\n\n/** Block detection */\nexport const SHOULD_RENDER_AS_BLOCK_R = /(\\n|^[-*]\\s|^#|^ {2,}|^-{2,}|^>\\s)/;\n\n/** Tab and whitespace */\nexport const TAB_R = /\\t/g;\n/** Every character `normalizeWhitespace` rewrites, so it needs a single pass. */\nexport const NORMALIZE_WHITESPACE_R = /\\r\\n?|\\f|\\t/g;\nexport const TRIM_STARTING_NEWLINES = /^\\n+/;\nexport const HTML_LEFT_TRIM_AMOUNT_R = /^\\n*([ \\t]*)/;\n\n/** List patterns */\nexport const ORDERED_LIST_BULLET = '(?:\\\\d+\\\\.)';\nexport const UNORDERED_LIST_BULLET = '(?:[*+-])';\n\n/** Text formatting patterns */\nexport const TEXT_ESCAPED_R = /^\\\\([^0-9A-Za-z\\s])/;\nexport const UNESCAPE_R = /\\\\([^0-9A-Za-z\\s])/g;\nexport const TEXT_PLAIN_R =\n  /^[\\s\\S](?:(?! {2}\\n|[0-9]\\.|http)[^=*_~\\-\\n:<`\\\\[!])*/;\n\n/** Shortcode pattern */\nexport const SHORTCODE_R = /^(:[a-zA-Z0-9-_]+:)/;\n\n// ============================================================================\n// LIST TYPE CONSTANTS\n// ============================================================================\n\nexport type ListType = 1 | 2;\nexport const ORDERED: ListType = 1;\nexport const UNORDERED: ListType = 2;\n\n// ============================================================================\n// INLINE PATTERN HELPERS\n// ============================================================================\n\n/**\n * Ensure there's at least one more instance of the delimiter later\n * in the current sequence.\n */\nexport const LOOKAHEAD = (double: number): string =>\n  `(?=[\\\\s\\\\S]+?\\\\1${double ? '\\\\1' : ''})`;\n\n/**\n * For inline formatting, this partial attempts to ignore characters that\n * may appear in nested formatting.\n */\nexport const INLINE_SKIP_R =\n  '((?:\\\\[.*?\\\\][([].*?[)\\\\]]|<.*?>(?:.*?<.*?>)?|`.*?`|\\\\\\\\[^\\\\s]|[\\\\s\\\\S])+?)';\n\n/** Bold text pattern */\nexport const TEXT_BOLD_R = new RegExp(\n  `^([*_])\\\\1${LOOKAHEAD(1)}${INLINE_SKIP_R}\\\\1\\\\1(?!\\\\1)`\n);\n\n/** Emphasized text pattern */\nexport const TEXT_EMPHASIZED_R = new RegExp(\n  `^([*_])${LOOKAHEAD(0)}${INLINE_SKIP_R}\\\\1(?!\\\\1)`\n);\n\n/** Marked text pattern */\nexport const TEXT_MARKED_R = new RegExp(\n  `^(==)${LOOKAHEAD(0)}${INLINE_SKIP_R}\\\\1`\n);\n\n/** Strikethrough text pattern */\nexport const TEXT_STRIKETHROUGHED_R = new RegExp(\n  `^(~~)${LOOKAHEAD(0)}${INLINE_SKIP_R}\\\\1`\n);\n\n// ============================================================================\n// LIST REGEX GENERATORS\n// ============================================================================\n\nexport const generateListItemPrefix = (type: ListType): string => {\n  return (\n    '( *)(' +\n    (type === ORDERED ? ORDERED_LIST_BULLET : UNORDERED_LIST_BULLET) +\n    ') +'\n  );\n};\n\nexport const ORDERED_LIST_ITEM_PREFIX = generateListItemPrefix(ORDERED);\nexport const UNORDERED_LIST_ITEM_PREFIX = generateListItemPrefix(UNORDERED);\n\nexport const generateListItemPrefixRegex = (type: ListType): RegExp => {\n  return new RegExp(\n    '^' +\n      (type === ORDERED ? ORDERED_LIST_ITEM_PREFIX : UNORDERED_LIST_ITEM_PREFIX)\n  );\n};\n\nexport const ORDERED_LIST_ITEM_PREFIX_R = generateListItemPrefixRegex(ORDERED);\nexport const UNORDERED_LIST_ITEM_PREFIX_R =\n  generateListItemPrefixRegex(UNORDERED);\n\nexport const generateListItemRegex = (type: ListType): RegExp => {\n  return new RegExp(\n    '^' +\n      (type === ORDERED\n        ? ORDERED_LIST_ITEM_PREFIX\n        : UNORDERED_LIST_ITEM_PREFIX) +\n      '[^\\\\n]*(?:\\\\n' +\n      '(?!\\\\1' +\n      (type === ORDERED ? ORDERED_LIST_BULLET : UNORDERED_LIST_BULLET) +\n      ' )[^\\\\n]*)*(\\\\n|$)',\n    'gm'\n  );\n};\n\nexport const ORDERED_LIST_ITEM_R = generateListItemRegex(ORDERED);\nexport const UNORDERED_LIST_ITEM_R = generateListItemRegex(UNORDERED);\n\nexport const generateListRegex = (type: ListType): RegExp => {\n  const bullet = type === ORDERED ? ORDERED_LIST_BULLET : UNORDERED_LIST_BULLET;\n\n  return new RegExp(\n    '^( *)(' +\n      bullet +\n      ') ' +\n      '[\\\\s\\\\S]+?(?:\\\\n{2,}(?! )' +\n      '(?!\\\\1' +\n      bullet +\n      ' (?!' +\n      bullet +\n      ' ))\\\\n*' +\n      '|\\\\s*\\\\n*$)'\n  );\n};\n\nexport const ORDERED_LIST_R = generateListRegex(ORDERED);\nexport const UNORDERED_LIST_R = generateListRegex(UNORDERED);\n"],"mappings":";;;;;;AAQA,MAAa,WAAW;CACtB,YAAY;CACZ,WAAW;CACX,eAAe;CACf,WAAW;CACX,YAAY;CACZ,YAAY;CACZ,UAAU;CACV,mBAAmB;CACnB,SAAS;CACT,SAAS;CACT,eAAe;;CAEf,WAAW;CACX,aAAa;;CAEb,iBAAiB;;CAEjB,iBAAiB;CACjB,OAAO;CACP,MAAM;;CAEN,6BAA6B;;CAE7B,qBAAqB;CACrB,kBAAkB;CAClB,aAAa;CACb,WAAW;CACX,KAAK;CACL,UAAU;CACV,SAAS;CACT,OAAO;CACP,gBAAgB;CAChB,MAAM;CACN,YAAY;CACZ,gBAAgB;CAChB,aAAa;CACb,YAAY;CACZ,qBAAqB;CACrB,eAAe;AACjB;AAGA,IAAI,QAAQ,IAAI,aAAa,QAC3B,OAAO,KAAK,QAAQ,CAAC,CAAC,SAAS,QAAQ;CACrC,AAAC,SAAiB,OAAO;AAC3B,CAAC;;;;AAYH,MAAa,WAAW;;CAEtB,KAAK;;CAEL,MAAM;;CAEN,KAAK;;CAEL,KAAK;;CAEL,KAAK;AACP;;;;;AAYA,MAAa,6BAAqD;CAChE;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC,CAAC,QACC,KAA6B,MAAM;CAClC,IAAI,EAAE,YAAY,KAAK;CACvB,OAAO;AACT,GACA;CAAE,OAAO;CAAa,KAAK;AAAU,CACvC;;;;AASA,MAAa,yBAAiD;CAC5D,KAAK;CACL,MAAM;CACN,IAAI;CACJ,IAAI;CACJ,MAAM;CACN,MAAM;AACR;;AAOA,MAAa,+BAA+B;CAAC;CAAS;CAAU;AAAK;;AAGrE,MAAa,yBAAyB;CACpC;CACA;CACA;CACA;CACA;CACA;AACF;;AAOA,MAAa,mBACX;;AAGF,MAAa,cAAc;;AAG3B,MAAa,eAAe;AAC5B,MAAa,mCAAmC;AAChD,MAAa,qBAAqB;;AAGlC,MAAa,eAAe;AAC5B,MAAa,mBAAmB;;AAGhC,MAAa,sBACX;AACF,MAAa,eAAe;;AAE5B,MAAa,oBAAoB;AACjC,MAAa,gBAAgB;;AAG7B,MAAa,wBAAwB;AACrC,MAAa,eAAe;;AAG5B,MAAa,aAAa;AAC1B,MAAa,uBAAuB;;AAGpC,MAAa,aAAa;;AAG1B,MAAa,iBAAiB;;AAG9B,MAAa,aAAa;;AAG1B,MAAa,YAAY;AACzB,MAAa,0BACX;AACF,MAAa,mBAAmB;;;;;;AAQhC,MAAM,gBAAgB;;;;;;;AAgBtB,MAAM,iBAAiB,GAAG,cAAc,yCAAuC,cAAc;;AAG7F,MAAM,mBAAmB;;;;;;;AAQzB,MAAM,0BAA0B;AAEhC,MAAa,uBAAuB,IAAI,OACtC,mDAAmD,mBAAmB,eAAe,gBAAgB,wBAAwB,+DAC7H,GACF;AACA,MAAa,mBACX;AACF,MAAa,iBAAiB;AAC9B,MAAa,qBAAqB;AAClC,MAAa,8BAA8B,IAAI,OAC7C,sCAAsC,eAAe,6BACrD,GACF;;AAGA,MAAa,qBAAqB,IAAI,OACpC,kCAAkC,eAAe,kBAAkB,wBAAwB,6DAC7F;;AAGA,MAAa,kBAAkB;;AAG/B,MAAa,2BAA2B;AACxC,MAAa,kBAAkB;AAC/B,MAAa,8BAA8B;;AAG3C,MAAa,aACX;AACF,MAAa,mBAAmB;AAChC,MAAa,qBAAqB;AAClC,MAAa,mBAAmB;AAChC,MAAa,oBAAoB;;AAGjC,MAAa,cAAc;;AAG3B,MAAa,0BACX;AACF,MAAa,oBAAoB;AACjC,MAAa,mBAAmB;;;;;;AAOhC,MAAa,2BAA2B;AACxC,MAAa,kCACX;AACF,MAAa,iCAAiC;;AAG9C,MAAa,2BAA2B;;AAGxC,MAAa,QAAQ;;AAErB,MAAa,yBAAyB;AACtC,MAAa,yBAAyB;AACtC,MAAa,0BAA0B;;AAGvC,MAAa,sBAAsB;AACnC,MAAa,wBAAwB;;AAGrC,MAAa,iBAAiB;AAC9B,MAAa,aAAa;AAC1B,MAAa,eACX;;AAGF,MAAa,cAAc;AAO3B,MAAa,UAAoB;AACjC,MAAa,YAAsB;;;;;AAUnC,MAAa,aAAa,WACxB,mBAAmB,SAAS,QAAQ,GAAG;;;;;AAMzC,MAAa,gBACX;;AAGF,MAAa,cAAc,IAAI,OAC7B,aAAa,UAAU,CAAC,IAAI,cAAc,cAC5C;;AAGA,MAAa,oBAAoB,IAAI,OACnC,UAAU,UAAU,CAAC,IAAI,cAAc,WACzC;;AAGA,MAAa,gBAAgB,IAAI,OAC/B,QAAQ,UAAU,CAAC,IAAI,cAAc,IACvC;;AAGA,MAAa,yBAAyB,IAAI,OACxC,QAAQ,UAAU,CAAC,IAAI,cAAc,IACvC;AAMA,MAAa,0BAA0B,SAA2B;CAChE,OACE,WACC,aAAmB,sBAAsB,yBAC1C;AAEJ;AAEA,MAAa,2BAA2B,wBAA8B;AACtE,MAAa,6BAA6B,wBAAgC;AAE1E,MAAa,+BAA+B,SAA2B;CACrE,OAAO,IAAI,OACT,OACG,aAAmB,2BAA2B,2BACnD;AACF;AAEA,MAAa,6BAA6B,6BAAmC;AAC7E,MAAa,+BACX,6BAAqC;AAEvC,MAAa,yBAAyB,SAA2B;CAC/D,OAAO,IAAI,OACT,OACG,aACG,2BACA,8BACJ,yBAEC,aAAmB,sBAAsB,yBAC1C,sBACF,IACF;AACF;AAEA,MAAa,sBAAsB,uBAA6B;AAChE,MAAa,wBAAwB,uBAA+B;AAEpE,MAAa,qBAAqB,SAA2B;CAC3D,MAAM,SAAS,aAAmB,sBAAsB;CAExD,OAAO,IAAI,OACT,WACE,SACA,sCAGA,SACA,SACA,SACA,oBAEJ;AACF;AAEA,MAAa,iBAAiB,mBAAyB;AACvD,MAAa,mBAAmB,mBAA2B"}

package/dist/cjs/markdown/index.cjs

@@ -23,9 +23,9 @@ exports.CODE_BLOCK_R = require_markdown_constants.CODE_BLOCK_R;
 exports.CODE_INLINE_R = require_markdown_constants.CODE_INLINE_R;
 exports.CONSECUTIVE_NEWLINE_R = require_markdown_constants.CONSECUTIVE_NEWLINE_R;
 exports.CR_NEWLINE_R = require_markdown_constants.CR_NEWLINE_R;
+exports.CUSTOM_COMPONENT_OPENING_TAG_R = require_markdown_constants.CUSTOM_COMPONENT_OPENING_TAG_R;
 exports.CUSTOM_COMPONENT_R = require_markdown_constants.CUSTOM_COMPONENT_R;
 exports.DO_NOT_PROCESS_HTML_ELEMENTS = require_markdown_constants.DO_NOT_PROCESS_HTML_ELEMENTS;
-exports.DURATION_DELAY_TRIGGER = require_markdown_constants.DURATION_DELAY_TRIGGER;
 exports.FENCE_DELIMITER_R = require_markdown_constants.FENCE_DELIMITER_R;
 exports.FOOTNOTE_R = require_markdown_constants.FOOTNOTE_R;
 exports.FOOTNOTE_REFERENCE_R = require_markdown_constants.FOOTNOTE_REFERENCE_R;
@@ -36,18 +36,20 @@ exports.HEADING_ATX_COMPLIANT_R = require_markdown_constants.HEADING_ATX_COMPLIA
 exports.HEADING_R = require_markdown_constants.HEADING_R;
 exports.HEADING_SETEXT_R = require_markdown_constants.HEADING_SETEXT_R;
 exports.HTML_BLOCK_ELEMENT_R = require_markdown_constants.HTML_BLOCK_ELEMENT_R;
+exports.HTML_BLOCK_OPENING_TAG_R = require_markdown_constants.HTML_BLOCK_OPENING_TAG_R;
 exports.HTML_CHAR_CODE_R = require_markdown_constants.HTML_CHAR_CODE_R;
 exports.HTML_COMMENT_R = require_markdown_constants.HTML_COMMENT_R;
 exports.HTML_CUSTOM_ATTR_R = require_markdown_constants.HTML_CUSTOM_ATTR_R;
 exports.HTML_LEFT_TRIM_AMOUNT_R = require_markdown_constants.HTML_LEFT_TRIM_AMOUNT_R;
 exports.HTML_SELF_CLOSING_ELEMENT_R = require_markdown_constants.HTML_SELF_CLOSING_ELEMENT_R;
+exports.HTML_SELF_CLOSING_OPENING_TAG_R = require_markdown_constants.HTML_SELF_CLOSING_OPENING_TAG_R;
 exports.INLINE_SKIP_R = require_markdown_constants.INLINE_SKIP_R;
 exports.INTERPOLATION_R = require_markdown_constants.INTERPOLATION_R;
 exports.LINK_AUTOLINK_BARE_URL_R = require_markdown_constants.LINK_AUTOLINK_BARE_URL_R;
 exports.LINK_AUTOLINK_R = require_markdown_constants.LINK_AUTOLINK_R;
-exports.LIST_LOOKBEHIND_R = require_markdown_constants.LIST_LOOKBEHIND_R;
 exports.LOOKAHEAD = require_markdown_constants.LOOKAHEAD;
 exports.NAMED_CODES_TO_UNICODE = require_markdown_constants.NAMED_CODES_TO_UNICODE;
+exports.NORMALIZE_WHITESPACE_R = require_markdown_constants.NORMALIZE_WHITESPACE_R;
 exports.NP_TABLE_R = require_markdown_constants.NP_TABLE_R;
 exports.ORDERED = require_markdown_constants.ORDERED;
 exports.ORDERED_LIST_BULLET = require_markdown_constants.ORDERED_LIST_BULLET;

package/dist/cjs/markdown/parser.cjs

@@ -1,8 +1,54 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-const require_markdown_constants = require('./constants.cjs');
 const require_markdown_utils = require('./utils.cjs');
 
 //#region src/markdown/parser.ts
+const ruleOrderCache = /* @__PURE__ */ new Map();
+const sameNames = (a, b) => {
+	for (let i = 0; i < a.length; i++) if (a[i] !== b[i]) return false;
+	return true;
+};
+/**
+* Resolves `Object.keys(rules)` into precedence order, sorting only the first
+* time a given rule set is seen.
+*/
+const orderRules = (names, rules) => {
+	const candidates = ruleOrderCache.get(names.length);
+	if (candidates) {
+		for (let i = 0; i < candidates.length; i++) if (sameNames(names, candidates[i].names)) return candidates[i].order;
+	}
+	const order = names.slice().sort((a, b) => rules[a]._order - rules[b]._order || +a - +b);
+	const entry = {
+		names: names.slice(),
+		order
+	};
+	if (candidates) candidates.push(entry);
+	else ruleOrderCache.set(names.length, [entry]);
+	return order;
+};
+/**
+* Advance the incremental lookbehind carried on the parse state.
+*
+* Rules only ever ask two questions about the source already consumed: how far
+* the current line is indented (`prevCaptureIndent`) and whether a blank line
+* has been seen (`prevCaptureHasBlankLine`). Both are maintained in time
+* proportional to the capture rather than by concatenating — and later
+* rescanning — the whole document, which made parsing quadratic.
+*/
+const advanceLookbehind = (state, capture) => {
+	const newlineIndex = capture.lastIndexOf("\n");
+	const hasPrevCapture = state.prevCaptureHasBlankLine !== void 0;
+	if (state.prevCaptureHasBlankLine !== true) state.prevCaptureHasBlankLine = capture.indexOf("\n\n") !== -1 || hasPrevCapture && capture.charCodeAt(0) === 10 && state.prevCaptureIndent === "";
+	const tail = newlineIndex === -1 ? state.prevCaptureIndent === void 0 ? void 0 : state.prevCaptureIndent + capture : capture.slice(newlineIndex + 1);
+	if (tail === void 0 || tail === "") {
+		state.prevCaptureIndent = tail;
+		return;
+	}
+	for (let i = 0; i < tail.length; i++) if (tail.charCodeAt(i) !== 32) {
+		state.prevCaptureIndent = void 0;
+		return;
+	}
+	state.prevCaptureIndent = tail;
+};
 /**
 * Creates a parser for a given set of rules, with the precedence
 * specified as a list of rules.
@@ -13,60 +59,40 @@ const require_markdown_utils = require('./utils.cjs');
 * @returns The resulting parse function
 */
 const parserFor = (rules) => {
-	const start = performance.now();
 	const ruleList = Object.keys(rules);
 	if (process.env.NODE_ENV !== "production") ruleList.forEach((type) => {
 		const order = rules[type]?._order;
 		if (typeof order !== "number" || !Number.isFinite(order)) console.warn(`intlayer: Invalid order for rule \`${type}\`: ${order}`);
 	});
-	ruleList.sort((a, b) => {
-		return rules[a]._order - rules[b]._order || +a - +b;
-	});
+	const order = orderRules(ruleList, rules);
+	const ruleCount = order.length;
+	const qualifiers = new Array(ruleCount);
+	const matchers = new Array(ruleCount);
+	const parsers = new Array(ruleCount);
+	for (let i = 0; i < ruleCount; i++) {
+		const rule = rules[order[i]];
+		qualifiers[i] = rule._qualify;
+		matchers[i] = rule._match;
+		parsers[i] = rule._parse;
+	}
 	const nestedParse = (source, state = {}) => {
-		const parseStart = performance.now();
 		const result = [];
-		state.prevCapture = state.prevCapture || "";
-		if (source.trim()) while (source) {
-			let i = 0;
-			while (i < ruleList.length) {
-				const ruleType = ruleList[i];
-				const rule = rules[ruleType];
-				if (rule?._qualify && !require_markdown_utils.qualifies(source, state, rule._qualify)) {
-					i++;
-					continue;
-				}
-				const matchStart = performance.now();
-				const capture = rule?._match(source, state);
-				if (process.env.NODE_ENV !== "production") {
-					const matchDuration = performance.now() - matchStart;
-					if (matchDuration > 1) console.log(`${ruleType}._match: ${matchDuration.toFixed(3)}ms, source length: ${source.length}`);
-				}
-				if (capture?.[0]) {
-					source = source.substring(capture[0].length);
-					const ruleParseStart = performance.now();
-					const parsedAny = rule?._parse(capture, nestedParse, state);
-					if (process.env.NODE_ENV !== "production") {
-						const ruleParseDuration = performance.now() - ruleParseStart;
-						if (ruleParseDuration > 1) console.log(`${ruleType}._parse: ${ruleParseDuration.toFixed(3)}ms, capture length: ${capture[0].length}`);
-					}
-					state.prevCapture = (state.prevCapture || "") + capture[0];
-					if (!parsedAny.type) parsedAny.type = ruleType;
-					result.push(parsedAny);
-					break;
-				}
-				i++;
+		if (state.prevCaptureHasBlankLine === void 0) state.prevCaptureIndent = "";
+		if (source.trim()) while (source) for (let i = 0; i < ruleCount; i++) {
+			const qualify = qualifiers[i];
+			if (qualify && !require_markdown_utils.qualifies(source, state, qualify)) continue;
+			const capture = matchers[i](source, state);
+			if (capture?.[0]) {
+				source = source.substring(capture[0].length);
+				const parsed = parsers[i](capture, nestedParse, state);
+				advanceLookbehind(state, capture[0]);
+				if (!parsed.type) parsed.type = order[i];
+				result.push(parsed);
+				break;
 			}
 		}
-		if (process.env.NODE_ENV === "development") {
-			const parseDuration = performance.now() - parseStart;
-			if (parseDuration > 1) console.log(`nestedParse: ${parseDuration.toFixed(3)}ms, source length: ${source.length}, result count: ${result.length}`);
-		}
 		return result;
 	};
-	if (process.env.NODE_ENV === "development") {
-		const duration = performance.now() - start;
-		if (duration > 20) console.log(`parserFor: ${duration.toFixed(3)}ms, rules count: ${ruleList.length}`);
-	}
 	return (source, state) => nestedParse(require_markdown_utils.normalizeWhitespace(source), state);
 };
 

package/dist/cjs/markdown/parser.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"parser.cjs","names":["qualifies","normalizeWhitespace"],"sources":["../../../src/markdown/parser.ts"],"sourcesContent":["import { DURATION_DELAY_TRIGGER } from './constants';\nimport type { NestedParser, ParserResult, ParseState, Rules } from './types';\nimport { normalizeWhitespace, qualifies } from './utils';\n\n/**\n * Creates a parser for a given set of rules, with the precedence\n * specified as a list of rules.\n *\n * @param rules - An object containing rule type -> {match, order, parse} objects\n *                (lower order is higher precedence)\n *\n * @returns The resulting parse function\n */\nexport const parserFor = (\n  rules: Rules\n): ((source: string, state: ParseState) => ParserResult[]) => {\n  const start = performance.now();\n  const ruleList = Object.keys(rules);\n\n  if (process.env.NODE_ENV !== 'production') {\n    ruleList.forEach((type) => {\n      const order = rules[type]?._order;\n      if (typeof order !== 'number' || !Number.isFinite(order)) {\n        console.warn(`intlayer: Invalid order for rule \\`${type}\\`: ${order}`);\n      }\n    });\n  }\n\n  // Sorts rules in order of increasing order, then\n  // ascending rule name (numeric) in case of ties.\n  // RuleType keys are string numbers — use numeric comparison to preserve\n  // intended ordering (e.g. codeFenced '4' must precede headingSetext '10').\n  ruleList.sort((a, b) => {\n    return rules[a]!._order - rules[b]!._order || +a - +b;\n  });\n\n  const nestedParse: NestedParser = (\n    source: string,\n    state: ParseState = {}\n  ): ParserResult[] => {\n    const parseStart = performance.now();\n    const result: ParserResult[] = [];\n    state.prevCapture = state.prevCapture || '';\n\n    if (source.trim()) {\n      while (source) {\n        let i = 0;\n        while (i < ruleList.length) {\n          const ruleType = ruleList[i];\n          const rule = rules[ruleType as keyof typeof rules];\n\n          if (rule?._qualify && !qualifies(source, state, rule._qualify)) {\n            i++;\n            continue;\n          }\n\n          const matchStart = performance.now();\n          const capture = rule?._match(source, state);\n\n          if (process.env.NODE_ENV !== 'production') {\n            const matchDuration = performance.now() - matchStart;\n            if (matchDuration > 1) {\n              console.log(\n                `${ruleType}._match: ${matchDuration.toFixed(3)}ms, source length: ${source.length}`\n              );\n            }\n          }\n\n          if (capture?.[0]) {\n            source = source.substring(capture[0].length);\n\n            const ruleParseStart = performance.now();\n            const parsedAny: any = rule?._parse(capture, nestedParse, state);\n\n            if (process.env.NODE_ENV !== 'production') {\n              const ruleParseDuration = performance.now() - ruleParseStart;\n              if (ruleParseDuration > 1) {\n                console.log(\n                  `${ruleType}._parse: ${ruleParseDuration.toFixed(3)}ms, capture length: ${capture[0].length}`\n                );\n              }\n            }\n\n            state.prevCapture = (state.prevCapture || '') + capture[0];\n\n            if (!parsedAny.type) {\n              parsedAny.type = ruleType;\n            }\n            result.push(parsedAny as ParserResult);\n            break;\n          }\n          i++;\n        }\n      }\n    }\n\n    // Tree shakeable log for prod\n    if (process.env.NODE_ENV === 'development') {\n      const parseDuration = performance.now() - parseStart;\n      if (parseDuration > 1) {\n        console.log(\n          `nestedParse: ${parseDuration.toFixed(3)}ms, source length: ${source.length}, result count: ${result.length}`\n        );\n      }\n    }\n\n    return result;\n  };\n\n  // Tree shakeable log for prod\n  if (process.env.NODE_ENV === 'development') {\n    const duration = performance.now() - start;\n\n    if (duration > DURATION_DELAY_TRIGGER) {\n      console.log(\n        `parserFor: ${duration.toFixed(3)}ms, rules count: ${ruleList.length}`\n      );\n    }\n  }\n\n  return (source: string, state: ParseState) =>\n    nestedParse(normalizeWhitespace(source), state);\n};\n"],"mappings":";;;;;;;;;;;;;;AAaA,MAAa,aACX,UAC4D;CAC5D,MAAM,QAAQ,YAAY,IAAI;CAC9B,MAAM,WAAW,OAAO,KAAK,KAAK;CAElC,IAAI,QAAQ,IAAI,aAAa,cAC3B,SAAS,SAAS,SAAS;EACzB,MAAM,QAAQ,MAAM,KAAK,EAAE;EAC3B,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,GACrD,QAAQ,KAAK,sCAAsC,KAAK,MAAM,OAAO;CAEzE,CAAC;CAOH,SAAS,MAAM,GAAG,MAAM;EACtB,OAAO,MAAM,EAAE,CAAE,SAAS,MAAM,EAAE,CAAE,UAAU,CAAC,IAAI,CAAC;CACtD,CAAC;CAED,MAAM,eACJ,QACA,QAAoB,CAAC,MACF;EACnB,MAAM,aAAa,YAAY,IAAI;EACnC,MAAM,SAAyB,CAAC;EAChC,MAAM,cAAc,MAAM,eAAe;EAEzC,IAAI,OAAO,KAAK,GACd,OAAO,QAAQ;GACb,IAAI,IAAI;GACR,OAAO,IAAI,SAAS,QAAQ;IAC1B,MAAM,WAAW,SAAS;IAC1B,MAAM,OAAO,MAAM;IAEnB,IAAI,MAAM,YAAY,CAACA,iCAAU,QAAQ,OAAO,KAAK,QAAQ,GAAG;KAC9D;KACA;IACF;IAEA,MAAM,aAAa,YAAY,IAAI;IACnC,MAAM,UAAU,MAAM,OAAO,QAAQ,KAAK;IAE1C,IAAI,QAAQ,IAAI,aAAa,cAAc;KACzC,MAAM,gBAAgB,YAAY,IAAI,IAAI;KAC1C,IAAI,gBAAgB,GAClB,QAAQ,IACN,GAAG,SAAS,WAAW,cAAc,QAAQ,CAAC,EAAE,qBAAqB,OAAO,QAC9E;IAEJ;IAEA,IAAI,UAAU,IAAI;KAChB,SAAS,OAAO,UAAU,QAAQ,EAAE,CAAC,MAAM;KAE3C,MAAM,iBAAiB,YAAY,IAAI;KACvC,MAAM,YAAiB,MAAM,OAAO,SAAS,aAAa,KAAK;KAE/D,IAAI,QAAQ,IAAI,aAAa,cAAc;MACzC,MAAM,oBAAoB,YAAY,IAAI,IAAI;MAC9C,IAAI,oBAAoB,GACtB,QAAQ,IACN,GAAG,SAAS,WAAW,kBAAkB,QAAQ,CAAC,EAAE,sBAAsB,QAAQ,EAAE,CAAC,QACvF;KAEJ;KAEA,MAAM,eAAe,MAAM,eAAe,MAAM,QAAQ;KAExD,IAAI,CAAC,UAAU,MACb,UAAU,OAAO;KAEnB,OAAO,KAAK,SAAyB;KACrC;IACF;IACA;GACF;EACF;EAIF,IAAI,QAAQ,IAAI,aAAa,eAAe;GAC1C,MAAM,gBAAgB,YAAY,IAAI,IAAI;GAC1C,IAAI,gBAAgB,GAClB,QAAQ,IACN,gBAAgB,cAAc,QAAQ,CAAC,EAAE,qBAAqB,OAAO,OAAO,kBAAkB,OAAO,QACvG;EAEJ;EAEA,OAAO;CACT;CAGA,IAAI,QAAQ,IAAI,aAAa,eAAe;EAC1C,MAAM,WAAW,YAAY,IAAI,IAAI;EAErC,IAAI,eACF,QAAQ,IACN,cAAc,SAAS,QAAQ,CAAC,EAAE,mBAAmB,SAAS,QAChE;CAEJ;CAEA,QAAQ,QAAgB,UACtB,YAAYC,2CAAoB,MAAM,GAAG,KAAK;AAClD"}
+{"version":3,"file":"parser.cjs","names":["qualifies","normalizeWhitespace"],"sources":["../../../src/markdown/parser.ts"],"sourcesContent":["import type {\n  NestedParser,\n  ParserResult,\n  ParseState,\n  Rule,\n  Rules,\n} from './types';\nimport { normalizeWhitespace, qualifies } from './utils';\n\n/**\n * Cached rule precedence, grouped by rule count.\n *\n * A rule's `_order` never varies, so the precedence a rule set sorts into is a\n * pure function of which rules it holds. Rules themselves are rebuilt per\n * document, so the cache is keyed by rule names rather than by object identity,\n * and grouped by count to keep the comparison short.\n */\ntype RuleOrderEntry = { names: string[]; order: string[] };\n\nconst ruleOrderCache = new Map<number, RuleOrderEntry[]>();\n\nconst sameNames = (a: string[], b: string[]): boolean => {\n  for (let i = 0; i < a.length; i++) {\n    if (a[i] !== b[i]) return false;\n  }\n\n  return true;\n};\n\n/**\n * Resolves `Object.keys(rules)` into precedence order, sorting only the first\n * time a given rule set is seen.\n */\nconst orderRules = (names: string[], rules: Rules): string[] => {\n  const candidates = ruleOrderCache.get(names.length);\n\n  if (candidates) {\n    for (let i = 0; i < candidates.length; i++) {\n      if (sameNames(names, candidates[i]!.names)) return candidates[i]!.order;\n    }\n  }\n\n  // Sorts rules in order of increasing order, then\n  // ascending rule name (numeric) in case of ties.\n  // RuleType keys are string numbers — use numeric comparison to preserve\n  // intended ordering (e.g. codeFenced '4' must precede headingSetext '10').\n  const order = names\n    .slice()\n    .sort((a, b) => rules[a]!._order - rules[b]!._order || +a - +b);\n\n  const entry: RuleOrderEntry = { names: names.slice(), order };\n\n  if (candidates) candidates.push(entry);\n  else ruleOrderCache.set(names.length, [entry]);\n\n  return order;\n};\n\n/**\n * Advance the incremental lookbehind carried on the parse state.\n *\n * Rules only ever ask two questions about the source already consumed: how far\n * the current line is indented (`prevCaptureIndent`) and whether a blank line\n * has been seen (`prevCaptureHasBlankLine`). Both are maintained in time\n * proportional to the capture rather than by concatenating — and later\n * rescanning — the whole document, which made parsing quadratic.\n */\nconst advanceLookbehind = (state: ParseState, capture: string): void => {\n  const newlineIndex = capture.lastIndexOf('\\n');\n  // `undefined` marks a lookbehind nothing has been appended to yet, which is\n  // the only way to tell an empty lookbehind from one ending on a line break.\n  const hasPrevCapture = state.prevCaptureHasBlankLine !== undefined;\n\n  if (state.prevCaptureHasBlankLine !== true) {\n    state.prevCaptureHasBlankLine =\n      capture.indexOf('\\n\\n') !== -1 ||\n      // A capture opening on a line break closes a blank line when the\n      // lookbehind already ended on one.\n      (hasPrevCapture &&\n        capture.charCodeAt(0) === 10 /* \\n */ &&\n        state.prevCaptureIndent === '');\n  }\n\n  // Everything after the final newline forms the current line. With no newline\n  // in the capture, the current line simply grew by `capture`.\n  const tail =\n    newlineIndex === -1\n      ? state.prevCaptureIndent === undefined\n        ? undefined\n        : state.prevCaptureIndent + capture\n      : capture.slice(newlineIndex + 1);\n\n  if (tail === undefined || tail === '') {\n    state.prevCaptureIndent = tail;\n    return;\n  }\n\n  for (let i = 0; i < tail.length; i++) {\n    if (tail.charCodeAt(i) !== 32 /* space */) {\n      state.prevCaptureIndent = undefined;\n      return;\n    }\n  }\n\n  state.prevCaptureIndent = tail;\n};\n\n/**\n * Creates a parser for a given set of rules, with the precedence\n * specified as a list of rules.\n *\n * @param rules - An object containing rule type -> {match, order, parse} objects\n *                (lower order is higher precedence)\n *\n * @returns The resulting parse function\n */\nexport const parserFor = (\n  rules: Rules\n): ((source: string, state: ParseState) => ParserResult[]) => {\n  const ruleList = Object.keys(rules);\n\n  if (process.env.NODE_ENV !== 'production') {\n    ruleList.forEach((type) => {\n      const order = rules[type]?._order;\n      if (typeof order !== 'number' || !Number.isFinite(order)) {\n        console.warn(`intlayer: Invalid order for rule \\`${type}\\`: ${order}`);\n      }\n    });\n  }\n\n  const order = orderRules(ruleList, rules);\n  const ruleCount = order.length;\n\n  // Rule objects have heterogeneous shapes (`_qualify` and `_render` are both\n  // optional), so their members are hoisted into parallel arrays: the hot loop\n  // then reads monomorphic slots instead of polymorphic properties, and the\n  // whole set costs three allocations rather than one wrapper per rule.\n  const qualifiers: (Rule<any>['_qualify'] | undefined)[] = new Array(\n    ruleCount\n  );\n  const matchers: Rule<any>['_match'][] = new Array(ruleCount);\n  const parsers: Rule<any>['_parse'][] = new Array(ruleCount);\n\n  for (let i = 0; i < ruleCount; i++) {\n    const rule = rules[order[i]!]!;\n\n    qualifiers[i] = rule._qualify;\n    matchers[i] = rule._match;\n    parsers[i] = rule._parse;\n  }\n\n  const nestedParse: NestedParser = (\n    source: string,\n    state: ParseState = {}\n  ): ParserResult[] => {\n    const result: ParserResult[] = [];\n\n    if (state.prevCaptureHasBlankLine === undefined) {\n      // Nothing consumed yet: an empty lookbehind sits at the start of a line.\n      state.prevCaptureIndent = '';\n    }\n\n    if (source.trim()) {\n      while (source) {\n        for (let i = 0; i < ruleCount; i++) {\n          const qualify = qualifiers[i];\n\n          if (qualify && !qualifies(source, state, qualify)) continue;\n\n          const capture = matchers[i]!(source, state);\n\n          if (capture?.[0]) {\n            source = source.substring(capture[0].length);\n\n            const parsed: any = parsers[i]!(capture, nestedParse, state);\n\n            advanceLookbehind(state, capture[0]);\n\n            if (!parsed.type) {\n              parsed.type = order[i];\n            }\n\n            result.push(parsed as ParserResult);\n            break;\n          }\n        }\n      }\n    }\n\n    return result;\n  };\n\n  return (source: string, state: ParseState) =>\n    nestedParse(normalizeWhitespace(source), state);\n};\n"],"mappings":";;;;AAmBA,MAAM,iCAAiB,IAAI,IAA8B;AAEzD,MAAM,aAAa,GAAa,MAAyB;CACvD,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,IAAI,EAAE,OAAO,EAAE,IAAI,OAAO;CAG5B,OAAO;AACT;;;;;AAMA,MAAM,cAAc,OAAiB,UAA2B;CAC9D,MAAM,aAAa,eAAe,IAAI,MAAM,MAAM;CAElD,IAAI,YACF;OAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KACrC,IAAI,UAAU,OAAO,WAAW,EAAE,CAAE,KAAK,GAAG,OAAO,WAAW,EAAE,CAAE;CACpE;CAOF,MAAM,QAAQ,MACX,MAAM,CAAC,CACP,MAAM,GAAG,MAAM,MAAM,EAAE,CAAE,SAAS,MAAM,EAAE,CAAE,UAAU,CAAC,IAAI,CAAC,CAAC;CAEhE,MAAM,QAAwB;EAAE,OAAO,MAAM,MAAM;EAAG;CAAM;CAE5D,IAAI,YAAY,WAAW,KAAK,KAAK;MAChC,eAAe,IAAI,MAAM,QAAQ,CAAC,KAAK,CAAC;CAE7C,OAAO;AACT;;;;;;;;;;AAWA,MAAM,qBAAqB,OAAmB,YAA0B;CACtE,MAAM,eAAe,QAAQ,YAAY,IAAI;CAG7C,MAAM,iBAAiB,MAAM,4BAA4B;CAEzD,IAAI,MAAM,4BAA4B,MACpC,MAAM,0BACJ,QAAQ,QAAQ,MAAM,MAAM,MAG3B,kBACC,QAAQ,WAAW,CAAC,MAAM,MAC1B,MAAM,sBAAsB;CAKlC,MAAM,OACJ,iBAAiB,KACb,MAAM,sBAAsB,SAC1B,SACA,MAAM,oBAAoB,UAC5B,QAAQ,MAAM,eAAe,CAAC;CAEpC,IAAI,SAAS,UAAa,SAAS,IAAI;EACrC,MAAM,oBAAoB;EAC1B;CACF;CAEA,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,IAAI,KAAK,WAAW,CAAC,MAAM,IAAgB;EACzC,MAAM,oBAAoB;EAC1B;CACF;CAGF,MAAM,oBAAoB;AAC5B;;;;;;;;;;AAWA,MAAa,aACX,UAC4D;CAC5D,MAAM,WAAW,OAAO,KAAK,KAAK;CAElC,IAAI,QAAQ,IAAI,aAAa,cAC3B,SAAS,SAAS,SAAS;EACzB,MAAM,QAAQ,MAAM,KAAK,EAAE;EAC3B,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,GACrD,QAAQ,KAAK,sCAAsC,KAAK,MAAM,OAAO;CAEzE,CAAC;CAGH,MAAM,QAAQ,WAAW,UAAU,KAAK;CACxC,MAAM,YAAY,MAAM;CAMxB,MAAM,aAAoD,IAAI,MAC5D,SACF;CACA,MAAM,WAAkC,IAAI,MAAM,SAAS;CAC3D,MAAM,UAAiC,IAAI,MAAM,SAAS;CAE1D,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;EAClC,MAAM,OAAO,MAAM,MAAM;EAEzB,WAAW,KAAK,KAAK;EACrB,SAAS,KAAK,KAAK;EACnB,QAAQ,KAAK,KAAK;CACpB;CAEA,MAAM,eACJ,QACA,QAAoB,CAAC,MACF;EACnB,MAAM,SAAyB,CAAC;EAEhC,IAAI,MAAM,4BAA4B,QAEpC,MAAM,oBAAoB;EAG5B,IAAI,OAAO,KAAK,GACd,OAAO,QACL,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;GAClC,MAAM,UAAU,WAAW;GAE3B,IAAI,WAAW,CAACA,iCAAU,QAAQ,OAAO,OAAO,GAAG;GAEnD,MAAM,UAAU,SAAS,EAAE,CAAE,QAAQ,KAAK;GAE1C,IAAI,UAAU,IAAI;IAChB,SAAS,OAAO,UAAU,QAAQ,EAAE,CAAC,MAAM;IAE3C,MAAM,SAAc,QAAQ,EAAE,CAAE,SAAS,aAAa,KAAK;IAE3D,kBAAkB,OAAO,QAAQ,EAAE;IAEnC,IAAI,CAAC,OAAO,MACV,OAAO,OAAO,MAAM;IAGtB,OAAO,KAAK,MAAsB;IAClC;GACF;EACF;EAIJ,OAAO;CACT;CAEA,QAAQ,QAAgB,UACtB,YAAYC,2CAAoB,MAAM,GAAG,KAAK;AAClD"}

package/dist/cjs/markdown/renderer.cjs

@@ -1,6 +1,4 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-const require_markdown_constants = require('./constants.cjs');
-
 //#region src/markdown/renderer.ts
 /**
 * Creates a renderer for AST nodes.
@@ -9,16 +7,15 @@ const require_markdown_constants = require('./constants.cjs');
 * @param render - The render function to call for each node
 * @returns A function that renders AST to output
 */
-const renderFor = (render) => (ast, state = {}) => {
-	const start = performance.now();
-	const patchedRender = (ast, state = {}) => renderFor(render)(ast, state);
-	if (Array.isArray(ast)) {
+const renderFor = (render) => {
+	const emit = (ast, state = {}) => {
+		if (!Array.isArray(ast)) return render(ast, emit, state);
 		const oldKey = state.key;
 		const result = [];
 		let lastWasString = false;
 		let renderedIndex = 0;
 		for (let i = 0; i < ast.length; i++) {
-			const nodeOut = patchedRender(ast[i], {
+			const nodeOut = emit(ast[i], {
 				...state,
 				key: renderedIndex
 			});
@@ -31,14 +28,9 @@ const renderFor = (render) => (ast, state = {}) => {
 			lastWasString = isString;
 		}
 		state.key = oldKey;
-		const duration = performance.now() - start;
-		if (duration > 20) console.log(`renderFor (array): ${duration.toFixed(3)}ms, ast length: ${ast.length}`);
 		return result;
-	}
-	const result = render(ast, patchedRender, state);
-	const duration = performance.now() - start;
-	if (duration > 20) console.log(`renderFor (single): ${duration.toFixed(3)}ms, ast type: ${ast.type}`);
-	return result;
+	};
+	return emit;
 };
 /**
 * Creates a renderer from rules with optional custom render hook.
@@ -48,12 +40,8 @@ const renderFor = (render) => (ast, state = {}) => {
 * @returns A render function for AST nodes
 */
 const createRenderer = (rules, userRender) => (ast, render, state) => {
-	const start = performance.now();
 	const renderer = rules[ast.type]?._render;
-	const result = userRender ? userRender(() => renderer?.(ast, render, state), ast, render, state) : renderer?.(ast, render, state);
-	const duration = performance.now() - start;
-	if (duration > 20) console.log(`createRenderer: ${duration.toFixed(3)}ms, ast type: ${ast.type}, hasUserRender: ${!!userRender}`);
-	return result;
+	return userRender ? userRender(() => renderer?.(ast, render, state), ast, render, state) : renderer?.(ast, render, state);
 };
 
 //#endregion

package/dist/cjs/markdown/renderer.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"renderer.cjs","names":[],"sources":["../../../src/markdown/renderer.ts"],"sourcesContent":["import { DURATION_DELAY_TRIGGER } from './constants';\nimport type {\n  ParserResult,\n  ParseState,\n  RenderRuleHook,\n  RuleOutput,\n  Rules,\n} from './types';\n\n/**\n * Creates a renderer for AST nodes.\n * Renamed from `reactFor` to be framework-agnostic.\n *\n * @param render - The render function to call for each node\n * @returns A function that renders AST to output\n */\nexport const renderFor =\n  (\n    render: (\n      ast: ParserResult,\n      render: RuleOutput,\n      state: ParseState\n    ) => unknown\n  ) =>\n  (ast: ParserResult | ParserResult[], state: ParseState = {}): any => {\n    const start = performance.now();\n\n    const patchedRender = (\n      ast: ParserResult | ParserResult[],\n      state: ParseState = {}\n    ): any => renderFor(render)(ast, state);\n\n    if (Array.isArray(ast)) {\n      const oldKey = state.key;\n      const result: any[] = [];\n\n      // map nestedOutput over the ast, except group any text\n      // nodes together into a single string output.\n      let lastWasString = false;\n      let renderedIndex = 0;\n\n      for (let i = 0; i < ast.length; i++) {\n        // We clone the state to avoid side effects on other nodes in the same level\n        // while ensuring each non-null rendered node gets a unique, sequential key.\n        const nodeOut = patchedRender(ast[i], { ...state, key: renderedIndex });\n        const isString = typeof nodeOut === 'string';\n\n        if (isString && lastWasString) {\n          result[result.length - 1] =\n            (result[result.length - 1] as string) + nodeOut;\n        } else if (nodeOut !== null) {\n          result.push(nodeOut);\n          renderedIndex++;\n        }\n\n        lastWasString = isString;\n      }\n\n      state.key = oldKey;\n\n      const duration = performance.now() - start;\n      if (duration > DURATION_DELAY_TRIGGER) {\n        console.log(\n          `renderFor (array): ${duration.toFixed(3)}ms, ast length: ${ast.length}`\n        );\n      }\n\n      return result;\n    }\n\n    const result = render(ast, patchedRender as RuleOutput, state);\n\n    const duration = performance.now() - start;\n    if (duration > DURATION_DELAY_TRIGGER) {\n      console.log(\n        `renderFor (single): ${duration.toFixed(3)}ms, ast type: ${(ast as ParserResult).type}`\n      );\n    }\n\n    return result;\n  };\n\n/**\n * Creates a renderer from rules with optional custom render hook.\n *\n * @param rules - The rules object containing _render functions\n * @param userRender - Optional custom render hook for full control\n * @returns A render function for AST nodes\n */\nexport const createRenderer =\n  (rules: Rules, userRender?: RenderRuleHook) =>\n  (ast: ParserResult, render: RuleOutput, state: ParseState): unknown => {\n    const start = performance.now();\n    const renderer = rules[ast.type]?._render;\n\n    const result = userRender\n      ? userRender(() => renderer?.(ast, render, state), ast, render, state)\n      : renderer?.(ast, render, state);\n\n    const duration = performance.now() - start;\n    if (duration > DURATION_DELAY_TRIGGER) {\n      console.log(\n        `createRenderer: ${duration.toFixed(3)}ms, ast type: ${ast.type}, hasUserRender: ${!!userRender}`\n      );\n    }\n\n    return result;\n  };\n"],"mappings":";;;;;;;;;;;AAgBA,MAAa,aAET,YAMD,KAAoC,QAAoB,CAAC,MAAW;CACnE,MAAM,QAAQ,YAAY,IAAI;CAE9B,MAAM,iBACJ,KACA,QAAoB,CAAC,MACb,UAAU,MAAM,CAAC,CAAC,KAAK,KAAK;CAEtC,IAAI,MAAM,QAAQ,GAAG,GAAG;EACtB,MAAM,SAAS,MAAM;EACrB,MAAM,SAAgB,CAAC;EAIvB,IAAI,gBAAgB;EACpB,IAAI,gBAAgB;EAEpB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;GAGnC,MAAM,UAAU,cAAc,IAAI,IAAI;IAAE,GAAG;IAAO,KAAK;GAAc,CAAC;GACtE,MAAM,WAAW,OAAO,YAAY;GAEpC,IAAI,YAAY,eACd,OAAO,OAAO,SAAS,KACpB,OAAO,OAAO,SAAS,KAAgB;QACrC,IAAI,YAAY,MAAM;IAC3B,OAAO,KAAK,OAAO;IACnB;GACF;GAEA,gBAAgB;EAClB;EAEA,MAAM,MAAM;EAEZ,MAAM,WAAW,YAAY,IAAI,IAAI;EACrC,IAAI,eACF,QAAQ,IACN,sBAAsB,SAAS,QAAQ,CAAC,EAAE,kBAAkB,IAAI,QAClE;EAGF,OAAO;CACT;CAEA,MAAM,SAAS,OAAO,KAAK,eAA6B,KAAK;CAE7D,MAAM,WAAW,YAAY,IAAI,IAAI;CACrC,IAAI,eACF,QAAQ,IACN,uBAAuB,SAAS,QAAQ,CAAC,EAAE,gBAAiB,IAAqB,MACnF;CAGF,OAAO;AACT;;;;;;;;AASF,MAAa,kBACV,OAAc,gBACd,KAAmB,QAAoB,UAA+B;CACrE,MAAM,QAAQ,YAAY,IAAI;CAC9B,MAAM,WAAW,MAAM,IAAI,KAAK,EAAE;CAElC,MAAM,SAAS,aACX,iBAAiB,WAAW,KAAK,QAAQ,KAAK,GAAG,KAAK,QAAQ,KAAK,IACnE,WAAW,KAAK,QAAQ,KAAK;CAEjC,MAAM,WAAW,YAAY,IAAI,IAAI;CACrC,IAAI,eACF,QAAQ,IACN,mBAAmB,SAAS,QAAQ,CAAC,EAAE,gBAAgB,IAAI,KAAK,mBAAmB,CAAC,CAAC,YACvF;CAGF,OAAO;AACT"}
+{"version":3,"file":"renderer.cjs","names":[],"sources":["../../../src/markdown/renderer.ts"],"sourcesContent":["import type {\n  ParserResult,\n  ParseState,\n  RenderRuleHook,\n  RuleOutput,\n  Rules,\n} from './types';\n\n/**\n * Creates a renderer for AST nodes.\n * Renamed from `reactFor` to be framework-agnostic.\n *\n * @param render - The render function to call for each node\n * @returns A function that renders AST to output\n */\nexport const renderFor = (\n  render: (ast: ParserResult, render: RuleOutput, state: ParseState) => unknown\n) => {\n  // Bound once instead of per node: rebuilding the recursive renderer on every\n  // visit allocated a closure pair for each AST node.\n  const emit = (\n    ast: ParserResult | ParserResult[],\n    state: ParseState = {}\n  ): any => {\n    if (!Array.isArray(ast)) {\n      return render(ast, emit as RuleOutput, state);\n    }\n\n    const oldKey = state.key;\n    const result: any[] = [];\n\n    // map nestedOutput over the ast, except group any text\n    // nodes together into a single string output.\n    let lastWasString = false;\n    let renderedIndex = 0;\n\n    for (let i = 0; i < ast.length; i++) {\n      // We clone the state to avoid side effects on other nodes in the same level\n      // while ensuring each non-null rendered node gets a unique, sequential key.\n      const nodeOut = emit(ast[i], { ...state, key: renderedIndex });\n      const isString = typeof nodeOut === 'string';\n\n      if (isString && lastWasString) {\n        result[result.length - 1] =\n          (result[result.length - 1] as string) + nodeOut;\n      } else if (nodeOut !== null) {\n        result.push(nodeOut);\n        renderedIndex++;\n      }\n\n      lastWasString = isString;\n    }\n\n    state.key = oldKey;\n\n    return result;\n  };\n\n  return emit;\n};\n\n/**\n * Creates a renderer from rules with optional custom render hook.\n *\n * @param rules - The rules object containing _render functions\n * @param userRender - Optional custom render hook for full control\n * @returns A render function for AST nodes\n */\nexport const createRenderer =\n  (rules: Rules, userRender?: RenderRuleHook) =>\n  (ast: ParserResult, render: RuleOutput, state: ParseState): unknown => {\n    const renderer = rules[ast.type]?._render;\n\n    return userRender\n      ? userRender(() => renderer?.(ast, render, state), ast, render, state)\n      : renderer?.(ast, render, state);\n  };\n"],"mappings":";;;;;;;;;AAeA,MAAa,aACX,WACG;CAGH,MAAM,QACJ,KACA,QAAoB,CAAC,MACb;EACR,IAAI,CAAC,MAAM,QAAQ,GAAG,GACpB,OAAO,OAAO,KAAK,MAAoB,KAAK;EAG9C,MAAM,SAAS,MAAM;EACrB,MAAM,SAAgB,CAAC;EAIvB,IAAI,gBAAgB;EACpB,IAAI,gBAAgB;EAEpB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;GAGnC,MAAM,UAAU,KAAK,IAAI,IAAI;IAAE,GAAG;IAAO,KAAK;GAAc,CAAC;GAC7D,MAAM,WAAW,OAAO,YAAY;GAEpC,IAAI,YAAY,eACd,OAAO,OAAO,SAAS,KACpB,OAAO,OAAO,SAAS,KAAgB;QACrC,IAAI,YAAY,MAAM;IAC3B,OAAO,KAAK,OAAO;IACnB;GACF;GAEA,gBAAgB;EAClB;EAEA,MAAM,MAAM;EAEZ,OAAO;CACT;CAEA,OAAO;AACT;;;;;;;;AASA,MAAa,kBACV,OAAc,gBACd,KAAmB,QAAoB,UAA+B;CACrE,MAAM,WAAW,MAAM,IAAI,KAAK,EAAE;CAElC,OAAO,aACH,iBAAiB,WAAW,KAAK,QAAQ,KAAK,GAAG,KAAK,QAAQ,KAAK,IACnE,WAAW,KAAK,QAAQ,KAAK;AACnC"}