cgraphx 1.4.1 → 2.0.0

package/dist/search/query-utils.js

@@ -1,449 +0,0 @@
-"use strict";
-/**
- * Search Query Utilities
- *
- * Shared module for search term extraction and scoring.
- */
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (this && this.__importStar) || (function () {
-    var ownKeys = function(o) {
-        ownKeys = Object.getOwnPropertyNames || function (o) {
-            var ar = [];
-            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
-            return ar;
-        };
-        return ownKeys(o);
-    };
-    return function (mod) {
-        if (mod && mod.__esModule) return mod;
-        var result = {};
-        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
-        __setModuleDefault(result, mod);
-        return result;
-    };
-})();
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.STOP_WORDS = void 0;
-exports.normalizeNameToken = normalizeNameToken;
-exports.deriveProjectNameTokens = deriveProjectNameTokens;
-exports.getStemVariants = getStemVariants;
-exports.extractSearchTerms = extractSearchTerms;
-exports.scorePathRelevance = scorePathRelevance;
-exports.isTestFile = isTestFile;
-exports.nameMatchBonus = nameMatchBonus;
-exports.kindBonus = kindBonus;
-exports.isDistinctiveIdentifier = isDistinctiveIdentifier;
-const fs = __importStar(require("fs"));
-const path = __importStar(require("path"));
-/** Normalize a name to a comparable token: lowercase, alphanumerics only. */
-function normalizeNameToken(raw) {
-    return raw.toLowerCase().replace(/[^a-z0-9]/g, '');
-}
-/**
- * Tokens that name the PROJECT as a whole — its `go.mod` module, `package.json`
- * name, or repo root directory — rather than any specific symbol. A user
- * naturally puts the project name in a query as context ("MyApp backend
- * routes"), but it carries no discriminative signal: when it's also a substring
- * of a symbol or path on one stack (a `MyAppFrontend/` dir, a `MyAppApp` class)
- * it lexically inflates that stack and buries the rest (#720).
- *
- * Returned normalized (lowercase, alphanumerics only) so a query word can be
- * compared by its normalized form. Only names ≥5 chars are kept — short ones
- * (`api`, `app`, `core`, `web`) collide with real query terms too often to
- * safely down-weight.
- */
-function deriveProjectNameTokens(projectRoot) {
-    const tokens = new Set();
-    const add = (raw) => {
-        if (!raw)
-            return;
-        const norm = normalizeNameToken(raw);
-        if (norm.length >= 5)
-            tokens.add(norm);
-    };
-    // go.mod module last segment (the most reliable signal for Go repos).
-    try {
-        const gomod = fs.readFileSync(path.join(projectRoot, 'go.mod'), 'utf-8');
-        const m = gomod.match(/^\s*module\s+(\S+)/m);
-        if (m && m[1])
-            add(m[1].split('/').pop());
-    }
-    catch { /* no go.mod */ }
-    // package.json name (strip an `@scope/` prefix).
-    try {
-        const pkg = JSON.parse(fs.readFileSync(path.join(projectRoot, 'package.json'), 'utf-8'));
-        if (typeof pkg.name === 'string')
-            add(pkg.name.replace(/^@[^/]+\//, ''));
-    }
-    catch { /* no / invalid package.json */ }
-    // Repo root directory name — a fallback when neither manifest names the project.
-    add(path.basename(path.resolve(projectRoot)));
-    return tokens;
-}
-/**
- * Common stop words to filter from search queries.
- * Includes generic English + code-specific noise words.
- */
-exports.STOP_WORDS = new Set([
-    // English
-    'the', 'a', 'an', 'and', 'or', 'but', 'in', 'on', 'at', 'to', 'for',
-    'of', 'with', 'by', 'from', 'is', 'it', 'that', 'this', 'are', 'was',
-    'be', 'has', 'had', 'have', 'do', 'does', 'did', 'will', 'would', 'could',
-    'should', 'may', 'might', 'can', 'shall', 'not', 'no', 'all', 'each',
-    'every', 'how', 'what', 'where', 'when', 'who', 'which', 'why',
-    'i', 'me', 'my', 'we', 'our', 'you', 'your', 'he', 'she', 'they',
-    'show', 'give', 'tell',
-    'been', 'done', 'made', 'used', 'using', 'work', 'works', 'found',
-    'also', 'into', 'then', 'than', 'just', 'more', 'some', 'such',
-    'over', 'only', 'out', 'its', 'so', 'up', 'as', 'if',
-    'look', 'need', 'needs', 'want', 'happen', 'happens',
-    'affect', 'affected', 'break', 'breaks', 'failing',
-    'implemented', 'implement',
-    // Code-specific noise (avoid filtering common symbol names like get/set/add/build/find/list)
-    'code', 'file', 'files', 'function', 'method', 'class', 'type',
-    'fix', 'bug', 'called',
-]);
-/**
- * Generate stem variants of a search term by removing common English suffixes.
- * Used for FTS query expansion so "caching" also finds "cache", "eviction" finds "evict", etc.
- * Stems are used as PREFIX matches in FTS, so they don't need to be perfect English words.
- */
-function getStemVariants(term) {
-    const variants = new Set();
-    const t = term.toLowerCase();
-    // -ing: caching→cach/cache, handling→handl/handle, running→run
-    if (t.endsWith('ing') && t.length > 5) {
-        const base = t.slice(0, -3);
-        variants.add(base);
-        variants.add(base + 'e');
-        if (base.length >= 2 && base[base.length - 1] === base[base.length - 2]) {
-            variants.add(base.slice(0, -1));
-        }
-    }
-    // -tion/-sion: eviction→evict, expression→express
-    if ((t.endsWith('tion') || t.endsWith('sion')) && t.length > 5) {
-        variants.add(t.slice(0, -3));
-    }
-    // -ment: management→manage
-    if (t.endsWith('ment') && t.length > 6) {
-        variants.add(t.slice(0, -4));
-    }
-    // -ies: entries→entry
-    if (t.endsWith('ies') && t.length > 4) {
-        variants.add(t.slice(0, -3) + 'y');
-    }
-    // -es: processes→process, classes→class
-    else if (t.endsWith('es') && t.length > 4) {
-        variants.add(t.slice(0, -2));
-    }
-    // -s: errors→error (skip -ss endings like "class")
-    else if (t.endsWith('s') && !t.endsWith('ss') && t.length > 4) {
-        variants.add(t.slice(0, -1));
-    }
-    // -ed: handled→handle, propagated→propagate, carried→carry
-    if (t.endsWith('ed') && !t.endsWith('eed') && t.length > 4) {
-        variants.add(t.slice(0, -1));
-        variants.add(t.slice(0, -2));
-        if (t.endsWith('ied') && t.length > 5) {
-            variants.add(t.slice(0, -3) + 'y');
-        }
-    }
-    // -er: builder→build/builde, handler→handl/handle, getter→get
-    if (t.endsWith('er') && t.length > 4) {
-        const base = t.slice(0, -2);
-        variants.add(base);
-        variants.add(base + 'e');
-        if (base.length >= 2 && base[base.length - 1] === base[base.length - 2]) {
-            variants.add(base.slice(0, -1));
-        }
-    }
-    return [...variants].filter(v => v.length >= 3 && v !== t);
-}
-/**
- * Extract meaningful search terms from a natural language query.
- * Splits camelCase, PascalCase, snake_case, SCREAMING_SNAKE, and dot.notation
- * into individual tokens before filtering.
- *
- * Preserves original compound identifiers (e.g., "scrapeLoop") alongside
- * their split parts so that FTS can match both the full symbol name and
- * individual words within it.
- *
- * Also generates stem variants (e.g., "caching"→"cache", "eviction"→"evict")
- * so FTS prefix matching can find related code symbols.
- */
-function extractSearchTerms(query, options) {
-    const includeStems = options?.stems !== false;
-    const tokens = new Set();
-    // First, extract and preserve compound identifiers before splitting
-    // CamelCase: scrapeLoop, UserService, getCallGraph
-    const compoundPattern = /\b([a-zA-Z][a-zA-Z0-9]*(?:[A-Z][a-z]+)+|[A-Z][a-z]+(?:[A-Z][a-z]*)+)\b/g;
-    let match;
-    while ((match = compoundPattern.exec(query)) !== null) {
-        if (match[1] && match[1].length >= 3) {
-            tokens.add(match[1].toLowerCase()); // preserve full compound: "scrapeloop"
-        }
-    }
-    // snake_case: scrape_loop, user_service
-    const snakePattern = /\b([a-zA-Z][a-zA-Z0-9]*(?:_[a-zA-Z0-9]+)+)\b/g;
-    while ((match = snakePattern.exec(query)) !== null) {
-        if (match[1] && match[1].length >= 3) {
-            tokens.add(match[1].toLowerCase());
-        }
-    }
-    // Split camelCase / PascalCase: "getUserName" → "get User Name"
-    const camelSplit = query
-        .replace(/([a-z])([A-Z])/g, '$1 $2')
-        .replace(/([A-Z]+)([A-Z][a-z])/g, '$1 $2');
-    // Replace underscores and dots with spaces (snake_case, dot.notation)
-    const normalised = camelSplit.replace(/[_.]+/g, ' ');
-    // Split on any non-alphanumeric character
-    const words = normalised.split(/[^a-zA-Z0-9]+/).filter(Boolean);
-    for (const word of words) {
-        const lower = word.toLowerCase();
-        if (lower.length < 3)
-            continue;
-        if (exports.STOP_WORDS.has(lower))
-            continue;
-        tokens.add(lower);
-    }
-    // Generate stem variants for broader FTS matching.
-    // "caching" → "cache" finds CacheBuilder; "eviction" → "evict" finds evictEntries.
-    // Also enables co-occurrence dampening by increasing term count above 1.
-    // Stems are skipped when scoring path relevance (stems inflate path scores).
-    if (includeStems) {
-        const stems = new Set();
-        for (const token of tokens) {
-            for (const variant of getStemVariants(token)) {
-                if (!tokens.has(variant) && !exports.STOP_WORDS.has(variant)) {
-                    stems.add(variant);
-                }
-            }
-        }
-        for (const stem of stems) {
-            tokens.add(stem);
-        }
-    }
-    return [...tokens];
-}
-/**
- * Score path relevance to a query
- * Higher score = more relevant path
- */
-function scorePathRelevance(filePath, query, projectNameTokens) {
-    const pathLower = filePath.toLowerCase();
-    const fileName = path.basename(filePath).toLowerCase();
-    const dirName = path.dirname(filePath).toLowerCase();
-    let score = 0;
-    // Score per original query WORD, not per sub-token. A single PascalCase word
-    // splits into many sub-tokens (a project name "SuperBizAgent" →
-    // superbizagent / super / biz / agent) that all match the SAME path segment,
-    // so summing per sub-token boosted that path 4× for one concept — enough to
-    // bury the rest of the query's stack (#720). A word matches a path level if
-    // ANY of its sub-tokens do, and counts ONCE; distinct words still each add.
-    // Split the ORIGINAL-case query into words; extractSearchTerms does the
-    // camelCase/snake split per word (so `getUserName` still matches a
-    // `get_user_name` path) — we just attribute each word's matches once.
-    const allWords = query.split(/\s+/).filter((w) => w.length > 0);
-    if (allWords.length === 0)
-        return 0;
-    // A query word that just names the PROJECT (its go.mod / package.json / repo
-    // name) carries no discriminative path signal — drop it so the rest of the
-    // query decides the ranking, instead of every file under a `<ProjectName>…/`
-    // tree winning on the project name alone (#720). Only when OTHER words remain,
-    // so a bare project-name query still scores on its path.
-    const words = projectNameTokens && projectNameTokens.size > 0
-        ? allWords.filter((w) => !projectNameTokens.has(normalizeNameToken(w)))
-        : allWords;
-    const scored = words.length > 0 ? words : allWords;
-    for (const word of scored) {
-        // Use base terms only — stem variants inflate path scores by generating
-        // many near-duplicate terms that all match the same path segments.
-        const subtokens = extractSearchTerms(word, { stems: false });
-        if (subtokens.length === 0)
-            continue;
-        // Exact filename match (strongest)
-        if (subtokens.some((t) => fileName.includes(t)))
-            score += 10;
-        // Directory match
-        if (subtokens.some((t) => dirName.includes(t)))
-            score += 5;
-        // General path match
-        else if (subtokens.some((t) => pathLower.includes(t)))
-            score += 3;
-    }
-    // Deprioritize test files unless the query is explicitly about tests
-    const queryLower = query.toLowerCase();
-    const isTestQuery = queryLower.includes('test') || queryLower.includes('spec');
-    if (!isTestQuery && isTestFile(filePath)) {
-        score -= 15;
-    }
-    return score;
-}
-/**
- * Check if a file path looks like a test file
- */
-function isTestFile(filePath) {
-    const lower = filePath.toLowerCase();
-    const fileName = path.basename(filePath); // original case — needed for camelCase boundaries
-    const lowerName = fileName.toLowerCase();
-    // --- Filename patterns ---
-    if (lowerName.startsWith('test_') || // python: test_foo.py
-        lowerName.startsWith('test.') ||
-        // separator-delimited: foo_test.go, foo.test.ts, foo-spec.rb, bar_spec.py
-        /[._-](test|tests|spec|specs)\.[a-z0-9]+$/.test(lowerName) ||
-        // CamelCase suffix (Java/Kotlin/Swift/C#/Scala): FooTest.kt, BarTests.swift,
-        // BazSpec.scala, QuxTestCase.java. Capital-led so "latest.kt"/"manifest.kt"
-        // (lowercase "test") are NOT matched.
-        /(?:Test|Tests|TestCase|Tester|Spec|Specs)\.[A-Za-z0-9]+$/.test(fileName)) {
-        return true;
-    }
-    // --- Directory patterns ---
-    if (lower.includes('/tests/') || lower.includes('/test/') ||
-        lower.includes('/__tests__/') || lower.includes('/spec/') ||
-        lower.includes('/specs/') || lower.includes('/testlib/') ||
-        lower.includes('/testing/') ||
-        lower.startsWith('test/') || lower.startsWith('tests/') ||
-        lower.startsWith('spec/') || lower.startsWith('specs/') ||
-        // CamelCase test source-set dirs (Kotlin Multiplatform / Gradle / Xcode):
-        // jvmTest/, commonTest/, androidTest/, iosTest/, integrationTest/. Capital-led
-        // so "latest/" / "manifest/" are not matched.
-        /(?:^|\/)[A-Za-z0-9]*(?:Test|Tests|Spec)\//.test(filePath)) {
-        return true;
-    }
-    // Non-production directories: examples, samples, benchmarks, fixtures, demos.
-    // Check both mid-path (/integration/) and start-of-path (integration/) since
-    // file paths may be stored as relative paths without a leading slash.
-    return matchesNonProductionDir(lower);
-}
-/**
- * Check if a path is in a non-production directory (integration, sample, example, etc.)
- * Handles both absolute paths (/foo/integration/bar) and relative paths (integration/bar).
- */
-function matchesNonProductionDir(lowerPath) {
-    const dirs = [
-        'integration', 'sample', 'samples', 'example', 'examples',
-        'fixture', 'fixtures', 'benchmark', 'benchmarks', 'demo', 'demos',
-    ];
-    for (const dir of dirs) {
-        if (lowerPath.includes('/' + dir + '/') || lowerPath.startsWith(dir + '/')) {
-            return true;
-        }
-    }
-    return false;
-}
-/**
- * Bonus when a node's name matches the search query.
- * Exact matches get the largest boost; prefix matches get smaller boosts.
- * Multi-word queries also check individual term matches against the name.
- */
-function nameMatchBonus(nodeName, query) {
-    const nameLower = nodeName.toLowerCase();
-    // Split query into word-level terms (handles "CacheBuilder build" → ["cache","builder","build"])
-    const rawTerms = query
-        .replace(/([a-z])([A-Z])/g, '$1 $2')
-        .split(/[\s_.\-]+/)
-        .map(t => t.toLowerCase())
-        .filter(t => t.length >= 2);
-    // Also keep original space-separated tokens for exact-term matching
-    const queryTokens = query.split(/\s+/).map(t => t.toLowerCase()).filter(t => t.length >= 2);
-    // Full query as a single token (for compound identifiers like "CacheBuilder")
-    const queryLower = query.replace(/[\s]+/g, '').toLowerCase();
-    // Exact match: query exactly equals the node name
-    if (nameLower === queryLower)
-        return 80;
-    // Exact match on a query token: "CacheBuilder build" and node name is "build"
-    if (queryTokens.length > 1 && queryTokens.includes(nameLower))
-        return 60;
-    // Name starts with query — scale by length ratio so "Pod"→"Pod" (exact, handled above)
-    // scores much higher than "Pod"→"PodGCControllerOptions" (ratio 0.125).
-    if (nameLower.startsWith(queryLower)) {
-        const ratio = queryLower.length / nameLower.length;
-        return Math.round(10 + 30 * ratio);
-    }
-    // All camelCase-split terms appear in the name
-    if (rawTerms.length > 1) {
-        const allMatch = rawTerms.every(t => nameLower.includes(t));
-        if (allMatch)
-            return 15;
-    }
-    // Name contains the full query as substring
-    if (nameLower.includes(queryLower))
-        return 10;
-    return 0;
-}
-/**
- * Kind-based bonus for search ranking
- * Functions and classes are typically more relevant than variables/imports
- */
-function kindBonus(kind) {
-    const bonuses = {
-        function: 10,
-        method: 10,
-        class: 8,
-        interface: 9,
-        type_alias: 6,
-        struct: 6,
-        trait: 9,
-        enum: 5,
-        component: 8,
-        route: 9,
-        module: 4,
-        property: 3,
-        field: 3,
-        variable: 2,
-        constant: 3,
-        import: 1,
-        export: 1,
-        parameter: 0,
-        namespace: 4,
-        file: 0,
-        protocol: 9,
-        enum_member: 3,
-    };
-    return bonuses[kind] ?? 0;
-}
-/**
- * Whether a query token looks like a code identifier the user deliberately typed
- * (camelCase / PascalCase-with-internal-caps / snake_case / has a digit) rather
- * than a plain dictionary word ("flat", "object", "screen").
- *
- * Used to decide whether an EXACT name match earns the "the user named this
- * symbol" exemption from single-term dampening. A common English word that
- * happens to exact-match an unrelated symbol — the query "flat object" matching
- * a constant named `FLAT` — must NOT get that exemption, or the +exact-name
- * bonus floats it to the top of a prose query on its own.
- *
- * Classifies the token AS THE USER TYPED IT, not the matched symbol's name:
- * "flat" (lowercase, descriptive) is non-distinctive even though it matches
- * `FLAT`. A leading-capital-only word ("Screen", "Zustand") is also treated as
- * a plain word — sentence-start capitalization and proper nouns aren't reliable
- * identifier signals.
- */
-function isDistinctiveIdentifier(token) {
-    if (!token)
-        return false;
-    // snake_case / SCREAMING_SNAKE, or an embedded digit → a deliberate identifier.
-    if (/[_0-9]/.test(token))
-        return true;
-    // An uppercase letter anywhere AFTER the first char → a camelCase/PascalCase
-    // boundary (setLastEmail, OrgUserStore) or an acronym (REST, HTTP).
-    if (/[A-Z]/.test(token.slice(1)))
-        return true;
-    return false;
-}
-//# sourceMappingURL=query-utils.js.map

package/dist/search/query-utils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"query-utils.js","sourceRoot":"","sources":["../../src/search/query-utils.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAOH,gDAEC;AAeD,0DAyBC;AA+BD,0CAyDC;AAcD,gDA2DC;AAMD,gDAsDC;AAKD,gCAuCC;AAwBD,wCAuCC;AAMD,8BA0BC;AAmBD,0DAQC;AAlbD,uCAAyB;AACzB,2CAA6B;AAG7B,6EAA6E;AAC7E,SAAgB,kBAAkB,CAAC,GAAW;IAC5C,OAAO,GAAG,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;AACrD,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAgB,uBAAuB,CAAC,WAAmB;IACzD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,MAAM,GAAG,GAAG,CAAC,GAA8B,EAAQ,EAAE;QACnD,IAAI,CAAC,GAAG;YAAE,OAAO;QACjB,MAAM,IAAI,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC;IAEF,sEAAsE;IACtE,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,QAAQ,CAAC,EAAE,OAAO,CAAC,CAAC;QACzE,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAC7C,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAC5C,CAAC;IAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC;IAE3B,iDAAiD;IACjD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,cAAc,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;QACzF,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3E,CAAC;IAAC,MAAM,CAAC,CAAC,+BAA+B,CAAC,CAAC;IAE3C,iFAAiF;IACjF,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IAE9C,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACU,QAAA,UAAU,GAAG,IAAI,GAAG,CAAC;IAChC,UAAU;IACV,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK;IACnE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK;IACpE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;IACzE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM;IACpE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK;IAC9D,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM;IAChE,MAAM,EAAE,MAAM,EAAE,MAAM;IACtB,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;IACjE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IAC9D,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;IACpD,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS;IACpD,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,SAAS;IAClD,aAAa,EAAE,WAAW;IAC1B,6FAA6F;IAC7F,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM;IAC9D,KAAK,EAAE,KAAK,EAAE,QAAQ;CACvB,CAAC,CAAC;AAEH;;;;GAIG;AACH,SAAgB,eAAe,CAAC,IAAY;IAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAE7B,+DAA+D;IAC/D,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;QACzB,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;YACxE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,kDAAkD;IAClD,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/D,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED,2BAA2B;IAC3B,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED,sBAAsB;IACtB,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IACrC,CAAC;IACD,wCAAwC;SACnC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1C,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,mDAAmD;SAC9C,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9D,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED,2DAA2D;IAC3D,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3D,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7B,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,8DAA8D;IAC9D,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;QACzB,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;YACxE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,kBAAkB,CAAC,KAAa,EAAE,OAA6B;IAC7E,MAAM,YAAY,GAAG,OAAO,EAAE,KAAK,KAAK,KAAK,CAAC;IAC9C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IAEjC,oEAAoE;IACpE,mDAAmD;IACnD,MAAM,eAAe,GAAG,yEAAyE,CAAC;IAClG,IAAI,KAAK,CAAC;IACV,OAAO,CAAC,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACtD,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACrC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,uCAAuC;QAC7E,CAAC;IACH,CAAC;IAED,wCAAwC;IACxC,MAAM,YAAY,GAAG,+CAA+C,CAAC;IACrE,OAAO,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACnD,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACrC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,gEAAgE;IAChE,MAAM,UAAU,GAAG,KAAK;SACrB,OAAO,CAAC,iBAAiB,EAAE,OAAO,CAAC;SACnC,OAAO,CAAC,uBAAuB,EAAE,OAAO,CAAC,CAAC;IAE7C,sEAAsE;IACtE,MAAM,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;IAErD,0CAA0C;IAC1C,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAEhE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC/B,IAAI,kBAAU,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QACpC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACpB,CAAC;IAED,mDAAmD;IACnD,mFAAmF;IACnF,yEAAyE;IACzE,6EAA6E;IAC7E,IAAI,YAAY,EAAE,CAAC;QACjB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAChC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,KAAK,MAAM,OAAO,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC7C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,kBAAU,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBACrD,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC;AACrB,CAAC;AAED;;;GAGG;AACH,SAAgB,kBAAkB,CAChC,QAAgB,EAChB,KAAa,EACb,iBAA+B;IAE/B,MAAM,SAAS,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;IACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAC;IACvD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAC;IACrD,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,6EAA6E;IAC7E,gEAAgE;IAChE,6EAA6E;IAC7E,4EAA4E;IAC5E,4EAA4E;IAC5E,4EAA4E;IAC5E,wEAAwE;IACxE,mEAAmE;IACnE,sEAAsE;IACtE,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAChE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEpC,6EAA6E;IAC7E,2EAA2E;IAC3E,6EAA6E;IAC7E,+EAA+E;IAC/E,yDAAyD;IACzD,MAAM,KAAK,GACT,iBAAiB,IAAI,iBAAiB,CAAC,IAAI,GAAG,CAAC;QAC7C,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,iBAAiB,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,CAAC,CAAC,QAAQ,CAAC;IACf,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC;IAEnD,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,wEAAwE;QACxE,mEAAmE;QACnE,MAAM,SAAS,GAAG,kBAAkB,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;QAC7D,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACrC,mCAAmC;QACnC,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAAE,KAAK,IAAI,EAAE,CAAC;QAC7D,kBAAkB;QAClB,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAAE,KAAK,IAAI,CAAC,CAAC;QAC3D,qBAAqB;aAChB,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAAE,KAAK,IAAI,CAAC,CAAC;IACpE,CAAC;IAED,qEAAqE;IACrE,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IACvC,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC/E,IAAI,CAAC,WAAW,IAAI,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QACzC,KAAK,IAAI,EAAE,CAAC;IACd,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAgB,UAAU,CAAC,QAAgB;IACzC,MAAM,KAAK,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAG,kDAAkD;IAC9F,MAAM,SAAS,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;IAEzC,4BAA4B;IAC5B,IACE,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,IAAiC,sBAAsB;QACpF,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC;QAC7B,0EAA0E;QAC1E,0CAA0C,CAAC,IAAI,CAAC,SAAS,CAAC;QAC1D,6EAA6E;QAC7E,4EAA4E;QAC5E,sCAAsC;QACtC,0DAA0D,CAAC,IAAI,CAAC,QAAQ,CAAC,EACzE,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,6BAA6B;IAC7B,IACE,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC;QACrD,KAAK,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC;QACzD,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC;QACxD,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC;QAC3B,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC;QACvD,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC;QACvD,0EAA0E;QAC1E,+EAA+E;QAC/E,8CAA8C;QAC9C,2CAA2C,CAAC,IAAI,CAAC,QAAQ,CAAC,EAC1D,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8EAA8E;IAC9E,6EAA6E;IAC7E,sEAAsE;IACtE,OAAO,uBAAuB,CAAC,KAAK,CAAC,CAAC;AACxC,CAAC;AAED;;;GAGG;AACH,SAAS,uBAAuB,CAAC,SAAiB;IAChD,MAAM,IAAI,GAAG;QACX,aAAa,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU;QACzD,SAAS,EAAE,UAAU,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO;KAClE,CAAC;IACF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,SAAS,CAAC,QAAQ,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI,SAAS,CAAC,UAAU,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC;YAC3E,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,SAAgB,cAAc,CAAC,QAAgB,EAAE,KAAa;IAC5D,MAAM,SAAS,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;IAEzC,iGAAiG;IACjG,MAAM,QAAQ,GAAG,KAAK;SACnB,OAAO,CAAC,iBAAiB,EAAE,OAAO,CAAC;SACnC,KAAK,CAAC,WAAW,CAAC;SAClB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;SACzB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IAE9B,oEAAoE;IACpE,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IAE5F,8EAA8E;IAC9E,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IAE7D,kDAAkD;IAClD,IAAI,SAAS,KAAK,UAAU;QAAE,OAAO,EAAE,CAAC;IAExC,8EAA8E;IAC9E,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC;QAAE,OAAO,EAAE,CAAC;IAEzE,uFAAuF;IACvF,wEAAwE;IACxE,IAAI,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QACrC,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;QACnD,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC;IACrC,CAAC;IAED,+CAA+C;IAC/C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,IAAI,QAAQ;YAAE,OAAO,EAAE,CAAC;IAC1B,CAAC;IAED,4CAA4C;IAC5C,IAAI,SAAS,CAAC,QAAQ,CAAC,UAAU,CAAC;QAAE,OAAO,EAAE,CAAC;IAE9C,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;GAGG;AACH,SAAgB,SAAS,CAAC,IAAkB;IAC1C,MAAM,OAAO,GAA2B;QACtC,QAAQ,EAAE,EAAE;QACZ,MAAM,EAAE,EAAE;QACV,KAAK,EAAE,CAAC;QACR,SAAS,EAAE,CAAC;QACZ,UAAU,EAAE,CAAC;QACb,MAAM,EAAE,CAAC;QACT,KAAK,EAAE,CAAC;QACR,IAAI,EAAE,CAAC;QACP,SAAS,EAAE,CAAC;QACZ,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,CAAC;QACT,QAAQ,EAAE,CAAC;QACX,KAAK,EAAE,CAAC;QACR,QAAQ,EAAE,CAAC;QACX,QAAQ,EAAE,CAAC;QACX,MAAM,EAAE,CAAC;QACT,MAAM,EAAE,CAAC;QACT,SAAS,EAAE,CAAC;QACZ,SAAS,EAAE,CAAC;QACZ,IAAI,EAAE,CAAC;QACP,QAAQ,EAAE,CAAC;QACX,WAAW,EAAE,CAAC;KACf,CAAC;IACF,OAAO,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC5B,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,SAAgB,uBAAuB,CAAC,KAAa;IACnD,IAAI,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC;IACzB,gFAAgF;IAChF,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACtC,6EAA6E;IAC7E,oEAAoE;IACpE,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9C,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/search/related.d.ts

@@ -1,178 +0,0 @@
-/**
- * Related-code search — find methods / classes / files with similar names
- * across the project. Cross-class retrieval: where `context` shows you a
- * method's siblings in the same class, `related` shows you its peers across
- * the whole codebase.
- *
- * MVP similarity metric: name-based (camelCase token overlap + Levenshtein
- * distance + substring match). No AST signature matching, no body-shape
- * analysis — those are explicit non-goals per clarify-requirements.
- *
- * Input is multi-granular:
- *   - `Class#method`        — method-level: find similar methods project-wide
- *   - `Class`               — class-level: find similar class/interface names
- *   - `path/to/file.java`   — file-level: find files with similar basenames
- *   - bare `<name>`         — fuzzy method search (like calls callers mode)
- *
- * Output: top-K matches, similarity-ranked. Same essential/recommended/optional
- * tiered budget as `calls` / `impact`.
- *
- * Isolation: lives under `src/search/`, imports nothing from the indexed
- * pipeline. Reuses call-sites helpers (listJavaFamilyFiles, DEFAULT_EXCLUDE_DIRS).
- */
-import type { Node as SyntaxNode } from 'web-tree-sitter';
-import type { Language } from '../types';
-export type RelatedQueryKind = 'method' | 'class' | 'file' | 'unknown';
-export interface RelatedOptions {
-    /** Max results after ranking. Default 20. */
-    topK?: number;
-    /** Char budget for output. Default 4000. */
-    budget?: number;
-    /** Languages to scan. Default ['java', 'kotlin']. */
-    languages?: Language[];
-    /** Directory globs to exclude. */
-    excludeDirs?: string[];
-    /** Force recommended tier (--snippet). */
-    withSnippet?: boolean;
-    /** Force optional tier (--full). */
-    full?: boolean;
-    /** Minimum similarity score to include (0-100). Default 20 (filters pure-noise matches). */
-    minScore?: number;
-}
-export interface RelatedMatch {
-    /** Match kind: method_declaration / class_declaration / interface_declaration / file. */
-    kind: 'method' | 'class' | 'interface' | 'enum' | 'record' | 'file';
-    /** Display name (method name, class name, or file basename). */
-    name: string;
-    /** Qualified name when applicable (`Class#method` or ` pkg.Class`). */
-    qualifiedName: string;
-    /** File path relative to projectRoot. */
-    filePath: string;
-    /** 1-based start line of the declaration (1 for whole-file matches). */
-    line: number;
-    /** Enclosing class for method matches, else null. */
-    enclosingClass: string | null;
-    /** 0-100 similarity score. */
-    similarity: number;
-    /** Why this matched (one-line breakdown of the similarity score). */
-    reason: string;
-    /** Snippet (declaration line + 1-2 context lines). */
-    snippet: string;
-    /** Tier assigned by budget allocator. */
-    tier?: 'essential' | 'recommended' | 'optional';
-    /**
-     * Return type of the candidate's enclosing method (Java: explicit return type;
-     * Kotlin: `: Type` suffix or undefined when omitted). Used for semantic penalty.
-     * Omitted for file/class matches.
-     */
-    enclosingReturnType?: string;
-}
-export interface RelatedResult {
-    /** Original input. */
-    query: string;
-    /** Detected query kind. */
-    queryKind: RelatedQueryKind;
-    /** Normalized query name (e.g. `sceneCommit` extracted from `Class#sceneCommit`). */
-    queryName: string;
-    /** Total matches found above minScore. */
-    totalFound: number;
-    /** Matches returned after topK + budget. */
-    returned: number;
-    matches: RelatedMatch[];
-    omitted: {
-        belowMinScore: number;
-        pastTopK: number;
-        truncatedByBudget: number;
-    };
-}
-export declare function searchRelated(projectRoot: string, query: string, options?: RelatedOptions): Promise<RelatedResult>;
-export interface SimilarityScore {
-    score: number;
-    reason: string;
-}
-/**
- * Score name similarity 0-100. Higher = more similar.
- *
- * Heuristics (first match wins):
- *   exact match (different class)             → 100
- *   query is exact prefix of candidate        → 85  (createOrder vs createOrderAsync)
- *   candidate is exact prefix of query        → 75
- *   all query tokens appear in candidate      → 75  (camelCase token overlap)
- *   some query tokens match exactly           → 30 + 10 * overlap
- *   Levenshtein distance ≤ 2                  → 60 - dist * 10
- *   substring match (one contains the other)  → 40
- *   Levenshtein distance ≤ 5                  → 25
- *   else                                      → 0
- */
-export declare function nameSimilarity(query: string, candidate: string): SimilarityScore;
-/**
- * Split camelCase / PascalCase identifier into lowercase tokens.
- * `createOrderAsync` → ['create', 'Order', 'Async']
- * `OrderService` → ['Order', 'Service']
- * `ICustomerOrderService` → ['ICustomer', 'Order', 'Service']
- *   (note: leading `I` is preserved; we don't strip interface-prefix here)
- */
-export declare function camelSplit(s: string): string[];
-/**
- * Standard Levenshtein distance (no early termination — names are short).
- */
-export declare function levenshtein(a: string, b: string): number;
-/**
- * POJO / primitive-ish return types. A candidate whose enclosing method returns
- * one of these is likely a simple accessor/converter, not the business method
- * the query is after. Add more here if probe shows new patterns.
- */
-export declare const POJO_RETURN_TYPES: Set<string>;
-/** Candidate name starts with `get`/`is`/`has` followed by an uppercase letter. */
-export declare const GETTER_PREFIX: RegExp;
-/** Penalty values. Tunable range per plan: -20/-15 (initial) → -25/-20 (max). */
-export declare const PENALTY_POJO_VS_DOMAIN = -20;
-export declare const PENALTY_GETTER_MISMATCH = -15;
-export interface MethodContext {
-    name: string;
-    /** Java: explicit return type (`String`, `CreateCustomerOrderRspVo`, `void`).
-     *  Kotlin: `: Type` suffix, or undefined when omitted (Unit inferred).
-     *  Omitted when the candidate is not a method (e.g. file/class match). */
-    enclosingReturnType?: string;
-}
-/**
- * Returns a non-positive penalty. Higher absolute value = more penalty.
- *
- * Rule 1: candidate returns POJO but query returns domain object → -20
- * Rule 2: candidate starts with get/is/has but query doesn't → -15
- * Rules stack (worst case -35 with defaults).
- *
- * Pure function — no I/O, no AST. Safe to unit-test directly.
- */
-export declare function semanticPenalty(candidate: MethodContext, queryMethod: MethodContext): number;
-/**
- * Extract a method's declared return type from its AST node.
- *
- * Java `method_declaration`: read the `type` field (tree-sitter-java exposes
- *   this for explicit return types). Constructors have no return type → undefined.
- * Kotlin `function_declaration`: scan children for the `:` token, then take the
- *   following type node's text. Omitted return type (Unit inferred) → undefined.
- *
- * Returns undefined for unknown node shapes (defensive — caller skips penalty).
- */
-export declare function extractMethodReturnType(node: SyntaxNode, language: Language): string | undefined;
-/**
- * Derive the query method's likely return type from collected candidates.
- *
- * Strategy: among same-name candidates (name === queryName), pick the most
- * frequent non-undefined return type. This is a heuristic — we assume the
- * query method exists in the codebase and its return type appears in the
- * candidate set. Returns undefined if no same-name candidate has a return type.
- */
-export declare function deriveQueryReturnType(candidates: RelatedMatch[], queryName: string): string | undefined;
-export declare function applyRelatedTieredBudget(matches: RelatedMatch[], budget: number, opts?: {
-    forceRecommended?: boolean;
-    forceOptional?: boolean;
-}): {
-    tiered: RelatedMatch[];
-    truncatedByBudget: number;
-};
-export declare function formatRelatedResult(result: RelatedResult, options?: {
-    explain?: boolean;
-}): string;
-//# sourceMappingURL=related.d.ts.map

package/dist/search/related.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"related.d.ts","sourceRoot":"","sources":["../../src/search/related.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAKH,OAAO,KAAK,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC1D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AAWzC,MAAM,MAAM,gBAAgB,GAAG,QAAQ,GAAG,OAAO,GAAG,MAAM,GAAG,SAAS,CAAC;AAEvE,MAAM,WAAW,cAAc;IAC7B,6CAA6C;IAC7C,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,4CAA4C;IAC5C,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,qDAAqD;IACrD,SAAS,CAAC,EAAE,QAAQ,EAAE,CAAC;IACvB,kCAAkC;IAClC,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;IACvB,0CAA0C;IAC1C,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,oCAAoC;IACpC,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,4FAA4F;IAC5F,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,YAAY;IAC3B,yFAAyF;IACzF,IAAI,EAAE,QAAQ,GAAG,OAAO,GAAG,WAAW,GAAG,MAAM,GAAG,QAAQ,GAAG,MAAM,CAAC;IACpE,gEAAgE;IAChE,IAAI,EAAE,MAAM,CAAC;IACb,uEAAuE;IACvE,aAAa,EAAE,MAAM,CAAC;IACtB,yCAAyC;IACzC,QAAQ,EAAE,MAAM,CAAC;IACjB,wEAAwE;IACxE,IAAI,EAAE,MAAM,CAAC;IACb,qDAAqD;IACrD,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,8BAA8B;IAC9B,UAAU,EAAE,MAAM,CAAC;IACnB,qEAAqE;IACrE,MAAM,EAAE,MAAM,CAAC;IACf,sDAAsD;IACtD,OAAO,EAAE,MAAM,CAAC;IAChB,yCAAyC;IACzC,IAAI,CAAC,EAAE,WAAW,GAAG,aAAa,GAAG,UAAU,CAAC;IAChD;;;;OAIG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAC;CAC9B;AAED,MAAM,WAAW,aAAa;IAC5B,sBAAsB;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,2BAA2B;IAC3B,SAAS,EAAE,gBAAgB,CAAC;IAC5B,qFAAqF;IACrF,SAAS,EAAE,MAAM,CAAC;IAClB,0CAA0C;IAC1C,UAAU,EAAE,MAAM,CAAC;IACnB,4CAA4C;IAC5C,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,OAAO,EAAE;QACP,aAAa,EAAE,MAAM,CAAC;QACtB,QAAQ,EAAE,MAAM,CAAC;QACjB,iBAAiB,EAAE,MAAM,CAAC;KAC3B,CAAC;CACH;AAMD,wBAAsB,aAAa,CACjC,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,cAAmB,GAC3B,OAAO,CAAC,aAAa,CAAC,CAsMxB;AAgCD,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,eAAe,CAwDhF;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAI9C;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAqBxD;AAsBD;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,aAG5B,CAAC;AAEH,mFAAmF;AACnF,eAAO,MAAM,aAAa,QAAuB,CAAC;AAElD,iFAAiF;AACjF,eAAO,MAAM,sBAAsB,MAAM,CAAC;AAC1C,eAAO,MAAM,uBAAuB,MAAM,CAAC;AAE3C,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb;;8EAE0E;IAC1E,mBAAmB,CAAC,EAAE,MAAM,CAAC;CAC9B;AAED;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAC7B,SAAS,EAAE,aAAa,EACxB,WAAW,EAAE,aAAa,GACzB,MAAM,CAmBR;AAED;;;;;;;;;GASG;AACH,wBAAgB,uBAAuB,CACrC,IAAI,EAAE,UAAU,EAChB,QAAQ,EAAE,QAAQ,GACjB,MAAM,GAAG,SAAS,CAyBpB;AAgBD;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CACnC,UAAU,EAAE,YAAY,EAAE,EAC1B,SAAS,EAAE,MAAM,GAChB,MAAM,GAAG,SAAS,CAiBpB;AAuCD,wBAAgB,wBAAwB,CACtC,OAAO,EAAE,YAAY,EAAE,EACvB,MAAM,EAAE,MAAM,EACd,IAAI,GAAE;IAAE,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAAC,aAAa,CAAC,EAAE,OAAO,CAAA;CAAO,GACjE;IAAE,MAAM,EAAE,YAAY,EAAE,CAAC;IAAC,iBAAiB,EAAE,MAAM,CAAA;CAAE,CAqCvD;AAMD,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,aAAa,EACrB,OAAO,CAAC,EAAE;IAAE,OAAO,CAAC,EAAE,OAAO,CAAA;CAAE,GAC9B,MAAM,CAmER"}