seer-mcp 0.1.0

package/dist/indexer/serviceLinks.js

@@ -0,0 +1,509 @@
+"use strict";
+/**
+ * Track G — service-link resolver and helpers.
+ *
+ * Two concerns live here, kept independent so they can be unit-tested in
+ * isolation:
+ *
+ *   1. `normalizeHttpTarget(raw)` — turn a string captured at a client call
+ *      site (literal URL, template path, env-prefixed concat) into a
+ *      `{ path, hostHint, envKey }` triple where each field is undefined when
+ *      it can't be confidently recovered. Pure function; no DB access.
+ *
+ *   2. `routePatternsMatch(callPath, routePath)` — decide whether a literal
+ *      caller path matches a (possibly parameterised) framework route.
+ *      Returns a `{ matched, confidence, reason }` result so the resolver
+ *      can ranke evidence without recomputing it.
+ *
+ *   3. `resolveServiceLinks(store)` — the actual post-index resolver.
+ *      Wipes prior service_links, scans service_calls + routes, and inserts
+ *      one row per confident rendezvous.
+ *
+ * Deterministic by construction: the resolver runs candidates in id order
+ * and only emits a top match (with ambiguity recorded as evidence) so two
+ * runs of the same DB produce the same service_links rows.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.normalizeHttpTarget = normalizeHttpTarget;
+exports.routePatternsMatch = routePatternsMatch;
+exports.methodMatchScore = methodMatchScore;
+exports.resolveServiceLinks = resolveServiceLinks;
+exports.normalizeRoutePath = normalizeRoutePath;
+/**
+ * Normalize an HTTP target captured at a client call site.
+ *
+ * Rules:
+ *   - strip scheme + host when literal (`https://payment/api/charge` → `/api/charge`, host = `payment`)
+ *   - keep route paths starting with '/'
+ *   - drop query string and fragment
+ *   - normalize trailing slash (but keep root '/'): '/api/users/' → '/api/users'
+ *   - drop empty paths
+ *   - do NOT collapse dynamic segments — that's the route-pattern matcher's job.
+ */
+function normalizeHttpTarget(raw) {
+    if (!raw || typeof raw !== 'string')
+        return {};
+    let s = raw.trim();
+    if (!s)
+        return {};
+    let hostHint;
+    // Strip scheme + host if present.
+    const schemeMatch = s.match(/^(https?):\/\/([^/?#]+)(.*)$/i);
+    if (schemeMatch) {
+        hostHint = schemeMatch[2];
+        s = schemeMatch[3] || '/';
+    }
+    else if (/^[a-zA-Z0-9._-]+\/[a-zA-Z0-9_./%-]+/.test(s) && !s.startsWith('/')) {
+        // Bare host/path with no scheme (rare but seen in some libs).
+        const firstSlash = s.indexOf('/');
+        if (firstSlash > 0) {
+            hostHint = s.slice(0, firstSlash);
+            s = s.slice(firstSlash);
+        }
+    }
+    // Strip query + fragment.
+    const q = s.indexOf('?');
+    if (q >= 0)
+        s = s.slice(0, q);
+    const h = s.indexOf('#');
+    if (h >= 0)
+        s = s.slice(0, h);
+    // Trailing slash normalization (keep root).
+    if (s.length > 1 && s.endsWith('/'))
+        s = s.slice(0, -1);
+    let path;
+    if (s.startsWith('/'))
+        path = s;
+    const out = {};
+    if (path)
+        out.path = path;
+    if (hostHint)
+        out.hostHint = hostHint;
+    return out;
+}
+/**
+ * Decide whether `callPath` (literal) satisfies a (possibly parameterised)
+ * `routePath` like `/users/:id`, `/users/{id}`, `/items/<int:n>`.
+ *
+ * No method check here — the resolver applies method comparison around this
+ * with method-mismatch falling back to a lower confidence.
+ *
+ * Returns matched=false when the segment count differs OR a literal segment
+ * differs. Parameter segments (`:x`, `{x}`, `<...:x>`) match any one segment.
+ */
+function routePatternsMatch(callPath, routePath) {
+    if (!callPath || !routePath)
+        return { matched: false, confidence: 0, reason: 'empty' };
+    // Exact literal match.
+    if (callPath === routePath) {
+        return { matched: true, confidence: 0.95, reason: 'literal_path' };
+    }
+    const callSegs = callPath.split('/').filter(Boolean);
+    const routeSegs = routePath.split('/').filter(Boolean);
+    if (callSegs.length !== routeSegs.length) {
+        return { matched: false, confidence: 0, reason: 'segment_count' };
+    }
+    let paramHits = 0;
+    for (let i = 0; i < callSegs.length; i++) {
+        const r = routeSegs[i];
+        const c = callSegs[i];
+        if (isParamSegment(r)) {
+            paramHits++;
+            continue;
+        }
+        if (r !== c)
+            return { matched: false, confidence: 0, reason: 'segment_mismatch' };
+    }
+    if (paramHits === 0) {
+        // Same literal segment count but no params — earlier exact check should
+        // have caught this. Treat as no match so we don't accidentally rank
+        // /a/b == /a/b twice.
+        return { matched: false, confidence: 0, reason: 'duplicate_literal' };
+    }
+    return { matched: true, confidence: 0.85, reason: 'route_pattern' };
+}
+function isParamSegment(seg) {
+    // Express :id, FastAPI {id}, Spring {id}, Flask <int:id>
+    if (seg.startsWith(':'))
+        return true;
+    if (seg.startsWith('{') && seg.endsWith('}'))
+        return true;
+    if (seg.startsWith('<') && seg.endsWith('>'))
+        return true;
+    return false;
+}
+/**
+ * Compare two HTTP methods, treating 'ANY' (client unknown method) and route's
+ * absence of method as wildcards. Returns:
+ *   1.0 — methods match exactly (including both 'ANY')
+ *   0.9 — caller method known + route is ANY (or vice versa)
+ *   0.0 — explicit mismatch (e.g. POST vs GET)
+ */
+function methodMatchScore(callMethod, routeMethod) {
+    const cm = (callMethod ?? 'ANY').toUpperCase();
+    const rm = (routeMethod ?? 'ANY').toUpperCase();
+    if (cm === rm)
+        return 1.0;
+    if (cm === 'ANY' || rm === 'ANY')
+        return 0.9;
+    return 0.0;
+}
+// v9 Track-H — hard cap on how many candidate routes we consider for a single
+// service_call. A symbol with 25+ matching routes is almost always ambiguous
+// (think a generic /users/:id route in 30 microservices); we keep determinism
+// by sorting first and then truncating, and record `truncated: true` in the
+// link's evidence so the agent can see the cutoff happened.
+const MAX_CANDIDATES_PER_CALL = 25;
+// Cap on how many candidates we serialize into evidence_json. Smaller than the
+// cap above so a link row stays compact even when many routes matched.
+const MAX_EVIDENCE_CANDIDATES = 5;
+/**
+ * Wipe service_links and rebuild from current service_calls + routes.
+ * Deterministic: orders candidates by id ascending and ties are broken by id.
+ *
+ * Match strategy:
+ *   1. literal_path  — call.path == route.path, method compatible
+ *   2. route_pattern — call.path matches a parameterised route, method compatible
+ *   3. env_base      — call carried an env key; we record the link only when
+ *                      the path *also* matches a route (env alone is not enough).
+ *
+ * S3 (service_host) — k8s/Docker host resolution — is provided by
+ * `scanServiceHosts()` and passed in as optional evidence.
+ */
+function resolveServiceLinks(store, options = {}) {
+    const raw = store.rawDb();
+    raw.exec('DELETE FROM service_links');
+    // v9: detect whether the v9 generalized columns exist. listServiceCalls
+    // reads them but we use a raw SELECT here for speed.
+    const hasV9Cols = hasColumn(raw, 'service_calls', 'operation');
+    const v9Cols = hasV9Cols ? ', operation, topic, queue, service' : '';
+    const calls = raw.prepare(`SELECT id, symbol_id, protocol, method, raw_target, normalized_path,
+            host_hint, env_key, framework ${v9Cols}
+       FROM service_calls
+      ORDER BY id ASC`).all();
+    // v9 Track-H — build a doc-identifier → field-name map from gql-doc sentinel
+    // rows. Lets us rewrite `client.query({ query: GET_USER })` whose operation
+    // is the const name to the operation field parsed from its gql body.
+    const gqlDocMap = new Map();
+    for (const c of calls) {
+        if (c.framework !== 'gql-doc' || !c.operation || !c.raw_target)
+            continue;
+        gqlDocMap.set(c.raw_target, { operation: c.operation, method: c.method });
+    }
+    const hasV9RouteCols = hasColumn(raw, 'routes', 'protocol');
+    const v9RouteCols = hasV9RouteCols
+        ? ', protocol, operation, topic, queue, service'
+        : '';
+    const routes = raw.prepare(`SELECT id, method, path, framework, handler_id ${v9RouteCols}
+       FROM routes
+      ORDER BY id ASC`).all();
+    // Backfill protocol/operation for pre-v9 row shape — every pre-v9 route is HTTP.
+    if (!hasV9RouteCols) {
+        for (const r of routes) {
+            r.protocol = 'http';
+            r.operation = null;
+            r.topic = null;
+            r.queue = null;
+            r.service = null;
+        }
+    }
+    // Index routes by exact path for cheap lookup (HTTP only), and by operation
+    // (tRPC / GraphQL / gRPC), and keep the full list for parameterised matching.
+    const byExactPath = new Map();
+    const byOperation = new Map(); // key = `${protocol}:${operation}`
+    const byTopic = new Map(); // key = topic
+    const byQueue = new Map(); // key = queue
+    for (const r of routes) {
+        const proto = r.protocol ?? 'http';
+        if (proto === 'http' && r.path) {
+            const norm = normalizeRoutePath(r.path);
+            const list = byExactPath.get(norm);
+            if (list)
+                list.push(r);
+            else
+                byExactPath.set(norm, [r]);
+        }
+        if (r.operation) {
+            const key = `${proto}:${r.operation}`;
+            const list = byOperation.get(key);
+            if (list)
+                list.push(r);
+            else
+                byOperation.set(key, [r]);
+        }
+        if (r.topic) {
+            const list = byTopic.get(r.topic);
+            if (list)
+                list.push(r);
+            else
+                byTopic.set(r.topic, [r]);
+        }
+        if (r.queue) {
+            const list = byQueue.get(r.queue);
+            if (list)
+                list.push(r);
+            else
+                byQueue.set(r.queue, [r]);
+        }
+    }
+    const insertLink = store.makeServiceLinkInserter();
+    const byKind = {
+        literal_path: 0, env_base: 0, service_host: 0, route_pattern: 0,
+        trpc_procedure: 0, graphql_operation: 0, grpc_method: 0,
+        topic_match: 0, queue_match: 0, exchange_match: 0,
+    };
+    let considered = 0;
+    let inserted = 0;
+    let truncatedCalls = 0;
+    for (const c of calls) {
+        const candidates = [];
+        if (c.protocol === 'http') {
+            if (!c.normalized_path)
+                continue;
+            considered++;
+            // Known service host? Used as a confidence boost AND as the match_kind
+            // when the host carries strictly more signal than the path alone.
+            const knownHost = c.host_hint
+                ? options.hostMap?.hosts.has(c.host_hint.toLowerCase())
+                : false;
+            const hostBoost = knownHost ? 1.05 : 1.0;
+            // Pass 1 — literal exact path matches (HTTP only).
+            const exacts = byExactPath.get(c.normalized_path) ?? [];
+            for (const r of exacts) {
+                // Only HTTP routes; tRPC operation could in theory collide with a path
+                // string but we filter by route.protocol to keep concerns separate.
+                if ((r.protocol ?? 'http') !== 'http')
+                    continue;
+                const ms = methodMatchScore(c.method, r.method);
+                if (ms === 0)
+                    continue;
+                const conf = Math.min(1.0, 0.95 * ms * hostBoost);
+                // Prefer 'service_host' when we have a known k8s/Docker host AND the
+                // call has no env_key — both the host name and a workspace route
+                // independently agree. Otherwise fall back to env_base / literal_path.
+                const matchKind = knownHost && !c.env_key
+                    ? 'service_host'
+                    : (c.env_key ? 'env_base' : 'literal_path');
+                candidates.push({
+                    route: r, confidence: conf, matchKind,
+                    reason: knownHost ? 'literal_path+service_host' : 'literal_path',
+                });
+            }
+            // Pass 2 — parameterised route matches. Only if no exact hit.
+            if (candidates.length === 0) {
+                for (const r of routes) {
+                    if ((r.protocol ?? 'http') !== 'http')
+                        continue;
+                    const pm = routePatternsMatch(c.normalized_path, normalizeRoutePath(r.path));
+                    if (!pm.matched)
+                        continue;
+                    const ms = methodMatchScore(c.method, r.method);
+                    if (ms === 0)
+                        continue;
+                    const conf = Math.min(1.0, pm.confidence * ms * hostBoost);
+                    candidates.push({
+                        route: r, confidence: conf,
+                        matchKind: knownHost && !c.env_key ? 'service_host' : 'route_pattern',
+                        reason: knownHost ? `${pm.reason}+service_host` : pm.reason,
+                    });
+                }
+            }
+        }
+        else if (c.protocol === 'trpc') {
+            if (!c.operation)
+                continue;
+            considered++;
+            // tRPC clients carry the full nested procedure path like 'user.getById';
+            // server-side routes carry only their immediate procedure key like
+            // 'getById'. We match either way: prefer exact full-path equality, then
+            // fall back to last-segment match.
+            const exacts = byOperation.get(`trpc:${c.operation}`) ?? [];
+            for (const r of exacts) {
+                const ms = methodMatchScore(c.method, r.method);
+                // tRPC method match: query vs query etc.; fall back to ANY-as-wildcard.
+                const conf = 0.95 * (ms === 0 ? 0.85 : ms);
+                candidates.push({
+                    route: r, confidence: conf,
+                    matchKind: 'trpc_procedure', reason: 'exact_operation',
+                });
+            }
+            if (candidates.length === 0) {
+                // Last-segment fallback: client 'user.getById' matches server route
+                // whose operation is 'getById' (a procedure inside a sub-router).
+                const lastSeg = c.operation.split('.').pop();
+                const tail = byOperation.get(`trpc:${lastSeg}`) ?? [];
+                for (const r of tail) {
+                    const ms = methodMatchScore(c.method, r.method);
+                    const conf = 0.7 * (ms === 0 ? 0.85 : ms);
+                    candidates.push({
+                        route: r, confidence: conf,
+                        matchKind: 'trpc_procedure', reason: 'last_segment_operation',
+                    });
+                }
+            }
+        }
+        else if (c.protocol === 'graphql') {
+            // gql-doc sentinel rows: skip — they're document definitions, not calls.
+            if (c.framework === 'gql-doc')
+                continue;
+            if (!c.operation)
+                continue;
+            considered++;
+            // Resolve operation: prefer the parsed field name. If the operation is a
+            // known document-identifier (e.g. GET_USER) and we have a sentinel for
+            // it, use the sentinel's field name instead.
+            let effectiveOp = c.operation;
+            let effectiveMethod = c.method;
+            const doc = gqlDocMap.get(c.operation);
+            if (doc) {
+                effectiveOp = doc.operation;
+                if (!effectiveMethod && doc.method)
+                    effectiveMethod = doc.method;
+            }
+            const exacts = byOperation.get(`graphql:${effectiveOp}`) ?? [];
+            for (const r of exacts) {
+                const ms = methodMatchScore(effectiveMethod, r.method);
+                const conf = 0.9 * (ms === 0 ? 0.85 : ms);
+                candidates.push({
+                    route: r, confidence: conf,
+                    matchKind: 'graphql_operation',
+                    reason: doc ? 'gql_doc_field' : 'exact_operation',
+                });
+            }
+        }
+        else if (c.protocol === 'grpc') {
+            // Match by service + method, encoded as 'Service/Method' or just 'Method'.
+            const op = c.operation;
+            if (!op)
+                continue;
+            considered++;
+            const exacts = byOperation.get(`grpc:${op}`) ?? [];
+            for (const r of exacts) {
+                candidates.push({
+                    route: r, confidence: 0.95,
+                    matchKind: 'grpc_method', reason: 'exact_grpc_method',
+                });
+            }
+        }
+        else if (c.protocol === 'kafka' || c.protocol === 'sns' ||
+            c.protocol === 'nats' || c.protocol === 'redis_pubsub') {
+            if (!c.topic)
+                continue;
+            considered++;
+            const consumers = byTopic.get(c.topic) ?? [];
+            for (const r of consumers) {
+                if ((r.protocol ?? '') !== c.protocol)
+                    continue;
+                candidates.push({
+                    route: r, confidence: 0.9,
+                    matchKind: 'topic_match', reason: 'topic_match',
+                });
+            }
+        }
+        else if (c.protocol === 'sqs' || c.protocol === 'rabbitmq') {
+            if (!c.queue)
+                continue;
+            considered++;
+            const consumers = byQueue.get(c.queue) ?? [];
+            for (const r of consumers) {
+                if ((r.protocol ?? '') !== c.protocol)
+                    continue;
+                candidates.push({
+                    route: r, confidence: 0.9,
+                    matchKind: 'queue_match', reason: 'queue_match',
+                });
+            }
+        }
+        else {
+            // websocket / sse / unknown — skip for now; future plans can add them.
+            continue;
+        }
+        if (candidates.length === 0)
+            continue;
+        // Sort by (confidence DESC, route_id ASC, match_kind ASC) so the top pick
+        // — and the ambiguity ordering — is deterministic across runs. match_kind
+        // is a tertiary tie-break in case two routes have identical id+confidence
+        // (shouldn't happen, but defensive).
+        candidates.sort((a, b) => {
+            if (b.confidence !== a.confidence)
+                return b.confidence - a.confidence;
+            if (a.route.id !== b.route.id)
+                return a.route.id - b.route.id;
+            return a.matchKind < b.matchKind ? -1 : a.matchKind > b.matchKind ? 1 : 0;
+        });
+        // Cap candidates considered. Truncation is recorded in evidence so the
+        // agent can see the cutoff fired. Capping AFTER sorting preserves the
+        // best matches.
+        const totalCandidates = candidates.length;
+        let didTruncate = false;
+        if (candidates.length > MAX_CANDIDATES_PER_CALL) {
+            candidates.length = MAX_CANDIDATES_PER_CALL;
+            didTruncate = true;
+            truncatedCalls++;
+        }
+        const top = candidates[0];
+        const ambiguity = candidates.length > 1
+            ? candidates.slice(1, 1 + MAX_EVIDENCE_CANDIDATES).map(x => ({
+                route_id: x.route.id,
+                confidence: Number(x.confidence.toFixed(3)),
+                reason: x.reason,
+                match_kind: x.matchKind,
+            }))
+            : [];
+        const evidence = JSON.stringify({
+            reason: top.reason,
+            method_call: c.method,
+            method_route: top.route.method,
+            env_key: c.env_key ?? null,
+            host_hint: c.host_hint ?? null,
+            raw_target: c.raw_target,
+            operation: c.operation ?? null,
+            topic: c.topic ?? null,
+            queue: c.queue ?? null,
+            service: c.service ?? null,
+            total_candidates: totalCandidates,
+            truncated: didTruncate,
+            ambiguity_candidates: ambiguity,
+        });
+        insertLink({
+            callId: c.id,
+            routeId: top.route.id,
+            callerSymbolId: c.symbol_id,
+            handlerSymbolId: top.route.handler_id,
+            protocol: c.protocol,
+            matchKind: top.matchKind,
+            confidence: Number(top.confidence.toFixed(3)),
+            evidenceJson: evidence,
+        });
+        byKind[top.matchKind] = (byKind[top.matchKind] ?? 0) + 1;
+        inserted++;
+    }
+    return {
+        callsConsidered: considered,
+        linksInserted: inserted,
+        byKind: byKind,
+        truncated: truncatedCalls,
+    };
+}
+/** Cheap PRAGMA-based column-existence check; used so the resolver can run
+ *  unchanged against a pre-v9 DB shape. */
+function hasColumn(raw, table, column) {
+    try {
+        const rows = raw.prepare(`PRAGMA table_info(${table})`).all();
+        return rows.some(r => r.name === column);
+    }
+    catch {
+        return false;
+    }
+}
+/** Apply the same normalization to a route path as to a call path so the
+ *  byExactPath comparison is symmetric (strip trailing slash, etc). */
+function normalizeRoutePath(p) {
+    if (!p)
+        return '';
+    let s = p.trim();
+    if (s.length > 1 && s.endsWith('/'))
+        s = s.slice(0, -1);
+    return s;
+}
+//# sourceMappingURL=serviceLinks.js.map

package/dist/indexer/serviceLinks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"serviceLinks.js","sourceRoot":"","sources":["../../src/indexer/serviceLinks.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;;AAsCH,kDAqCC;AAoBD,gDAyBC;AAiBD,4CAOC;AAwCD,kDA6TC;AAaD,gDAKC;AA5eD;;;;;;;;;;GAUG;AACH,SAAgB,mBAAmB,CAAC,GAAW;IAC7C,IAAI,CAAC,GAAG,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,EAAE,CAAC;IAC/C,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IACnB,IAAI,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IAElB,IAAI,QAA4B,CAAC;IAEjC,kCAAkC;IAClC,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC;IAC7D,IAAI,WAAW,EAAE,CAAC;QAChB,QAAQ,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;IAC5B,CAAC;SAAM,IAAI,qCAAqC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/E,8DAA8D;QAC9D,MAAM,UAAU,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACnB,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAClC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,0BAA0B;IAC1B,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACzB,IAAI,CAAC,IAAI,CAAC;QAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9B,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACzB,IAAI,CAAC,IAAI,CAAC;QAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE9B,4CAA4C;IAC5C,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAExD,IAAI,IAAwB,CAAC;IAC7B,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,IAAI,GAAG,CAAC,CAAC;IAEhC,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,IAAI,IAAI;QAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC;IAC1B,IAAI,QAAQ;QAAE,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC;IACtC,OAAO,GAAG,CAAC;AACb,CAAC;AAUD;;;;;;;;;GASG;AACH,SAAgB,kBAAkB,CAAC,QAAgB,EAAE,SAAiB;IACpE,IAAI,CAAC,QAAQ,IAAI,CAAC,SAAS;QAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;IACvF,uBAAuB;IACvB,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC;IACrE,CAAC;IACD,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACrD,MAAM,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACvD,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;QACzC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC;IACpE,CAAC;IACD,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC;YAAC,SAAS,EAAE,CAAC;YAAC,SAAS;QAAC,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,kBAAkB,EAAE,CAAC;IACpF,CAAC;IACD,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QACpB,wEAAwE;QACxE,oEAAoE;QACpE,sBAAsB;QACtB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,mBAAmB,EAAE,CAAC;IACxE,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC;AACtE,CAAC;AAED,SAAS,cAAc,CAAC,GAAW;IACjC,yDAAyD;IACzD,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1D,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1D,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,gBAAgB,CAAC,UAAqC,EACrC,WAAsC;IACrE,MAAM,EAAE,GAAG,CAAC,UAAU,IAAI,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;IAC/C,MAAM,EAAE,GAAG,CAAC,WAAW,IAAI,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;IAChD,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,GAAG,CAAC;IAC1B,IAAI,EAAE,KAAK,KAAK,IAAI,EAAE,KAAK,KAAK;QAAE,OAAO,GAAG,CAAC;IAC7C,OAAO,GAAG,CAAC;AACb,CAAC;AAiBD,8EAA8E;AAC9E,6EAA6E;AAC7E,8EAA8E;AAC9E,4EAA4E;AAC5E,4DAA4D;AAC5D,MAAM,uBAAuB,GAAG,EAAE,CAAC;AACnC,+EAA+E;AAC/E,uEAAuE;AACvE,MAAM,uBAAuB,GAAG,CAAC,CAAC;AAElC;;;;;;;;;;;;GAYG;AACH,SAAgB,mBAAmB,CAAC,KAAY,EAAE,UAAwC,EAAE;IAC1F,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAC1B,GAAG,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;IAYtC,wEAAwE;IACxE,qDAAqD;IACrD,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,EAAE,eAAe,EAAE,WAAW,CAAC,CAAC;IAC/D,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,oCAAoC,CAAC,CAAC,CAAC,EAAE,CAAC;IACrE,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CACvB;4CACwC,MAAM;;sBAE5B,CACnB,CAAC,GAAG,EAAe,CAAC;IAErB,6EAA6E;IAC7E,4EAA4E;IAC5E,qEAAqE;IACrE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAwD,CAAC;IAClF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,SAAS,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,UAAU;YAAE,SAAS;QACzE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5E,CAAC;IAWD,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;IAC5D,MAAM,WAAW,GAAG,cAAc;QAChC,CAAC,CAAC,8CAA8C;QAChD,CAAC,CAAC,EAAE,CAAC;IACP,MAAM,MAAM,GAAG,GAAG,CAAC,OAAO,CACxB,kDAAkD,WAAW;;sBAE3C,CACnB,CAAC,GAAG,EAAgB,CAAC;IACtB,iFAAiF;IACjF,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,CAAC,CAAC,QAAQ,GAAG,MAAM,CAAC;YACpB,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC;YACnB,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC;YAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC;YAAC,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC;QACnD,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,8EAA8E;IAC9E,MAAM,WAAW,GAAG,IAAI,GAAG,EAAsB,CAAC;IAClD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAsB,CAAC,CAAQ,mCAAmC;IAC7F,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC,CAAa,cAAc;IACzE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC,CAAa,cAAc;IACzE,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,IAAI,MAAM,CAAC;QACnC,IAAI,KAAK,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAG,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACxC,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;gBAAM,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,CAAC;QACD,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;YAChB,MAAM,GAAG,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;gBAAM,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,CAAC;QACD,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YACZ,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;gBAAM,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,CAAC;QACD,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YACZ,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;gBAAM,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAG,KAAK,CAAC,uBAAuB,EAAE,CAAC;IACnD,MAAM,MAAM,GAA2B;QACrC,YAAY,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC;QAC/D,cAAc,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC;QACvD,WAAW,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC;KAClD,CAAC;IACF,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,cAAc,GAAG,CAAC,CAAC;IAEvB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QAOtB,MAAM,UAAU,GAAgB,EAAE,CAAC;QAEnC,IAAI,CAAC,CAAC,QAAQ,KAAK,MAAM,EAAE,CAAC;YAC1B,IAAI,CAAC,CAAC,CAAC,eAAe;gBAAE,SAAS;YACjC,UAAU,EAAE,CAAC;YACb,uEAAuE;YACvE,kEAAkE;YAClE,MAAM,SAAS,GAAG,CAAC,CAAC,SAAS;gBAC3B,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC;gBACvD,CAAC,CAAC,KAAK,CAAC;YACV,MAAM,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;YAEzC,mDAAmD;YACnD,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;YACxD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,uEAAuE;gBACvE,oEAAoE;gBACpE,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI,MAAM,CAAC,KAAK,MAAM;oBAAE,SAAS;gBAChD,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;gBAChD,IAAI,EAAE,KAAK,CAAC;oBAAE,SAAS;gBACvB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,GAAG,SAAS,CAAC,CAAC;gBAClD,qEAAqE;gBACrE,iEAAiE;gBACjE,uEAAuE;gBACvE,MAAM,SAAS,GAAc,SAAS,IAAI,CAAC,CAAC,CAAC,OAAO;oBAClD,CAAC,CAAC,cAAc;oBAChB,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;gBAC9C,UAAU,CAAC,IAAI,CAAC;oBACd,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS;oBACrC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,2BAA2B,CAAC,CAAC,CAAC,cAAc;iBACjE,CAAC,CAAC;YACL,CAAC;YACD,8DAA8D;YAC9D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC5B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;oBACvB,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI,MAAM,CAAC,KAAK,MAAM;wBAAE,SAAS;oBAChD,MAAM,EAAE,GAAG,kBAAkB,CAAC,CAAC,CAAC,eAAe,EAAE,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;oBAC7E,IAAI,CAAC,EAAE,CAAC,OAAO;wBAAE,SAAS;oBAC1B,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;oBAChD,IAAI,EAAE,KAAK,CAAC;wBAAE,SAAS;oBACvB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,UAAU,GAAG,EAAE,GAAG,SAAS,CAAC,CAAC;oBAC3D,UAAU,CAAC,IAAI,CAAC;wBACd,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,IAAI;wBAC1B,SAAS,EAAE,SAAS,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,eAAe;wBACrE,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM;qBAC5D,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,CAAC,CAAC,QAAQ,KAAK,MAAM,EAAE,CAAC;YACjC,IAAI,CAAC,CAAC,CAAC,SAAS;gBAAE,SAAS;YAC3B,UAAU,EAAE,CAAC;YACb,yEAAyE;YACzE,mEAAmE;YACnE,wEAAwE;YACxE,mCAAmC;YACnC,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC;YAC5D,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;gBAChD,wEAAwE;gBACxE,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC3C,UAAU,CAAC,IAAI,CAAC;oBACd,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,IAAI;oBAC1B,SAAS,EAAE,gBAAgB,EAAE,MAAM,EAAE,iBAAiB;iBACvD,CAAC,CAAC;YACL,CAAC;YACD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC5B,oEAAoE;gBACpE,kEAAkE;gBAClE,MAAM,OAAO,GAAG,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAG,CAAC;gBAC9C,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC;gBACtD,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;oBACrB,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;oBAChD,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBAC1C,UAAU,CAAC,IAAI,CAAC;wBACd,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,IAAI;wBAC1B,SAAS,EAAE,gBAAgB,EAAE,MAAM,EAAE,wBAAwB;qBAC9D,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YACpC,yEAAyE;YACzE,IAAI,CAAC,CAAC,SAAS,KAAK,SAAS;gBAAE,SAAS;YACxC,IAAI,CAAC,CAAC,CAAC,SAAS;gBAAE,SAAS;YAC3B,UAAU,EAAE,CAAC;YACb,yEAAyE;YACzE,uEAAuE;YACvE,6CAA6C;YAC7C,IAAI,WAAW,GAAG,CAAC,CAAC,SAAS,CAAC;YAC9B,IAAI,eAAe,GAAG,CAAC,CAAC,MAAM,CAAC;YAC/B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACvC,IAAI,GAAG,EAAE,CAAC;gBACR,WAAW,GAAG,GAAG,CAAC,SAAS,CAAC;gBAC5B,IAAI,CAAC,eAAe,IAAI,GAAG,CAAC,MAAM;oBAAE,eAAe,GAAG,GAAG,CAAC,MAAM,CAAC;YACnE,CAAC;YACD,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,WAAW,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;YAC/D,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,MAAM,EAAE,GAAG,gBAAgB,CAAC,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;gBACvD,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC1C,UAAU,CAAC,IAAI,CAAC;oBACd,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,IAAI;oBAC1B,SAAS,EAAE,mBAAmB;oBAC9B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,iBAAiB;iBAClD,CAAC,CAAC;YACL,CAAC;QACH,CAAC;aAAM,IAAI,CAAC,CAAC,QAAQ,KAAK,MAAM,EAAE,CAAC;YACjC,2EAA2E;YAC3E,MAAM,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC;YACvB,IAAI,CAAC,EAAE;gBAAE,SAAS;YAClB,UAAU,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC;YACnD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,UAAU,CAAC,IAAI,CAAC;oBACd,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,IAAI;oBAC1B,SAAS,EAAE,aAAa,EAAE,MAAM,EAAE,mBAAmB;iBACtD,CAAC,CAAC;YACL,CAAC;QACH,CAAC;aAAM,IAAI,CAAC,CAAC,QAAQ,KAAK,OAAO,IAAI,CAAC,CAAC,QAAQ,KAAK,KAAK;YAC9C,CAAC,CAAC,QAAQ,KAAK,MAAM,IAAK,CAAC,CAAC,QAAQ,KAAK,cAAc,EAAE,CAAC;YACnE,IAAI,CAAC,CAAC,CAAC,KAAK;gBAAE,SAAS;YACvB,UAAU,EAAE,CAAC;YACb,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAC7C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC1B,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,QAAQ;oBAAE,SAAS;gBAChD,UAAU,CAAC,IAAI,CAAC;oBACd,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG;oBACzB,SAAS,EAAE,aAAa,EAAE,MAAM,EAAE,aAAa;iBAChD,CAAC,CAAC;YACL,CAAC;QACH,CAAC;aAAM,IAAI,CAAC,CAAC,QAAQ,KAAK,KAAK,IAAI,CAAC,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;YAC7D,IAAI,CAAC,CAAC,CAAC,KAAK;gBAAE,SAAS;YACvB,UAAU,EAAE,CAAC;YACb,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAC7C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC1B,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,QAAQ;oBAAE,SAAS;gBAChD,UAAU,CAAC,IAAI,CAAC;oBACd,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG;oBACzB,SAAS,EAAE,aAAa,EAAE,MAAM,EAAE,aAAa;iBAChD,CAAC,CAAC;YACL,CAAC;QACH,CAAC;aAAM,CAAC;YACN,uEAAuE;YACvE,SAAS;QACX,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEtC,0EAA0E;QAC1E,0EAA0E;QAC1E,0EAA0E;QAC1E,qCAAqC;QACrC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACvB,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU;gBAAE,OAAO,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;YACtE,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,EAAE;gBAAE,OAAO,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9D,OAAO,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5E,CAAC,CAAC,CAAC;QAEH,uEAAuE;QACvE,sEAAsE;QACtE,gBAAgB;QAChB,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC;QAC1C,IAAI,WAAW,GAAG,KAAK,CAAC;QACxB,IAAI,UAAU,CAAC,MAAM,GAAG,uBAAuB,EAAE,CAAC;YAChD,UAAU,CAAC,MAAM,GAAG,uBAAuB,CAAC;YAC5C,WAAW,GAAG,IAAI,CAAC;YACnB,cAAc,EAAE,CAAC;QACnB,CAAC;QAED,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC;YACrC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,uBAAuB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACzD,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE;gBACpB,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC3C,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,UAAU,EAAE,CAAC,CAAC,SAAS;aACxB,CAAC,CAAC;YACL,CAAC,CAAC,EAAE,CAAC;QACP,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;YAC9B,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,WAAW,EAAE,CAAC,CAAC,MAAM;YACrB,YAAY,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM;YAC9B,OAAO,EAAE,CAAC,CAAC,OAAO,IAAI,IAAI;YAC1B,SAAS,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI;YAC9B,UAAU,EAAE,CAAC,CAAC,UAAU;YACxB,SAAS,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI;YAC9B,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI;YACtB,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI;YACtB,OAAO,EAAE,CAAC,CAAC,OAAO,IAAI,IAAI;YAC1B,gBAAgB,EAAE,eAAe;YACjC,SAAS,EAAE,WAAW;YACtB,oBAAoB,EAAE,SAAS;SAChC,CAAC,CAAC;QACH,UAAU,CAAC;YACT,MAAM,EAAE,CAAC,CAAC,EAAE;YACZ,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE;YACrB,cAAc,EAAE,CAAC,CAAC,SAAS;YAC3B,eAAe,EAAE,GAAG,CAAC,KAAK,CAAC,UAAU;YACrC,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,UAAU,EAAE,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC7C,YAAY,EAAE,QAAQ;SACvB,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACzD,QAAQ,EAAE,CAAC;IACb,CAAC;IAED,OAAO;QACL,eAAe,EAAE,UAAU;QAC3B,aAAa,EAAE,QAAQ;QACvB,MAAM,EAAE,MAAmC;QAC3C,SAAS,EAAE,cAAc;KAC1B,CAAC;AACJ,CAAC;AAED;2CAC2C;AAC3C,SAAS,SAAS,CAAC,GAAQ,EAAE,KAAa,EAAE,MAAc;IACxD,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO,CAAC,qBAAqB,KAAK,GAAG,CAAC,CAAC,GAAG,EAA6B,CAAC;QACzF,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;IAC3C,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,KAAK,CAAC;IAAC,CAAC;AAC3B,CAAC;AAED;uEACuE;AACvE,SAAgB,kBAAkB,CAAC,CAAS;IAC1C,IAAI,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IAClB,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IACjB,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACxD,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/indexer/shapehash.d.ts

@@ -0,0 +1,98 @@
+import { Store } from '../db/store.js';
+/** Tokens we recognize when computing the shape hash. */
+type TokenKind = 'NAME' | 'NUMBER' | 'STRING' | 'KEYWORD' | 'OP';
+interface ShapeToken {
+    kind: TokenKind;
+    /**
+     * For keywords/operators we keep the lexeme so `if` ≠ `for` ≠ `while`.
+     * For names/numbers/strings we drop the lexeme to fold them together —
+     * structure first, content second.
+     */
+    text: string;
+}
+/**
+ * A tiny language-agnostic tokenizer. We don't need to be a full lexer —
+ * the goal is "structurally meaningful tokens that survive renames." A
+ * char-class scan over the source body suffices:
+ *   - identifier-start runs → NAME (folded)
+ *   - digit runs → NUMBER (folded)
+ *   - quoted strings → STRING (folded; we just skip until the closing quote)
+ *   - operators / punctuation → OP (lexeme kept)
+ *
+ * Keywords aren't language-specific in this tokenizer — they appear as NAME
+ * tokens. That's intentional: a Python `if` and a JS `if` have the same
+ * structural role, and at the shape-hash level we want them to collide.
+ * Real keywords still get distinguished from random identifiers because the
+ * SURROUNDING operators differ ( `if (` vs `def foo(` ).
+ */
+export declare function tokenize(source: string): ShapeToken[];
+/**
+ * Compute the 64-bit structural SimHash over a function body source string.
+ * Returns NULL when the source is too small to be meaningfully compared.
+ *
+ * Algorithm (standard Charikar SimHash):
+ *   1. Tokenize, fold names/numbers/strings, keep operator lexemes.
+ *   2. Slide a 3-gram window over the tokens.
+ *   3. For each n-gram compute a stable 64-bit hash (FNV-1a is plenty here).
+ *   4. For each bit position, sum +1 if set in the gram-hash, -1 if unset.
+ *   5. Output bit i is 1 iff sum_i > 0.
+ */
+export declare function computeShapeHash(body: string, minTokens?: number): bigint | null;
+/** Hamming distance between two 64-bit bigints. */
+export declare function hammingDistance(a: bigint, b: bigint): number;
+export interface BuildShapeHashResult {
+    symbolsHashed: number;
+    symbolsSkipped: number;
+    elapsedMs: number;
+}
+/**
+ * Compute shape hashes for every function-like symbol in the DB by reading
+ * its file and slicing out the body. We re-read each file once and slice all
+ * its function bodies in one pass.
+ *
+ * Idempotent: skips symbols that already have a shape_hash and whose file
+ * hash hasn't changed since the last pass (Store.upsertFileWithCache will
+ * have NULLed the column for re-parsed files automatically because the row
+ * gets deleted-and-reinserted).
+ */
+export declare function buildShapeHashes(store: Store, options?: {
+    minLoc?: number;
+    force?: boolean;
+    log?: (m: string) => void;
+}): BuildShapeHashResult;
+export interface DuplicateCluster {
+    fingerprint: bigint;
+    symbols: Array<{
+        id: number;
+        name: string;
+        qualifiedName: string | null;
+        kind: string;
+        file: string;
+        lineStart: number;
+        lineEnd: number;
+        loc: number | null;
+        hammingFromAnchor: number;
+    }>;
+}
+export interface FindDuplicatesOptions {
+    /** Maximum Hamming distance two symbols may differ to count as duplicates. */
+    maxDistance?: number;
+    /** Minimum LOC for a symbol to be considered. */
+    minLoc?: number;
+    /** Include test files. */
+    includeTests?: boolean;
+    /** Hard cap on clusters returned. */
+    maxClusters?: number;
+}
+/**
+ * Find clusters of structurally near-duplicate symbols.
+ *
+ * Implementation: pairwise Hamming distance over the candidate set. For
+ * codebases up to ~20k functions this stays well under a second; bigger
+ * codebases can pre-bucket on the top 16 bits of the hash (we don't do that
+ * here yet — the current scale works). The output is grouped into clusters
+ * via simple transitive-closure union-find on the (distance ≤ N) graph.
+ */
+export declare function findDuplicates(store: Store, options?: FindDuplicatesOptions): DuplicateCluster[];
+export {};
+//# sourceMappingURL=shapehash.d.ts.map

package/dist/indexer/shapehash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shapehash.d.ts","sourceRoot":"","sources":["../../src/indexer/shapehash.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAiCvC,yDAAyD;AACzD,KAAK,SAAS,GAAG,MAAM,GAAG,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,IAAI,CAAC;AAEjE,UAAU,UAAU;IAClB,IAAI,EAAE,SAAS,CAAC;IAChB;;;;OAIG;IACH,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,UAAU,EAAE,CA0DrD;AASD;;;;;;;;;;GAUG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,SAAI,GAAG,MAAM,GAAG,IAAI,CAoB3E;AAcD,mDAAmD;AACnD,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAQ5D;AAED,MAAM,WAAW,oBAAoB;IACnC,aAAa,EAAE,MAAM,CAAC;IACtB,cAAc,EAAE,MAAM,CAAC;IACvB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,KAAK,EACZ,OAAO,GAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,OAAO,CAAC;IAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,IAAI,CAAA;CAAO,GAC5E,oBAAoB,CAsDtB;AAUD,MAAM,WAAW,gBAAgB;IAC/B,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,KAAK,CAAC;QACb,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QACrE,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;QACrE,iBAAiB,EAAE,MAAM,CAAC;KAC3B,CAAC,CAAC;CACJ;AAED,MAAM,WAAW,qBAAqB;IACpC,8EAA8E;IAC9E,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,iDAAiD;IACjD,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,0BAA0B;IAC1B,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,qCAAqC;IACrC,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;;;;;;;GAQG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,KAAK,EAAE,OAAO,GAAE,qBAA0B,GAChD,gBAAgB,EAAE,CAsEpB"}