@triedotdev/mcp 1.0.168 → 1.0.170

package/dist/chunk-6NLHFIYA.js

@@ -1,344 +0,0 @@
-// src/trie/trie.ts
-var Trie = class _Trie {
-  root;
-  size = 0;
-  constructor() {
-    this.root = this.createNode();
-  }
-  createNode() {
-    return {
-      children: /* @__PURE__ */ new Map(),
-      isEnd: false
-    };
-  }
-  /**
-   * Insert a pattern into the trie
-   * O(m) where m = pattern length
-   */
-  insert(pattern, value, metadata) {
-    let node = this.root;
-    for (const char of pattern) {
-      if (!node.children.has(char)) {
-        node.children.set(char, this.createNode());
-      }
-      node = node.children.get(char);
-    }
-    node.isEnd = true;
-    if (value !== void 0) {
-      node.value = value;
-    }
-    if (metadata !== void 0) {
-      node.metadata = metadata;
-    }
-    this.size++;
-  }
-  /**
-   * Search for an exact pattern
-   * O(m) where m = pattern length
-   */
-  search(pattern) {
-    let node = this.root;
-    for (const char of pattern) {
-      if (!node.children.has(char)) {
-        return { found: false };
-      }
-      node = node.children.get(char);
-    }
-    const result = {
-      found: node.isEnd
-    };
-    if (node.value !== void 0) {
-      result.value = node.value;
-    }
-    if (node.metadata !== void 0) {
-      result.metadata = node.metadata;
-    }
-    return result;
-  }
-  /**
-   * Check if any pattern starts with the given prefix
-   * O(m) where m = prefix length
-   */
-  startsWith(prefix) {
-    let node = this.root;
-    for (const char of prefix) {
-      if (!node.children.has(char)) {
-        return false;
-      }
-      node = node.children.get(char);
-    }
-    return true;
-  }
-  /**
-   * Find all patterns that match within the given text
-   * Uses Aho-Corasick-like multi-pattern matching
-   * O(n + m) where n = text length, m = total matches
-   */
-  findAllMatches(text) {
-    const matches = [];
-    const lines = text.split("\n");
-    let globalPos = 0;
-    for (let lineNum = 0; lineNum < lines.length; lineNum++) {
-      const line = lines[lineNum];
-      for (let i = 0; i < line.length; i++) {
-        let node = this.root;
-        let matchLen = 0;
-        let j = i;
-        while (j < line.length && node.children.has(line[j])) {
-          node = node.children.get(line[j]);
-          matchLen++;
-          j++;
-          if (node.isEnd) {
-            const matchResult = {
-              pattern: line.substring(i, i + matchLen),
-              position: globalPos + i,
-              line: lineNum + 1,
-              column: i + 1
-            };
-            if (node.value !== void 0) {
-              matchResult.value = node.value;
-            }
-            if (node.metadata !== void 0) {
-              matchResult.metadata = node.metadata;
-            }
-            matches.push(matchResult);
-          }
-        }
-      }
-      globalPos += line.length + 1;
-    }
-    return matches;
-  }
-  /**
-   * Find the longest matching prefix at a position
-   * O(m) where m = longest pattern length
-   */
-  findLongestMatch(text, startPos = 0) {
-    let node = this.root;
-    let lastMatch = null;
-    let matchLen = 0;
-    for (let i = startPos; i < text.length; i++) {
-      const char = text[i];
-      if (!node.children.has(char)) {
-        break;
-      }
-      node = node.children.get(char);
-      matchLen++;
-      if (node.isEnd) {
-        lastMatch = {
-          pattern: text.substring(startPos, startPos + matchLen),
-          position: startPos,
-          line: this.getLineNumber(text, startPos),
-          column: this.getColumnNumber(text, startPos)
-        };
-        if (node.value !== void 0) {
-          lastMatch.value = node.value;
-        }
-        if (node.metadata !== void 0) {
-          lastMatch.metadata = node.metadata;
-        }
-      }
-    }
-    return lastMatch;
-  }
-  /**
-   * Get all patterns with a given prefix
-   * O(p + n) where p = prefix length, n = number of matches
-   */
-  getWithPrefix(prefix) {
-    let node = this.root;
-    for (const char of prefix) {
-      if (!node.children.has(char)) {
-        return [];
-      }
-      node = node.children.get(char);
-    }
-    const results = [];
-    this.collectPatterns(node, prefix, results);
-    return results;
-  }
-  collectPatterns(node, prefix, results) {
-    if (node.isEnd) {
-      const entry = { pattern: prefix };
-      if (node.value !== void 0) {
-        entry.value = node.value;
-      }
-      if (node.metadata !== void 0) {
-        entry.metadata = node.metadata;
-      }
-      results.push(entry);
-    }
-    for (const [char, child] of node.children) {
-      this.collectPatterns(child, prefix + char, results);
-    }
-  }
-  getLineNumber(text, position) {
-    let line = 1;
-    for (let i = 0; i < position && i < text.length; i++) {
-      if (text[i] === "\n") line++;
-    }
-    return line;
-  }
-  getColumnNumber(text, position) {
-    let column = 1;
-    for (let i = position - 1; i >= 0 && text[i] !== "\n"; i--) {
-      column++;
-    }
-    return column;
-  }
-  /**
-   * Get the number of patterns in the trie
-   */
-  getSize() {
-    return this.size;
-  }
-  /**
-   * Clear all patterns
-   */
-  clear() {
-    this.root = this.createNode();
-    this.size = 0;
-  }
-  /**
-   * Serialize trie to JSON for persistence
-   */
-  toJSON() {
-    return this.serializeNode(this.root);
-  }
-  serializeNode(node) {
-    const children = {};
-    for (const [char, child] of node.children) {
-      children[char] = this.serializeNode(child);
-    }
-    return {
-      children,
-      isEnd: node.isEnd,
-      value: node.value,
-      metadata: node.metadata
-    };
-  }
-  /**
-   * Load trie from JSON
-   */
-  static fromJSON(json) {
-    const trie = new _Trie();
-    trie.root = trie.deserializeNode(json);
-    return trie;
-  }
-  deserializeNode(data) {
-    const node = this.createNode();
-    node.isEnd = data.isEnd;
-    node.value = data.value;
-    node.metadata = data.metadata;
-    for (const [char, childData] of Object.entries(data.children)) {
-      node.children.set(char, this.deserializeNode(childData));
-    }
-    return node;
-  }
-};
-var AhoCorasick = class {
-  root;
-  built = false;
-  constructor() {
-    this.root = this.createNode();
-  }
-  createNode() {
-    return {
-      children: /* @__PURE__ */ new Map(),
-      fail: null,
-      output: []
-    };
-  }
-  /**
-   * Add a pattern to the automaton
-   */
-  addPattern(pattern, value, metadata) {
-    let node = this.root;
-    for (const char of pattern) {
-      if (!node.children.has(char)) {
-        node.children.set(char, this.createNode());
-      }
-      node = node.children.get(char);
-    }
-    const outputEntry = { pattern };
-    if (value !== void 0) {
-      outputEntry.value = value;
-    }
-    if (metadata !== void 0) {
-      outputEntry.metadata = metadata;
-    }
-    node.output.push(outputEntry);
-    this.built = false;
-  }
-  /**
-   * Build failure links (call after adding all patterns)
-   */
-  build() {
-    const queue = [];
-    for (const child of this.root.children.values()) {
-      child.fail = this.root;
-      queue.push(child);
-    }
-    while (queue.length > 0) {
-      const current = queue.shift();
-      for (const [char, child] of current.children) {
-        queue.push(child);
-        let fail = current.fail;
-        while (fail !== null && !fail.children.has(char)) {
-          fail = fail.fail;
-        }
-        child.fail = fail ? fail.children.get(char) : this.root;
-        if (child.fail !== this.root) {
-          child.output = [...child.output, ...child.fail.output];
-        }
-      }
-    }
-    this.built = true;
-  }
-  /**
-   * Search text for all pattern matches
-   * O(n + z) where n = text length, z = number of matches
-   */
-  search(text) {
-    if (!this.built) {
-      this.build();
-    }
-    const matches = [];
-    let node = this.root;
-    let line = 1;
-    let lineStart = 0;
-    for (let i = 0; i < text.length; i++) {
-      const char = text[i];
-      if (char === "\n") {
-        line++;
-        lineStart = i + 1;
-      }
-      while (node !== this.root && !node.children.has(char)) {
-        node = node.fail || this.root;
-      }
-      node = node.children.get(char) || this.root;
-      for (const output of node.output) {
-        const matchResult = {
-          pattern: output.pattern,
-          position: i - output.pattern.length + 1,
-          line,
-          column: i - output.pattern.length + 1 - lineStart + 1
-        };
-        if (output.value !== void 0) {
-          matchResult.value = output.value;
-        }
-        if (output.metadata !== void 0) {
-          matchResult.metadata = output.metadata;
-        }
-        matches.push(matchResult);
-      }
-    }
-    return matches;
-  }
-};
-
-export {
-  Trie,
-  AhoCorasick
-};
-//# sourceMappingURL=chunk-6NLHFIYA.js.map

