@react-querybuilder/core 8.16.1 → 8.17.0

package/dist/parseCypher.js.map

@@ -1 +1 @@
-{"version":3,"file":"parseCypher.js","names":["Lexer","CstParser"],"sources":["../src/utils/parseCypher/parseCypher.ts"],"sourcesContent":["import { createToken, Lexer, CstParser, type CstNode, type IToken } from 'chevrotain';\nimport type {\n  DefaultRuleGroupType,\n  DefaultRuleGroupTypeAny,\n  DefaultRuleGroupTypeIC,\n  DefaultRuleType,\n} from '../../types';\n\n// ─── Lexer Tokens ────────────────────────────────────────────────────────────\n\nconst WhiteSpace = createToken({ name: 'WhiteSpace', pattern: /\\s+/, group: Lexer.SKIPPED });\n\n// Keywords (longer/multi-word first)\nconst OptionalMatch = createToken({\n  name: 'OptionalMatch',\n  pattern: /OPTIONAL\\s+MATCH/i,\n  longer_alt: undefined,\n});\nconst StartsWith = createToken({ name: 'StartsWith', pattern: /STARTS\\s+WITH/i });\nconst EndsWith = createToken({ name: 'EndsWith', pattern: /ENDS\\s+WITH/i });\nconst IsNotNull = createToken({ name: 'IsNotNull', pattern: /IS\\s+NOT\\s+NULL/i });\nconst IsNull = createToken({ name: 'IsNull', pattern: /IS\\s+NULL/i });\nconst NotIn = createToken({ name: 'NotIn', pattern: /NOT\\s+IN/i });\nconst Match = createToken({ name: 'Match', pattern: /MATCH/i });\nconst Where = createToken({ name: 'Where', pattern: /WHERE/i });\nconst Return = createToken({ name: 'Return', pattern: /RETURN/i });\nconst And = createToken({ name: 'And', pattern: /AND/i });\nconst Or = createToken({ name: 'Or', pattern: /OR/i });\nconst Not = createToken({ name: 'Not', pattern: /NOT/i });\nconst Contains = createToken({ name: 'Contains', pattern: /CONTAINS/i });\nconst In = createToken({ name: 'In', pattern: /IN/i });\nconst NullLit = createToken({ name: 'NullLit', pattern: /null\\b/ });\nconst TrueLit = createToken({ name: 'TrueLit', pattern: /true\\b/ });\nconst FalseLit = createToken({ name: 'FalseLit', pattern: /false\\b/ });\n\n// Literals\nconst StringLiteral = createToken({ name: 'StringLiteral', pattern: /'(?:[^'\\\\]|\\\\.)*'/ });\nconst NumberLiteral = createToken({ name: 'NumberLiteral', pattern: /-?\\d+(?:\\.\\d+)?/ });\n\n// Operators\nconst LessEqual = createToken({ name: 'LessEqual', pattern: /<=/ });\nconst GreaterEqual = createToken({ name: 'GreaterEqual', pattern: />=/ });\nconst NotEqual = createToken({ name: 'NotEqual', pattern: /<>/ });\nconst Less = createToken({ name: 'Less', pattern: /</ });\nconst Greater = createToken({ name: 'Greater', pattern: />/ });\nconst Equal = createToken({ name: 'Equal', pattern: /=/ });\n\n// Punctuation\nconst LParen = createToken({ name: 'LParen', pattern: /\\(/ });\nconst RParen = createToken({ name: 'RParen', pattern: /\\)/ });\nconst LBracket = createToken({ name: 'LBracket', pattern: /\\[/ });\nconst RBracket = createToken({ name: 'RBracket', pattern: /\\]/ });\nconst Comma = createToken({ name: 'Comma', pattern: /,/ });\nconst Colon = createToken({ name: 'Colon', pattern: /:/ });\nconst Dot = createToken({ name: 'Dot', pattern: /\\./ });\n\n// Arrow parts for relationship patterns\nconst DashArrowRight = createToken({ name: 'DashArrowRight', pattern: /->/ });\nconst ArrowLeftDash = createToken({ name: 'ArrowLeftDash', pattern: /<-/ });\nconst Dash = createToken({ name: 'Dash', pattern: /-/ });\n\n// Identifier (must come after all keywords)\nconst Identifier = createToken({ name: 'Identifier', pattern: /[a-zA-Z_]\\w*/ });\n\n// Token order matters: longer patterns and keywords before shorter ones\nconst allTokens = [\n  WhiteSpace,\n  // Multi-word keywords (must come before single-word)\n  OptionalMatch,\n  StartsWith,\n  EndsWith,\n  IsNotNull,\n  IsNull,\n  NotIn,\n  // Single-word keywords\n  Match,\n  Where,\n  Return,\n  And,\n  Or,\n  Not,\n  Contains,\n  In,\n  NullLit,\n  TrueLit,\n  FalseLit,\n  // Literals\n  StringLiteral,\n  NumberLiteral,\n  // Multi-char operators\n  LessEqual,\n  GreaterEqual,\n  NotEqual,\n  DashArrowRight,\n  ArrowLeftDash,\n  // Single-char operators\n  Less,\n  Greater,\n  Equal,\n  // Punctuation\n  LParen,\n  RParen,\n  LBracket,\n  RBracket,\n  Comma,\n  Colon,\n  Dot,\n  Dash,\n  // Identifier last\n  Identifier,\n];\n\nconst cypherLexer = new Lexer(allTokens);\n\n// ─── CST Parser ──────────────────────────────────────────────────────────────\n\nclass CypherCstParser extends CstParser {\n  constructor() {\n    super(allTokens, { recoveryEnabled: false });\n    this.performSelfAnalysis();\n  }\n\n  /** Top-level: sequence of MATCH/OPTIONAL MATCH clauses, optional WHERE, optional RETURN */\n  public cypherQuery = this.RULE('cypherQuery', () => {\n    this.MANY(() => {\n      this.OR([\n        { ALT: () => this.SUBRULE(this.optionalMatchClause) },\n        { ALT: () => this.SUBRULE(this.matchClause) },\n      ]);\n    });\n    this.OPTION(() => this.SUBRULE(this.whereClause));\n    this.OPTION1(() => this.SUBRULE(this.returnClause));\n  });\n\n  /** MATCH pattern */\n  public matchClause = this.RULE('matchClause', () => {\n    this.CONSUME(Match);\n    this.SUBRULE(this.pattern);\n  });\n\n  /** OPTIONAL MATCH pattern */\n  public optionalMatchClause = this.RULE('optionalMatchClause', () => {\n    this.CONSUME(OptionalMatch);\n    this.SUBRULE(this.pattern);\n  });\n\n  /** A graph pattern: node or node-rel-node */\n  public pattern = this.RULE('pattern', () => {\n    this.SUBRULE(this.nodePattern, { LABEL: 'lhs' });\n    this.OPTION(() => {\n      this.SUBRULE(this.relPattern);\n      this.SUBRULE1(this.nodePattern, { LABEL: 'rhs' });\n    });\n  });\n\n  /** (alias:Label) or (alias) */\n  public nodePattern = this.RULE('nodePattern', () => {\n    this.CONSUME(LParen);\n    this.CONSUME(Identifier, { LABEL: 'alias' });\n    this.OPTION(() => {\n      this.CONSUME(Colon);\n      this.CONSUME1(Identifier, { LABEL: 'label' });\n    });\n    this.CONSUME(RParen);\n  });\n\n  /** -[:TYPE]-> or <-[:TYPE]- or -[:TYPE]- */\n  public relPattern = this.RULE('relPattern', () => {\n    this.OR([\n      {\n        ALT: () => {\n          this.CONSUME(ArrowLeftDash, { LABEL: 'leftArrow' });\n          this.CONSUME(LBracket);\n          this.OPTION(() => {\n            this.CONSUME(Colon);\n            this.CONSUME(Identifier, { LABEL: 'relType' });\n          });\n          this.CONSUME(RBracket);\n          this.CONSUME(Dash, { LABEL: 'rightDash' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME1(Dash, { LABEL: 'leftDash' });\n          this.CONSUME1(LBracket);\n          this.OPTION1(() => {\n            this.CONSUME1(Colon);\n            this.CONSUME1(Identifier, { LABEL: 'relType' });\n          });\n          this.CONSUME1(RBracket);\n          this.CONSUME(DashArrowRight, { LABEL: 'rightArrow' });\n        },\n      },\n    ]);\n  });\n\n  /** WHERE expression */\n  public whereClause = this.RULE('whereClause', () => {\n    this.CONSUME(Where);\n    this.SUBRULE(this.orExpression);\n  });\n\n  /** expression OR expression */\n  public orExpression = this.RULE('orExpression', () => {\n    this.SUBRULE(this.andExpression, { LABEL: 'lhs' });\n    this.MANY(() => {\n      this.CONSUME(Or);\n      this.SUBRULE1(this.andExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  /** expression AND expression */\n  public andExpression = this.RULE('andExpression', () => {\n    this.SUBRULE(this.notExpression, { LABEL: 'lhs' });\n    this.MANY(() => {\n      this.CONSUME(And);\n      this.SUBRULE1(this.notExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  /** NOT expression */\n  public notExpression = this.RULE('notExpression', () => {\n    this.OPTION(() => this.CONSUME(Not));\n    this.SUBRULE(this.atomicExpression);\n  });\n\n  /** Parenthesized group or single condition */\n  public atomicExpression = this.RULE('atomicExpression', () => {\n    this.OR([\n      {\n        ALT: () => {\n          this.CONSUME(LParen);\n          this.SUBRULE(this.orExpression);\n          this.CONSUME(RParen);\n        },\n      },\n      { ALT: () => this.SUBRULE(this.condition) },\n    ]);\n  });\n\n  /** Single condition: field op value */\n  public condition = this.RULE('condition', () => {\n    this.SUBRULE(this.propertyRef, { LABEL: 'field' });\n    this.OR([\n      {\n        ALT: () => {\n          this.CONSUME(Equal);\n          this.SUBRULE(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(NotEqual);\n          this.SUBRULE1(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(Less);\n          this.SUBRULE2(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(Greater);\n          this.SUBRULE3(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(LessEqual);\n          this.SUBRULE4(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(GreaterEqual);\n          this.SUBRULE5(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(Contains);\n          this.SUBRULE6(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(StartsWith);\n          this.SUBRULE7(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(EndsWith);\n          this.SUBRULE8(this.literal, { LABEL: 'value' });\n        },\n      },\n      { ALT: () => this.CONSUME(IsNotNull) },\n      { ALT: () => this.CONSUME(IsNull) },\n      {\n        ALT: () => {\n          this.CONSUME(In);\n          this.SUBRULE(this.listLiteral, { LABEL: 'list' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(NotIn);\n          this.SUBRULE1(this.listLiteral, { LABEL: 'list' });\n        },\n      },\n    ]);\n  });\n\n  /** Dotted property reference: alias.prop or just identifier */\n  public propertyRef = this.RULE('propertyRef', () => {\n    this.CONSUME(Identifier, { LABEL: 'head' });\n    this.MANY(() => {\n      this.CONSUME(Dot);\n      this.CONSUME1(Identifier, { LABEL: 'tail' });\n    });\n  });\n\n  /** A literal value */\n  public literal = this.RULE('literal', () => {\n    this.OR([\n      { ALT: () => this.CONSUME(StringLiteral) },\n      { ALT: () => this.CONSUME(NumberLiteral) },\n      { ALT: () => this.CONSUME(NullLit) },\n      { ALT: () => this.CONSUME(TrueLit) },\n      { ALT: () => this.CONSUME(FalseLit) },\n      { ALT: () => this.CONSUME(Identifier) },\n    ]);\n  });\n\n  /** [val, val, ...] */\n  public listLiteral = this.RULE('listLiteral', () => {\n    this.CONSUME(LBracket);\n    this.OPTION(() => {\n      this.SUBRULE(this.literal, { LABEL: 'items' });\n      this.MANY(() => {\n        this.CONSUME(Comma);\n        this.SUBRULE1(this.literal, { LABEL: 'items' });\n      });\n    });\n    this.CONSUME(RBracket);\n  });\n\n  /** RETURN clause (consumed but not transformed) */\n  public returnClause = this.RULE('returnClause', () => {\n    this.CONSUME(Return);\n    this.MANY(() => {\n      this.OR([\n        { ALT: () => this.CONSUME(Identifier) },\n        { ALT: () => this.CONSUME(Comma) },\n        { ALT: () => this.CONSUME(Dot) },\n      ]);\n    });\n  });\n}\n\nconst parserInstance = new CypherCstParser();\n\n// ─── CST Visitor (CST → RuleGroupType) ──────────────────────────────────────\n\n/** Resolves a literal token to a JS value. */\nconst tokenToValue = (token: IToken): unknown => {\n  const img = token.image;\n  switch (token.tokenType) {\n    case StringLiteral:\n      return img.slice(1, -1).replace(/\\\\'/g, \"'\");\n    case NumberLiteral:\n      return Number(img);\n    case NullLit:\n      return null;\n    case TrueLit:\n      return true;\n    case FalseLit:\n      return false;\n    default:\n      return img;\n  }\n};\n\n/** Extracts a literal value from a CST 'literal' node. */\nconst extractLiteral = (literalNode: CstNode): unknown => {\n  const children = literalNode.children;\n  const token =\n    (children.StringLiteral as IToken[])?.[0] ??\n    (children.NumberLiteral as IToken[])?.[0] ??\n    (children.NullLit as IToken[])?.[0] ??\n    (children.TrueLit as IToken[])?.[0] ??\n    (children.FalseLit as IToken[])?.[0] ??\n    (children.Identifier as IToken[])?.[0];\n  return token ? tokenToValue(token) : '';\n};\n\n/** Builds a dotted property reference string from a propertyRef CST node. */\nconst extractPropertyRef = (node: CstNode): string => {\n  const head = (node.children.head as IToken[])[0].image;\n  const tails = (node.children.tail as IToken[] | undefined) ?? [];\n  if (tails.length === 0) return head;\n  return head + '.' + tails.map(t => t.image).join('.');\n};\n\n/** Extracts list items from a listLiteral CST node. */\nconst extractList = (node: CstNode): unknown[] => {\n  const items = (node.children.items as CstNode[] | undefined) ?? [];\n  return items.map(extractLiteral);\n};\n\ntype RuleOrGroup = DefaultRuleType | DefaultRuleGroupType;\n\n/** Visits an orExpression CST node. */\nconst visitOrExpression = (node: CstNode): RuleOrGroup[] => {\n  const lhsNodes = node.children.lhs as CstNode[];\n  const rhsNodes = (node.children.rhs as CstNode[] | undefined) ?? [];\n\n  if (rhsNodes.length === 0) {\n    return visitAndExpression(lhsNodes[0]);\n  }\n\n  const allParts = [lhsNodes[0], ...rhsNodes];\n  const subRules: RuleOrGroup[] = [];\n  for (const part of allParts) {\n    const partRules = visitAndExpression(part);\n    if (partRules.length === 1) {\n      subRules.push(partRules[0]);\n    } else {\n      subRules.push({ combinator: 'and', rules: partRules });\n    }\n  }\n  return [{ combinator: 'or', rules: subRules }];\n};\n\n/** Visits an andExpression CST node. */\nconst visitAndExpression = (node: CstNode): RuleOrGroup[] => {\n  const lhsNodes = node.children.lhs as CstNode[];\n  const rhsNodes = (node.children.rhs as CstNode[] | undefined) ?? [];\n  const all = [lhsNodes[0], ...rhsNodes];\n  const rules: RuleOrGroup[] = [];\n  for (const item of all) {\n    rules.push(...visitNotExpression(item));\n  }\n  return rules;\n};\n\n/** Visits a notExpression CST node. */\nconst visitNotExpression = (node: CstNode): RuleOrGroup[] => {\n  const hasNot = !!(node.children.Not as IToken[] | undefined)?.length;\n  const atomicRules = visitAtomicExpression((node.children.atomicExpression as CstNode[])[0]);\n\n  if (!hasNot) return atomicRules;\n\n  return [{ combinator: 'and', not: true, rules: atomicRules }];\n};\n\n/** Visits an atomicExpression CST node. */\nconst visitAtomicExpression = (node: CstNode): RuleOrGroup[] => {\n  if (node.children.orExpression) {\n    return visitOrExpression((node.children.orExpression as CstNode[])[0]);\n  }\n  if (node.children.condition) {\n    return [visitCondition((node.children.condition as CstNode[])[0])];\n  }\n  return [];\n};\n\n/** Visits a condition CST node and returns a DefaultRuleType (no meta). */\nconst visitCondition = (node: CstNode): DefaultRuleType => {\n  const field = extractPropertyRef((node.children.field as CstNode[])[0]);\n\n  if (node.children.IsNull) {\n    return { field, operator: 'null', value: null } as DefaultRuleType;\n  }\n  if (node.children.IsNotNull) {\n    return { field, operator: 'notNull', value: null } as DefaultRuleType;\n  }\n\n  if (node.children.In) {\n    const list = extractList((node.children.list as CstNode[])[0]);\n    return { field, operator: 'in', value: list } as DefaultRuleType;\n  }\n  if (node.children.NotIn) {\n    const list = extractList((node.children.list as CstNode[])[0]);\n    return { field, operator: 'notIn', value: list } as DefaultRuleType;\n  }\n\n  const valueNode = (node.children.value as CstNode[] | undefined)?.[0];\n  const value = valueNode ? extractLiteral(valueNode) : null;\n\n  if (node.children.Equal) return { field, operator: '=', value } as DefaultRuleType;\n  if (node.children.NotEqual) return { field, operator: '!=', value } as DefaultRuleType;\n  if (node.children.Less) return { field, operator: '<', value } as DefaultRuleType;\n  if (node.children.Greater) return { field, operator: '>', value } as DefaultRuleType;\n  if (node.children.LessEqual) return { field, operator: '<=', value } as DefaultRuleType;\n  if (node.children.GreaterEqual) return { field, operator: '>=', value } as DefaultRuleType;\n  if (node.children.Contains) return { field, operator: 'contains', value } as DefaultRuleType;\n  if (node.children.StartsWith) return { field, operator: 'beginsWith', value } as DefaultRuleType;\n  if (node.children.EndsWith) return { field, operator: 'endsWith', value } as DefaultRuleType;\n\n  return { field, operator: '=', value } as DefaultRuleType;\n};\n\n// ─── Public API ──────────────────────────────────────────────────────────────\n\n/**\n * Options for {@link parseCypher}.\n */\nexport interface ParseCypherOptions {\n  independentCombinators?: boolean;\n}\n\n/**\n * Parses a Cypher query string into a {@link DefaultRuleGroupType}.\n *\n * Accepts a full Cypher query, a `WHERE` clause, or a bare boolean expression.\n * MATCH and RETURN clauses are consumed but discarded — only WHERE conditions\n * are returned.\n *\n * @example\n * ```ts\n * // Full query — extracts WHERE conditions only\n * parseCypher('MATCH (a:Person) WHERE a.age > 30 RETURN a');\n *\n * // WHERE clause\n * parseCypher('WHERE a.age > 30 AND a.name CONTAINS \"Alice\"');\n *\n * // Bare expression\n * parseCypher('a.age > 30 AND a.name CONTAINS \"Alice\"');\n * ```\n */\nexport function parseCypher(cypher: string): DefaultRuleGroupType;\nexport function parseCypher(\n  cypher: string,\n  options: Omit<ParseCypherOptions, 'independentCombinators'> & {\n    independentCombinators?: false;\n  }\n): DefaultRuleGroupType;\nexport function parseCypher(\n  cypher: string,\n  options: Omit<ParseCypherOptions, 'independentCombinators'> & {\n    independentCombinators: true;\n  }\n): DefaultRuleGroupTypeIC;\nexport function parseCypher(\n  cypher: string,\n  _options?: ParseCypherOptions\n): DefaultRuleGroupTypeAny {\n  const trimmed = cypher.trim();\n  if (!trimmed) return { combinator: 'and', rules: [] };\n\n  // Auto-detect input shape (like parseSQL)\n  let input = trimmed;\n  if (!/^\\s*match\\b/i.test(input) && !/^\\s*where\\b/i.test(input)) {\n    // Bare expression — prepend WHERE so the parser can handle it\n    input = `WHERE ${input}`;\n  }\n\n  const lexResult = cypherLexer.tokenize(input);\n  if (lexResult.errors.length > 0) {\n    return { combinator: 'and', rules: [] };\n  }\n\n  parserInstance.input = lexResult.tokens;\n  const cst = parserInstance.cypherQuery();\n\n  if (parserInstance.errors.length > 0) {\n    return { combinator: 'and', rules: [] };\n  }\n\n  const rules: RuleOrGroup[] = [];\n\n  // Only process WHERE clause — skip MATCH/RETURN\n  const whereClauses = (cst.children.whereClause as CstNode[] | undefined) ?? [];\n  if (whereClauses.length > 0) {\n    const whereNode = whereClauses[0];\n    const orExpr = (whereNode.children.orExpression as CstNode[])[0];\n    const whereRules = visitOrExpression(orExpr);\n\n    // If the top-level OR produced a single AND group without NOT, flatten it\n    if (\n      whereRules.length === 1 &&\n      'combinator' in whereRules[0] &&\n      whereRules[0].combinator === 'and' &&\n      !('not' in whereRules[0] && whereRules[0].not)\n    ) {\n      rules.push(...whereRules[0].rules);\n    } else {\n      rules.push(...whereRules);\n    }\n  }\n\n  return { combinator: 'and', rules };\n}\n\n/**\n * Parses a GQL query string. GQL is ~95% compatible with Cypher;\n * the parser handles the same syntax.\n */\nexport function parseGQL(gql: string): DefaultRuleGroupType;\nexport function parseGQL(\n  gql: string,\n  options: Omit<ParseCypherOptions, 'independentCombinators'> & {\n    independentCombinators?: false;\n  }\n): DefaultRuleGroupType;\nexport function parseGQL(\n  gql: string,\n  options: Omit<ParseCypherOptions, 'independentCombinators'> & {\n    independentCombinators: true;\n  }\n): DefaultRuleGroupTypeIC;\nexport function parseGQL(gql: string, options?: ParseCypherOptions): DefaultRuleGroupTypeAny {\n  // Call the implementation signature directly (not the overloads)\n  return (parseCypher as (s: string, o?: ParseCypherOptions) => DefaultRuleGroupTypeAny)(\n    gql,\n    options\n  );\n}\n"],"mappings":";;;;AAUA,MAAM,cAAA,GAAA,WAAA,aAAyB;CAAE,MAAM;CAAc,SAAS;CAAO,OAAOA,WAAAA,MAAM;AAAQ,CAAC;AAG3F,MAAM,iBAAA,GAAA,WAAA,aAA4B;CAChC,MAAM;CACN,SAAS;CACT,YAAY,KAAA;AACd,CAAC;AACD,MAAM,cAAA,GAAA,WAAA,aAAyB;CAAE,MAAM;CAAc,SAAS;AAAiB,CAAC;AAChF,MAAM,YAAA,GAAA,WAAA,aAAuB;CAAE,MAAM;CAAY,SAAS;AAAe,CAAC;AAC1E,MAAM,aAAA,GAAA,WAAA,aAAwB;CAAE,MAAM;CAAa,SAAS;AAAmB,CAAC;AAChF,MAAM,UAAA,GAAA,WAAA,aAAqB;CAAE,MAAM;CAAU,SAAS;AAAa,CAAC;AACpE,MAAM,SAAA,GAAA,WAAA,aAAoB;CAAE,MAAM;CAAS,SAAS;AAAY,CAAC;AACjE,MAAM,SAAA,GAAA,WAAA,aAAoB;CAAE,MAAM;CAAS,SAAS;AAAS,CAAC;AAC9D,MAAM,SAAA,GAAA,WAAA,aAAoB;CAAE,MAAM;CAAS,SAAS;AAAS,CAAC;AAC9D,MAAM,UAAA,GAAA,WAAA,aAAqB;CAAE,MAAM;CAAU,SAAS;AAAU,CAAC;AACjE,MAAM,OAAA,GAAA,WAAA,aAAkB;CAAE,MAAM;CAAO,SAAS;AAAO,CAAC;AACxD,MAAM,MAAA,GAAA,WAAA,aAAiB;CAAE,MAAM;CAAM,SAAS;AAAM,CAAC;AACrD,MAAM,OAAA,GAAA,WAAA,aAAkB;CAAE,MAAM;CAAO,SAAS;AAAO,CAAC;AACxD,MAAM,YAAA,GAAA,WAAA,aAAuB;CAAE,MAAM;CAAY,SAAS;AAAY,CAAC;AACvE,MAAM,MAAA,GAAA,WAAA,aAAiB;CAAE,MAAM;CAAM,SAAS;AAAM,CAAC;AACrD,MAAM,WAAA,GAAA,WAAA,aAAsB;CAAE,MAAM;CAAW,SAAS;AAAS,CAAC;AAClE,MAAM,WAAA,GAAA,WAAA,aAAsB;CAAE,MAAM;CAAW,SAAS;AAAS,CAAC;AAClE,MAAM,YAAA,GAAA,WAAA,aAAuB;CAAE,MAAM;CAAY,SAAS;AAAU,CAAC;AAGrE,MAAM,iBAAA,GAAA,WAAA,aAA4B;CAAE,MAAM;CAAiB,SAAS;AAAoB,CAAC;AACzF,MAAM,iBAAA,GAAA,WAAA,aAA4B;CAAE,MAAM;CAAiB,SAAS;AAAkB,CAAC;AAGvF,MAAM,aAAA,GAAA,WAAA,aAAwB;CAAE,MAAM;CAAa,SAAS;AAAK,CAAC;AAClE,MAAM,gBAAA,GAAA,WAAA,aAA2B;CAAE,MAAM;CAAgB,SAAS;AAAK,CAAC;AACxE,MAAM,YAAA,GAAA,WAAA,aAAuB;CAAE,MAAM;CAAY,SAAS;AAAK,CAAC;AAChE,MAAM,QAAA,GAAA,WAAA,aAAmB;CAAE,MAAM;CAAQ,SAAS;AAAI,CAAC;AACvD,MAAM,WAAA,GAAA,WAAA,aAAsB;CAAE,MAAM;CAAW,SAAS;AAAI,CAAC;AAC7D,MAAM,SAAA,GAAA,WAAA,aAAoB;CAAE,MAAM;CAAS,SAAS;AAAI,CAAC;AAGzD,MAAM,UAAA,GAAA,WAAA,aAAqB;CAAE,MAAM;CAAU,SAAS;AAAK,CAAC;AAC5D,MAAM,UAAA,GAAA,WAAA,aAAqB;CAAE,MAAM;CAAU,SAAS;AAAK,CAAC;AAC5D,MAAM,YAAA,GAAA,WAAA,aAAuB;CAAE,MAAM;CAAY,SAAS;AAAK,CAAC;AAChE,MAAM,YAAA,GAAA,WAAA,aAAuB;CAAE,MAAM;CAAY,SAAS;AAAK,CAAC;AAChE,MAAM,SAAA,GAAA,WAAA,aAAoB;CAAE,MAAM;CAAS,SAAS;AAAI,CAAC;AACzD,MAAM,SAAA,GAAA,WAAA,aAAoB;CAAE,MAAM;CAAS,SAAS;AAAI,CAAC;AACzD,MAAM,OAAA,GAAA,WAAA,aAAkB;CAAE,MAAM;CAAO,SAAS;AAAK,CAAC;AAGtD,MAAM,kBAAA,GAAA,WAAA,aAA6B;CAAE,MAAM;CAAkB,SAAS;AAAK,CAAC;AAC5E,MAAM,iBAAA,GAAA,WAAA,aAA4B;CAAE,MAAM;CAAiB,SAAS;AAAK,CAAC;AAC1E,MAAM,QAAA,GAAA,WAAA,aAAmB;CAAE,MAAM;CAAQ,SAAS;AAAI,CAAC;AAGvD,MAAM,cAAA,GAAA,WAAA,aAAyB;CAAE,MAAM;CAAc,SAAS;AAAe,CAAC;AAG9E,MAAM,YAAY;CAChB;CAEA;CACA;CACA;CACA;CACA;CACA;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA;CACA;CAEA;CACA;CACA;CACA;CACA;CAEA;CACA;CACA;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA;AACF;AAEA,MAAM,cAAc,IAAIA,WAAAA,MAAM,SAAS;AAIvC,IAAM,kBAAN,cAA8BC,WAAAA,UAAU;CACtC,cAAc;EACZ,MAAM,WAAW,EAAE,iBAAiB,MAAM,CAAC;EAC3C,KAAK,oBAAoB;CAC3B;;CAGA,cAAqB,KAAK,KAAK,qBAAqB;EAClD,KAAK,WAAW;GACd,KAAK,GAAG,CACN,EAAE,WAAW,KAAK,QAAQ,KAAK,mBAAmB,EAAE,GACpD,EAAE,WAAW,KAAK,QAAQ,KAAK,WAAW,EAAE,CAC9C,CAAC;EACH,CAAC;EACD,KAAK,aAAa,KAAK,QAAQ,KAAK,WAAW,CAAC;EAChD,KAAK,cAAc,KAAK,QAAQ,KAAK,YAAY,CAAC;CACpD,CAAC;;CAGD,cAAqB,KAAK,KAAK,qBAAqB;EAClD,KAAK,QAAQ,KAAK;EAClB,KAAK,QAAQ,KAAK,OAAO;CAC3B,CAAC;;CAGD,sBAA6B,KAAK,KAAK,6BAA6B;EAClE,KAAK,QAAQ,aAAa;EAC1B,KAAK,QAAQ,KAAK,OAAO;CAC3B,CAAC;;CAGD,UAAiB,KAAK,KAAK,iBAAiB;EAC1C,KAAK,QAAQ,KAAK,aAAa,EAAE,OAAO,MAAM,CAAC;EAC/C,KAAK,aAAa;GAChB,KAAK,QAAQ,KAAK,UAAU;GAC5B,KAAK,SAAS,KAAK,aAAa,EAAE,OAAO,MAAM,CAAC;EAClD,CAAC;CACH,CAAC;;CAGD,cAAqB,KAAK,KAAK,qBAAqB;EAClD,KAAK,QAAQ,MAAM;EACnB,KAAK,QAAQ,YAAY,EAAE,OAAO,QAAQ,CAAC;EAC3C,KAAK,aAAa;GAChB,KAAK,QAAQ,KAAK;GAClB,KAAK,SAAS,YAAY,EAAE,OAAO,QAAQ,CAAC;EAC9C,CAAC;EACD,KAAK,QAAQ,MAAM;CACrB,CAAC;;CAGD,aAAoB,KAAK,KAAK,oBAAoB;EAChD,KAAK,GAAG,CACN,EACE,WAAW;GACT,KAAK,QAAQ,eAAe,EAAE,OAAO,YAAY,CAAC;GAClD,KAAK,QAAQ,QAAQ;GACrB,KAAK,aAAa;IAChB,KAAK,QAAQ,KAAK;IAClB,KAAK,QAAQ,YAAY,EAAE,OAAO,UAAU,CAAC;GAC/C,CAAC;GACD,KAAK,QAAQ,QAAQ;GACrB,KAAK,QAAQ,MAAM,EAAE,OAAO,YAAY,CAAC;EAC3C,EACF,GACA,EACE,WAAW;GACT,KAAK,SAAS,MAAM,EAAE,OAAO,WAAW,CAAC;GACzC,KAAK,SAAS,QAAQ;GACtB,KAAK,cAAc;IACjB,KAAK,SAAS,KAAK;IACnB,KAAK,SAAS,YAAY,EAAE,OAAO,UAAU,CAAC;GAChD,CAAC;GACD,KAAK,SAAS,QAAQ;GACtB,KAAK,QAAQ,gBAAgB,EAAE,OAAO,aAAa,CAAC;EACtD,EACF,CACF,CAAC;CACH,CAAC;;CAGD,cAAqB,KAAK,KAAK,qBAAqB;EAClD,KAAK,QAAQ,KAAK;EAClB,KAAK,QAAQ,KAAK,YAAY;CAChC,CAAC;;CAGD,eAAsB,KAAK,KAAK,sBAAsB;EACpD,KAAK,QAAQ,KAAK,eAAe,EAAE,OAAO,MAAM,CAAC;EACjD,KAAK,WAAW;GACd,KAAK,QAAQ,EAAE;GACf,KAAK,SAAS,KAAK,eAAe,EAAE,OAAO,MAAM,CAAC;EACpD,CAAC;CACH,CAAC;;CAGD,gBAAuB,KAAK,KAAK,uBAAuB;EACtD,KAAK,QAAQ,KAAK,eAAe,EAAE,OAAO,MAAM,CAAC;EACjD,KAAK,WAAW;GACd,KAAK,QAAQ,GAAG;GAChB,KAAK,SAAS,KAAK,eAAe,EAAE,OAAO,MAAM,CAAC;EACpD,CAAC;CACH,CAAC;;CAGD,gBAAuB,KAAK,KAAK,uBAAuB;EACtD,KAAK,aAAa,KAAK,QAAQ,GAAG,CAAC;EACnC,KAAK,QAAQ,KAAK,gBAAgB;CACpC,CAAC;;CAGD,mBAA0B,KAAK,KAAK,0BAA0B;EAC5D,KAAK,GAAG,CACN,EACE,WAAW;GACT,KAAK,QAAQ,MAAM;GACnB,KAAK,QAAQ,KAAK,YAAY;GAC9B,KAAK,QAAQ,MAAM;EACrB,EACF,GACA,EAAE,WAAW,KAAK,QAAQ,KAAK,SAAS,EAAE,CAC5C,CAAC;CACH,CAAC;;CAGD,YAAmB,KAAK,KAAK,mBAAmB;EAC9C,KAAK,QAAQ,KAAK,aAAa,EAAE,OAAO,QAAQ,CAAC;EACjD,KAAK,GAAG;GACN,EACE,WAAW;IACT,KAAK,QAAQ,KAAK;IAClB,KAAK,QAAQ,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAC/C,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,QAAQ;IACrB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,IAAI;IACjB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,OAAO;IACpB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,SAAS;IACtB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,YAAY;IACzB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,QAAQ;IACrB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,UAAU;IACvB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,QAAQ;IACrB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EAAE,WAAW,KAAK,QAAQ,SAAS,EAAE;GACrC,EAAE,WAAW,KAAK,QAAQ,MAAM,EAAE;GAClC,EACE,WAAW;IACT,KAAK,QAAQ,EAAE;IACf,KAAK,QAAQ,KAAK,aAAa,EAAE,OAAO,OAAO,CAAC;GAClD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,KAAK;IAClB,KAAK,SAAS,KAAK,aAAa,EAAE,OAAO,OAAO,CAAC;GACnD,EACF;EACF,CAAC;CACH,CAAC;;CAGD,cAAqB,KAAK,KAAK,qBAAqB;EAClD,KAAK,QAAQ,YAAY,EAAE,OAAO,OAAO,CAAC;EAC1C,KAAK,WAAW;GACd,KAAK,QAAQ,GAAG;GAChB,KAAK,SAAS,YAAY,EAAE,OAAO,OAAO,CAAC;EAC7C,CAAC;CACH,CAAC;;CAGD,UAAiB,KAAK,KAAK,iBAAiB;EAC1C,KAAK,GAAG;GACN,EAAE,WAAW,KAAK,QAAQ,aAAa,EAAE;GACzC,EAAE,WAAW,KAAK,QAAQ,aAAa,EAAE;GACzC,EAAE,WAAW,KAAK,QAAQ,OAAO,EAAE;GACnC,EAAE,WAAW,KAAK,QAAQ,OAAO,EAAE;GACnC,EAAE,WAAW,KAAK,QAAQ,QAAQ,EAAE;GACpC,EAAE,WAAW,KAAK,QAAQ,UAAU,EAAE;EACxC,CAAC;CACH,CAAC;;CAGD,cAAqB,KAAK,KAAK,qBAAqB;EAClD,KAAK,QAAQ,QAAQ;EACrB,KAAK,aAAa;GAChB,KAAK,QAAQ,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAC7C,KAAK,WAAW;IACd,KAAK,QAAQ,KAAK;IAClB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,CAAC;EACH,CAAC;EACD,KAAK,QAAQ,QAAQ;CACvB,CAAC;;CAGD,eAAsB,KAAK,KAAK,sBAAsB;EACpD,KAAK,QAAQ,MAAM;EACnB,KAAK,WAAW;GACd,KAAK,GAAG;IACN,EAAE,WAAW,KAAK,QAAQ,UAAU,EAAE;IACtC,EAAE,WAAW,KAAK,QAAQ,KAAK,EAAE;IACjC,EAAE,WAAW,KAAK,QAAQ,GAAG,EAAE;GACjC,CAAC;EACH,CAAC;CACH,CAAC;AACH;AAEA,MAAM,iBAAiB,IAAI,gBAAgB;;AAK3C,MAAM,gBAAgB,UAA2B;CAC/C,MAAM,MAAM,MAAM;CAClB,QAAQ,MAAM,WAAd;EACE,KAAK,eACH,OAAO,IAAI,MAAM,GAAG,EAAE,EAAE,QAAQ,QAAQ,GAAG;EAC7C,KAAK,eACH,OAAO,OAAO,GAAG;EACnB,KAAK,SACH,OAAO;EACT,KAAK,SACH,OAAO;EACT,KAAK,UACH,OAAO;EACT,SACE,OAAO;CACX;AACF;;AAGA,MAAM,kBAAkB,gBAAkC;CACxD,MAAM,WAAW,YAAY;CAC7B,MAAM,QACH,SAAS,gBAA6B,MACtC,SAAS,gBAA6B,MACtC,SAAS,UAAuB,MAChC,SAAS,UAAuB,MAChC,SAAS,WAAwB,MACjC,SAAS,aAA0B;CACtC,OAAO,QAAQ,aAAa,KAAK,IAAI;AACvC;;AAGA,MAAM,sBAAsB,SAA0B;CACpD,MAAM,OAAQ,KAAK,SAAS,KAAkB,GAAG;CACjD,MAAM,QAAS,KAAK,SAAS,QAAiC,CAAC;CAC/D,IAAI,MAAM,WAAW,GAAG,OAAO;CAC/B,OAAO,OAAO,MAAM,MAAM,KAAI,MAAK,EAAE,KAAK,EAAE,KAAK,GAAG;AACtD;;AAGA,MAAM,eAAe,SAA6B;CAEhD,QADe,KAAK,SAAS,SAAmC,CAAC,GACpD,IAAI,cAAc;AACjC;;AAKA,MAAM,qBAAqB,SAAiC;CAC1D,MAAM,WAAW,KAAK,SAAS;CAC/B,MAAM,WAAY,KAAK,SAAS,OAAiC,CAAC;CAElE,IAAI,SAAS,WAAW,GACtB,OAAO,mBAAmB,SAAS,EAAE;CAGvC,MAAM,WAAW,CAAC,SAAS,IAAI,GAAG,QAAQ;CAC1C,MAAM,WAA0B,CAAC;CACjC,KAAK,MAAM,QAAQ,UAAU;EAC3B,MAAM,YAAY,mBAAmB,IAAI;EACzC,IAAI,UAAU,WAAW,GACvB,SAAS,KAAK,UAAU,EAAE;OAE1B,SAAS,KAAK;GAAE,YAAY;GAAO,OAAO;EAAU,CAAC;CAEzD;CACA,OAAO,CAAC;EAAE,YAAY;EAAM,OAAO;CAAS,CAAC;AAC/C;;AAGA,MAAM,sBAAsB,SAAiC;CAC3D,MAAM,WAAW,KAAK,SAAS;CAC/B,MAAM,WAAY,KAAK,SAAS,OAAiC,CAAC;CAClE,MAAM,MAAM,CAAC,SAAS,IAAI,GAAG,QAAQ;CACrC,MAAM,QAAuB,CAAC;CAC9B,KAAK,MAAM,QAAQ,KACjB,MAAM,KAAK,GAAG,mBAAmB,IAAI,CAAC;CAExC,OAAO;AACT;;AAGA,MAAM,sBAAsB,SAAiC;CAC3D,MAAM,SAAS,CAAC,CAAE,KAAK,SAAS,KAA8B;CAC9D,MAAM,cAAc,sBAAuB,KAAK,SAAS,iBAA+B,EAAE;CAE1F,IAAI,CAAC,QAAQ,OAAO;CAEpB,OAAO,CAAC;EAAE,YAAY;EAAO,KAAK;EAAM,OAAO;CAAY,CAAC;AAC9D;;AAGA,MAAM,yBAAyB,SAAiC;CAC9D,IAAI,KAAK,SAAS,cAChB,OAAO,kBAAmB,KAAK,SAAS,aAA2B,EAAE;CAEvE,IAAI,KAAK,SAAS,WAChB,OAAO,CAAC,eAAgB,KAAK,SAAS,UAAwB,EAAE,CAAC;CAEnE,OAAO,CAAC;AACV;;AAGA,MAAM,kBAAkB,SAAmC;CACzD,MAAM,QAAQ,mBAAoB,KAAK,SAAS,MAAoB,EAAE;CAEtE,IAAI,KAAK,SAAS,QAChB,OAAO;EAAE;EAAO,UAAU;EAAQ,OAAO;CAAK;CAEhD,IAAI,KAAK,SAAS,WAChB,OAAO;EAAE;EAAO,UAAU;EAAW,OAAO;CAAK;CAGnD,IAAI,KAAK,SAAS,IAEhB,OAAO;EAAE;EAAO,UAAU;EAAM,OADnB,YAAa,KAAK,SAAS,KAAmB,EACjB;CAAE;CAE9C,IAAI,KAAK,SAAS,OAEhB,OAAO;EAAE;EAAO,UAAU;EAAS,OADtB,YAAa,KAAK,SAAS,KAAmB,EACd;CAAE;CAGjD,MAAM,YAAa,KAAK,SAAS,QAAkC;CACnE,MAAM,QAAQ,YAAY,eAAe,SAAS,IAAI;CAEtD,IAAI,KAAK,SAAS,OAAO,OAAO;EAAE;EAAO,UAAU;EAAK;CAAM;CAC9D,IAAI,KAAK,SAAS,UAAU,OAAO;EAAE;EAAO,UAAU;EAAM;CAAM;CAClE,IAAI,KAAK,SAAS,MAAM,OAAO;EAAE;EAAO,UAAU;EAAK;CAAM;CAC7D,IAAI,KAAK,SAAS,SAAS,OAAO;EAAE;EAAO,UAAU;EAAK;CAAM;CAChE,IAAI,KAAK,SAAS,WAAW,OAAO;EAAE;EAAO,UAAU;EAAM;CAAM;CACnE,IAAI,KAAK,SAAS,cAAc,OAAO;EAAE;EAAO,UAAU;EAAM;CAAM;CACtE,IAAI,KAAK,SAAS,UAAU,OAAO;EAAE;EAAO,UAAU;EAAY;CAAM;CACxE,IAAI,KAAK,SAAS,YAAY,OAAO;EAAE;EAAO,UAAU;EAAc;CAAM;CAC5E,IAAI,KAAK,SAAS,UAAU,OAAO;EAAE;EAAO,UAAU;EAAY;CAAM;CAExE,OAAO;EAAE;EAAO,UAAU;EAAK;CAAM;AACvC;AA2CA,SAAgB,YACd,QACA,UACyB;CACzB,MAAM,UAAU,OAAO,KAAK;CAC5B,IAAI,CAAC,SAAS,OAAO;EAAE,YAAY;EAAO,OAAO,CAAC;CAAE;CAGpD,IAAI,QAAQ;CACZ,IAAI,CAAC,eAAe,KAAK,KAAK,KAAK,CAAC,eAAe,KAAK,KAAK,GAE3D,QAAQ,SAAS;CAGnB,MAAM,YAAY,YAAY,SAAS,KAAK;CAC5C,IAAI,UAAU,OAAO,SAAS,GAC5B,OAAO;EAAE,YAAY;EAAO,OAAO,CAAC;CAAE;CAGxC,eAAe,QAAQ,UAAU;CACjC,MAAM,MAAM,eAAe,YAAY;CAEvC,IAAI,eAAe,OAAO,SAAS,GACjC,OAAO;EAAE,YAAY;EAAO,OAAO,CAAC;CAAE;CAGxC,MAAM,QAAuB,CAAC;CAG9B,MAAM,eAAgB,IAAI,SAAS,eAAyC,CAAC;CAC7E,IAAI,aAAa,SAAS,GAAG;EAE3B,MAAM,SADY,aAAa,GACL,SAAS,aAA2B;EAC9D,MAAM,aAAa,kBAAkB,MAAM;EAG3C,IACE,WAAW,WAAW,KACtB,gBAAgB,WAAW,MAC3B,WAAW,GAAG,eAAe,SAC7B,EAAE,SAAS,WAAW,MAAM,WAAW,GAAG,MAE1C,MAAM,KAAK,GAAG,WAAW,GAAG,KAAK;OAEjC,MAAM,KAAK,GAAG,UAAU;CAE5B;CAEA,OAAO;EAAE,YAAY;EAAO;CAAM;AACpC;AAmBA,SAAgB,SAAS,KAAa,SAAuD;CAE3F,OAAQ,YACN,KACA,OACF;AACF"}
+{"version":3,"file":"parseCypher.js","names":["Lexer","CstParser"],"sources":["../src/utils/parseCypher/parseCypher.ts"],"sourcesContent":["import { createToken, Lexer, CstParser, type CstNode, type IToken } from 'chevrotain';\nimport type {\n  DefaultRuleGroupType,\n  DefaultRuleGroupTypeAny,\n  DefaultRuleGroupTypeIC,\n  DefaultRuleType,\n} from '../../types';\n\n// ─── Lexer Tokens ────────────────────────────────────────────────────────────\n\nconst WhiteSpace = createToken({ name: 'WhiteSpace', pattern: /\\s+/, group: Lexer.SKIPPED });\n\n// Keywords (longer/multi-word first)\nconst OptionalMatch = createToken({\n  name: 'OptionalMatch',\n  pattern: /OPTIONAL\\s+MATCH/i,\n  longer_alt: undefined,\n});\nconst StartsWith = createToken({ name: 'StartsWith', pattern: /STARTS\\s+WITH/i });\nconst EndsWith = createToken({ name: 'EndsWith', pattern: /ENDS\\s+WITH/i });\nconst IsNotNull = createToken({ name: 'IsNotNull', pattern: /IS\\s+NOT\\s+NULL/i });\nconst IsNull = createToken({ name: 'IsNull', pattern: /IS\\s+NULL/i });\nconst NotIn = createToken({ name: 'NotIn', pattern: /NOT\\s+IN/i });\nconst Match = createToken({ name: 'Match', pattern: /MATCH/i });\nconst Where = createToken({ name: 'Where', pattern: /WHERE/i });\nconst Return = createToken({ name: 'Return', pattern: /RETURN/i });\nconst And = createToken({ name: 'And', pattern: /AND/i });\nconst Or = createToken({ name: 'Or', pattern: /OR/i });\nconst Not = createToken({ name: 'Not', pattern: /NOT/i });\nconst Contains = createToken({ name: 'Contains', pattern: /CONTAINS/i });\nconst In = createToken({ name: 'In', pattern: /IN/i });\nconst NullLit = createToken({ name: 'NullLit', pattern: /null\\b/ });\nconst TrueLit = createToken({ name: 'TrueLit', pattern: /true\\b/ });\nconst FalseLit = createToken({ name: 'FalseLit', pattern: /false\\b/ });\n\n// Literals\nconst StringLiteral = createToken({ name: 'StringLiteral', pattern: /'(?:[^'\\\\]|\\\\.)*'/ });\nconst NumberLiteral = createToken({ name: 'NumberLiteral', pattern: /-?\\d+(?:\\.\\d+)?/ });\n\n// Operators\nconst LessEqual = createToken({ name: 'LessEqual', pattern: /<=/ });\nconst GreaterEqual = createToken({ name: 'GreaterEqual', pattern: />=/ });\nconst NotEqual = createToken({ name: 'NotEqual', pattern: /<>/ });\nconst Less = createToken({ name: 'Less', pattern: /</ });\nconst Greater = createToken({ name: 'Greater', pattern: />/ });\nconst Equal = createToken({ name: 'Equal', pattern: /=/ });\n\n// Punctuation\nconst LParen = createToken({ name: 'LParen', pattern: /\\(/ });\nconst RParen = createToken({ name: 'RParen', pattern: /\\)/ });\nconst LBracket = createToken({ name: 'LBracket', pattern: /\\[/ });\nconst RBracket = createToken({ name: 'RBracket', pattern: /\\]/ });\nconst Comma = createToken({ name: 'Comma', pattern: /,/ });\nconst Colon = createToken({ name: 'Colon', pattern: /:/ });\nconst Dot = createToken({ name: 'Dot', pattern: /\\./ });\n\n// Arrow parts for relationship patterns\nconst DashArrowRight = createToken({ name: 'DashArrowRight', pattern: /->/ });\nconst ArrowLeftDash = createToken({ name: 'ArrowLeftDash', pattern: /<-/ });\nconst Dash = createToken({ name: 'Dash', pattern: /-/ });\n\n// Identifier (must come after all keywords)\nconst Identifier = createToken({ name: 'Identifier', pattern: /[a-zA-Z_]\\w*/ });\n\n// Token order matters: longer patterns and keywords before shorter ones\nconst allTokens = [\n  WhiteSpace,\n  // Multi-word keywords (must come before single-word)\n  OptionalMatch,\n  StartsWith,\n  EndsWith,\n  IsNotNull,\n  IsNull,\n  NotIn,\n  // Single-word keywords\n  Match,\n  Where,\n  Return,\n  And,\n  Or,\n  Not,\n  Contains,\n  In,\n  NullLit,\n  TrueLit,\n  FalseLit,\n  // Literals\n  StringLiteral,\n  NumberLiteral,\n  // Multi-char operators\n  LessEqual,\n  GreaterEqual,\n  NotEqual,\n  DashArrowRight,\n  ArrowLeftDash,\n  // Single-char operators\n  Less,\n  Greater,\n  Equal,\n  // Punctuation\n  LParen,\n  RParen,\n  LBracket,\n  RBracket,\n  Comma,\n  Colon,\n  Dot,\n  Dash,\n  // Identifier last\n  Identifier,\n];\n\nconst cypherLexer = new Lexer(allTokens);\n\n// ─── CST Parser ──────────────────────────────────────────────────────────────\n\nclass CypherCstParser extends CstParser {\n  constructor() {\n    super(allTokens, { recoveryEnabled: false });\n    this.performSelfAnalysis();\n  }\n\n  /** Top-level: sequence of MATCH/OPTIONAL MATCH clauses, optional WHERE, optional RETURN */\n  public cypherQuery = this.RULE('cypherQuery', () => {\n    this.MANY(() => {\n      this.OR([\n        { ALT: () => this.SUBRULE(this.optionalMatchClause) },\n        { ALT: () => this.SUBRULE(this.matchClause) },\n      ]);\n    });\n    this.OPTION(() => this.SUBRULE(this.whereClause));\n    this.OPTION1(() => this.SUBRULE(this.returnClause));\n  });\n\n  /** MATCH pattern */\n  public matchClause = this.RULE('matchClause', () => {\n    this.CONSUME(Match);\n    this.SUBRULE(this.pattern);\n  });\n\n  /** OPTIONAL MATCH pattern */\n  public optionalMatchClause = this.RULE('optionalMatchClause', () => {\n    this.CONSUME(OptionalMatch);\n    this.SUBRULE(this.pattern);\n  });\n\n  /** A graph pattern: node or node-rel-node */\n  public pattern = this.RULE('pattern', () => {\n    this.SUBRULE(this.nodePattern, { LABEL: 'lhs' });\n    this.OPTION(() => {\n      this.SUBRULE(this.relPattern);\n      this.SUBRULE1(this.nodePattern, { LABEL: 'rhs' });\n    });\n  });\n\n  /** (alias:Label) or (alias) */\n  public nodePattern = this.RULE('nodePattern', () => {\n    this.CONSUME(LParen);\n    this.CONSUME(Identifier, { LABEL: 'alias' });\n    this.OPTION(() => {\n      this.CONSUME(Colon);\n      this.CONSUME1(Identifier, { LABEL: 'label' });\n    });\n    this.CONSUME(RParen);\n  });\n\n  /** -[:TYPE]-> or <-[:TYPE]- or -[:TYPE]- */\n  public relPattern = this.RULE('relPattern', () => {\n    this.OR([\n      {\n        ALT: () => {\n          this.CONSUME(ArrowLeftDash, { LABEL: 'leftArrow' });\n          this.CONSUME(LBracket);\n          this.OPTION(() => {\n            this.CONSUME(Colon);\n            this.CONSUME(Identifier, { LABEL: 'relType' });\n          });\n          this.CONSUME(RBracket);\n          this.CONSUME(Dash, { LABEL: 'rightDash' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME1(Dash, { LABEL: 'leftDash' });\n          this.CONSUME1(LBracket);\n          this.OPTION1(() => {\n            this.CONSUME1(Colon);\n            this.CONSUME1(Identifier, { LABEL: 'relType' });\n          });\n          this.CONSUME1(RBracket);\n          this.CONSUME(DashArrowRight, { LABEL: 'rightArrow' });\n        },\n      },\n    ]);\n  });\n\n  /** WHERE expression */\n  public whereClause = this.RULE('whereClause', () => {\n    this.CONSUME(Where);\n    this.SUBRULE(this.orExpression);\n  });\n\n  /** expression OR expression */\n  public orExpression = this.RULE('orExpression', () => {\n    this.SUBRULE(this.andExpression, { LABEL: 'lhs' });\n    this.MANY(() => {\n      this.CONSUME(Or);\n      this.SUBRULE1(this.andExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  /** expression AND expression */\n  public andExpression = this.RULE('andExpression', () => {\n    this.SUBRULE(this.notExpression, { LABEL: 'lhs' });\n    this.MANY(() => {\n      this.CONSUME(And);\n      this.SUBRULE1(this.notExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  /** NOT expression */\n  public notExpression = this.RULE('notExpression', () => {\n    this.OPTION(() => this.CONSUME(Not));\n    this.SUBRULE(this.atomicExpression);\n  });\n\n  /** Parenthesized group or single condition */\n  public atomicExpression = this.RULE('atomicExpression', () => {\n    this.OR([\n      {\n        ALT: () => {\n          this.CONSUME(LParen);\n          this.SUBRULE(this.orExpression);\n          this.CONSUME(RParen);\n        },\n      },\n      { ALT: () => this.SUBRULE(this.condition) },\n    ]);\n  });\n\n  /** Single condition: field op value */\n  public condition = this.RULE('condition', () => {\n    this.SUBRULE(this.propertyRef, { LABEL: 'field' });\n    this.OR([\n      {\n        ALT: () => {\n          this.CONSUME(Equal);\n          this.SUBRULE(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(NotEqual);\n          this.SUBRULE1(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(Less);\n          this.SUBRULE2(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(Greater);\n          this.SUBRULE3(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(LessEqual);\n          this.SUBRULE4(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(GreaterEqual);\n          this.SUBRULE5(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(Contains);\n          this.SUBRULE6(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(StartsWith);\n          this.SUBRULE7(this.literal, { LABEL: 'value' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(EndsWith);\n          this.SUBRULE8(this.literal, { LABEL: 'value' });\n        },\n      },\n      { ALT: () => this.CONSUME(IsNotNull) },\n      { ALT: () => this.CONSUME(IsNull) },\n      {\n        ALT: () => {\n          this.CONSUME(In);\n          this.SUBRULE(this.listLiteral, { LABEL: 'list' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(NotIn);\n          this.SUBRULE1(this.listLiteral, { LABEL: 'list' });\n        },\n      },\n    ]);\n  });\n\n  /** Dotted property reference: alias.prop or just identifier */\n  public propertyRef = this.RULE('propertyRef', () => {\n    this.CONSUME(Identifier, { LABEL: 'head' });\n    this.MANY(() => {\n      this.CONSUME(Dot);\n      this.CONSUME1(Identifier, { LABEL: 'tail' });\n    });\n  });\n\n  /** A literal value */\n  public literal = this.RULE('literal', () => {\n    this.OR([\n      { ALT: () => this.CONSUME(StringLiteral) },\n      { ALT: () => this.CONSUME(NumberLiteral) },\n      { ALT: () => this.CONSUME(NullLit) },\n      { ALT: () => this.CONSUME(TrueLit) },\n      { ALT: () => this.CONSUME(FalseLit) },\n      { ALT: () => this.CONSUME(Identifier) },\n    ]);\n  });\n\n  /** [val, val, ...] */\n  public listLiteral = this.RULE('listLiteral', () => {\n    this.CONSUME(LBracket);\n    this.OPTION(() => {\n      this.SUBRULE(this.literal, { LABEL: 'items' });\n      this.MANY(() => {\n        this.CONSUME(Comma);\n        this.SUBRULE1(this.literal, { LABEL: 'items' });\n      });\n    });\n    this.CONSUME(RBracket);\n  });\n\n  /** RETURN clause (consumed but not transformed) */\n  public returnClause = this.RULE('returnClause', () => {\n    this.CONSUME(Return);\n    this.MANY(() => {\n      this.OR([\n        { ALT: () => this.CONSUME(Identifier) },\n        { ALT: () => this.CONSUME(Comma) },\n        { ALT: () => this.CONSUME(Dot) },\n      ]);\n    });\n  });\n}\n\nconst parserInstance = new CypherCstParser();\n\n// ─── CST Visitor (CST → RuleGroupType) ──────────────────────────────────────\n\n/** Resolves a literal token to a JS value. */\nconst tokenToValue = (token: IToken): unknown => {\n  const img = token.image;\n  switch (token.tokenType) {\n    case StringLiteral:\n      return img.slice(1, -1).replace(/\\\\'/g, \"'\");\n    case NumberLiteral:\n      return Number(img);\n    case NullLit:\n      return null;\n    case TrueLit:\n      return true;\n    case FalseLit:\n      return false;\n    default:\n      return img;\n  }\n};\n\n/** Extracts a literal value from a CST 'literal' node. */\nconst extractLiteral = (literalNode: CstNode): unknown => {\n  const children = literalNode.children;\n  const token =\n    (children.StringLiteral as IToken[])?.[0] ??\n    (children.NumberLiteral as IToken[])?.[0] ??\n    (children.NullLit as IToken[])?.[0] ??\n    (children.TrueLit as IToken[])?.[0] ??\n    (children.FalseLit as IToken[])?.[0] ??\n    (children.Identifier as IToken[])?.[0];\n  return token ? tokenToValue(token) : '';\n};\n\n/** Builds a dotted property reference string from a propertyRef CST node. */\nconst extractPropertyRef = (node: CstNode): string => {\n  const head = (node.children.head as IToken[])[0].image;\n  const tails = (node.children.tail as IToken[] | undefined) ?? [];\n  if (tails.length === 0) return head;\n  return head + '.' + tails.map(t => t.image).join('.');\n};\n\n/** Extracts list items from a listLiteral CST node. */\nconst extractList = (node: CstNode): unknown[] => {\n  const items = (node.children.items as CstNode[] | undefined) ?? [];\n  return items.map(extractLiteral);\n};\n\ntype RuleOrGroup = DefaultRuleType | DefaultRuleGroupType;\n\n/** Visits an orExpression CST node. */\nconst visitOrExpression = (node: CstNode): RuleOrGroup[] => {\n  const lhsNodes = node.children.lhs as CstNode[];\n  const rhsNodes = (node.children.rhs as CstNode[] | undefined) ?? [];\n\n  if (rhsNodes.length === 0) {\n    return visitAndExpression(lhsNodes[0]);\n  }\n\n  const allParts = [lhsNodes[0], ...rhsNodes];\n  const subRules: RuleOrGroup[] = [];\n  for (const part of allParts) {\n    const partRules = visitAndExpression(part);\n    if (partRules.length === 1) {\n      subRules.push(partRules[0]);\n    } else {\n      subRules.push({ combinator: 'and', rules: partRules });\n    }\n  }\n  return [{ combinator: 'or', rules: subRules }];\n};\n\n/** Visits an andExpression CST node. */\nconst visitAndExpression = (node: CstNode): RuleOrGroup[] => {\n  const lhsNodes = node.children.lhs as CstNode[];\n  const rhsNodes = (node.children.rhs as CstNode[] | undefined) ?? [];\n  const all = [lhsNodes[0], ...rhsNodes];\n  const rules: RuleOrGroup[] = [];\n  for (const item of all) {\n    rules.push(...visitNotExpression(item));\n  }\n  return rules;\n};\n\n/** Visits a notExpression CST node. */\nconst visitNotExpression = (node: CstNode): RuleOrGroup[] => {\n  const hasNot = !!(node.children.Not as IToken[] | undefined)?.length;\n  const atomicRules = visitAtomicExpression((node.children.atomicExpression as CstNode[])[0]);\n\n  if (!hasNot) return atomicRules;\n\n  return [{ combinator: 'and', not: true, rules: atomicRules }];\n};\n\n/** Visits an atomicExpression CST node. */\nconst visitAtomicExpression = (node: CstNode): RuleOrGroup[] => {\n  if (node.children.orExpression) {\n    return visitOrExpression((node.children.orExpression as CstNode[])[0]);\n  }\n  if (node.children.condition) {\n    return [visitCondition((node.children.condition as CstNode[])[0])];\n  }\n  return [];\n};\n\n/** Visits a condition CST node and returns a DefaultRuleType (no meta). */\nconst visitCondition = (node: CstNode): DefaultRuleType => {\n  const field = extractPropertyRef((node.children.field as CstNode[])[0]);\n\n  if (node.children.IsNull) {\n    return { field, operator: 'null', value: null } as DefaultRuleType;\n  }\n  if (node.children.IsNotNull) {\n    return { field, operator: 'notNull', value: null } as DefaultRuleType;\n  }\n\n  if (node.children.In) {\n    const list = extractList((node.children.list as CstNode[])[0]);\n    return { field, operator: 'in', value: list } as DefaultRuleType;\n  }\n  if (node.children.NotIn) {\n    const list = extractList((node.children.list as CstNode[])[0]);\n    return { field, operator: 'notIn', value: list } as DefaultRuleType;\n  }\n\n  const valueNode = (node.children.value as CstNode[] | undefined)?.[0];\n  const value = valueNode ? extractLiteral(valueNode) : null;\n\n  if (node.children.Equal) return { field, operator: '=', value } as DefaultRuleType;\n  if (node.children.NotEqual) return { field, operator: '!=', value } as DefaultRuleType;\n  if (node.children.Less) return { field, operator: '<', value } as DefaultRuleType;\n  if (node.children.Greater) return { field, operator: '>', value } as DefaultRuleType;\n  if (node.children.LessEqual) return { field, operator: '<=', value } as DefaultRuleType;\n  if (node.children.GreaterEqual) return { field, operator: '>=', value } as DefaultRuleType;\n  if (node.children.Contains) return { field, operator: 'contains', value } as DefaultRuleType;\n  if (node.children.StartsWith) return { field, operator: 'beginsWith', value } as DefaultRuleType;\n  if (node.children.EndsWith) return { field, operator: 'endsWith', value } as DefaultRuleType;\n\n  return { field, operator: '=', value } as DefaultRuleType;\n};\n\n// ─── Public API ──────────────────────────────────────────────────────────────\n\n/**\n * Options for {@link parseCypher}.\n */\nexport interface ParseCypherOptions {\n  independentCombinators?: boolean;\n}\n\n/**\n * Parses a Cypher query string into a {@link DefaultRuleGroupType}.\n *\n * Accepts a full Cypher query, a `WHERE` clause, or a bare boolean expression.\n * MATCH and RETURN clauses are consumed but discarded — only WHERE conditions\n * are returned.\n *\n * @example\n * ```ts\n * // Full query — extracts WHERE conditions only\n * parseCypher('MATCH (a:Person) WHERE a.age > 30 RETURN a');\n *\n * // WHERE clause\n * parseCypher('WHERE a.age > 30 AND a.name CONTAINS \"Alice\"');\n *\n * // Bare expression\n * parseCypher('a.age > 30 AND a.name CONTAINS \"Alice\"');\n * ```\n */\nexport function parseCypher(cypher: string): DefaultRuleGroupType;\nexport function parseCypher(\n  cypher: string,\n  options: Omit<ParseCypherOptions, 'independentCombinators'> & {\n    independentCombinators?: false;\n  }\n): DefaultRuleGroupType;\nexport function parseCypher(\n  cypher: string,\n  options: Omit<ParseCypherOptions, 'independentCombinators'> & {\n    independentCombinators: true;\n  }\n): DefaultRuleGroupTypeIC;\nexport function parseCypher(\n  cypher: string,\n  _options?: ParseCypherOptions\n): DefaultRuleGroupTypeAny {\n  const trimmed = cypher.trim();\n  if (!trimmed) return { combinator: 'and', rules: [] };\n\n  // Auto-detect input shape (like parseSQL)\n  let input = trimmed;\n  if (!/^\\s*match\\b/i.test(input) && !/^\\s*where\\b/i.test(input)) {\n    // Bare expression — prepend WHERE so the parser can handle it\n    input = `WHERE ${input}`;\n  }\n\n  const lexResult = cypherLexer.tokenize(input);\n  if (lexResult.errors.length > 0) {\n    return { combinator: 'and', rules: [] };\n  }\n\n  parserInstance.input = lexResult.tokens;\n  const cst = parserInstance.cypherQuery();\n\n  if (parserInstance.errors.length > 0) {\n    return { combinator: 'and', rules: [] };\n  }\n\n  const rules: RuleOrGroup[] = [];\n\n  // Only process WHERE clause — skip MATCH/RETURN\n  const whereClauses = (cst.children.whereClause as CstNode[] | undefined) ?? [];\n  if (whereClauses.length > 0) {\n    const whereNode = whereClauses[0];\n    const orExpr = (whereNode.children.orExpression as CstNode[])[0];\n    const whereRules = visitOrExpression(orExpr);\n\n    // If the top-level OR produced a single AND group without NOT, flatten it\n    if (\n      whereRules.length === 1 &&\n      'combinator' in whereRules[0] &&\n      whereRules[0].combinator === 'and' &&\n      !('not' in whereRules[0] && whereRules[0].not)\n    ) {\n      rules.push(...whereRules[0].rules);\n    } else {\n      rules.push(...whereRules);\n    }\n  }\n\n  return { combinator: 'and', rules };\n}\n\n/**\n * Parses a GQL query string. GQL is ~95% compatible with Cypher;\n * the parser handles the same syntax.\n */\nexport function parseGQL(gql: string): DefaultRuleGroupType;\nexport function parseGQL(\n  gql: string,\n  options: Omit<ParseCypherOptions, 'independentCombinators'> & {\n    independentCombinators?: false;\n  }\n): DefaultRuleGroupType;\nexport function parseGQL(\n  gql: string,\n  options: Omit<ParseCypherOptions, 'independentCombinators'> & {\n    independentCombinators: true;\n  }\n): DefaultRuleGroupTypeIC;\nexport function parseGQL(gql: string, options?: ParseCypherOptions): DefaultRuleGroupTypeAny {\n  // Call the implementation signature directly (not the overloads)\n  return (parseCypher as (s: string, o?: ParseCypherOptions) => DefaultRuleGroupTypeAny)(\n    gql,\n    options\n  );\n}\n"],"mappings":";;;AAUA,MAAM,cAAA,GAAA,WAAA,aAAyB;CAAE,MAAM;CAAc,SAAS;CAAO,OAAOA,WAAAA,MAAM;AAAQ,CAAC;AAG3F,MAAM,iBAAA,GAAA,WAAA,aAA4B;CAChC,MAAM;CACN,SAAS;CACT,YAAY,KAAA;AACd,CAAC;AACD,MAAM,cAAA,GAAA,WAAA,aAAyB;CAAE,MAAM;CAAc,SAAS;AAAiB,CAAC;AAChF,MAAM,YAAA,GAAA,WAAA,aAAuB;CAAE,MAAM;CAAY,SAAS;AAAe,CAAC;AAC1E,MAAM,aAAA,GAAA,WAAA,aAAwB;CAAE,MAAM;CAAa,SAAS;AAAmB,CAAC;AAChF,MAAM,UAAA,GAAA,WAAA,aAAqB;CAAE,MAAM;CAAU,SAAS;AAAa,CAAC;AACpE,MAAM,SAAA,GAAA,WAAA,aAAoB;CAAE,MAAM;CAAS,SAAS;AAAY,CAAC;AACjE,MAAM,SAAA,GAAA,WAAA,aAAoB;CAAE,MAAM;CAAS,SAAS;AAAS,CAAC;AAC9D,MAAM,SAAA,GAAA,WAAA,aAAoB;CAAE,MAAM;CAAS,SAAS;AAAS,CAAC;AAC9D,MAAM,UAAA,GAAA,WAAA,aAAqB;CAAE,MAAM;CAAU,SAAS;AAAU,CAAC;AACjE,MAAM,OAAA,GAAA,WAAA,aAAkB;CAAE,MAAM;CAAO,SAAS;AAAO,CAAC;AACxD,MAAM,MAAA,GAAA,WAAA,aAAiB;CAAE,MAAM;CAAM,SAAS;AAAM,CAAC;AACrD,MAAM,OAAA,GAAA,WAAA,aAAkB;CAAE,MAAM;CAAO,SAAS;AAAO,CAAC;AACxD,MAAM,YAAA,GAAA,WAAA,aAAuB;CAAE,MAAM;CAAY,SAAS;AAAY,CAAC;AACvE,MAAM,MAAA,GAAA,WAAA,aAAiB;CAAE,MAAM;CAAM,SAAS;AAAM,CAAC;AACrD,MAAM,WAAA,GAAA,WAAA,aAAsB;CAAE,MAAM;CAAW,SAAS;AAAS,CAAC;AAClE,MAAM,WAAA,GAAA,WAAA,aAAsB;CAAE,MAAM;CAAW,SAAS;AAAS,CAAC;AAClE,MAAM,YAAA,GAAA,WAAA,aAAuB;CAAE,MAAM;CAAY,SAAS;AAAU,CAAC;AAGrE,MAAM,iBAAA,GAAA,WAAA,aAA4B;CAAE,MAAM;CAAiB,SAAS;AAAoB,CAAC;AACzF,MAAM,iBAAA,GAAA,WAAA,aAA4B;CAAE,MAAM;CAAiB,SAAS;AAAkB,CAAC;AAGvF,MAAM,aAAA,GAAA,WAAA,aAAwB;CAAE,MAAM;CAAa,SAAS;AAAK,CAAC;AAClE,MAAM,gBAAA,GAAA,WAAA,aAA2B;CAAE,MAAM;CAAgB,SAAS;AAAK,CAAC;AACxE,MAAM,YAAA,GAAA,WAAA,aAAuB;CAAE,MAAM;CAAY,SAAS;AAAK,CAAC;AAChE,MAAM,QAAA,GAAA,WAAA,aAAmB;CAAE,MAAM;CAAQ,SAAS;AAAI,CAAC;AACvD,MAAM,WAAA,GAAA,WAAA,aAAsB;CAAE,MAAM;CAAW,SAAS;AAAI,CAAC;AAC7D,MAAM,SAAA,GAAA,WAAA,aAAoB;CAAE,MAAM;CAAS,SAAS;AAAI,CAAC;AAGzD,MAAM,UAAA,GAAA,WAAA,aAAqB;CAAE,MAAM;CAAU,SAAS;AAAK,CAAC;AAC5D,MAAM,UAAA,GAAA,WAAA,aAAqB;CAAE,MAAM;CAAU,SAAS;AAAK,CAAC;AAC5D,MAAM,YAAA,GAAA,WAAA,aAAuB;CAAE,MAAM;CAAY,SAAS;AAAK,CAAC;AAChE,MAAM,YAAA,GAAA,WAAA,aAAuB;CAAE,MAAM;CAAY,SAAS;AAAK,CAAC;AAChE,MAAM,SAAA,GAAA,WAAA,aAAoB;CAAE,MAAM;CAAS,SAAS;AAAI,CAAC;AACzD,MAAM,SAAA,GAAA,WAAA,aAAoB;CAAE,MAAM;CAAS,SAAS;AAAI,CAAC;AACzD,MAAM,OAAA,GAAA,WAAA,aAAkB;CAAE,MAAM;CAAO,SAAS;AAAK,CAAC;AAGtD,MAAM,kBAAA,GAAA,WAAA,aAA6B;CAAE,MAAM;CAAkB,SAAS;AAAK,CAAC;AAC5E,MAAM,iBAAA,GAAA,WAAA,aAA4B;CAAE,MAAM;CAAiB,SAAS;AAAK,CAAC;AAC1E,MAAM,QAAA,GAAA,WAAA,aAAmB;CAAE,MAAM;CAAQ,SAAS;AAAI,CAAC;AAGvD,MAAM,cAAA,GAAA,WAAA,aAAyB;CAAE,MAAM;CAAc,SAAS;AAAe,CAAC;AAG9E,MAAM,YAAY;CAChB;CAEA;CACA;CACA;CACA;CACA;CACA;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA;CACA;CAEA;CACA;CACA;CACA;CACA;CAEA;CACA;CACA;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA;AACF;AAEA,MAAM,cAAc,IAAIA,WAAAA,MAAM,SAAS;AAIvC,IAAM,kBAAN,cAA8BC,WAAAA,UAAU;CACtC,cAAc;EACZ,MAAM,WAAW,EAAE,iBAAiB,MAAM,CAAC;EAC3C,KAAK,oBAAoB;CAC3B;;CAGA,cAAqB,KAAK,KAAK,qBAAqB;EAClD,KAAK,WAAW;GACd,KAAK,GAAG,CACN,EAAE,WAAW,KAAK,QAAQ,KAAK,mBAAmB,EAAE,GACpD,EAAE,WAAW,KAAK,QAAQ,KAAK,WAAW,EAAE,CAC9C,CAAC;EACH,CAAC;EACD,KAAK,aAAa,KAAK,QAAQ,KAAK,WAAW,CAAC;EAChD,KAAK,cAAc,KAAK,QAAQ,KAAK,YAAY,CAAC;CACpD,CAAC;;CAGD,cAAqB,KAAK,KAAK,qBAAqB;EAClD,KAAK,QAAQ,KAAK;EAClB,KAAK,QAAQ,KAAK,OAAO;CAC3B,CAAC;;CAGD,sBAA6B,KAAK,KAAK,6BAA6B;EAClE,KAAK,QAAQ,aAAa;EAC1B,KAAK,QAAQ,KAAK,OAAO;CAC3B,CAAC;;CAGD,UAAiB,KAAK,KAAK,iBAAiB;EAC1C,KAAK,QAAQ,KAAK,aAAa,EAAE,OAAO,MAAM,CAAC;EAC/C,KAAK,aAAa;GAChB,KAAK,QAAQ,KAAK,UAAU;GAC5B,KAAK,SAAS,KAAK,aAAa,EAAE,OAAO,MAAM,CAAC;EAClD,CAAC;CACH,CAAC;;CAGD,cAAqB,KAAK,KAAK,qBAAqB;EAClD,KAAK,QAAQ,MAAM;EACnB,KAAK,QAAQ,YAAY,EAAE,OAAO,QAAQ,CAAC;EAC3C,KAAK,aAAa;GAChB,KAAK,QAAQ,KAAK;GAClB,KAAK,SAAS,YAAY,EAAE,OAAO,QAAQ,CAAC;EAC9C,CAAC;EACD,KAAK,QAAQ,MAAM;CACrB,CAAC;;CAGD,aAAoB,KAAK,KAAK,oBAAoB;EAChD,KAAK,GAAG,CACN,EACE,WAAW;GACT,KAAK,QAAQ,eAAe,EAAE,OAAO,YAAY,CAAC;GAClD,KAAK,QAAQ,QAAQ;GACrB,KAAK,aAAa;IAChB,KAAK,QAAQ,KAAK;IAClB,KAAK,QAAQ,YAAY,EAAE,OAAO,UAAU,CAAC;GAC/C,CAAC;GACD,KAAK,QAAQ,QAAQ;GACrB,KAAK,QAAQ,MAAM,EAAE,OAAO,YAAY,CAAC;EAC3C,EACF,GACA,EACE,WAAW;GACT,KAAK,SAAS,MAAM,EAAE,OAAO,WAAW,CAAC;GACzC,KAAK,SAAS,QAAQ;GACtB,KAAK,cAAc;IACjB,KAAK,SAAS,KAAK;IACnB,KAAK,SAAS,YAAY,EAAE,OAAO,UAAU,CAAC;GAChD,CAAC;GACD,KAAK,SAAS,QAAQ;GACtB,KAAK,QAAQ,gBAAgB,EAAE,OAAO,aAAa,CAAC;EACtD,EACF,CACF,CAAC;CACH,CAAC;;CAGD,cAAqB,KAAK,KAAK,qBAAqB;EAClD,KAAK,QAAQ,KAAK;EAClB,KAAK,QAAQ,KAAK,YAAY;CAChC,CAAC;;CAGD,eAAsB,KAAK,KAAK,sBAAsB;EACpD,KAAK,QAAQ,KAAK,eAAe,EAAE,OAAO,MAAM,CAAC;EACjD,KAAK,WAAW;GACd,KAAK,QAAQ,EAAE;GACf,KAAK,SAAS,KAAK,eAAe,EAAE,OAAO,MAAM,CAAC;EACpD,CAAC;CACH,CAAC;;CAGD,gBAAuB,KAAK,KAAK,uBAAuB;EACtD,KAAK,QAAQ,KAAK,eAAe,EAAE,OAAO,MAAM,CAAC;EACjD,KAAK,WAAW;GACd,KAAK,QAAQ,GAAG;GAChB,KAAK,SAAS,KAAK,eAAe,EAAE,OAAO,MAAM,CAAC;EACpD,CAAC;CACH,CAAC;;CAGD,gBAAuB,KAAK,KAAK,uBAAuB;EACtD,KAAK,aAAa,KAAK,QAAQ,GAAG,CAAC;EACnC,KAAK,QAAQ,KAAK,gBAAgB;CACpC,CAAC;;CAGD,mBAA0B,KAAK,KAAK,0BAA0B;EAC5D,KAAK,GAAG,CACN,EACE,WAAW;GACT,KAAK,QAAQ,MAAM;GACnB,KAAK,QAAQ,KAAK,YAAY;GAC9B,KAAK,QAAQ,MAAM;EACrB,EACF,GACA,EAAE,WAAW,KAAK,QAAQ,KAAK,SAAS,EAAE,CAC5C,CAAC;CACH,CAAC;;CAGD,YAAmB,KAAK,KAAK,mBAAmB;EAC9C,KAAK,QAAQ,KAAK,aAAa,EAAE,OAAO,QAAQ,CAAC;EACjD,KAAK,GAAG;GACN,EACE,WAAW;IACT,KAAK,QAAQ,KAAK;IAClB,KAAK,QAAQ,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAC/C,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,QAAQ;IACrB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,IAAI;IACjB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,OAAO;IACpB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,SAAS;IACtB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,YAAY;IACzB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,QAAQ;IACrB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,UAAU;IACvB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,QAAQ;IACrB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,EACF;GACA,EAAE,WAAW,KAAK,QAAQ,SAAS,EAAE;GACrC,EAAE,WAAW,KAAK,QAAQ,MAAM,EAAE;GAClC,EACE,WAAW;IACT,KAAK,QAAQ,EAAE;IACf,KAAK,QAAQ,KAAK,aAAa,EAAE,OAAO,OAAO,CAAC;GAClD,EACF;GACA,EACE,WAAW;IACT,KAAK,QAAQ,KAAK;IAClB,KAAK,SAAS,KAAK,aAAa,EAAE,OAAO,OAAO,CAAC;GACnD,EACF;EACF,CAAC;CACH,CAAC;;CAGD,cAAqB,KAAK,KAAK,qBAAqB;EAClD,KAAK,QAAQ,YAAY,EAAE,OAAO,OAAO,CAAC;EAC1C,KAAK,WAAW;GACd,KAAK,QAAQ,GAAG;GAChB,KAAK,SAAS,YAAY,EAAE,OAAO,OAAO,CAAC;EAC7C,CAAC;CACH,CAAC;;CAGD,UAAiB,KAAK,KAAK,iBAAiB;EAC1C,KAAK,GAAG;GACN,EAAE,WAAW,KAAK,QAAQ,aAAa,EAAE;GACzC,EAAE,WAAW,KAAK,QAAQ,aAAa,EAAE;GACzC,EAAE,WAAW,KAAK,QAAQ,OAAO,EAAE;GACnC,EAAE,WAAW,KAAK,QAAQ,OAAO,EAAE;GACnC,EAAE,WAAW,KAAK,QAAQ,QAAQ,EAAE;GACpC,EAAE,WAAW,KAAK,QAAQ,UAAU,EAAE;EACxC,CAAC;CACH,CAAC;;CAGD,cAAqB,KAAK,KAAK,qBAAqB;EAClD,KAAK,QAAQ,QAAQ;EACrB,KAAK,aAAa;GAChB,KAAK,QAAQ,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAC7C,KAAK,WAAW;IACd,KAAK,QAAQ,KAAK;IAClB,KAAK,SAAS,KAAK,SAAS,EAAE,OAAO,QAAQ,CAAC;GAChD,CAAC;EACH,CAAC;EACD,KAAK,QAAQ,QAAQ;CACvB,CAAC;;CAGD,eAAsB,KAAK,KAAK,sBAAsB;EACpD,KAAK,QAAQ,MAAM;EACnB,KAAK,WAAW;GACd,KAAK,GAAG;IACN,EAAE,WAAW,KAAK,QAAQ,UAAU,EAAE;IACtC,EAAE,WAAW,KAAK,QAAQ,KAAK,EAAE;IACjC,EAAE,WAAW,KAAK,QAAQ,GAAG,EAAE;GACjC,CAAC;EACH,CAAC;CACH,CAAC;AACH;AAEA,MAAM,iBAAiB,IAAI,gBAAgB;;AAK3C,MAAM,gBAAgB,UAA2B;CAC/C,MAAM,MAAM,MAAM;CAClB,QAAQ,MAAM,WAAd;EACE,KAAK,eACH,OAAO,IAAI,MAAM,GAAG,EAAE,EAAE,QAAQ,QAAQ,GAAG;EAC7C,KAAK,eACH,OAAO,OAAO,GAAG;EACnB,KAAK,SACH,OAAO;EACT,KAAK,SACH,OAAO;EACT,KAAK,UACH,OAAO;EACT,SACE,OAAO;CACX;AACF;;AAGA,MAAM,kBAAkB,gBAAkC;CACxD,MAAM,WAAW,YAAY;CAC7B,MAAM,QACH,SAAS,gBAA6B,MACtC,SAAS,gBAA6B,MACtC,SAAS,UAAuB,MAChC,SAAS,UAAuB,MAChC,SAAS,WAAwB,MACjC,SAAS,aAA0B;CACtC,OAAO,QAAQ,aAAa,KAAK,IAAI;AACvC;;AAGA,MAAM,sBAAsB,SAA0B;CACpD,MAAM,OAAQ,KAAK,SAAS,KAAkB,GAAG;CACjD,MAAM,QAAS,KAAK,SAAS,QAAiC,CAAC;CAC/D,IAAI,MAAM,WAAW,GAAG,OAAO;CAC/B,OAAO,OAAO,MAAM,MAAM,KAAI,MAAK,EAAE,KAAK,EAAE,KAAK,GAAG;AACtD;;AAGA,MAAM,eAAe,SAA6B;CAEhD,QADe,KAAK,SAAS,SAAmC,CAAC,GACpD,IAAI,cAAc;AACjC;;AAKA,MAAM,qBAAqB,SAAiC;CAC1D,MAAM,WAAW,KAAK,SAAS;CAC/B,MAAM,WAAY,KAAK,SAAS,OAAiC,CAAC;CAElE,IAAI,SAAS,WAAW,GACtB,OAAO,mBAAmB,SAAS,EAAE;CAGvC,MAAM,WAAW,CAAC,SAAS,IAAI,GAAG,QAAQ;CAC1C,MAAM,WAA0B,CAAC;CACjC,KAAK,MAAM,QAAQ,UAAU;EAC3B,MAAM,YAAY,mBAAmB,IAAI;EACzC,IAAI,UAAU,WAAW,GACvB,SAAS,KAAK,UAAU,EAAE;OAE1B,SAAS,KAAK;GAAE,YAAY;GAAO,OAAO;EAAU,CAAC;CAEzD;CACA,OAAO,CAAC;EAAE,YAAY;EAAM,OAAO;CAAS,CAAC;AAC/C;;AAGA,MAAM,sBAAsB,SAAiC;CAC3D,MAAM,WAAW,KAAK,SAAS;CAC/B,MAAM,WAAY,KAAK,SAAS,OAAiC,CAAC;CAClE,MAAM,MAAM,CAAC,SAAS,IAAI,GAAG,QAAQ;CACrC,MAAM,QAAuB,CAAC;CAC9B,KAAK,MAAM,QAAQ,KACjB,MAAM,KAAK,GAAG,mBAAmB,IAAI,CAAC;CAExC,OAAO;AACT;;AAGA,MAAM,sBAAsB,SAAiC;CAC3D,MAAM,SAAS,CAAC,CAAE,KAAK,SAAS,KAA8B;CAC9D,MAAM,cAAc,sBAAuB,KAAK,SAAS,iBAA+B,EAAE;CAE1F,IAAI,CAAC,QAAQ,OAAO;CAEpB,OAAO,CAAC;EAAE,YAAY;EAAO,KAAK;EAAM,OAAO;CAAY,CAAC;AAC9D;;AAGA,MAAM,yBAAyB,SAAiC;CAC9D,IAAI,KAAK,SAAS,cAChB,OAAO,kBAAmB,KAAK,SAAS,aAA2B,EAAE;CAEvE,IAAI,KAAK,SAAS,WAChB,OAAO,CAAC,eAAgB,KAAK,SAAS,UAAwB,EAAE,CAAC;CAEnE,OAAO,CAAC;AACV;;AAGA,MAAM,kBAAkB,SAAmC;CACzD,MAAM,QAAQ,mBAAoB,KAAK,SAAS,MAAoB,EAAE;CAEtE,IAAI,KAAK,SAAS,QAChB,OAAO;EAAE;EAAO,UAAU;EAAQ,OAAO;CAAK;CAEhD,IAAI,KAAK,SAAS,WAChB,OAAO;EAAE;EAAO,UAAU;EAAW,OAAO;CAAK;CAGnD,IAAI,KAAK,SAAS,IAEhB,OAAO;EAAE;EAAO,UAAU;EAAM,OADnB,YAAa,KAAK,SAAS,KAAmB,EACjB;CAAE;CAE9C,IAAI,KAAK,SAAS,OAEhB,OAAO;EAAE;EAAO,UAAU;EAAS,OADtB,YAAa,KAAK,SAAS,KAAmB,EACd;CAAE;CAGjD,MAAM,YAAa,KAAK,SAAS,QAAkC;CACnE,MAAM,QAAQ,YAAY,eAAe,SAAS,IAAI;CAEtD,IAAI,KAAK,SAAS,OAAO,OAAO;EAAE;EAAO,UAAU;EAAK;CAAM;CAC9D,IAAI,KAAK,SAAS,UAAU,OAAO;EAAE;EAAO,UAAU;EAAM;CAAM;CAClE,IAAI,KAAK,SAAS,MAAM,OAAO;EAAE;EAAO,UAAU;EAAK;CAAM;CAC7D,IAAI,KAAK,SAAS,SAAS,OAAO;EAAE;EAAO,UAAU;EAAK;CAAM;CAChE,IAAI,KAAK,SAAS,WAAW,OAAO;EAAE;EAAO,UAAU;EAAM;CAAM;CACnE,IAAI,KAAK,SAAS,cAAc,OAAO;EAAE;EAAO,UAAU;EAAM;CAAM;CACtE,IAAI,KAAK,SAAS,UAAU,OAAO;EAAE;EAAO,UAAU;EAAY;CAAM;CACxE,IAAI,KAAK,SAAS,YAAY,OAAO;EAAE;EAAO,UAAU;EAAc;CAAM;CAC5E,IAAI,KAAK,SAAS,UAAU,OAAO;EAAE;EAAO,UAAU;EAAY;CAAM;CAExE,OAAO;EAAE;EAAO,UAAU;EAAK;CAAM;AACvC;AA2CA,SAAgB,YACd,QACA,UACyB;CACzB,MAAM,UAAU,OAAO,KAAK;CAC5B,IAAI,CAAC,SAAS,OAAO;EAAE,YAAY;EAAO,OAAO,CAAC;CAAE;CAGpD,IAAI,QAAQ;CACZ,IAAI,CAAC,eAAe,KAAK,KAAK,KAAK,CAAC,eAAe,KAAK,KAAK,GAE3D,QAAQ,SAAS;CAGnB,MAAM,YAAY,YAAY,SAAS,KAAK;CAC5C,IAAI,UAAU,OAAO,SAAS,GAC5B,OAAO;EAAE,YAAY;EAAO,OAAO,CAAC;CAAE;CAGxC,eAAe,QAAQ,UAAU;CACjC,MAAM,MAAM,eAAe,YAAY;CAEvC,IAAI,eAAe,OAAO,SAAS,GACjC,OAAO;EAAE,YAAY;EAAO,OAAO,CAAC;CAAE;CAGxC,MAAM,QAAuB,CAAC;CAG9B,MAAM,eAAgB,IAAI,SAAS,eAAyC,CAAC;CAC7E,IAAI,aAAa,SAAS,GAAG;EAE3B,MAAM,SADY,aAAa,GACL,SAAS,aAA2B;EAC9D,MAAM,aAAa,kBAAkB,MAAM;EAG3C,IACE,WAAW,WAAW,KACtB,gBAAgB,WAAW,MAC3B,WAAW,GAAG,eAAe,SAC7B,EAAE,SAAS,WAAW,MAAM,WAAW,GAAG,MAE1C,MAAM,KAAK,GAAG,WAAW,GAAG,KAAK;OAEjC,MAAM,KAAK,GAAG,UAAU;CAE5B;CAEA,OAAO;EAAE,YAAY;EAAO;CAAM;AACpC;AAmBA,SAAgB,SAAS,KAAa,SAAuD;CAE3F,OAAQ,YACN,KACA,OACF;AACF"}

