causantic 0.2.0

package/dist/clusters/hdbscan/core-distance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"core-distance.js","sourceRoot":"","sources":["../../../src/clusters/hdbscan/core-distance.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC1E,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAEzD;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAkB,EAClB,CAAS,EACT,SAAkC,WAAW,EAC7C,YAAqB,KAAK;IAE1B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IAExB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,uDAAuD;IACvD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAEtC,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;QACpB,mCAAmC;QACnC,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IAED,IAAI,SAAS,IAAI,MAAM,KAAK,WAAW,EAAE,CAAC;QACxC,OAAO,0BAA0B,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IACxD,CAAC;IAED,OAAO,8BAA8B,CAAC,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;AACpE,CAAC;AAED;;GAEG;AACH,SAAS,8BAA8B,CACrC,MAAkB,EAClB,CAAS,EACT,MAA+B;IAE/B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,MAAM,aAAa,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,eAAe,CAAC;IAE5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,wCAAwC;QACxC,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QAED,iDAAiD;QACjD,aAAa,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,OAAO,aAAa,CAAC;AACvB,CAAC;AAED;;GAEG;AACH,SAAS,0BAA0B,CAAC,MAAkB,EAAE,CAAS;IAC/D,MAAM,IAAI,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC;IAChC,MAAM,aAAa,GAAG,IAAI,KAAK,CAAS,MAAM,CAAC,MAAM,CAAC,CAAC;IAEvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,aAAa,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;QAC/C,CAAC;aAAM,CAAC;YACN,2CAA2C;YAC3C,aAAa,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACzF,CAAC;IACH,CAAC;IAED,OAAO,aAAa,CAAC;AACvB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,yBAAyB,CACvC,OAAiB,EACjB,SAAqB,EACrB,CAAS,EACT,SAAkC,WAAW;IAE7C,MAAM,MAAM,GAAG,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,eAAe,CAAC;IAC5E,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;IAC3B,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,MAAM,OAAO,GAAmD,EAAE,CAAC;IAEnE,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QAED,MAAM,YAAY,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjF,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC;IAC3C,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/clusters/hdbscan/distance-cache.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Distance cache for repeated clustering on the same dataset.
+ * Useful when tuning parameters (minClusterSize sweep).
+ */
+/**
+ * Cache for pairwise distances.
+ * Uses lazy computation - only calculates distances when requested.
+ */
+export declare class DistanceCache {
+    private cache;
+    private embeddings;
+    private metric;
+    /**
+     * Create a new distance cache.
+     * @param embeddings The embeddings to compute distances for.
+     * @param metric Distance metric to use.
+     */
+    constructor(embeddings: number[][], metric?: 'euclidean' | 'angular');
+    /**
+     * Get distance between two points by index.
+     * Computes and caches if not already cached.
+     */
+    get(i: number, j: number): number;
+    /**
+     * Pre-compute all pairwise distances.
+     * Only use for small datasets (< 1000 points).
+     */
+    precomputeAll(): void;
+    /**
+     * Get the number of cached distances.
+     */
+    get size(): number;
+    /**
+     * Clear the cache.
+     */
+    clear(): void;
+    /**
+     * Get cache hit rate (for diagnostics).
+     */
+    getHitRate(): {
+        cached: number;
+        total: number;
+        rate: number;
+    };
+}
+//# sourceMappingURL=distance-cache.d.ts.map

package/dist/clusters/hdbscan/distance-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"distance-cache.d.ts","sourceRoot":"","sources":["../../../src/clusters/hdbscan/distance-cache.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;;GAGG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,KAAK,CAAsB;IACnC,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,MAAM,CAA0B;IAExC;;;;OAIG;gBACS,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAE,WAAW,GAAG,SAAuB;IAMjF;;;OAGG;IACH,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAkBjC;;;OAGG;IACH,aAAa,IAAI,IAAI;IAcrB;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;OAEG;IACH,KAAK,IAAI,IAAI;IAIb;;OAEG;IACH,UAAU,IAAI;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE;CAU9D"}

package/dist/clusters/hdbscan/distance-cache.js

@@ -0,0 +1,84 @@
+/**
+ * Distance cache for repeated clustering on the same dataset.
+ * Useful when tuning parameters (minClusterSize sweep).
+ */
+import { euclideanDistance, angularDistance } from './kd-tree.js';
+/**
+ * Cache for pairwise distances.
+ * Uses lazy computation - only calculates distances when requested.
+ */
+export class DistanceCache {
+    cache;
+    embeddings;
+    metric;
+    /**
+     * Create a new distance cache.
+     * @param embeddings The embeddings to compute distances for.
+     * @param metric Distance metric to use.
+     */
+    constructor(embeddings, metric = 'euclidean') {
+        this.cache = new Map();
+        this.embeddings = embeddings;
+        this.metric = metric;
+    }
+    /**
+     * Get distance between two points by index.
+     * Computes and caches if not already cached.
+     */
+    get(i, j) {
+        if (i === j) {
+            return 0;
+        }
+        // Use canonical key (smaller index first)
+        const key = i < j ? `${i}-${j}` : `${j}-${i}`;
+        let distance = this.cache.get(key);
+        if (distance === undefined) {
+            const distFn = this.metric === 'euclidean' ? euclideanDistance : angularDistance;
+            distance = distFn(this.embeddings[i], this.embeddings[j]);
+            this.cache.set(key, distance);
+        }
+        return distance;
+    }
+    /**
+     * Pre-compute all pairwise distances.
+     * Only use for small datasets (< 1000 points).
+     */
+    precomputeAll() {
+        const n = this.embeddings.length;
+        const distFn = this.metric === 'euclidean' ? euclideanDistance : angularDistance;
+        for (let i = 0; i < n; i++) {
+            for (let j = i + 1; j < n; j++) {
+                const key = `${i}-${j}`;
+                if (!this.cache.has(key)) {
+                    this.cache.set(key, distFn(this.embeddings[i], this.embeddings[j]));
+                }
+            }
+        }
+    }
+    /**
+     * Get the number of cached distances.
+     */
+    get size() {
+        return this.cache.size;
+    }
+    /**
+     * Clear the cache.
+     */
+    clear() {
+        this.cache.clear();
+    }
+    /**
+     * Get cache hit rate (for diagnostics).
+     */
+    getHitRate() {
+        const n = this.embeddings.length;
+        const total = (n * (n - 1)) / 2;
+        const cached = this.cache.size;
+        return {
+            cached,
+            total,
+            rate: total > 0 ? cached / total : 0,
+        };
+    }
+}
+//# sourceMappingURL=distance-cache.js.map

package/dist/clusters/hdbscan/distance-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"distance-cache.js","sourceRoot":"","sources":["../../../src/clusters/hdbscan/distance-cache.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAElE;;;GAGG;AACH,MAAM,OAAO,aAAa;IAChB,KAAK,CAAsB;IAC3B,UAAU,CAAa;IACvB,MAAM,CAA0B;IAExC;;;;OAIG;IACH,YAAY,UAAsB,EAAE,SAAkC,WAAW;QAC/E,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,GAAG,CAAC,CAAS,EAAE,CAAS;QACtB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,OAAO,CAAC,CAAC;QACX,CAAC;QAED,0CAA0C;QAC1C,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAE9C,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,eAAe,CAAC;YACjF,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1D,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QAChC,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACH,aAAa;QACX,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,eAAe,CAAC;QAEjF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,UAAU;QACR,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QACjC,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QAC/B,OAAO;YACL,MAAM;YACN,KAAK;YACL,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;SACrC,CAAC;IACJ,CAAC;CACF"}

package/dist/clusters/hdbscan/hierarchy.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Condensed cluster tree construction for HDBSCAN.
+ *
+ * The algorithm works as follows:
+ * 1. Start with each point in its own component
+ * 2. Process MST edges in ascending weight (lowest distance first)
+ * 3. Merge components as edges connect them
+ * 4. When a component reaches minClusterSize, it becomes a cluster
+ * 5. Track cluster splits as larger structures merge
+ */
+import type { MSTEdge, CondensedTree } from './types.js';
+/**
+ * Build a condensed cluster tree from the MST.
+ */
+export declare function buildCondensedTree(edges: MSTEdge[], numPoints: number, minClusterSize: number): CondensedTree;
+/**
+ * Build a condensed cluster tree from the MST, with member point tracking.
+ */
+export declare function buildCondensedTreeWithMembers(edges: MSTEdge[], numPoints: number, minClusterSize: number): {
+    tree: CondensedTree;
+    memberPoints: Map<number, Set<number>>;
+};
+/**
+ * Get all point indices that belong to a cluster.
+ */
+export declare function getClusterPoints(tree: CondensedTree, clusterId: number): number[];
+/**
+ * Get lambda value for a specific point.
+ */
+export declare function getPointLambda(tree: CondensedTree, pointIndex: number): {
+    birth: number;
+    death: number;
+};
+//# sourceMappingURL=hierarchy.d.ts.map

package/dist/clusters/hdbscan/hierarchy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hierarchy.d.ts","sourceRoot":"","sources":["../../../src/clusters/hdbscan/hierarchy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,KAAK,EAAE,OAAO,EAAE,aAAa,EAAqB,MAAM,YAAY,CAAC;AAS5E;;GAEG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,OAAO,EAAE,EAChB,SAAS,EAAE,MAAM,EACjB,cAAc,EAAE,MAAM,GACrB,aAAa,CAwMf;AA4BD;;GAEG;AACH,wBAAgB,6BAA6B,CAC3C,KAAK,EAAE,OAAO,EAAE,EAChB,SAAS,EAAE,MAAM,EACjB,cAAc,EAAE,MAAM,GACrB;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;CAAE,CA2MjE;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,aAAa,EACnB,SAAS,EAAE,MAAM,GAChB,MAAM,EAAE,CAuBV;AAED;;GAEG;AACH,wBAAgB,cAAc,CAC5B,IAAI,EAAE,aAAa,EACnB,UAAU,EAAE,MAAM,GACjB;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAMlC"}

package/dist/clusters/hdbscan/hierarchy.js

@@ -0,0 +1,442 @@
+/**
+ * Condensed cluster tree construction for HDBSCAN.
+ *
+ * The algorithm works as follows:
+ * 1. Start with each point in its own component
+ * 2. Process MST edges in ascending weight (lowest distance first)
+ * 3. Merge components as edges connect them
+ * 4. When a component reaches minClusterSize, it becomes a cluster
+ * 5. Track cluster splits as larger structures merge
+ */
+import { UnionFind } from './union-find.js';
+/**
+ * Build a condensed cluster tree from the MST.
+ */
+export function buildCondensedTree(edges, numPoints, minClusterSize) {
+    if (numPoints === 0) {
+        return { nodes: new Map(), root: -1, numPoints: 0 };
+    }
+    const nodes = new Map();
+    // Initialize point nodes
+    for (let i = 0; i < numPoints; i++) {
+        nodes.set(i, {
+            id: i,
+            parent: -1,
+            lambdaBirth: Infinity,
+            lambdaDeath: 0,
+            size: 1,
+            isCluster: false,
+            children: [],
+            stability: 0,
+            selected: false,
+            memberPoints: new Set([i]),
+        });
+    }
+    if (edges.length === 0) {
+        const root = numPoints;
+        nodes.set(root, {
+            id: root,
+            parent: -1,
+            lambdaBirth: 0,
+            lambdaDeath: Infinity,
+            size: 0,
+            isCluster: true,
+            children: [],
+            stability: 0,
+            selected: false,
+            memberPoints: new Set(),
+        });
+        return { nodes: convertNodes(nodes), root, numPoints };
+    }
+    // Sort edges ascending by weight
+    const sortedEdges = [...edges].sort((a, b) => a.weight - b.weight);
+    const uf = new UnionFind(numPoints);
+    let nextClusterId = numPoints;
+    // Track which cluster a component root belongs to
+    const rootToCluster = new Map(); // component root -> cluster id
+    for (const edge of sortedEdges) {
+        const lambda = edge.weight > 0 ? 1 / edge.weight : Infinity;
+        const rootA = uf.find(edge.from);
+        const rootB = uf.find(edge.to);
+        if (rootA === rootB)
+            continue;
+        const sizeA = uf.getSize(rootA);
+        const sizeB = uf.getSize(rootB);
+        const combinedSize = sizeA + sizeB;
+        const clusterIdA = rootToCluster.get(rootA);
+        const clusterIdB = rootToCluster.get(rootB);
+        // Merge in union-find
+        const newRoot = uf.union(edge.from, edge.to);
+        if (clusterIdA !== undefined && clusterIdB !== undefined) {
+            // Both were clusters - merge them into a new parent
+            const parentClusterId = nextClusterId++;
+            const clusterA = nodes.get(clusterIdA);
+            const clusterB = nodes.get(clusterIdB);
+            const allPoints = new Set([...clusterA.memberPoints, ...clusterB.memberPoints]);
+            nodes.set(parentClusterId, {
+                id: parentClusterId,
+                parent: -1,
+                lambdaBirth: lambda,
+                lambdaDeath: Infinity,
+                size: combinedSize,
+                isCluster: true,
+                children: [clusterIdA, clusterIdB],
+                stability: 0,
+                selected: false,
+                memberPoints: allPoints,
+            });
+            // Update children
+            clusterA.parent = parentClusterId;
+            clusterA.lambdaDeath = lambda;
+            clusterB.parent = parentClusterId;
+            clusterB.lambdaDeath = lambda;
+            rootToCluster.delete(rootA);
+            rootToCluster.delete(rootB);
+            rootToCluster.set(newRoot, parentClusterId);
+        }
+        else if (clusterIdA !== undefined) {
+            // Only A was a cluster - points from B join A
+            const clusterA = nodes.get(clusterIdA);
+            for (let i = 0; i < numPoints; i++) {
+                if (uf.find(i) === newRoot && !clusterA.memberPoints.has(i)) {
+                    nodes.get(i).lambdaDeath = lambda;
+                    clusterA.memberPoints.add(i);
+                }
+            }
+            clusterA.size = combinedSize;
+            rootToCluster.delete(rootA);
+            rootToCluster.set(newRoot, clusterIdA);
+        }
+        else if (clusterIdB !== undefined) {
+            // Only B was a cluster - points from A join B
+            const clusterB = nodes.get(clusterIdB);
+            for (let i = 0; i < numPoints; i++) {
+                if (uf.find(i) === newRoot && !clusterB.memberPoints.has(i)) {
+                    nodes.get(i).lambdaDeath = lambda;
+                    clusterB.memberPoints.add(i);
+                }
+            }
+            clusterB.size = combinedSize;
+            rootToCluster.delete(rootB);
+            rootToCluster.set(newRoot, clusterIdB);
+        }
+        else if (combinedSize >= minClusterSize) {
+            // Neither was a cluster, but combined is big enough - new cluster born
+            const clusterId = nextClusterId++;
+            const points = new Set();
+            for (let i = 0; i < numPoints; i++) {
+                if (uf.find(i) === newRoot) {
+                    points.add(i);
+                    nodes.get(i).lambdaDeath = lambda;
+                }
+            }
+            nodes.set(clusterId, {
+                id: clusterId,
+                parent: -1,
+                lambdaBirth: lambda,
+                lambdaDeath: Infinity,
+                size: combinedSize,
+                isCluster: true,
+                children: [],
+                stability: 0,
+                selected: false,
+                memberPoints: points,
+            });
+            rootToCluster.set(newRoot, clusterId);
+        }
+        // else: combined is still too small, just merge tracking
+    }
+    // Find remaining active clusters
+    const activeClusters = [...new Set(rootToCluster.values())];
+    let root;
+    if (activeClusters.length === 0) {
+        // No clusters found
+        root = nextClusterId++;
+        nodes.set(root, {
+            id: root,
+            parent: -1,
+            lambdaBirth: 0,
+            lambdaDeath: Infinity,
+            size: 0,
+            isCluster: true,
+            children: [],
+            stability: 0,
+            selected: false,
+            memberPoints: new Set(),
+        });
+    }
+    else if (activeClusters.length === 1) {
+        root = activeClusters[0];
+    }
+    else {
+        // Multiple clusters remain - create root
+        root = nextClusterId++;
+        const allPoints = new Set();
+        for (const cid of activeClusters) {
+            for (const p of nodes.get(cid).memberPoints) {
+                allPoints.add(p);
+            }
+        }
+        nodes.set(root, {
+            id: root,
+            parent: -1,
+            lambdaBirth: 0,
+            lambdaDeath: Infinity,
+            size: numPoints,
+            isCluster: true,
+            children: activeClusters,
+            stability: 0,
+            selected: false,
+            memberPoints: allPoints,
+        });
+        for (const cid of activeClusters) {
+            nodes.get(cid).parent = root;
+            nodes.get(cid).lambdaDeath = 0;
+        }
+    }
+    return { nodes: convertNodes(nodes), root, numPoints };
+}
+/**
+ * Convert extended nodes to standard nodes (strip memberPoints).
+ */
+function convertNodes(nodes) {
+    const result = new Map();
+    for (const [id, node] of nodes) {
+        const { memberPoints, ...rest } = node;
+        result.set(id, {
+            ...rest,
+            // Store memberPoints in a way that can be accessed later
+            // We'll use the stability field temporarily, then extract to a separate structure
+        });
+        // Actually, let's store the member points directly on the node
+        // by extending the CondensedTreeNode type or using a side map
+    }
+    return result;
+}
+// Store cluster member points separately for label assignment
+const clusterMemberPoints = new Map();
+/**
+ * Build a condensed cluster tree from the MST, with member point tracking.
+ */
+export function buildCondensedTreeWithMembers(edges, numPoints, minClusterSize) {
+    if (numPoints === 0) {
+        return { tree: { nodes: new Map(), root: -1, numPoints: 0 }, memberPoints: new Map() };
+    }
+    const nodes = new Map();
+    const memberPoints = new Map();
+    // Initialize point nodes
+    for (let i = 0; i < numPoints; i++) {
+        nodes.set(i, {
+            id: i,
+            parent: -1,
+            lambdaBirth: Infinity,
+            lambdaDeath: 0,
+            size: 1,
+            isCluster: false,
+            children: [],
+            stability: 0,
+            selected: false,
+        });
+        memberPoints.set(i, new Set([i]));
+    }
+    if (edges.length === 0) {
+        const root = numPoints;
+        nodes.set(root, {
+            id: root,
+            parent: -1,
+            lambdaBirth: 0,
+            lambdaDeath: Infinity,
+            size: 0,
+            isCluster: true,
+            children: [],
+            stability: 0,
+            selected: false,
+        });
+        memberPoints.set(root, new Set());
+        return { tree: { nodes, root, numPoints }, memberPoints };
+    }
+    // Sort edges ascending by weight
+    const sortedEdges = [...edges].sort((a, b) => a.weight - b.weight);
+    const uf = new UnionFind(numPoints);
+    let nextClusterId = numPoints;
+    // Track which cluster a component root belongs to
+    const rootToCluster = new Map(); // component root -> cluster id
+    for (const edge of sortedEdges) {
+        const lambda = edge.weight > 0 ? 1 / edge.weight : Infinity;
+        const rootA = uf.find(edge.from);
+        const rootB = uf.find(edge.to);
+        if (rootA === rootB)
+            continue;
+        const sizeA = uf.getSize(rootA);
+        const sizeB = uf.getSize(rootB);
+        const combinedSize = sizeA + sizeB;
+        const clusterIdA = rootToCluster.get(rootA);
+        const clusterIdB = rootToCluster.get(rootB);
+        // Merge in union-find
+        const newRoot = uf.union(edge.from, edge.to);
+        if (clusterIdA !== undefined && clusterIdB !== undefined) {
+            // Both were clusters - merge them into a new parent
+            const parentClusterId = nextClusterId++;
+            const pointsA = memberPoints.get(clusterIdA);
+            const pointsB = memberPoints.get(clusterIdB);
+            const allPoints = new Set([...pointsA, ...pointsB]);
+            nodes.set(parentClusterId, {
+                id: parentClusterId,
+                parent: -1,
+                lambdaBirth: lambda,
+                lambdaDeath: Infinity,
+                size: combinedSize,
+                isCluster: true,
+                children: [clusterIdA, clusterIdB],
+                stability: 0,
+                selected: false,
+            });
+            memberPoints.set(parentClusterId, allPoints);
+            // Update children
+            nodes.get(clusterIdA).parent = parentClusterId;
+            nodes.get(clusterIdA).lambdaDeath = lambda;
+            nodes.get(clusterIdB).parent = parentClusterId;
+            nodes.get(clusterIdB).lambdaDeath = lambda;
+            rootToCluster.delete(rootA);
+            rootToCluster.delete(rootB);
+            rootToCluster.set(newRoot, parentClusterId);
+        }
+        else if (clusterIdA !== undefined) {
+            // Only A was a cluster - points from B join A
+            const clusterA = nodes.get(clusterIdA);
+            const pointsA = memberPoints.get(clusterIdA);
+            for (let i = 0; i < numPoints; i++) {
+                if (uf.find(i) === newRoot && !pointsA.has(i)) {
+                    nodes.get(i).lambdaDeath = lambda;
+                    pointsA.add(i);
+                }
+            }
+            clusterA.size = combinedSize;
+            rootToCluster.delete(rootA);
+            rootToCluster.set(newRoot, clusterIdA);
+        }
+        else if (clusterIdB !== undefined) {
+            // Only B was a cluster - points from A join B
+            const clusterB = nodes.get(clusterIdB);
+            const pointsB = memberPoints.get(clusterIdB);
+            for (let i = 0; i < numPoints; i++) {
+                if (uf.find(i) === newRoot && !pointsB.has(i)) {
+                    nodes.get(i).lambdaDeath = lambda;
+                    pointsB.add(i);
+                }
+            }
+            clusterB.size = combinedSize;
+            rootToCluster.delete(rootB);
+            rootToCluster.set(newRoot, clusterIdB);
+        }
+        else if (combinedSize >= minClusterSize) {
+            // Neither was a cluster, but combined is big enough - new cluster born
+            const clusterId = nextClusterId++;
+            const points = new Set();
+            for (let i = 0; i < numPoints; i++) {
+                if (uf.find(i) === newRoot) {
+                    points.add(i);
+                    nodes.get(i).lambdaDeath = lambda;
+                }
+            }
+            nodes.set(clusterId, {
+                id: clusterId,
+                parent: -1,
+                lambdaBirth: lambda,
+                lambdaDeath: Infinity,
+                size: combinedSize,
+                isCluster: true,
+                children: [],
+                stability: 0,
+                selected: false,
+            });
+            memberPoints.set(clusterId, points);
+            rootToCluster.set(newRoot, clusterId);
+        }
+        // else: combined is still too small, just merge tracking
+    }
+    // Find remaining active clusters
+    const activeClusters = [...new Set(rootToCluster.values())];
+    let root;
+    if (activeClusters.length === 0) {
+        // No clusters found
+        root = nextClusterId++;
+        nodes.set(root, {
+            id: root,
+            parent: -1,
+            lambdaBirth: 0,
+            lambdaDeath: Infinity,
+            size: 0,
+            isCluster: true,
+            children: [],
+            stability: 0,
+            selected: false,
+        });
+        memberPoints.set(root, new Set());
+    }
+    else if (activeClusters.length === 1) {
+        root = activeClusters[0];
+    }
+    else {
+        // Multiple clusters remain - create root
+        root = nextClusterId++;
+        const allPoints = new Set();
+        for (const cid of activeClusters) {
+            for (const p of memberPoints.get(cid)) {
+                allPoints.add(p);
+            }
+        }
+        nodes.set(root, {
+            id: root,
+            parent: -1,
+            lambdaBirth: 0,
+            lambdaDeath: Infinity,
+            size: numPoints,
+            isCluster: true,
+            children: activeClusters,
+            stability: 0,
+            selected: false,
+        });
+        memberPoints.set(root, allPoints);
+        for (const cid of activeClusters) {
+            nodes.get(cid).parent = root;
+            nodes.get(cid).lambdaDeath = 0;
+        }
+    }
+    return { tree: { nodes, root, numPoints }, memberPoints };
+}
+/**
+ * Get all point indices that belong to a cluster.
+ */
+export function getClusterPoints(tree, clusterId) {
+    const points = [];
+    const visited = new Set();
+    const collect = (id) => {
+        if (visited.has(id))
+            return;
+        visited.add(id);
+        if (id < tree.numPoints) {
+            points.push(id);
+            return;
+        }
+        const node = tree.nodes.get(id);
+        if (!node)
+            return;
+        for (const child of node.children) {
+            collect(child);
+        }
+    };
+    collect(clusterId);
+    return points;
+}
+/**
+ * Get lambda value for a specific point.
+ */
+export function getPointLambda(tree, pointIndex) {
+    const node = tree.nodes.get(pointIndex);
+    if (!node) {
+        return { birth: 0, death: 0 };
+    }
+    return { birth: node.lambdaBirth, death: node.lambdaDeath };
+}
+//# sourceMappingURL=hierarchy.js.map

package/dist/clusters/hdbscan/hierarchy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hierarchy.js","sourceRoot":"","sources":["../../../src/clusters/hdbscan/hierarchy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAU5C;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAChC,KAAgB,EAChB,SAAiB,EACjB,cAAsB;IAEtB,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QACpB,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;IACtD,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAAiC,CAAC;IAEvD,yBAAyB;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE;YACX,EAAE,EAAE,CAAC;YACL,MAAM,EAAE,CAAC,CAAC;YACV,WAAW,EAAE,QAAQ;YACrB,WAAW,EAAE,CAAC;YACd,IAAI,EAAE,CAAC;YACP,SAAS,EAAE,KAAK;YAChB,QAAQ,EAAE,EAAE;YACZ,SAAS,EAAE,CAAC;YACZ,QAAQ,EAAE,KAAK;YACf,YAAY,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B,CAAC,CAAC;IACL,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,SAAS,CAAC;QACvB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE;YACd,EAAE,EAAE,IAAI;YACR,MAAM,EAAE,CAAC,CAAC;YACV,WAAW,EAAE,CAAC;YACd,WAAW,EAAE,QAAQ;YACrB,IAAI,EAAE,CAAC;YACP,SAAS,EAAE,IAAI;YACf,QAAQ,EAAE,EAAE;YACZ,SAAS,EAAE,CAAC;YACZ,QAAQ,EAAE,KAAK;YACf,YAAY,EAAE,IAAI,GAAG,EAAE;SACxB,CAAC,CAAC;QACH,OAAO,EAAE,KAAK,EAAE,YAAY,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;IACzD,CAAC;IAED,iCAAiC;IACjC,MAAM,WAAW,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAEnE,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,SAAS,CAAC,CAAC;IACpC,IAAI,aAAa,GAAG,SAAS,CAAC;IAE9B,kDAAkD;IAClD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,+BAA+B;IAEhF,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;QAC5D,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAE/B,IAAI,KAAK,KAAK,KAAK;YAAE,SAAS;QAE9B,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,YAAY,GAAG,KAAK,GAAG,KAAK,CAAC;QAEnC,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAE5C,sBAAsB;QACtB,MAAM,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAE7C,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YACzD,oDAAoD;YACpD,MAAM,eAAe,GAAG,aAAa,EAAE,CAAC;YACxC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;YACxC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;YACxC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,YAAY,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC;YAEhF,KAAK,CAAC,GAAG,CAAC,eAAe,EAAE;gBACzB,EAAE,EAAE,eAAe;gBACnB,MAAM,EAAE,CAAC,CAAC;gBACV,WAAW,EAAE,MAAM;gBACnB,WAAW,EAAE,QAAQ;gBACrB,IAAI,EAAE,YAAY;gBAClB,SAAS,EAAE,IAAI;gBACf,QAAQ,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;gBAClC,SAAS,EAAE,CAAC;gBACZ,QAAQ,EAAE,KAAK;gBACf,YAAY,EAAE,SAAS;aACxB,CAAC,CAAC;YAEH,kBAAkB;YAClB,QAAQ,CAAC,MAAM,GAAG,eAAe,CAAC;YAClC,QAAQ,CAAC,WAAW,GAAG,MAAM,CAAC;YAC9B,QAAQ,CAAC,MAAM,GAAG,eAAe,CAAC;YAClC,QAAQ,CAAC,WAAW,GAAG,MAAM,CAAC;YAE9B,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5B,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5B,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;QAC9C,CAAC;aAAM,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YACpC,8CAA8C;YAC9C,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC5D,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,WAAW,GAAG,MAAM,CAAC;oBACnC,QAAQ,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC/B,CAAC;YACH,CAAC;YACD,QAAQ,CAAC,IAAI,GAAG,YAAY,CAAC;YAC7B,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5B,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACzC,CAAC;aAAM,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YACpC,8CAA8C;YAC9C,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC5D,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,WAAW,GAAG,MAAM,CAAC;oBACnC,QAAQ,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC/B,CAAC;YACH,CAAC;YACD,QAAQ,CAAC,IAAI,GAAG,YAAY,CAAC;YAC7B,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5B,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACzC,CAAC;aAAM,IAAI,YAAY,IAAI,cAAc,EAAE,CAAC;YAC1C,uEAAuE;YACvE,MAAM,SAAS,GAAG,aAAa,EAAE,CAAC;YAClC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;YAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE,CAAC;oBAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACd,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,WAAW,GAAG,MAAM,CAAC;gBACrC,CAAC;YACH,CAAC;YAED,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE;gBACnB,EAAE,EAAE,SAAS;gBACb,MAAM,EAAE,CAAC,CAAC;gBACV,WAAW,EAAE,MAAM;gBACnB,WAAW,EAAE,QAAQ;gBACrB,IAAI,EAAE,YAAY;gBAClB,SAAS,EAAE,IAAI;gBACf,QAAQ,EAAE,EAAE;gBACZ,SAAS,EAAE,CAAC;gBACZ,QAAQ,EAAE,KAAK;gBACf,YAAY,EAAE,MAAM;aACrB,CAAC,CAAC;YAEH,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACxC,CAAC;QACD,yDAAyD;IAC3D,CAAC;IAED,iCAAiC;IACjC,MAAM,cAAc,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAE5D,IAAI,IAAY,CAAC;IACjB,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,oBAAoB;QACpB,IAAI,GAAG,aAAa,EAAE,CAAC;QACvB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE;YACd,EAAE,EAAE,IAAI;YACR,MAAM,EAAE,CAAC,CAAC;YACV,WAAW,EAAE,CAAC;YACd,WAAW,EAAE,QAAQ;YACrB,IAAI,EAAE,CAAC;YACP,SAAS,EAAE,IAAI;YACf,QAAQ,EAAE,EAAE;YACZ,SAAS,EAAE,CAAC;YACZ,QAAQ,EAAE,KAAK;YACf,YAAY,EAAE,IAAI,GAAG,EAAE;SACxB,CAAC,CAAC;IACL,CAAC;SAAM,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvC,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;SAAM,CAAC;QACN,yCAAyC;QACzC,IAAI,GAAG,aAAa,EAAE,CAAC;QACvB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;YACjC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,YAAY,EAAE,CAAC;gBAC7C,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE;YACd,EAAE,EAAE,IAAI;YACR,MAAM,EAAE,CAAC,CAAC;YACV,WAAW,EAAE,CAAC;YACd,WAAW,EAAE,QAAQ;YACrB,IAAI,EAAE,SAAS;YACf,SAAS,EAAE,IAAI;YACf,QAAQ,EAAE,cAAc;YACxB,SAAS,EAAE,CAAC;YACZ,QAAQ,EAAE,KAAK;YACf,YAAY,EAAE,SAAS;SACxB,CAAC,CAAC;QAEH,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;YACjC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,MAAM,GAAG,IAAI,CAAC;YAC9B,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,WAAW,GAAG,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,YAAY,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;AACzD,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CACnB,KAAyC;IAEzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAA6B,CAAC;IAEpD,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QAC/B,MAAM,EAAE,YAAY,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC;QACvC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE;YACb,GAAG,IAAI;YACP,yDAAyD;YACzD,kFAAkF;SACnF,CAAC,CAAC;QAEH,+DAA+D;QAC/D,8DAA8D;IAChE,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8DAA8D;AAC9D,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAuB,CAAC;AAE3D;;GAEG;AACH,MAAM,UAAU,6BAA6B,CAC3C,KAAgB,EAChB,SAAiB,EACjB,cAAsB;IAEtB,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QACpB,OAAO,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,EAAE,YAAY,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;IACzF,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAA6B,CAAC;IACnD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAC;IAEpD,yBAAyB;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE;YACX,EAAE,EAAE,CAAC;YACL,MAAM,EAAE,CAAC,CAAC;YACV,WAAW,EAAE,QAAQ;YACrB,WAAW,EAAE,CAAC;YACd,IAAI,EAAE,CAAC;YACP,SAAS,EAAE,KAAK;YAChB,QAAQ,EAAE,EAAE;YACZ,SAAS,EAAE,CAAC;YACZ,QAAQ,EAAE,KAAK;SAChB,CAAC,CAAC;QACH,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,SAAS,CAAC;QACvB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE;YACd,EAAE,EAAE,IAAI;YACR,MAAM,EAAE,CAAC,CAAC;YACV,WAAW,EAAE,CAAC;YACd,WAAW,EAAE,QAAQ;YACrB,IAAI,EAAE,CAAC;YACP,SAAS,EAAE,IAAI;YACf,QAAQ,EAAE,EAAE;YACZ,SAAS,EAAE,CAAC;YACZ,QAAQ,EAAE,KAAK;SAChB,CAAC,CAAC;QACH,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAClC,OAAO,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,YAAY,EAAE,CAAC;IAC5D,CAAC;IAED,iCAAiC;IACjC,MAAM,WAAW,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAEnE,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,SAAS,CAAC,CAAC;IACpC,IAAI,aAAa,GAAG,SAAS,CAAC;IAE9B,kDAAkD;IAClD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,+BAA+B;IAEhF,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;QAC5D,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAE/B,IAAI,KAAK,KAAK,KAAK;YAAE,SAAS;QAE9B,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,YAAY,GAAG,KAAK,GAAG,KAAK,CAAC;QAEnC,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAE5C,sBAAsB;QACtB,MAAM,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAE7C,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YACzD,oDAAoD;YACpD,MAAM,eAAe,GAAG,aAAa,EAAE,CAAC;YACxC,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;YAC9C,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;YAC9C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;YAEpD,KAAK,CAAC,GAAG,CAAC,eAAe,EAAE;gBACzB,EAAE,EAAE,eAAe;gBACnB,MAAM,EAAE,CAAC,CAAC;gBACV,WAAW,EAAE,MAAM;gBACnB,WAAW,EAAE,QAAQ;gBACrB,IAAI,EAAE,YAAY;gBAClB,SAAS,EAAE,IAAI;gBACf,QAAQ,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;gBAClC,SAAS,EAAE,CAAC;gBACZ,QAAQ,EAAE,KAAK;aAChB,CAAC,CAAC;YACH,YAAY,CAAC,GAAG,CAAC,eAAe,EAAE,SAAS,CAAC,CAAC;YAE7C,kBAAkB;YAClB,KAAK,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC,MAAM,GAAG,eAAe,CAAC;YAChD,KAAK,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC,WAAW,GAAG,MAAM,CAAC;YAC5C,KAAK,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC,MAAM,GAAG,eAAe,CAAC;YAChD,KAAK,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC,WAAW,GAAG,MAAM,CAAC;YAE5C,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5B,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5B,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;QAC9C,CAAC;aAAM,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YACpC,8CAA8C;YAC9C,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;YACxC,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;YAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC9C,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,WAAW,GAAG,MAAM,CAAC;oBACnC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;YACD,QAAQ,CAAC,IAAI,GAAG,YAAY,CAAC;YAC7B,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5B,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACzC,CAAC;aAAM,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YACpC,8CAA8C;YAC9C,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;YACxC,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;YAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC9C,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,WAAW,GAAG,MAAM,CAAC;oBACnC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;YACD,QAAQ,CAAC,IAAI,GAAG,YAAY,CAAC;YAC7B,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5B,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACzC,CAAC;aAAM,IAAI,YAAY,IAAI,cAAc,EAAE,CAAC;YAC1C,uEAAuE;YACvE,MAAM,SAAS,GAAG,aAAa,EAAE,CAAC;YAClC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;YAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE,CAAC;oBAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACd,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,WAAW,GAAG,MAAM,CAAC;gBACrC,CAAC;YACH,CAAC;YAED,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE;gBACnB,EAAE,EAAE,SAAS;gBACb,MAAM,EAAE,CAAC,CAAC;gBACV,WAAW,EAAE,MAAM;gBACnB,WAAW,EAAE,QAAQ;gBACrB,IAAI,EAAE,YAAY;gBAClB,SAAS,EAAE,IAAI;gBACf,QAAQ,EAAE,EAAE;gBACZ,SAAS,EAAE,CAAC;gBACZ,QAAQ,EAAE,KAAK;aAChB,CAAC,CAAC;YACH,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YAEpC,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACxC,CAAC;QACD,yDAAyD;IAC3D,CAAC;IAED,iCAAiC;IACjC,MAAM,cAAc,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAE5D,IAAI,IAAY,CAAC;IACjB,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,oBAAoB;QACpB,IAAI,GAAG,aAAa,EAAE,CAAC;QACvB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE;YACd,EAAE,EAAE,IAAI;YACR,MAAM,EAAE,CAAC,CAAC;YACV,WAAW,EAAE,CAAC;YACd,WAAW,EAAE,QAAQ;YACrB,IAAI,EAAE,CAAC;YACP,SAAS,EAAE,IAAI;YACf,QAAQ,EAAE,EAAE;YACZ,SAAS,EAAE,CAAC;YACZ,QAAQ,EAAE,KAAK;SAChB,CAAC,CAAC;QACH,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACpC,CAAC;SAAM,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvC,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;SAAM,CAAC;QACN,yCAAyC;QACzC,IAAI,GAAG,aAAa,EAAE,CAAC;QACvB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;YACjC,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,CAAE,EAAE,CAAC;gBACvC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE;YACd,EAAE,EAAE,IAAI;YACR,MAAM,EAAE,CAAC,CAAC;YACV,WAAW,EAAE,CAAC;YACd,WAAW,EAAE,QAAQ;YACrB,IAAI,EAAE,SAAS;YACf,SAAS,EAAE,IAAI;YACf,QAAQ,EAAE,cAAc;YACxB,SAAS,EAAE,CAAC;YACZ,QAAQ,EAAE,KAAK;SAChB,CAAC,CAAC;QACH,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAElC,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;YACjC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,MAAM,GAAG,IAAI,CAAC;YAC9B,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,WAAW,GAAG,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,YAAY,EAAE,CAAC;AAC5D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,IAAmB,EACnB,SAAiB;IAEjB,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,MAAM,OAAO,GAAG,CAAC,EAAU,EAAQ,EAAE;QACnC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO;QAC5B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAEhB,IAAI,EAAE,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAChB,OAAO;QACT,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,OAAO,CAAC,KAAK,CAAC,CAAC;QACjB,CAAC;IACH,CAAC,CAAC;IAEF,OAAO,CAAC,SAAS,CAAC,CAAC;IACnB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAC5B,IAAmB,EACnB,UAAkB;IAElB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACxC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IAChC,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,WAAW,EAAE,KAAK,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC;AAC9D,CAAC"}