package/dist/chunk-6NLHFIYA.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/trie/trie.ts"],"sourcesContent":["/**\n * Trie Data Structure\n * \n * A prefix tree for O(m) pattern matching where m = pattern length.\n * Used for:\n * - Fast vulnerability signature matching\n * - Code symbol indexing\n * - Pattern-based triaging\n */\n\nexport interface TrieNode<T = any> {\n  children: Map<string, TrieNode<T>>;\n  isEnd: boolean;\n  value?: T;\n  // For pattern matching - store metadata about what this pattern means\n  metadata?: PatternMetadata;\n}\n\nexport interface PatternMetadata {\n  type: 'vulnerability' | 'symbol' | 'pattern' | 'keyword';\n  severity?: 'critical' | 'serious' | 'moderate' | 'low';\n  category?: string;\n  description?: string;\n  cwe?: string;\n  fix?: string;\n}\n\nexport interface MatchResult<T = any> {\n  pattern: string;\n  position: number;\n  line: number;\n  column: number;\n  value?: T;\n  metadata?: PatternMetadata;\n}\n\n/**\n * Core Trie implementation with pattern matching\n */\nexport class Trie<T = any> {\n  private root: TrieNode<T>;\n  private size: number = 0;\n\n  constructor() {\n    this.root = this.createNode();\n  }\n\n  private createNode(): TrieNode<T> {\n    return {\n      children: new Map(),\n      isEnd: false,\n    };\n  }\n\n  /**\n   * Insert a pattern into the trie\n   * O(m) where m = pattern length\n   */\n  insert(pattern: string, value?: T, metadata?: PatternMetadata): void {\n    let node = this.root;\n\n    for (const char of pattern) {\n      if (!node.children.has(char)) {\n        node.children.set(char, this.createNode());\n      }\n      node = node.children.get(char)!;\n    }\n\n    node.isEnd = true;\n    if (value !== undefined) {\n      node.value = value;\n    }\n    if (metadata !== undefined) {\n      node.metadata = metadata;\n    }\n    this.size++;\n  }\n\n  /**\n   * Search for an exact pattern\n   * O(m) where m = pattern length\n   */\n  search(pattern: string): { found: boolean; value?: T; metadata?: PatternMetadata } {\n    let node = this.root;\n\n    for (const char of pattern) {\n      if (!node.children.has(char)) {\n        return { found: false };\n      }\n      node = node.children.get(char)!;\n    }\n\n    const result: { found: boolean; value?: T; metadata?: PatternMetadata } = {\n      found: node.isEnd,\n    };\n    if (node.value !== undefined) {\n      result.value = node.value;\n    }\n    if (node.metadata !== undefined) {\n      result.metadata = node.metadata;\n    }\n    return result;\n  }\n\n  /**\n   * Check if any pattern starts with the given prefix\n   * O(m) where m = prefix length\n   */\n  startsWith(prefix: string): boolean {\n    let node = this.root;\n\n    for (const char of prefix) {\n      if (!node.children.has(char)) {\n        return false;\n      }\n      node = node.children.get(char)!;\n    }\n\n    return true;\n  }\n\n  /**\n   * Find all patterns that match within the given text\n   * Uses Aho-Corasick-like multi-pattern matching\n   * O(n + m) where n = text length, m = total matches\n   */\n  findAllMatches(text: string): MatchResult<T>[] {\n    const matches: MatchResult<T>[] = [];\n    const lines = text.split('\\n');\n    \n    let globalPos = 0;\n\n    for (let lineNum = 0; lineNum < lines.length; lineNum++) {\n      const line = lines[lineNum]!;\n      \n      // Try matching at each position in the line\n      for (let i = 0; i < line.length; i++) {\n        let node = this.root;\n        let matchLen = 0;\n        let j = i;\n\n        // Walk the trie as far as we can\n        while (j < line.length && node.children.has(line[j]!)) {\n          node = node.children.get(line[j]!)!;\n          matchLen++;\n          j++;\n\n          // Check if we found a complete pattern\n          if (node.isEnd) {\n            const matchResult: MatchResult<T> = {\n              pattern: line.substring(i, i + matchLen),\n              position: globalPos + i,\n              line: lineNum + 1,\n              column: i + 1,\n            };\n            if (node.value !== undefined) {\n              matchResult.value = node.value;\n            }\n            if (node.metadata !== undefined) {\n              matchResult.metadata = node.metadata;\n            }\n            matches.push(matchResult);\n          }\n        }\n      }\n\n      globalPos += line.length + 1; // +1 for newline\n    }\n\n    return matches;\n  }\n\n  /**\n   * Find the longest matching prefix at a position\n   * O(m) where m = longest pattern length\n   */\n  findLongestMatch(text: string, startPos: number = 0): MatchResult<T> | null {\n    let node = this.root;\n    let lastMatch: MatchResult<T> | null = null;\n    let matchLen = 0;\n\n    for (let i = startPos; i < text.length; i++) {\n      const char = text[i]!;\n      \n      if (!node.children.has(char)) {\n        break;\n      }\n\n      node = node.children.get(char)!;\n      matchLen++;\n\n      if (node.isEnd) {\n        lastMatch = {\n          pattern: text.substring(startPos, startPos + matchLen),\n          position: startPos,\n          line: this.getLineNumber(text, startPos),\n          column: this.getColumnNumber(text, startPos),\n        };\n        if (node.value !== undefined) {\n          lastMatch.value = node.value;\n        }\n        if (node.metadata !== undefined) {\n          lastMatch.metadata = node.metadata;\n        }\n      }\n    }\n\n    return lastMatch;\n  }\n\n  /**\n   * Get all patterns with a given prefix\n   * O(p + n) where p = prefix length, n = number of matches\n   */\n  getWithPrefix(prefix: string): Array<{ pattern: string; value?: T; metadata?: PatternMetadata }> {\n    let node = this.root;\n\n    // Navigate to prefix node\n    for (const char of prefix) {\n      if (!node.children.has(char)) {\n        return [];\n      }\n      node = node.children.get(char)!;\n    }\n\n    // Collect all patterns under this prefix\n    const results: Array<{ pattern: string; value?: T; metadata?: PatternMetadata }> = [];\n    this.collectPatterns(node, prefix, results);\n    return results;\n  }\n\n  private collectPatterns(\n    node: TrieNode<T>,\n    prefix: string,\n    results: Array<{ pattern: string; value?: T; metadata?: PatternMetadata }>\n  ): void {\n    if (node.isEnd) {\n      const entry: { pattern: string; value?: T; metadata?: PatternMetadata } = { pattern: prefix };\n      if (node.value !== undefined) {\n        entry.value = node.value;\n      }\n      if (node.metadata !== undefined) {\n        entry.metadata = node.metadata;\n      }\n      results.push(entry);\n    }\n\n    for (const [char, child] of node.children) {\n      this.collectPatterns(child, prefix + char, results);\n    }\n  }\n\n  private getLineNumber(text: string, position: number): number {\n    let line = 1;\n    for (let i = 0; i < position && i < text.length; i++) {\n      if (text[i] === '\\n') line++;\n    }\n    return line;\n  }\n\n  private getColumnNumber(text: string, position: number): number {\n    let column = 1;\n    for (let i = position - 1; i >= 0 && text[i] !== '\\n'; i--) {\n      column++;\n    }\n    return column;\n  }\n\n  /**\n   * Get the number of patterns in the trie\n   */\n  getSize(): number {\n    return this.size;\n  }\n\n  /**\n   * Clear all patterns\n   */\n  clear(): void {\n    this.root = this.createNode();\n    this.size = 0;\n  }\n\n  /**\n   * Serialize trie to JSON for persistence\n   */\n  toJSON(): object {\n    return this.serializeNode(this.root);\n  }\n\n  private serializeNode(node: TrieNode<T>): object {\n    const children: Record<string, object> = {};\n    for (const [char, child] of node.children) {\n      children[char] = this.serializeNode(child);\n    }\n    return {\n      children,\n      isEnd: node.isEnd,\n      value: node.value,\n      metadata: node.metadata,\n    };\n  }\n\n  /**\n   * Load trie from JSON\n   */\n  static fromJSON<T>(json: object): Trie<T> {\n    const trie = new Trie<T>();\n    trie.root = trie.deserializeNode(json as any);\n    return trie;\n  }\n\n  private deserializeNode(data: any): TrieNode<T> {\n    const node = this.createNode();\n    node.isEnd = data.isEnd;\n    node.value = data.value;\n    node.metadata = data.metadata;\n    \n    for (const [char, childData] of Object.entries(data.children)) {\n      node.children.set(char, this.deserializeNode(childData));\n    }\n    \n    return node;\n  }\n}\n\n/**\n * Aho-Corasick implementation for efficient multi-pattern matching\n * O(n + m + z) where n = text length, m = total pattern length, z = number of matches\n */\nexport class AhoCorasick<T = any> {\n  private root: ACNode<T>;\n  private built: boolean = false;\n\n  constructor() {\n    this.root = this.createNode();\n  }\n\n  private createNode(): ACNode<T> {\n    return {\n      children: new Map(),\n      fail: null,\n      output: [],\n    };\n  }\n\n  /**\n   * Add a pattern to the automaton\n   */\n  addPattern(pattern: string, value?: T, metadata?: PatternMetadata): void {\n    let node = this.root;\n\n    for (const char of pattern) {\n      if (!node.children.has(char)) {\n        node.children.set(char, this.createNode());\n      }\n      node = node.children.get(char)!;\n    }\n\n    const outputEntry: { pattern: string; value?: T; metadata?: PatternMetadata } = { pattern };\n    if (value !== undefined) {\n      outputEntry.value = value;\n    }\n    if (metadata !== undefined) {\n      outputEntry.metadata = metadata;\n    }\n    node.output.push(outputEntry);\n    this.built = false;\n  }\n\n  /**\n   * Build failure links (call after adding all patterns)\n   */\n  build(): void {\n    const queue: ACNode<T>[] = [];\n\n    // Initialize failure links for depth 1\n    for (const child of this.root.children.values()) {\n      child.fail = this.root;\n      queue.push(child);\n    }\n\n    // BFS to build failure links\n    while (queue.length > 0) {\n      const current = queue.shift()!;\n\n      for (const [char, child] of current.children) {\n        queue.push(child);\n\n        // Find failure link\n        let fail = current.fail;\n        while (fail !== null && !fail.children.has(char)) {\n          fail = fail.fail;\n        }\n\n        child.fail = fail ? fail.children.get(char)! : this.root;\n\n        // Merge outputs from failure chain\n        if (child.fail !== this.root) {\n          child.output = [...child.output, ...child.fail.output];\n        }\n      }\n    }\n\n    this.built = true;\n  }\n\n  /**\n   * Search text for all pattern matches\n   * O(n + z) where n = text length, z = number of matches\n   */\n  search(text: string): MatchResult<T>[] {\n    if (!this.built) {\n      this.build();\n    }\n\n    const matches: MatchResult<T>[] = [];\n    let node = this.root;\n    let line = 1;\n    let lineStart = 0;\n\n    for (let i = 0; i < text.length; i++) {\n      const char = text[i]!;\n\n      // Track line numbers\n      if (char === '\\n') {\n        line++;\n        lineStart = i + 1;\n      }\n\n      // Follow failure links until we find a match or reach root\n      while (node !== this.root && !node.children.has(char)) {\n        node = node.fail || this.root;\n      }\n\n      node = node.children.get(char) || this.root;\n\n      // Report all matches at this position\n      for (const output of node.output) {\n        const matchResult: MatchResult<T> = {\n          pattern: output.pattern,\n          position: i - output.pattern.length + 1,\n          line,\n          column: i - output.pattern.length + 1 - lineStart + 1,\n        };\n        if (output.value !== undefined) {\n          matchResult.value = output.value;\n        }\n        if (output.metadata !== undefined) {\n          matchResult.metadata = output.metadata;\n        }\n        matches.push(matchResult);\n      }\n    }\n\n    return matches;\n  }\n}\n\ninterface ACNode<T> {\n  children: Map<string, ACNode<T>>;\n  fail: ACNode<T> | null;\n  output: Array<{ pattern: string; value?: T; metadata?: PatternMetadata }>;\n}\n\n"],"mappings":";AAuCO,IAAM,OAAN,MAAM,MAAc;AAAA,EACjB;AAAA,EACA,OAAe;AAAA,EAEvB,cAAc;AACZ,SAAK,OAAO,KAAK,WAAW;AAAA,EAC9B;AAAA,EAEQ,aAA0B;AAChC,WAAO;AAAA,MACL,UAAU,oBAAI,IAAI;AAAA,MAClB,OAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,SAAiB,OAAW,UAAkC;AACnE,QAAI,OAAO,KAAK;AAEhB,eAAW,QAAQ,SAAS;AAC1B,UAAI,CAAC,KAAK,SAAS,IAAI,IAAI,GAAG;AAC5B,aAAK,SAAS,IAAI,MAAM,KAAK,WAAW,CAAC;AAAA,MAC3C;AACA,aAAO,KAAK,SAAS,IAAI,IAAI;AAAA,IAC/B;AAEA,SAAK,QAAQ;AACb,QAAI,UAAU,QAAW;AACvB,WAAK,QAAQ;AAAA,IACf;AACA,QAAI,aAAa,QAAW;AAC1B,WAAK,WAAW;AAAA,IAClB;AACA,SAAK;AAAA,EACP;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,SAA4E;AACjF,QAAI,OAAO,KAAK;AAEhB,eAAW,QAAQ,SAAS;AAC1B,UAAI,CAAC,KAAK,SAAS,IAAI,IAAI,GAAG;AAC5B,eAAO,EAAE,OAAO,MAAM;AAAA,MACxB;AACA,aAAO,KAAK,SAAS,IAAI,IAAI;AAAA,IAC/B;AAEA,UAAM,SAAoE;AAAA,MACxE,OAAO,KAAK;AAAA,IACd;AACA,QAAI,KAAK,UAAU,QAAW;AAC5B,aAAO,QAAQ,KAAK;AAAA,IACtB;AACA,QAAI,KAAK,aAAa,QAAW;AAC/B,aAAO,WAAW,KAAK;AAAA,IACzB;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAW,QAAyB;AAClC,QAAI,OAAO,KAAK;AAEhB,eAAW,QAAQ,QAAQ;AACzB,UAAI,CAAC,KAAK,SAAS,IAAI,IAAI,GAAG;AAC5B,eAAO;AAAA,MACT;AACA,aAAO,KAAK,SAAS,IAAI,IAAI;AAAA,IAC/B;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,eAAe,MAAgC;AAC7C,UAAM,UAA4B,CAAC;AACnC,UAAM,QAAQ,KAAK,MAAM,IAAI;AAE7B,QAAI,YAAY;AAEhB,aAAS,UAAU,GAAG,UAAU,MAAM,QAAQ,WAAW;AACvD,YAAM,OAAO,MAAM,OAAO;AAG1B,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAI,OAAO,KAAK;AAChB,YAAI,WAAW;AACf,YAAI,IAAI;AAGR,eAAO,IAAI,KAAK,UAAU,KAAK,SAAS,IAAI,KAAK,CAAC,CAAE,GAAG;AACrD,iBAAO,KAAK,SAAS,IAAI,KAAK,CAAC,CAAE;AACjC;AACA;AAGA,cAAI,KAAK,OAAO;AACd,kBAAM,cAA8B;AAAA,cAClC,SAAS,KAAK,UAAU,GAAG,IAAI,QAAQ;AAAA,cACvC,UAAU,YAAY;AAAA,cACtB,MAAM,UAAU;AAAA,cAChB,QAAQ,IAAI;AAAA,YACd;AACA,gBAAI,KAAK,UAAU,QAAW;AAC5B,0BAAY,QAAQ,KAAK;AAAA,YAC3B;AACA,gBAAI,KAAK,aAAa,QAAW;AAC/B,0BAAY,WAAW,KAAK;AAAA,YAC9B;AACA,oBAAQ,KAAK,WAAW;AAAA,UAC1B;AAAA,QACF;AAAA,MACF;AAEA,mBAAa,KAAK,SAAS;AAAA,IAC7B;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBAAiB,MAAc,WAAmB,GAA0B;AAC1E,QAAI,OAAO,KAAK;AAChB,QAAI,YAAmC;AACvC,QAAI,WAAW;AAEf,aAAS,IAAI,UAAU,IAAI,KAAK,QAAQ,KAAK;AAC3C,YAAM,OAAO,KAAK,CAAC;AAEnB,UAAI,CAAC,KAAK,SAAS,IAAI,IAAI,GAAG;AAC5B;AAAA,MACF;AAEA,aAAO,KAAK,SAAS,IAAI,IAAI;AAC7B;AAEA,UAAI,KAAK,OAAO;AACd,oBAAY;AAAA,UACV,SAAS,KAAK,UAAU,UAAU,WAAW,QAAQ;AAAA,UACrD,UAAU;AAAA,UACV,MAAM,KAAK,cAAc,MAAM,QAAQ;AAAA,UACvC,QAAQ,KAAK,gBAAgB,MAAM,QAAQ;AAAA,QAC7C;AACA,YAAI,KAAK,UAAU,QAAW;AAC5B,oBAAU,QAAQ,KAAK;AAAA,QACzB;AACA,YAAI,KAAK,aAAa,QAAW;AAC/B,oBAAU,WAAW,KAAK;AAAA,QAC5B;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc,QAAmF;AAC/F,QAAI,OAAO,KAAK;AAGhB,eAAW,QAAQ,QAAQ;AACzB,UAAI,CAAC,KAAK,SAAS,IAAI,IAAI,GAAG;AAC5B,eAAO,CAAC;AAAA,MACV;AACA,aAAO,KAAK,SAAS,IAAI,IAAI;AAAA,IAC/B;AAGA,UAAM,UAA6E,CAAC;AACpF,SAAK,gBAAgB,MAAM,QAAQ,OAAO;AAC1C,WAAO;AAAA,EACT;AAAA,EAEQ,gBACN,MACA,QACA,SACM;AACN,QAAI,KAAK,OAAO;AACd,YAAM,QAAoE,EAAE,SAAS,OAAO;AAC5F,UAAI,KAAK,UAAU,QAAW;AAC5B,cAAM,QAAQ,KAAK;AAAA,MACrB;AACA,UAAI,KAAK,aAAa,QAAW;AAC/B,cAAM,WAAW,KAAK;AAAA,MACxB;AACA,cAAQ,KAAK,KAAK;AAAA,IACpB;AAEA,eAAW,CAAC,MAAM,KAAK,KAAK,KAAK,UAAU;AACzC,WAAK,gBAAgB,OAAO,SAAS,MAAM,OAAO;AAAA,IACpD;AAAA,EACF;AAAA,EAEQ,cAAc,MAAc,UAA0B;AAC5D,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,YAAY,IAAI,KAAK,QAAQ,KAAK;AACpD,UAAI,KAAK,CAAC,MAAM,KAAM;AAAA,IACxB;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,gBAAgB,MAAc,UAA0B;AAC9D,QAAI,SAAS;AACb,aAAS,IAAI,WAAW,GAAG,KAAK,KAAK,KAAK,CAAC,MAAM,MAAM,KAAK;AAC1D;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,UAAkB;AAChB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,QAAc;AACZ,SAAK,OAAO,KAAK,WAAW;AAC5B,SAAK,OAAO;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,SAAiB;AACf,WAAO,KAAK,cAAc,KAAK,IAAI;AAAA,EACrC;AAAA,EAEQ,cAAc,MAA2B;AAC/C,UAAM,WAAmC,CAAC;AAC1C,eAAW,CAAC,MAAM,KAAK,KAAK,KAAK,UAAU;AACzC,eAAS,IAAI,IAAI,KAAK,cAAc,KAAK;AAAA,IAC3C;AACA,WAAO;AAAA,MACL;AAAA,MACA,OAAO,KAAK;AAAA,MACZ,OAAO,KAAK;AAAA,MACZ,UAAU,KAAK;AAAA,IACjB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,SAAY,MAAuB;AACxC,UAAM,OAAO,IAAI,MAAQ;AACzB,SAAK,OAAO,KAAK,gBAAgB,IAAW;AAC5C,WAAO;AAAA,EACT;AAAA,EAEQ,gBAAgB,MAAwB;AAC9C,UAAM,OAAO,KAAK,WAAW;AAC7B,SAAK,QAAQ,KAAK;AAClB,SAAK,QAAQ,KAAK;AAClB,SAAK,WAAW,KAAK;AAErB,eAAW,CAAC,MAAM,SAAS,KAAK,OAAO,QAAQ,KAAK,QAAQ,GAAG;AAC7D,WAAK,SAAS,IAAI,MAAM,KAAK,gBAAgB,SAAS,CAAC;AAAA,IACzD;AAEA,WAAO;AAAA,EACT;AACF;AAMO,IAAM,cAAN,MAA2B;AAAA,EACxB;AAAA,EACA,QAAiB;AAAA,EAEzB,cAAc;AACZ,SAAK,OAAO,KAAK,WAAW;AAAA,EAC9B;AAAA,EAEQ,aAAwB;AAC9B,WAAO;AAAA,MACL,UAAU,oBAAI,IAAI;AAAA,MAClB,MAAM;AAAA,MACN,QAAQ,CAAC;AAAA,IACX;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW,SAAiB,OAAW,UAAkC;AACvE,QAAI,OAAO,KAAK;AAEhB,eAAW,QAAQ,SAAS;AAC1B,UAAI,CAAC,KAAK,SAAS,IAAI,IAAI,GAAG;AAC5B,aAAK,SAAS,IAAI,MAAM,KAAK,WAAW,CAAC;AAAA,MAC3C;AACA,aAAO,KAAK,SAAS,IAAI,IAAI;AAAA,IAC/B;AAEA,UAAM,cAA0E,EAAE,QAAQ;AAC1F,QAAI,UAAU,QAAW;AACvB,kBAAY,QAAQ;AAAA,IACtB;AACA,QAAI,aAAa,QAAW;AAC1B,kBAAY,WAAW;AAAA,IACzB;AACA,SAAK,OAAO,KAAK,WAAW;AAC5B,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA,EAKA,QAAc;AACZ,UAAM,QAAqB,CAAC;AAG5B,eAAW,SAAS,KAAK,KAAK,SAAS,OAAO,GAAG;AAC/C,YAAM,OAAO,KAAK;AAClB,YAAM,KAAK,KAAK;AAAA,IAClB;AAGA,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,UAAU,MAAM,MAAM;AAE5B,iBAAW,CAAC,MAAM,KAAK,KAAK,QAAQ,UAAU;AAC5C,cAAM,KAAK,KAAK;AAGhB,YAAI,OAAO,QAAQ;AACnB,eAAO,SAAS,QAAQ,CAAC,KAAK,SAAS,IAAI,IAAI,GAAG;AAChD,iBAAO,KAAK;AAAA,QACd;AAEA,cAAM,OAAO,OAAO,KAAK,SAAS,IAAI,IAAI,IAAK,KAAK;AAGpD,YAAI,MAAM,SAAS,KAAK,MAAM;AAC5B,gBAAM,SAAS,CAAC,GAAG,MAAM,QAAQ,GAAG,MAAM,KAAK,MAAM;AAAA,QACvD;AAAA,MACF;AAAA,IACF;AAEA,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,MAAgC;AACrC,QAAI,CAAC,KAAK,OAAO;AACf,WAAK,MAAM;AAAA,IACb;AAEA,UAAM,UAA4B,CAAC;AACnC,QAAI,OAAO,KAAK;AAChB,QAAI,OAAO;AACX,QAAI,YAAY;AAEhB,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,OAAO,KAAK,CAAC;AAGnB,UAAI,SAAS,MAAM;AACjB;AACA,oBAAY,IAAI;AAAA,MAClB;AAGA,aAAO,SAAS,KAAK,QAAQ,CAAC,KAAK,SAAS,IAAI,IAAI,GAAG;AACrD,eAAO,KAAK,QAAQ,KAAK;AAAA,MAC3B;AAEA,aAAO,KAAK,SAAS,IAAI,IAAI,KAAK,KAAK;AAGvC,iBAAW,UAAU,KAAK,QAAQ;AAChC,cAAM,cAA8B;AAAA,UAClC,SAAS,OAAO;AAAA,UAChB,UAAU,IAAI,OAAO,QAAQ,SAAS;AAAA,UACtC;AAAA,UACA,QAAQ,IAAI,OAAO,QAAQ,SAAS,IAAI,YAAY;AAAA,QACtD;AACA,YAAI,OAAO,UAAU,QAAW;AAC9B,sBAAY,QAAQ,OAAO;AAAA,QAC7B;AACA,YAAI,OAAO,aAAa,QAAW;AACjC,sBAAY,WAAW,OAAO;AAAA,QAChC;AACA,gBAAQ,KAAK,WAAW;AAAA,MAC1B;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;","names":[]}