package/dist/parseGremlin.d.mts

@@ -1,4 +1,4 @@
-import { E as DefaultRuleGroupType, x as DefaultRuleGroupTypeIC } from "./index-AAZg4Uh1.mjs";
+import { E as DefaultRuleGroupType, x as DefaultRuleGroupTypeIC } from "./index-CREDWM32.mjs";
 
 //#region src/utils/parseGremlin/parseGremlin.d.ts
 /**

package/dist/parseGremlin.d.ts

@@ -1,4 +1,4 @@
-import { E as DefaultRuleGroupType, x as DefaultRuleGroupTypeIC } from "./index-Ds06V0zO.js";
+import { E as DefaultRuleGroupType, x as DefaultRuleGroupTypeIC } from "./index-CREDWM32.js";
 
 //#region src/utils/parseGremlin/parseGremlin.d.ts
 /**

package/dist/parseJSONata.d.mts

@@ -1,5 +1,5 @@
-import { E as DefaultRuleGroupType, j as Except, x as DefaultRuleGroupTypeIC } from "./index-AAZg4Uh1.mjs";
-import { t as ParserCommonOptions } from "./import-BC_bAKQ8.mjs";
+import { E as DefaultRuleGroupType, j as Except, x as DefaultRuleGroupTypeIC } from "./index-CREDWM32.mjs";
+import { t as ParserCommonOptions } from "./import-BQ5xaW6i.mjs";
 
 //#region src/utils/parseJSONata/parseJSONata.d.ts
 /**

package/dist/parseJSONata.d.ts

@@ -1,5 +1,5 @@
-import { E as DefaultRuleGroupType, j as Except, x as DefaultRuleGroupTypeIC } from "./index-Ds06V0zO.js";
-import { t as ParserCommonOptions } from "./import-D1KnXhkQ.js";
+import { E as DefaultRuleGroupType, j as Except, x as DefaultRuleGroupTypeIC } from "./index-CREDWM32.js";
+import { t as ParserCommonOptions } from "./import-CSHMjlid.js";
 
 //#region src/utils/parseJSONata/parseJSONata.d.ts
 /**

package/dist/parseJSONata.js

@@ -21,8 +21,8 @@ var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__ge
 	enumerable: true
 }) : target, mod));
 //#endregion
-const require_objectUtils = require("./objectUtils-Bzug_QfX.js");
-const require_prepareQueryObjects = require("./prepareQueryObjects-BoG5Rt8z.js");
+const require_objectUtils = require("./objectUtils-DxVaGCdg.js");
+const require_prepareQueryObjects = require("./prepareQueryObjects-gRQqiBPR.js");
 let jsonata = require("jsonata");
 jsonata = __toESM(jsonata);
 //#region src/utils/parseJSONata/utils.ts
@@ -283,7 +283,6 @@ function parseJSONata(jsonataInput, options = {}) {
 	return prepare(emptyQuery);
 }
 //#endregion
-exports.__toESM = __toESM;
 exports.parseJSONata = parseJSONata;
 
 //# sourceMappingURL=parseJSONata.js.map

package/dist/parseJSONata.mjs

@@ -1,5 +1,5 @@
-import { r as isRuleGroup } from "./objectUtils-D96eEEzL.mjs";
-import { n as fieldIsValidUtil, r as getFieldsArray, t as prepareRuleGroup } from "./prepareQueryObjects-uA10ZpZX.mjs";
+import { r as isRuleGroup } from "./objectUtils-D-w8MzpZ.mjs";
+import { n as fieldIsValidUtil, r as getFieldsArray, t as prepareRuleGroup } from "./prepareQueryObjects-BXf5aV-A.mjs";
 import jsonata from "jsonata";
 //#region src/utils/parseJSONata/utils.ts
 const isJSONataExprNode = (expr) => {

package/dist/parseJsonLogic.d.mts

@@ -1,5 +1,5 @@
-import { E as DefaultRuleGroupType, O as RuleType, S as RuleGroupTypeAny, f as RQBJsonLogic, j as Except, x as DefaultRuleGroupTypeIC } from "./index-AAZg4Uh1.mjs";
-import { t as ParserCommonOptions } from "./import-BC_bAKQ8.mjs";
+import { E as DefaultRuleGroupType, O as RuleType, S as RuleGroupTypeAny, f as RQBJsonLogic, j as Except, x as DefaultRuleGroupTypeIC } from "./index-CREDWM32.mjs";
+import { t as ParserCommonOptions } from "./import-BQ5xaW6i.mjs";
 
 //#region src/utils/parseJsonLogic/parseJsonLogic.d.ts
 /**

package/dist/parseJsonLogic.d.ts

@@ -1,5 +1,5 @@
-import { E as DefaultRuleGroupType, O as RuleType, S as RuleGroupTypeAny, f as RQBJsonLogic, j as Except, x as DefaultRuleGroupTypeIC } from "./index-Ds06V0zO.js";
-import { t as ParserCommonOptions } from "./import-D1KnXhkQ.js";
+import { E as DefaultRuleGroupType, O as RuleType, S as RuleGroupTypeAny, f as RQBJsonLogic, j as Except, x as DefaultRuleGroupTypeIC } from "./index-CREDWM32.js";
+import { t as ParserCommonOptions } from "./import-CSHMjlid.js";
 
 //#region src/utils/parseJsonLogic/parseJsonLogic.d.ts
 /**

package/dist/parseJsonLogic.js

@@ -1,8 +1,8 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_utils = require("./utils-Qwkq2Q0F.js");
-const require_objectUtils = require("./objectUtils-Bzug_QfX.js");
-const require_convertQuery = require("./convertQuery-Lx2HQa0m.js");
-const require_prepareQueryObjects = require("./prepareQueryObjects-BoG5Rt8z.js");
+const require_utils = require("./utils-ZlKseh1X.js");
+const require_objectUtils = require("./objectUtils-DxVaGCdg.js");
+const require_convertQuery = require("./convertQuery-BoMPXL7_.js");
+const require_prepareQueryObjects = require("./prepareQueryObjects-gRQqiBPR.js");
 //#region src/utils/parseJsonLogic/utils.ts
 const isJsonLogicVar = (logic) => require_objectUtils.isPojo(logic) && "var" in logic;
 const isRQBJsonLogicVar = (logic) => isJsonLogicVar(logic) && typeof logic.var === "string";

package/dist/parseJsonLogic.mjs

@@ -1,7 +1,7 @@
-import { E as joinWith, k as defaultOperatorNegationMap } from "./utils-ChLG90DP.mjs";
-import { i as isRuleGroupType, n as objectKeys, o as isPojo, r as isRuleGroup } from "./objectUtils-D96eEEzL.mjs";
-import { n as convertToIC } from "./convertQuery-BeJJH9BI.mjs";
-import { n as fieldIsValidUtil, r as getFieldsArray, t as prepareRuleGroup } from "./prepareQueryObjects-uA10ZpZX.mjs";
+import { E as joinWith, k as defaultOperatorNegationMap } from "./utils-01WaTGBL.mjs";
+import { i as isRuleGroupType, n as objectKeys, o as isPojo, r as isRuleGroup } from "./objectUtils-D-w8MzpZ.mjs";
+import { n as convertToIC } from "./convertQuery-CQwOrjQr.mjs";
+import { n as fieldIsValidUtil, r as getFieldsArray, t as prepareRuleGroup } from "./prepareQueryObjects-BXf5aV-A.mjs";
 //#region src/utils/parseJsonLogic/utils.ts
 const isJsonLogicVar = (logic) => isPojo(logic) && "var" in logic;
 const isRQBJsonLogicVar = (logic) => isJsonLogicVar(logic) && typeof logic.var === "string";

package/dist/parseMongoDB.d.mts

@@ -1,5 +1,5 @@
-import { D as RuleGroupType, E as DefaultRuleGroupType, O as RuleType, j as Except, x as DefaultRuleGroupTypeIC } from "./index-AAZg4Uh1.mjs";
-import { t as ParserCommonOptions } from "./import-BC_bAKQ8.mjs";
+import { D as RuleGroupType, E as DefaultRuleGroupType, O as RuleType, j as Except, x as DefaultRuleGroupTypeIC } from "./index-CREDWM32.mjs";
+import { t as ParserCommonOptions } from "./import-BQ5xaW6i.mjs";
 
 //#region src/utils/parseMongoDB/parseMongoDB.d.ts
 /**

package/dist/parseMongoDB.d.ts

@@ -1,5 +1,5 @@
-import { D as RuleGroupType, E as DefaultRuleGroupType, O as RuleType, j as Except, x as DefaultRuleGroupTypeIC } from "./index-Ds06V0zO.js";
-import { t as ParserCommonOptions } from "./import-D1KnXhkQ.js";
+import { D as RuleGroupType, E as DefaultRuleGroupType, O as RuleType, j as Except, x as DefaultRuleGroupTypeIC } from "./index-CREDWM32.js";
+import { t as ParserCommonOptions } from "./import-CSHMjlid.js";
 
 //#region src/utils/parseMongoDB/parseMongoDB.d.ts
 /**

package/dist/parseMongoDB.js

@@ -1,8 +1,8 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_utils = require("./utils-Qwkq2Q0F.js");
-const require_objectUtils = require("./objectUtils-Bzug_QfX.js");
-const require_convertQuery = require("./convertQuery-Lx2HQa0m.js");
-const require_prepareQueryObjects = require("./prepareQueryObjects-BoG5Rt8z.js");
+const require_utils = require("./utils-ZlKseh1X.js");
+const require_objectUtils = require("./objectUtils-DxVaGCdg.js");
+const require_convertQuery = require("./convertQuery-BoMPXL7_.js");
+const require_prepareQueryObjects = require("./prepareQueryObjects-gRQqiBPR.js");
 //#region src/utils/parseMongoDB/utils.ts
 const getRegExStr = (re) => typeof re === "string" ? re : re.source;
 const isPrimitive = (v) => typeof v === "string" || typeof v === "number" || typeof v === "boolean";

package/dist/parseMongoDB.mjs

@@ -1,7 +1,7 @@
-import { E as joinWith, k as defaultOperatorNegationMap } from "./utils-ChLG90DP.mjs";
-import { i as isRuleGroupType, n as objectKeys, o as isPojo } from "./objectUtils-D96eEEzL.mjs";
-import { n as convertToIC } from "./convertQuery-BeJJH9BI.mjs";
-import { n as fieldIsValidUtil, r as getFieldsArray, t as prepareRuleGroup } from "./prepareQueryObjects-uA10ZpZX.mjs";
+import { E as joinWith, k as defaultOperatorNegationMap } from "./utils-01WaTGBL.mjs";
+import { i as isRuleGroupType, n as objectKeys, o as isPojo } from "./objectUtils-D-w8MzpZ.mjs";
+import { n as convertToIC } from "./convertQuery-CQwOrjQr.mjs";
+import { n as fieldIsValidUtil, r as getFieldsArray, t as prepareRuleGroup } from "./prepareQueryObjects-BXf5aV-A.mjs";
 //#region src/utils/parseMongoDB/utils.ts
 const getRegExStr = (re) => typeof re === "string" ? re : re.source;
 const isPrimitive = (v) => typeof v === "string" || typeof v === "number" || typeof v === "boolean";

package/dist/parseSPARQL.d.mts

@@ -1,4 +1,4 @@
-import { E as DefaultRuleGroupType, x as DefaultRuleGroupTypeIC } from "./index-AAZg4Uh1.mjs";
+import { E as DefaultRuleGroupType, x as DefaultRuleGroupTypeIC } from "./index-CREDWM32.mjs";
 
 //#region src/utils/parseSPARQL/parseSPARQL.d.ts
 /**

package/dist/parseSPARQL.d.ts

@@ -1,4 +1,4 @@
-import { E as DefaultRuleGroupType, x as DefaultRuleGroupTypeIC } from "./index-Ds06V0zO.js";
+import { E as DefaultRuleGroupType, x as DefaultRuleGroupTypeIC } from "./index-CREDWM32.js";
 
 //#region src/utils/parseSPARQL/parseSPARQL.d.ts
 /**

package/dist/parseSPARQL.js

@@ -1,5 +1,4 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-require("./parseJSONata.js");
 let _traqula_parser_sparql_1_2 = require("@traqula/parser-sparql-1-2");
 //#region src/utils/parseSPARQL/parseSPARQL.ts
 let parserInstance;

package/dist/parseSPARQL.js.map

@@ -1 +1 @@
-{"version":3,"file":"parseSPARQL.js","names":["SparqlParser"],"sources":["../src/utils/parseSPARQL/parseSPARQL.ts"],"sourcesContent":["import { Parser as SparqlParser } from '@traqula/parser-sparql-1-2';\nimport type {\n  DefaultRuleGroupType,\n  DefaultRuleGroupTypeAny,\n  DefaultRuleGroupTypeIC,\n  DefaultRuleType,\n} from '../../types';\n\n// Reuse a single parser instance (Chevrotain-backed; creating parsers is expensive)\nlet parserInstance: SparqlParser | undefined;\nconst getParser = (): SparqlParser => {\n  if (!parserInstance) {\n    parserInstance = new SparqlParser();\n  }\n  return parserInstance;\n};\n\n// ─── Traqula AST Type Subset ─────────────────────────────────────────────────\n\ninterface TraqulaQuery {\n  type: 'query';\n  subType: string;\n  where?: TraqulaPatternGroup;\n  [key: string]: unknown;\n}\n\ninterface TraqulaPatternGroup {\n  type: 'pattern';\n  subType: 'group';\n  patterns: TraqulaPattern[];\n}\n\ntype TraqulaPattern =\n  | TraqulaBgp\n  | TraqulaOptional\n  | TraqulaFilter\n  | TraqulaPatternGroup\n  | TraqulaUnion\n  | { type: 'pattern'; subType: string; [key: string]: unknown }\n  | TraqulaQuery;\n\ninterface TraqulaBgp {\n  type: 'pattern';\n  subType: 'bgp';\n  triples: TraqulaTriple[];\n}\n\ninterface TraqulaOptional {\n  type: 'pattern';\n  subType: 'optional';\n  patterns: TraqulaPattern[];\n}\n\ninterface TraqulaFilter {\n  type: 'pattern';\n  subType: 'filter';\n  expression: TraqulaExpression;\n}\n\ninterface TraqulaUnion {\n  type: 'pattern';\n  subType: 'union';\n  patterns: TraqulaPatternGroup[];\n}\n\ninterface TraqulaTriple {\n  type: 'triple';\n  subject: TraqulaTerm;\n  predicate: TraqulaTerm;\n  object: TraqulaTerm;\n}\n\ninterface TraqulaTerm {\n  type: 'term' | 'path' | 'wildcard';\n  subType?: string;\n  value?: string;\n  prefix?: string;\n  langOrIri?: unknown;\n  [key: string]: unknown;\n}\n\ninterface TraqulaExpression {\n  type: 'expression' | 'term';\n  subType: string;\n  operator?: string;\n  args?: (TraqulaExpression | TraqulaTerm)[];\n  value?: string;\n  prefix?: string;\n  langOrIri?: unknown;\n  [key: string]: unknown;\n}\n\n// ─── AST Walker ──────────────────────────────────────────────────────────────\n\n/** Serializes a Traqula term into a user-facing string. */\nconst termToString = (term: TraqulaTerm): string => {\n  if (term.type === 'term') {\n    switch (term.subType) {\n      case 'variable':\n        return `?${term.value}`;\n      case 'namedNode':\n        if (term.prefix !== undefined && term.prefix !== '') {\n          return `${term.prefix}:${term.value}`;\n        }\n        return term.value ?? '';\n      case 'literal':\n        return term.value ?? '';\n      case 'blankNode':\n        return `_:${(term as { label?: string }).label ?? ''}`;\n      default:\n        return term.value ?? '';\n    }\n  }\n  return '';\n};\n\n/** Extracts a literal JS value from a Traqula term. */\nconst termToLiteralValue = (term: TraqulaTerm | TraqulaExpression): unknown => {\n  if (term.type === 'term' && term.subType === 'literal') {\n    const raw = term.value ?? '';\n    if (term.langOrIri && typeof term.langOrIri === 'object') {\n      const iri = term.langOrIri as TraqulaTerm;\n      const datatype = iri.value ?? '';\n      if (\n        datatype.endsWith('#integer') ||\n        datatype.endsWith('#decimal') ||\n        datatype.endsWith('#double') ||\n        datatype.endsWith('#float')\n      ) {\n        return Number(raw);\n      }\n      if (datatype.endsWith('#boolean')) {\n        return raw === 'true';\n      }\n    }\n    const num = Number(raw);\n    if (raw !== '' && !Number.isNaN(num)) return num;\n    return raw;\n  }\n  if (term.type === 'term' && term.subType === 'variable') {\n    return `?${term.value}`;\n  }\n  if (term.type === 'term' && term.subType === 'namedNode') {\n    return termToString(term as TraqulaTerm);\n  }\n  return term.value ?? '';\n};\n\n/** Walks patterns, extracting only FILTER expressions (skipping BGP triples). */\nconst visitPatterns = (\n  patterns: TraqulaPattern[],\n  out: (DefaultRuleType | DefaultRuleGroupType)[]\n): void => {\n  for (const p of patterns) {\n    if (p.type === 'pattern') {\n      switch (p.subType) {\n        case 'bgp':\n          // Skip triple patterns — Phase 1 only extracts filter conditions\n          break;\n        case 'optional':\n          visitPatterns((p as TraqulaOptional).patterns, out);\n          break;\n        case 'filter':\n          visitFilter((p as TraqulaFilter).expression, out);\n          break;\n        case 'group':\n          visitPatterns((p as TraqulaPatternGroup).patterns, out);\n          break;\n        case 'union': {\n          const union = p as TraqulaUnion;\n          const subRules: (DefaultRuleType | DefaultRuleGroupType)[] = [];\n          for (const branch of union.patterns) {\n            const branchRules: (DefaultRuleType | DefaultRuleGroupType)[] = [];\n            visitPatterns(branch.patterns, branchRules);\n            if (branchRules.length === 1) {\n              subRules.push(branchRules[0]);\n            } else if (branchRules.length > 1) {\n              subRules.push({ combinator: 'and', rules: branchRules });\n            }\n          }\n          if (subRules.length > 0) {\n            out.push({ combinator: 'or', rules: subRules });\n          }\n          break;\n        }\n        default:\n          break;\n      }\n    }\n  }\n};\n\n/** Maps a SPARQL comparison operator string to an RQB operator. */\nconst sparqlOpToRqb: Record<string, string> = {\n  '=': '=',\n  '!=': '!=',\n  '<': '<',\n  '>': '>',\n  '<=': '<=',\n  '>=': '>=',\n};\n\n/** Converts a FILTER expression into rules. */\nconst visitFilter = (\n  expr: TraqulaExpression,\n  out: (DefaultRuleType | DefaultRuleGroupType)[]\n): void => {\n  if (expr.type === 'expression' && expr.subType === 'operation') {\n    const op = expr.operator ?? '';\n    const args = expr.args ?? [];\n\n    // Logical operators\n    if (op === '&&') {\n      for (const arg of args) {\n        visitFilter(arg as TraqulaExpression, out);\n      }\n      return;\n    }\n    if (op === '||') {\n      const subRules: (DefaultRuleType | DefaultRuleGroupType)[] = [];\n      for (const arg of args) {\n        const branchRules: (DefaultRuleType | DefaultRuleGroupType)[] = [];\n        visitFilter(arg as TraqulaExpression, branchRules);\n        subRules.push(...branchRules);\n      }\n      out.push({ combinator: 'or', rules: subRules });\n      return;\n    }\n\n    // Negation\n    if (op === '!') {\n      if (args.length === 1) {\n        const inner = args[0] as TraqulaExpression;\n        // !BOUND(x) → null check\n        if (\n          inner.type === 'expression' &&\n          inner.subType === 'operation' &&\n          inner.operator === 'bound'\n        ) {\n          const field = termToString((inner.args?.[0] ?? {}) as TraqulaTerm);\n          out.push({ field, operator: 'null', value: null } as DefaultRuleType);\n          return;\n        }\n        const innerRules: (DefaultRuleType | DefaultRuleGroupType)[] = [];\n        visitFilter(inner, innerRules);\n        if (innerRules.length === 1 && !('combinator' in innerRules[0])) {\n          out.push(negateRule(innerRules[0]));\n        } else {\n          out.push({ combinator: 'and', not: true, rules: innerRules });\n        }\n        return;\n      }\n    }\n\n    // Comparison operators\n    if (op in sparqlOpToRqb && args.length === 2) {\n      const field = termToString(args[0] as TraqulaTerm);\n      const value = termToLiteralValue(args[1] as TraqulaExpression);\n      out.push({ field, operator: sparqlOpToRqb[op], value } as DefaultRuleType);\n      return;\n    }\n\n    // BOUND(?x) → notNull\n    if (op === 'bound' && args.length === 1) {\n      const field = termToString(args[0] as TraqulaTerm);\n      out.push({ field, operator: 'notNull', value: null } as DefaultRuleType);\n      return;\n    }\n\n    // String functions\n    if (op === 'contains' && args.length === 2) {\n      const field = termToString(args[0] as TraqulaTerm);\n      const value = termToLiteralValue(args[1] as TraqulaExpression);\n      out.push({ field, operator: 'contains', value } as DefaultRuleType);\n      return;\n    }\n    if (op === 'strstarts' && args.length === 2) {\n      const field = termToString(args[0] as TraqulaTerm);\n      const value = termToLiteralValue(args[1] as TraqulaExpression);\n      out.push({ field, operator: 'beginsWith', value } as DefaultRuleType);\n      return;\n    }\n    if (op === 'strends' && args.length === 2) {\n      const field = termToString(args[0] as TraqulaTerm);\n      const value = termToLiteralValue(args[1] as TraqulaExpression);\n      out.push({ field, operator: 'endsWith', value } as DefaultRuleType);\n      return;\n    }\n  }\n};\n\n/** Negates a rule by converting its operator. */\nconst negateRule = (rule: DefaultRuleType): DefaultRuleType => {\n  const negMap: Record<string, string> = {\n    contains: 'doesNotContain',\n    beginsWith: 'doesNotBeginWith',\n    endsWith: 'doesNotEndWith',\n    notNull: 'null',\n    null: 'notNull',\n    '=': '!=',\n    '!=': '=',\n    '<': '>=',\n    '>': '<=',\n    '<=': '>',\n    '>=': '<',\n  };\n  return { ...rule, operator: negMap[rule.operator] ?? rule.operator } as DefaultRuleType;\n};\n\n/**\n * Ensures all prefixed names in a SPARQL query have corresponding PREFIX\n * declarations so the parser accepts them without requiring full URIs.\n */\nconst ensurePrefixes = (sparql: string): string => {\n  const declaredPrefixes = new Set<string>();\n  const prefixDeclRegex = /PREFIX\\s+(\\w*):/gi;\n  let m: RegExpExecArray | null;\n  while ((m = prefixDeclRegex.exec(sparql)) !== null) {\n    declaredPrefixes.add(m[1].toLowerCase());\n  }\n\n  const usedPrefixes = new Set<string>();\n  const prefixUsageRegex = /\\b(\\w+):\\w+/g;\n  while ((m = prefixUsageRegex.exec(sparql)) !== null) {\n    const prefix = m[1];\n    if (/^https?$/i.test(prefix) || /^urn$/i.test(prefix)) continue;\n    const before = sparql.slice(0, m.index);\n    const lastOpen = before.lastIndexOf('<');\n    const lastClose = before.lastIndexOf('>');\n    if (lastOpen > lastClose) continue;\n    if (!declaredPrefixes.has(prefix.toLowerCase())) {\n      usedPrefixes.add(prefix);\n    }\n  }\n\n  if (usedPrefixes.size === 0) return sparql;\n\n  const stubs = [...usedPrefixes].map(p => `PREFIX ${p}: <urn:rqb:prefix:${p}:>`).join('\\n');\n  return stubs + '\\n' + sparql;\n};\n\n// ─── Public API ──────────────────────────────────────────────────────────────\n\n/**\n * Options for {@link parseSPARQL}.\n */\nexport interface ParseSPARQLOptions {\n  independentCombinators?: boolean;\n}\n\n/**\n * Parses a SPARQL query string into a {@link DefaultRuleGroupType}.\n *\n * Accepts a full SPARQL query or a `FILTER` expression. Triple patterns are\n * consumed but discarded — only FILTER conditions are returned.\n *\n * @example\n * ```ts\n * // Full query — extracts FILTER conditions only\n * parseSPARQL('SELECT ?x WHERE { ?x foaf:name ?name . FILTER(?age > 30) }');\n *\n * // Bare FILTER expression wrapped in a stub query\n * parseSPARQL('?age > 30 && ?name != \"Alice\"');\n * ```\n */\nexport function parseSPARQL(sparql: string): DefaultRuleGroupType;\nexport function parseSPARQL(\n  sparql: string,\n  options: Omit<ParseSPARQLOptions, 'independentCombinators'> & {\n    independentCombinators?: false;\n  }\n): DefaultRuleGroupType;\nexport function parseSPARQL(\n  sparql: string,\n  options: Omit<ParseSPARQLOptions, 'independentCombinators'> & {\n    independentCombinators: true;\n  }\n): DefaultRuleGroupTypeIC;\nexport function parseSPARQL(\n  sparql: string,\n  _options?: ParseSPARQLOptions\n): DefaultRuleGroupTypeAny {\n  const trimmed = sparql.trim();\n  if (!trimmed) return { combinator: 'and', rules: [] };\n\n  // Auto-detect input shape\n  let input = trimmed;\n  if (/^\\s*(select|prefix|construct|describe|ask)\\b/i.test(input)) {\n    // Full SPARQL query — parse as-is\n  } else {\n    // Bare expression — wrap in a stub query with FILTER\n    input = `SELECT * WHERE { FILTER(${input}) }`;\n  }\n\n  const prepared = ensurePrefixes(input);\n\n  let ast: unknown;\n  try {\n    ast = getParser().parse(prepared);\n  } catch {\n    return { combinator: 'and', rules: [] };\n  }\n\n  const typed = ast as TraqulaQuery;\n  if (!typed || typed.type !== 'query' || !typed.where) {\n    return { combinator: 'and', rules: [] };\n  }\n\n  const rules: (DefaultRuleType | DefaultRuleGroupType)[] = [];\n  visitPatterns(typed.where.patterns ?? [], rules);\n  return { combinator: 'and', rules };\n}\n"],"mappings":";;;;AASA,IAAI;AACJ,MAAM,kBAAgC;CACpC,IAAI,CAAC,gBACH,iBAAiB,IAAIA,2BAAAA,OAAa;CAEpC,OAAO;AACT;;AAgFA,MAAM,gBAAgB,SAA8B;CAClD,IAAI,KAAK,SAAS,QAChB,QAAQ,KAAK,SAAb;EACE,KAAK,YACH,OAAO,IAAI,KAAK;EAClB,KAAK;GACH,IAAI,KAAK,WAAW,KAAA,KAAa,KAAK,WAAW,IAC/C,OAAO,GAAG,KAAK,OAAO,GAAG,KAAK;GAEhC,OAAO,KAAK,SAAS;EACvB,KAAK,WACH,OAAO,KAAK,SAAS;EACvB,KAAK,aACH,OAAO,KAAM,KAA4B,SAAS;EACpD,SACE,OAAO,KAAK,SAAS;CACzB;CAEF,OAAO;AACT;;AAGA,MAAM,sBAAsB,SAAmD;CAC7E,IAAI,KAAK,SAAS,UAAU,KAAK,YAAY,WAAW;EACtD,MAAM,MAAM,KAAK,SAAS;EAC1B,IAAI,KAAK,aAAa,OAAO,KAAK,cAAc,UAAU;GAExD,MAAM,WADM,KAAK,UACI,SAAS;GAC9B,IACE,SAAS,SAAS,UAAU,KAC5B,SAAS,SAAS,UAAU,KAC5B,SAAS,SAAS,SAAS,KAC3B,SAAS,SAAS,QAAQ,GAE1B,OAAO,OAAO,GAAG;GAEnB,IAAI,SAAS,SAAS,UAAU,GAC9B,OAAO,QAAQ;EAEnB;EACA,MAAM,MAAM,OAAO,GAAG;EACtB,IAAI,QAAQ,MAAM,CAAC,OAAO,MAAM,GAAG,GAAG,OAAO;EAC7C,OAAO;CACT;CACA,IAAI,KAAK,SAAS,UAAU,KAAK,YAAY,YAC3C,OAAO,IAAI,KAAK;CAElB,IAAI,KAAK,SAAS,UAAU,KAAK,YAAY,aAC3C,OAAO,aAAa,IAAmB;CAEzC,OAAO,KAAK,SAAS;AACvB;;AAGA,MAAM,iBACJ,UACA,QACS;CACT,KAAK,MAAM,KAAK,UACd,IAAI,EAAE,SAAS,WACb,QAAQ,EAAE,SAAV;EACE,KAAK,OAEH;EACF,KAAK;GACH,cAAe,EAAsB,UAAU,GAAG;GAClD;EACF,KAAK;GACH,YAAa,EAAoB,YAAY,GAAG;GAChD;EACF,KAAK;GACH,cAAe,EAA0B,UAAU,GAAG;GACtD;EACF,KAAK,SAAS;GACZ,MAAM,QAAQ;GACd,MAAM,WAAuD,CAAC;GAC9D,KAAK,MAAM,UAAU,MAAM,UAAU;IACnC,MAAM,cAA0D,CAAC;IACjE,cAAc,OAAO,UAAU,WAAW;IAC1C,IAAI,YAAY,WAAW,GACzB,SAAS,KAAK,YAAY,EAAE;SACvB,IAAI,YAAY,SAAS,GAC9B,SAAS,KAAK;KAAE,YAAY;KAAO,OAAO;IAAY,CAAC;GAE3D;GACA,IAAI,SAAS,SAAS,GACpB,IAAI,KAAK;IAAE,YAAY;IAAM,OAAO;GAAS,CAAC;GAEhD;EACF;EACA,SACE;CACJ;AAGN;;AAGA,MAAM,gBAAwC;CAC5C,KAAK;CACL,MAAM;CACN,KAAK;CACL,KAAK;CACL,MAAM;CACN,MAAM;AACR;;AAGA,MAAM,eACJ,MACA,QACS;CACT,IAAI,KAAK,SAAS,gBAAgB,KAAK,YAAY,aAAa;EAC9D,MAAM,KAAK,KAAK,YAAY;EAC5B,MAAM,OAAO,KAAK,QAAQ,CAAC;EAG3B,IAAI,OAAO,MAAM;GACf,KAAK,MAAM,OAAO,MAChB,YAAY,KAA0B,GAAG;GAE3C;EACF;EACA,IAAI,OAAO,MAAM;GACf,MAAM,WAAuD,CAAC;GAC9D,KAAK,MAAM,OAAO,MAAM;IACtB,MAAM,cAA0D,CAAC;IACjE,YAAY,KAA0B,WAAW;IACjD,SAAS,KAAK,GAAG,WAAW;GAC9B;GACA,IAAI,KAAK;IAAE,YAAY;IAAM,OAAO;GAAS,CAAC;GAC9C;EACF;EAGA,IAAI,OAAO;OACL,KAAK,WAAW,GAAG;IACrB,MAAM,QAAQ,KAAK;IAEnB,IACE,MAAM,SAAS,gBACf,MAAM,YAAY,eAClB,MAAM,aAAa,SACnB;KACA,MAAM,QAAQ,aAAc,MAAM,OAAO,MAAM,CAAC,CAAiB;KACjE,IAAI,KAAK;MAAE;MAAO,UAAU;MAAQ,OAAO;KAAK,CAAoB;KACpE;IACF;IACA,MAAM,aAAyD,CAAC;IAChE,YAAY,OAAO,UAAU;IAC7B,IAAI,WAAW,WAAW,KAAK,EAAE,gBAAgB,WAAW,KAC1D,IAAI,KAAK,WAAW,WAAW,EAAE,CAAC;SAElC,IAAI,KAAK;KAAE,YAAY;KAAO,KAAK;KAAM,OAAO;IAAW,CAAC;IAE9D;GACF;;EAIF,IAAI,MAAM,iBAAiB,KAAK,WAAW,GAAG;GAC5C,MAAM,QAAQ,aAAa,KAAK,EAAiB;GACjD,MAAM,QAAQ,mBAAmB,KAAK,EAAuB;GAC7D,IAAI,KAAK;IAAE;IAAO,UAAU,cAAc;IAAK;GAAM,CAAoB;GACzE;EACF;EAGA,IAAI,OAAO,WAAW,KAAK,WAAW,GAAG;GACvC,MAAM,QAAQ,aAAa,KAAK,EAAiB;GACjD,IAAI,KAAK;IAAE;IAAO,UAAU;IAAW,OAAO;GAAK,CAAoB;GACvE;EACF;EAGA,IAAI,OAAO,cAAc,KAAK,WAAW,GAAG;GAC1C,MAAM,QAAQ,aAAa,KAAK,EAAiB;GACjD,MAAM,QAAQ,mBAAmB,KAAK,EAAuB;GAC7D,IAAI,KAAK;IAAE;IAAO,UAAU;IAAY;GAAM,CAAoB;GAClE;EACF;EACA,IAAI,OAAO,eAAe,KAAK,WAAW,GAAG;GAC3C,MAAM,QAAQ,aAAa,KAAK,EAAiB;GACjD,MAAM,QAAQ,mBAAmB,KAAK,EAAuB;GAC7D,IAAI,KAAK;IAAE;IAAO,UAAU;IAAc;GAAM,CAAoB;GACpE;EACF;EACA,IAAI,OAAO,aAAa,KAAK,WAAW,GAAG;GACzC,MAAM,QAAQ,aAAa,KAAK,EAAiB;GACjD,MAAM,QAAQ,mBAAmB,KAAK,EAAuB;GAC7D,IAAI,KAAK;IAAE;IAAO,UAAU;IAAY;GAAM,CAAoB;GAClE;EACF;CACF;AACF;;AAGA,MAAM,cAAc,SAA2C;CAC7D,MAAM,SAAiC;EACrC,UAAU;EACV,YAAY;EACZ,UAAU;EACV,SAAS;EACT,MAAM;EACN,KAAK;EACL,MAAM;EACN,KAAK;EACL,KAAK;EACL,MAAM;EACN,MAAM;CACR;CACA,OAAO;EAAE,GAAG;EAAM,UAAU,OAAO,KAAK,aAAa,KAAK;CAAS;AACrE;;;;;AAMA,MAAM,kBAAkB,WAA2B;CACjD,MAAM,mCAAmB,IAAI,IAAY;CACzC,MAAM,kBAAkB;CACxB,IAAI;CACJ,QAAQ,IAAI,gBAAgB,KAAK,MAAM,OAAO,MAC5C,iBAAiB,IAAI,EAAE,GAAG,YAAY,CAAC;CAGzC,MAAM,+BAAe,IAAI,IAAY;CACrC,MAAM,mBAAmB;CACzB,QAAQ,IAAI,iBAAiB,KAAK,MAAM,OAAO,MAAM;EACnD,MAAM,SAAS,EAAE;EACjB,IAAI,YAAY,KAAK,MAAM,KAAK,SAAS,KAAK,MAAM,GAAG;EACvD,MAAM,SAAS,OAAO,MAAM,GAAG,EAAE,KAAK;EAGtC,IAFiB,OAAO,YAAY,GAEzB,IADO,OAAO,YAAY,GACd,GAAG;EAC1B,IAAI,CAAC,iBAAiB,IAAI,OAAO,YAAY,CAAC,GAC5C,aAAa,IAAI,MAAM;CAE3B;CAEA,IAAI,aAAa,SAAS,GAAG,OAAO;CAGpC,OADc,CAAC,GAAG,YAAY,EAAE,KAAI,MAAK,UAAU,EAAE,oBAAoB,EAAE,GAAG,EAAE,KAAK,IAC1E,IAAI,OAAO;AACxB;AAuCA,SAAgB,YACd,QACA,UACyB;CACzB,MAAM,UAAU,OAAO,KAAK;CAC5B,IAAI,CAAC,SAAS,OAAO;EAAE,YAAY;EAAO,OAAO,CAAC;CAAE;CAGpD,IAAI,QAAQ;CACZ,IAAI,gDAAgD,KAAK,KAAK,GAAG,CAEjE,OAEE,QAAQ,2BAA2B,MAAM;CAG3C,MAAM,WAAW,eAAe,KAAK;CAErC,IAAI;CACJ,IAAI;EACF,MAAM,UAAU,EAAE,MAAM,QAAQ;CAClC,QAAQ;EACN,OAAO;GAAE,YAAY;GAAO,OAAO,CAAC;EAAE;CACxC;CAEA,MAAM,QAAQ;CACd,IAAI,CAAC,SAAS,MAAM,SAAS,WAAW,CAAC,MAAM,OAC7C,OAAO;EAAE,YAAY;EAAO,OAAO,CAAC;CAAE;CAGxC,MAAM,QAAoD,CAAC;CAC3D,cAAc,MAAM,MAAM,YAAY,CAAC,GAAG,KAAK;CAC/C,OAAO;EAAE,YAAY;EAAO;CAAM;AACpC"}
+{"version":3,"file":"parseSPARQL.js","names":["SparqlParser"],"sources":["../src/utils/parseSPARQL/parseSPARQL.ts"],"sourcesContent":["import { Parser as SparqlParser } from '@traqula/parser-sparql-1-2';\nimport type {\n  DefaultRuleGroupType,\n  DefaultRuleGroupTypeAny,\n  DefaultRuleGroupTypeIC,\n  DefaultRuleType,\n} from '../../types';\n\n// Reuse a single parser instance (Chevrotain-backed; creating parsers is expensive)\nlet parserInstance: SparqlParser | undefined;\nconst getParser = (): SparqlParser => {\n  if (!parserInstance) {\n    parserInstance = new SparqlParser();\n  }\n  return parserInstance;\n};\n\n// ─── Traqula AST Type Subset ─────────────────────────────────────────────────\n\ninterface TraqulaQuery {\n  type: 'query';\n  subType: string;\n  where?: TraqulaPatternGroup;\n  [key: string]: unknown;\n}\n\ninterface TraqulaPatternGroup {\n  type: 'pattern';\n  subType: 'group';\n  patterns: TraqulaPattern[];\n}\n\ntype TraqulaPattern =\n  | TraqulaBgp\n  | TraqulaOptional\n  | TraqulaFilter\n  | TraqulaPatternGroup\n  | TraqulaUnion\n  | { type: 'pattern'; subType: string; [key: string]: unknown }\n  | TraqulaQuery;\n\ninterface TraqulaBgp {\n  type: 'pattern';\n  subType: 'bgp';\n  triples: TraqulaTriple[];\n}\n\ninterface TraqulaOptional {\n  type: 'pattern';\n  subType: 'optional';\n  patterns: TraqulaPattern[];\n}\n\ninterface TraqulaFilter {\n  type: 'pattern';\n  subType: 'filter';\n  expression: TraqulaExpression;\n}\n\ninterface TraqulaUnion {\n  type: 'pattern';\n  subType: 'union';\n  patterns: TraqulaPatternGroup[];\n}\n\ninterface TraqulaTriple {\n  type: 'triple';\n  subject: TraqulaTerm;\n  predicate: TraqulaTerm;\n  object: TraqulaTerm;\n}\n\ninterface TraqulaTerm {\n  type: 'term' | 'path' | 'wildcard';\n  subType?: string;\n  value?: string;\n  prefix?: string;\n  langOrIri?: unknown;\n  [key: string]: unknown;\n}\n\ninterface TraqulaExpression {\n  type: 'expression' | 'term';\n  subType: string;\n  operator?: string;\n  args?: (TraqulaExpression | TraqulaTerm)[];\n  value?: string;\n  prefix?: string;\n  langOrIri?: unknown;\n  [key: string]: unknown;\n}\n\n// ─── AST Walker ──────────────────────────────────────────────────────────────\n\n/** Serializes a Traqula term into a user-facing string. */\nconst termToString = (term: TraqulaTerm): string => {\n  if (term.type === 'term') {\n    switch (term.subType) {\n      case 'variable':\n        return `?${term.value}`;\n      case 'namedNode':\n        if (term.prefix !== undefined && term.prefix !== '') {\n          return `${term.prefix}:${term.value}`;\n        }\n        return term.value ?? '';\n      case 'literal':\n        return term.value ?? '';\n      case 'blankNode':\n        return `_:${(term as { label?: string }).label ?? ''}`;\n      default:\n        return term.value ?? '';\n    }\n  }\n  return '';\n};\n\n/** Extracts a literal JS value from a Traqula term. */\nconst termToLiteralValue = (term: TraqulaTerm | TraqulaExpression): unknown => {\n  if (term.type === 'term' && term.subType === 'literal') {\n    const raw = term.value ?? '';\n    if (term.langOrIri && typeof term.langOrIri === 'object') {\n      const iri = term.langOrIri as TraqulaTerm;\n      const datatype = iri.value ?? '';\n      if (\n        datatype.endsWith('#integer') ||\n        datatype.endsWith('#decimal') ||\n        datatype.endsWith('#double') ||\n        datatype.endsWith('#float')\n      ) {\n        return Number(raw);\n      }\n      if (datatype.endsWith('#boolean')) {\n        return raw === 'true';\n      }\n    }\n    const num = Number(raw);\n    if (raw !== '' && !Number.isNaN(num)) return num;\n    return raw;\n  }\n  if (term.type === 'term' && term.subType === 'variable') {\n    return `?${term.value}`;\n  }\n  if (term.type === 'term' && term.subType === 'namedNode') {\n    return termToString(term as TraqulaTerm);\n  }\n  return term.value ?? '';\n};\n\n/** Walks patterns, extracting only FILTER expressions (skipping BGP triples). */\nconst visitPatterns = (\n  patterns: TraqulaPattern[],\n  out: (DefaultRuleType | DefaultRuleGroupType)[]\n): void => {\n  for (const p of patterns) {\n    if (p.type === 'pattern') {\n      switch (p.subType) {\n        case 'bgp':\n          // Skip triple patterns — Phase 1 only extracts filter conditions\n          break;\n        case 'optional':\n          visitPatterns((p as TraqulaOptional).patterns, out);\n          break;\n        case 'filter':\n          visitFilter((p as TraqulaFilter).expression, out);\n          break;\n        case 'group':\n          visitPatterns((p as TraqulaPatternGroup).patterns, out);\n          break;\n        case 'union': {\n          const union = p as TraqulaUnion;\n          const subRules: (DefaultRuleType | DefaultRuleGroupType)[] = [];\n          for (const branch of union.patterns) {\n            const branchRules: (DefaultRuleType | DefaultRuleGroupType)[] = [];\n            visitPatterns(branch.patterns, branchRules);\n            if (branchRules.length === 1) {\n              subRules.push(branchRules[0]);\n            } else if (branchRules.length > 1) {\n              subRules.push({ combinator: 'and', rules: branchRules });\n            }\n          }\n          if (subRules.length > 0) {\n            out.push({ combinator: 'or', rules: subRules });\n          }\n          break;\n        }\n        default:\n          break;\n      }\n    }\n  }\n};\n\n/** Maps a SPARQL comparison operator string to an RQB operator. */\nconst sparqlOpToRqb: Record<string, string> = {\n  '=': '=',\n  '!=': '!=',\n  '<': '<',\n  '>': '>',\n  '<=': '<=',\n  '>=': '>=',\n};\n\n/** Converts a FILTER expression into rules. */\nconst visitFilter = (\n  expr: TraqulaExpression,\n  out: (DefaultRuleType | DefaultRuleGroupType)[]\n): void => {\n  if (expr.type === 'expression' && expr.subType === 'operation') {\n    const op = expr.operator ?? '';\n    const args = expr.args ?? [];\n\n    // Logical operators\n    if (op === '&&') {\n      for (const arg of args) {\n        visitFilter(arg as TraqulaExpression, out);\n      }\n      return;\n    }\n    if (op === '||') {\n      const subRules: (DefaultRuleType | DefaultRuleGroupType)[] = [];\n      for (const arg of args) {\n        const branchRules: (DefaultRuleType | DefaultRuleGroupType)[] = [];\n        visitFilter(arg as TraqulaExpression, branchRules);\n        subRules.push(...branchRules);\n      }\n      out.push({ combinator: 'or', rules: subRules });\n      return;\n    }\n\n    // Negation\n    if (op === '!') {\n      if (args.length === 1) {\n        const inner = args[0] as TraqulaExpression;\n        // !BOUND(x) → null check\n        if (\n          inner.type === 'expression' &&\n          inner.subType === 'operation' &&\n          inner.operator === 'bound'\n        ) {\n          const field = termToString((inner.args?.[0] ?? {}) as TraqulaTerm);\n          out.push({ field, operator: 'null', value: null } as DefaultRuleType);\n          return;\n        }\n        const innerRules: (DefaultRuleType | DefaultRuleGroupType)[] = [];\n        visitFilter(inner, innerRules);\n        if (innerRules.length === 1 && !('combinator' in innerRules[0])) {\n          out.push(negateRule(innerRules[0]));\n        } else {\n          out.push({ combinator: 'and', not: true, rules: innerRules });\n        }\n        return;\n      }\n    }\n\n    // Comparison operators\n    if (op in sparqlOpToRqb && args.length === 2) {\n      const field = termToString(args[0] as TraqulaTerm);\n      const value = termToLiteralValue(args[1] as TraqulaExpression);\n      out.push({ field, operator: sparqlOpToRqb[op], value } as DefaultRuleType);\n      return;\n    }\n\n    // BOUND(?x) → notNull\n    if (op === 'bound' && args.length === 1) {\n      const field = termToString(args[0] as TraqulaTerm);\n      out.push({ field, operator: 'notNull', value: null } as DefaultRuleType);\n      return;\n    }\n\n    // String functions\n    if (op === 'contains' && args.length === 2) {\n      const field = termToString(args[0] as TraqulaTerm);\n      const value = termToLiteralValue(args[1] as TraqulaExpression);\n      out.push({ field, operator: 'contains', value } as DefaultRuleType);\n      return;\n    }\n    if (op === 'strstarts' && args.length === 2) {\n      const field = termToString(args[0] as TraqulaTerm);\n      const value = termToLiteralValue(args[1] as TraqulaExpression);\n      out.push({ field, operator: 'beginsWith', value } as DefaultRuleType);\n      return;\n    }\n    if (op === 'strends' && args.length === 2) {\n      const field = termToString(args[0] as TraqulaTerm);\n      const value = termToLiteralValue(args[1] as TraqulaExpression);\n      out.push({ field, operator: 'endsWith', value } as DefaultRuleType);\n      return;\n    }\n  }\n};\n\n/** Negates a rule by converting its operator. */\nconst negateRule = (rule: DefaultRuleType): DefaultRuleType => {\n  const negMap: Record<string, string> = {\n    contains: 'doesNotContain',\n    beginsWith: 'doesNotBeginWith',\n    endsWith: 'doesNotEndWith',\n    notNull: 'null',\n    null: 'notNull',\n    '=': '!=',\n    '!=': '=',\n    '<': '>=',\n    '>': '<=',\n    '<=': '>',\n    '>=': '<',\n  };\n  return { ...rule, operator: negMap[rule.operator] ?? rule.operator } as DefaultRuleType;\n};\n\n/**\n * Ensures all prefixed names in a SPARQL query have corresponding PREFIX\n * declarations so the parser accepts them without requiring full URIs.\n */\nconst ensurePrefixes = (sparql: string): string => {\n  const declaredPrefixes = new Set<string>();\n  const prefixDeclRegex = /PREFIX\\s+(\\w*):/gi;\n  let m: RegExpExecArray | null;\n  while ((m = prefixDeclRegex.exec(sparql)) !== null) {\n    declaredPrefixes.add(m[1].toLowerCase());\n  }\n\n  const usedPrefixes = new Set<string>();\n  const prefixUsageRegex = /\\b(\\w+):\\w+/g;\n  while ((m = prefixUsageRegex.exec(sparql)) !== null) {\n    const prefix = m[1];\n    if (/^https?$/i.test(prefix) || /^urn$/i.test(prefix)) continue;\n    const before = sparql.slice(0, m.index);\n    const lastOpen = before.lastIndexOf('<');\n    const lastClose = before.lastIndexOf('>');\n    if (lastOpen > lastClose) continue;\n    if (!declaredPrefixes.has(prefix.toLowerCase())) {\n      usedPrefixes.add(prefix);\n    }\n  }\n\n  if (usedPrefixes.size === 0) return sparql;\n\n  const stubs = [...usedPrefixes].map(p => `PREFIX ${p}: <urn:rqb:prefix:${p}:>`).join('\\n');\n  return stubs + '\\n' + sparql;\n};\n\n// ─── Public API ──────────────────────────────────────────────────────────────\n\n/**\n * Options for {@link parseSPARQL}.\n */\nexport interface ParseSPARQLOptions {\n  independentCombinators?: boolean;\n}\n\n/**\n * Parses a SPARQL query string into a {@link DefaultRuleGroupType}.\n *\n * Accepts a full SPARQL query or a `FILTER` expression. Triple patterns are\n * consumed but discarded — only FILTER conditions are returned.\n *\n * @example\n * ```ts\n * // Full query — extracts FILTER conditions only\n * parseSPARQL('SELECT ?x WHERE { ?x foaf:name ?name . FILTER(?age > 30) }');\n *\n * // Bare FILTER expression wrapped in a stub query\n * parseSPARQL('?age > 30 && ?name != \"Alice\"');\n * ```\n */\nexport function parseSPARQL(sparql: string): DefaultRuleGroupType;\nexport function parseSPARQL(\n  sparql: string,\n  options: Omit<ParseSPARQLOptions, 'independentCombinators'> & {\n    independentCombinators?: false;\n  }\n): DefaultRuleGroupType;\nexport function parseSPARQL(\n  sparql: string,\n  options: Omit<ParseSPARQLOptions, 'independentCombinators'> & {\n    independentCombinators: true;\n  }\n): DefaultRuleGroupTypeIC;\nexport function parseSPARQL(\n  sparql: string,\n  _options?: ParseSPARQLOptions\n): DefaultRuleGroupTypeAny {\n  const trimmed = sparql.trim();\n  if (!trimmed) return { combinator: 'and', rules: [] };\n\n  // Auto-detect input shape\n  let input = trimmed;\n  if (/^\\s*(select|prefix|construct|describe|ask)\\b/i.test(input)) {\n    // Full SPARQL query — parse as-is\n  } else {\n    // Bare expression — wrap in a stub query with FILTER\n    input = `SELECT * WHERE { FILTER(${input}) }`;\n  }\n\n  const prepared = ensurePrefixes(input);\n\n  let ast: unknown;\n  try {\n    ast = getParser().parse(prepared);\n  } catch {\n    return { combinator: 'and', rules: [] };\n  }\n\n  const typed = ast as TraqulaQuery;\n  if (!typed || typed.type !== 'query' || !typed.where) {\n    return { combinator: 'and', rules: [] };\n  }\n\n  const rules: (DefaultRuleType | DefaultRuleGroupType)[] = [];\n  visitPatterns(typed.where.patterns ?? [], rules);\n  return { combinator: 'and', rules };\n}\n"],"mappings":";;;AASA,IAAI;AACJ,MAAM,kBAAgC;CACpC,IAAI,CAAC,gBACH,iBAAiB,IAAIA,2BAAAA,OAAa;CAEpC,OAAO;AACT;;AAgFA,MAAM,gBAAgB,SAA8B;CAClD,IAAI,KAAK,SAAS,QAChB,QAAQ,KAAK,SAAb;EACE,KAAK,YACH,OAAO,IAAI,KAAK;EAClB,KAAK;GACH,IAAI,KAAK,WAAW,KAAA,KAAa,KAAK,WAAW,IAC/C,OAAO,GAAG,KAAK,OAAO,GAAG,KAAK;GAEhC,OAAO,KAAK,SAAS;EACvB,KAAK,WACH,OAAO,KAAK,SAAS;EACvB,KAAK,aACH,OAAO,KAAM,KAA4B,SAAS;EACpD,SACE,OAAO,KAAK,SAAS;CACzB;CAEF,OAAO;AACT;;AAGA,MAAM,sBAAsB,SAAmD;CAC7E,IAAI,KAAK,SAAS,UAAU,KAAK,YAAY,WAAW;EACtD,MAAM,MAAM,KAAK,SAAS;EAC1B,IAAI,KAAK,aAAa,OAAO,KAAK,cAAc,UAAU;GAExD,MAAM,WADM,KAAK,UACI,SAAS;GAC9B,IACE,SAAS,SAAS,UAAU,KAC5B,SAAS,SAAS,UAAU,KAC5B,SAAS,SAAS,SAAS,KAC3B,SAAS,SAAS,QAAQ,GAE1B,OAAO,OAAO,GAAG;GAEnB,IAAI,SAAS,SAAS,UAAU,GAC9B,OAAO,QAAQ;EAEnB;EACA,MAAM,MAAM,OAAO,GAAG;EACtB,IAAI,QAAQ,MAAM,CAAC,OAAO,MAAM,GAAG,GAAG,OAAO;EAC7C,OAAO;CACT;CACA,IAAI,KAAK,SAAS,UAAU,KAAK,YAAY,YAC3C,OAAO,IAAI,KAAK;CAElB,IAAI,KAAK,SAAS,UAAU,KAAK,YAAY,aAC3C,OAAO,aAAa,IAAmB;CAEzC,OAAO,KAAK,SAAS;AACvB;;AAGA,MAAM,iBACJ,UACA,QACS;CACT,KAAK,MAAM,KAAK,UACd,IAAI,EAAE,SAAS,WACb,QAAQ,EAAE,SAAV;EACE,KAAK,OAEH;EACF,KAAK;GACH,cAAe,EAAsB,UAAU,GAAG;GAClD;EACF,KAAK;GACH,YAAa,EAAoB,YAAY,GAAG;GAChD;EACF,KAAK;GACH,cAAe,EAA0B,UAAU,GAAG;GACtD;EACF,KAAK,SAAS;GACZ,MAAM,QAAQ;GACd,MAAM,WAAuD,CAAC;GAC9D,KAAK,MAAM,UAAU,MAAM,UAAU;IACnC,MAAM,cAA0D,CAAC;IACjE,cAAc,OAAO,UAAU,WAAW;IAC1C,IAAI,YAAY,WAAW,GACzB,SAAS,KAAK,YAAY,EAAE;SACvB,IAAI,YAAY,SAAS,GAC9B,SAAS,KAAK;KAAE,YAAY;KAAO,OAAO;IAAY,CAAC;GAE3D;GACA,IAAI,SAAS,SAAS,GACpB,IAAI,KAAK;IAAE,YAAY;IAAM,OAAO;GAAS,CAAC;GAEhD;EACF;EACA,SACE;CACJ;AAGN;;AAGA,MAAM,gBAAwC;CAC5C,KAAK;CACL,MAAM;CACN,KAAK;CACL,KAAK;CACL,MAAM;CACN,MAAM;AACR;;AAGA,MAAM,eACJ,MACA,QACS;CACT,IAAI,KAAK,SAAS,gBAAgB,KAAK,YAAY,aAAa;EAC9D,MAAM,KAAK,KAAK,YAAY;EAC5B,MAAM,OAAO,KAAK,QAAQ,CAAC;EAG3B,IAAI,OAAO,MAAM;GACf,KAAK,MAAM,OAAO,MAChB,YAAY,KAA0B,GAAG;GAE3C;EACF;EACA,IAAI,OAAO,MAAM;GACf,MAAM,WAAuD,CAAC;GAC9D,KAAK,MAAM,OAAO,MAAM;IACtB,MAAM,cAA0D,CAAC;IACjE,YAAY,KAA0B,WAAW;IACjD,SAAS,KAAK,GAAG,WAAW;GAC9B;GACA,IAAI,KAAK;IAAE,YAAY;IAAM,OAAO;GAAS,CAAC;GAC9C;EACF;EAGA,IAAI,OAAO;OACL,KAAK,WAAW,GAAG;IACrB,MAAM,QAAQ,KAAK;IAEnB,IACE,MAAM,SAAS,gBACf,MAAM,YAAY,eAClB,MAAM,aAAa,SACnB;KACA,MAAM,QAAQ,aAAc,MAAM,OAAO,MAAM,CAAC,CAAiB;KACjE,IAAI,KAAK;MAAE;MAAO,UAAU;MAAQ,OAAO;KAAK,CAAoB;KACpE;IACF;IACA,MAAM,aAAyD,CAAC;IAChE,YAAY,OAAO,UAAU;IAC7B,IAAI,WAAW,WAAW,KAAK,EAAE,gBAAgB,WAAW,KAC1D,IAAI,KAAK,WAAW,WAAW,EAAE,CAAC;SAElC,IAAI,KAAK;KAAE,YAAY;KAAO,KAAK;KAAM,OAAO;IAAW,CAAC;IAE9D;GACF;;EAIF,IAAI,MAAM,iBAAiB,KAAK,WAAW,GAAG;GAC5C,MAAM,QAAQ,aAAa,KAAK,EAAiB;GACjD,MAAM,QAAQ,mBAAmB,KAAK,EAAuB;GAC7D,IAAI,KAAK;IAAE;IAAO,UAAU,cAAc;IAAK;GAAM,CAAoB;GACzE;EACF;EAGA,IAAI,OAAO,WAAW,KAAK,WAAW,GAAG;GACvC,MAAM,QAAQ,aAAa,KAAK,EAAiB;GACjD,IAAI,KAAK;IAAE;IAAO,UAAU;IAAW,OAAO;GAAK,CAAoB;GACvE;EACF;EAGA,IAAI,OAAO,cAAc,KAAK,WAAW,GAAG;GAC1C,MAAM,QAAQ,aAAa,KAAK,EAAiB;GACjD,MAAM,QAAQ,mBAAmB,KAAK,EAAuB;GAC7D,IAAI,KAAK;IAAE;IAAO,UAAU;IAAY;GAAM,CAAoB;GAClE;EACF;EACA,IAAI,OAAO,eAAe,KAAK,WAAW,GAAG;GAC3C,MAAM,QAAQ,aAAa,KAAK,EAAiB;GACjD,MAAM,QAAQ,mBAAmB,KAAK,EAAuB;GAC7D,IAAI,KAAK;IAAE;IAAO,UAAU;IAAc;GAAM,CAAoB;GACpE;EACF;EACA,IAAI,OAAO,aAAa,KAAK,WAAW,GAAG;GACzC,MAAM,QAAQ,aAAa,KAAK,EAAiB;GACjD,MAAM,QAAQ,mBAAmB,KAAK,EAAuB;GAC7D,IAAI,KAAK;IAAE;IAAO,UAAU;IAAY;GAAM,CAAoB;GAClE;EACF;CACF;AACF;;AAGA,MAAM,cAAc,SAA2C;CAC7D,MAAM,SAAiC;EACrC,UAAU;EACV,YAAY;EACZ,UAAU;EACV,SAAS;EACT,MAAM;EACN,KAAK;EACL,MAAM;EACN,KAAK;EACL,KAAK;EACL,MAAM;EACN,MAAM;CACR;CACA,OAAO;EAAE,GAAG;EAAM,UAAU,OAAO,KAAK,aAAa,KAAK;CAAS;AACrE;;;;;AAMA,MAAM,kBAAkB,WAA2B;CACjD,MAAM,mCAAmB,IAAI,IAAY;CACzC,MAAM,kBAAkB;CACxB,IAAI;CACJ,QAAQ,IAAI,gBAAgB,KAAK,MAAM,OAAO,MAC5C,iBAAiB,IAAI,EAAE,GAAG,YAAY,CAAC;CAGzC,MAAM,+BAAe,IAAI,IAAY;CACrC,MAAM,mBAAmB;CACzB,QAAQ,IAAI,iBAAiB,KAAK,MAAM,OAAO,MAAM;EACnD,MAAM,SAAS,EAAE;EACjB,IAAI,YAAY,KAAK,MAAM,KAAK,SAAS,KAAK,MAAM,GAAG;EACvD,MAAM,SAAS,OAAO,MAAM,GAAG,EAAE,KAAK;EAGtC,IAFiB,OAAO,YAAY,GAEzB,IADO,OAAO,YAAY,GACd,GAAG;EAC1B,IAAI,CAAC,iBAAiB,IAAI,OAAO,YAAY,CAAC,GAC5C,aAAa,IAAI,MAAM;CAE3B;CAEA,IAAI,aAAa,SAAS,GAAG,OAAO;CAGpC,OADc,CAAC,GAAG,YAAY,EAAE,KAAI,MAAK,UAAU,EAAE,oBAAoB,EAAE,GAAG,EAAE,KAAK,IAC1E,IAAI,OAAO;AACxB;AAuCA,SAAgB,YACd,QACA,UACyB;CACzB,MAAM,UAAU,OAAO,KAAK;CAC5B,IAAI,CAAC,SAAS,OAAO;EAAE,YAAY;EAAO,OAAO,CAAC;CAAE;CAGpD,IAAI,QAAQ;CACZ,IAAI,gDAAgD,KAAK,KAAK,GAAG,CAEjE,OAEE,QAAQ,2BAA2B,MAAM;CAG3C,MAAM,WAAW,eAAe,KAAK;CAErC,IAAI;CACJ,IAAI;EACF,MAAM,UAAU,EAAE,MAAM,QAAQ;CAClC,QAAQ;EACN,OAAO;GAAE,YAAY;GAAO,OAAO,CAAC;EAAE;CACxC;CAEA,MAAM,QAAQ;CACd,IAAI,CAAC,SAAS,MAAM,SAAS,WAAW,CAAC,MAAM,OAC7C,OAAO;EAAE,YAAY;EAAO,OAAO,CAAC;CAAE;CAGxC,MAAM,QAAoD,CAAC;CAC3D,cAAc,MAAM,MAAM,YAAY,CAAC,GAAG,KAAK;CAC/C,OAAO;EAAE,YAAY;EAAO;CAAM;AACpC"}

package/dist/parseSQL.d.mts

@@ -1,5 +1,5 @@
-import { E as DefaultRuleGroupType, j as Except, x as DefaultRuleGroupTypeIC } from "./index-AAZg4Uh1.mjs";
-import { t as ParserCommonOptions } from "./import-BC_bAKQ8.mjs";
+import { E as DefaultRuleGroupType, j as Except, x as DefaultRuleGroupTypeIC } from "./index-CREDWM32.mjs";
+import { t as ParserCommonOptions } from "./import-BQ5xaW6i.mjs";
 
 //#region src/utils/parseSQL/parseSQL.d.ts
 /**

package/dist/parseSQL.d.ts

@@ -1,5 +1,5 @@
-import { E as DefaultRuleGroupType, j as Except, x as DefaultRuleGroupTypeIC } from "./index-Ds06V0zO.js";
-import { t as ParserCommonOptions } from "./import-D1KnXhkQ.js";
+import { E as DefaultRuleGroupType, j as Except, x as DefaultRuleGroupTypeIC } from "./index-CREDWM32.js";
+import { t as ParserCommonOptions } from "./import-CSHMjlid.js";
 
 //#region src/utils/parseSQL/parseSQL.d.ts
 /**

package/dist/parseSQL.js

@@ -1,8 +1,7 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_utils = require("./utils-Qwkq2Q0F.js");
-const require_objectUtils = require("./objectUtils-Bzug_QfX.js");
-const require_prepareQueryObjects = require("./prepareQueryObjects-BoG5Rt8z.js");
-require("./parseJSONata.js");
+const require_utils = require("./utils-ZlKseh1X.js");
+const require_objectUtils = require("./objectUtils-DxVaGCdg.js");
+const require_prepareQueryObjects = require("./prepareQueryObjects-gRQqiBPR.js");
 let _ts_jison_parser = require("@ts-jison/parser");
 let _ts_jison_lexer = require("@ts-jison/lexer");
 //#region src/utils/parseSQL/sqlParser.ts