verso-db 0.1.4 → 0.2.0

package/CHANGELOG.md

@@ -1,3 +1,28 @@
+# [0.2.0](https://github.com/briansunter/verso/compare/v0.1.5...v0.2.0) (2026-03-15)
+
+
+### Bug Fixes
+
+* comprehensive codebase audit - fix bugs, improve error handling, remove dead code ([3a95681](https://github.com/briansunter/verso/commit/3a95681365477b0a000a78beeebf95a6269bd90c))
+
+
+### Features
+
+* gracefully skip browser smoke test when Playwright unavailable in CI ([55bf0fd](https://github.com/briansunter/verso/commit/55bf0fd238b15263860fdd2c914910efd565323d))
+* worker parallelism with SharedArrayBuffer, quantized search, and parallel build ([ccdf9b3](https://github.com/briansunter/verso/commit/ccdf9b32d6bd0f0840a1799b6866e006a62fcbd3))
+
+## [0.1.5](https://github.com/briansunter/verso/compare/v0.1.4...v0.1.5) (2026-02-28)
+
+
+### Bug Fixes
+
+* audit round 2 — 7 fixes, 31 tests added (377 total) ([6098253](https://github.com/briansunter/verso/commit/6098253e7193d5af4d827abada8699dc9b8f3c55))
+* audit round 3 — 17 fixes, 111 tests added (488 total) ([2eb0c69](https://github.com/briansunter/verso/commit/2eb0c69751f2fe87f84ba128aad019b979e205fd))
+* audit round 4 — 14 fixes, 43 tests added (531 total) ([5078dde](https://github.com/briansunter/verso/commit/5078dde36cf5a7bb0467539eb471814c4881c3f7))
+* audit round 5 — ID exhaustion guards, input validation, deterministic ordering, benchmark fixes (607 total tests) ([b22d54c](https://github.com/briansunter/verso/commit/b22d54c359e328d76a0fd4658093411e5faccf0b))
+* comprehensive codebase audit — 12 bugs fixed, 69 tests added ([7479626](https://github.com/briansunter/verso/commit/7479626ee020952f56746914152c242b80e7c4f9))
+* quantized search respects explicit efSearch, benchmark fixes ([07ad671](https://github.com/briansunter/verso/commit/07ad6718d4af44a7e5bd4470dd3e23c921e19532))
+
 ## [0.1.4](https://github.com/briansunter/verso/compare/v0.1.3...v0.1.4) (2025-12-29)
 
 

package/README.md

@@ -1,8 +1,8 @@
 # Verso
 
-High-performance vector search with HNSW indexing for Bun and Browser.
+High-performance vector search with HNSW indexing for Bun, Node.js, and Browser.
 
-[![npm version](https://img.shields.io/npm/v/verso.svg)](https://www.npmjs.com/package/verso)
+[![npm version](https://img.shields.io/npm/v/verso-db.svg)](https://www.npmjs.com/package/verso-db)
 [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
 
 ## Performance
@@ -18,7 +18,7 @@ High-performance vector search with HNSW indexing for Bun and Browser.
 - **HNSW Algorithm** - Hierarchical Navigable Small World for fast approximate nearest neighbor search
 - **Multiple Distance Metrics** - Cosine similarity, Euclidean, dot product
 - **Int8 Quantization** - 4x memory reduction with minimal recall loss
-- **Multi-Platform** - Bun (file system) and Browser (OPFS)
+- **Multi-Platform** - Bun/Node.js (file system) and Browser (OPFS)
 - **Parameter Presets** - Pre-tuned configurations for different use cases
 - **Batch Queries** - Efficient batch processing for throughput
 - **Metadata Filtering** - MongoDB-style query operators
@@ -27,19 +27,19 @@ High-performance vector search with HNSW indexing for Bun and Browser.
 
 ```bash
 # Bun
-bun add verso
+bun add verso-db
 
-# npm
-npm install verso
+# npm / Node.js
+npm install verso-db
 ```
 
 ## Quick Start
 
 ```typescript
-import { VectorDB, getRecommendedPreset } from 'verso';
+import { VectorDB, getRecommendedPreset } from 'verso-db';
 
 // Create database
-const db = new VectorDB();
+const db = new VectorDB({ storagePath: './my_vectors' });
 
 // Get recommended parameters for your vector dimensions
 const preset = getRecommendedPreset(768);
@@ -74,8 +74,12 @@ const results = await collection.query({
   efSearch: preset.efSearch
 });
 
-console.log(results);
-// [{ id: 'doc1', score: 0.99, metadata: { title: 'Document 1', ... } }, ...]
+console.log(results.ids);        // ['doc1', 'doc2', 'doc3']
+console.log(results.distances);  // [0.01, 0.05, 0.12]
+console.log(results.metadata);   // [{ title: 'Document 1', ... }, ...]
+
+// Optional: release resources explicitly
+await db.close();
 ```
 
 ## API Reference
@@ -85,7 +89,7 @@ console.log(results);
 Main database class for managing collections.
 
 ```typescript
-const db = new VectorDB();
+const db = new VectorDB({ storagePath: './vectors' });
 
 // Create collection
 const collection = await db.createCollection('name', {
@@ -95,7 +99,7 @@ const collection = await db.createCollection('name', {
   efConstruction: 200 // Build-time search depth
 });
 
-// Get existing collection
+// Get existing collection (returns undefined if not found)
 const collection = await db.getCollection('name');
 
 // List collections
@@ -103,6 +107,9 @@ const names = await db.listCollections();
 
 // Delete collection
 await db.deleteCollection('name');
+
+// Close database
+await db.close();
 ```
 
 ### Collection
@@ -110,31 +117,47 @@ await db.deleteCollection('name');
 ```typescript
 // Add vectors
 await collection.add({
-  ids: string[],
-  vectors: Float32Array[],
-  metadata?: object[]
+  ids: ['id1', 'id2'],
+  vectors: [new Float32Array([...]), new Float32Array([...])],
+  metadata: [{ key: 'value' }, { key: 'value' }]  // optional
 });
 
-// Query
+// Upsert vectors (update existing, add new)
+await collection.upsert({
+  ids: ['id1', 'id3'],  // id1 updated, id3 added
+  vectors: [new Float32Array([...]), new Float32Array([...])],
+  metadata: [{ key: 'new_value' }, { key: 'value' }]
+});
+
+// Query — returns { ids: string[], distances: number[], metadata: object[] }
 const results = await collection.query({
-  queryVector: Float32Array,
-  k: number,
-  efSearch?: number,
-  filter?: FilterExpression
+  queryVector: new Float32Array([...]),
+  k: 10,
+  efSearch: 200,           // optional
+  filter: { category: 'tech' }  // optional
 });
 
 // Batch query
-const batchResults = await collection.queryBatch({
-  queryVectors: Float32Array[],
-  k: number,
-  efSearch?: number
-});
+const batchResults = await collection.queryBatch([
+  { queryVector: vec1, k: 10 },
+  { queryVector: vec2, k: 5, filter: { type: 'article' } }
+]);
 
-// Delete vectors
-await collection.delete(ids: string[]);
+// Delete a single vector
+await collection.delete('id1');
 
-// Get collection info
-const info = await collection.info();
+// Delete multiple vectors
+await collection.deleteBatch(['id1', 'id2']);
+
+// Check existence
+collection.has('id1');     // true if active (not deleted)
+collection.count();        // number of active vectors
+
+// Flush pending writes when using Collection directly
+await collection.flush();
+
+// Compact — permanently remove deleted vectors and reclaim space
+await collection.compact();
 ```
 
 ### Metadata Filtering
@@ -156,23 +179,23 @@ Supported operators: `$eq`, `$ne`, `$gt`, `$gte`, `$lt`, `$lte`, `$in`, `$nin`
 ### Parameter Presets
 
 ```typescript
-import { getRecommendedPreset, getRAGPreset, PRESETS } from 'verso';
+import { getRecommendedPreset, getRAGPreset, PRESETS } from 'verso-db';
 
 // Automatic preset based on dimensions
 const preset = getRecommendedPreset(768);
 
-// RAG-optimized preset (high recall)
-const ragPreset = getRAGPreset(768);
-
-// Available presets
-PRESETS.LOW_DIM        // <= 128 dimensions
-PRESETS.MEDIUM_DIM     // 256-512 dimensions
-PRESETS.HIGH_DIM       // 768+ dimensions
-PRESETS.VERY_HIGH_DIM  // 1024+ dimensions
-PRESETS.SMALL_DATASET  // < 10k vectors
-PRESETS.LARGE_DATASET  // 100k+ vectors
-PRESETS.MAX_RECALL     // Prioritize accuracy
-PRESETS.LOW_LATENCY    // Prioritize speed
+// RAG-optimized preset (high recall) by embedding model name
+const ragPreset = getRAGPreset('text-embedding-3-large');
+
+// Named presets (accessed by string key)
+PRESETS['low-dim']        // <= 128 dimensions
+PRESETS['medium-dim']     // 256-512 dimensions
+PRESETS['high-dim']       // 768+ dimensions
+PRESETS['very-high-dim']  // 1536+ dimensions
+PRESETS['small-dataset']  // < 10k vectors
+PRESETS['large-dataset']  // 100k+ vectors
+PRESETS['max-recall']     // Prioritize accuracy
+PRESETS['low-latency']    // Prioritize speed
 ```
 
 ### Int8 Quantization
@@ -180,7 +203,7 @@ PRESETS.LOW_LATENCY    // Prioritize speed
 Reduce memory usage by 4x with minimal recall loss:
 
 ```typescript
-import { ScalarQuantizer, QuantizedVectorStore } from 'verso';
+import { ScalarQuantizer, QuantizedVectorStore } from 'verso-db';
 
 // Create quantizer
 const quantizer = new ScalarQuantizer(768);
@@ -191,10 +214,10 @@ quantizer.train(sampleVectors);
 // Quantize vectors
 const quantized = quantizer.quantize(vector);
 
-// Use with QuantizedVectorStore for integrated search
+// Use QuantizedVectorStore for compact in-memory storage
 const store = new QuantizedVectorStore(768);
-store.add(ids, vectors);
-const results = store.search(queryVector, k);
+store.addVectors(sampleVectors);
+console.log(store.size(), store.memoryUsage());
 ```
 
 ## Storage Backends
@@ -203,16 +226,16 @@ Verso automatically selects the appropriate storage backend:
 
 | Environment | Backend | Storage |
 |-------------|---------|---------|
-| Bun | `BunStorageBackend` | File system |
+| Bun / Node.js | `BunStorageBackend` | File system |
 | Browser | `OPFSBackend` | Origin Private File System |
 | Fallback | `MemoryBackend` | In-memory (no persistence) |
 
 ```typescript
-import { createStorageBackend, getRecommendedStorageType } from 'verso';
+import { createStorageBackend, getRecommendedStorageType } from 'verso-db';
 
 // Automatic detection
 const backend = await createStorageBackend({
-  basePath: './vectors'
+  path: './vectors'
 });
 
 // Check available types
@@ -245,6 +268,15 @@ bun run build
 
 # Run benchmarks
 bun run bench
+
+# Recall benchmark
+bun run benchmark:recall
+
+# Storage benchmark
+bun run benchmark:storage
+
+# Comprehensive benchmark suite
+bun run benchmark:comprehensive
 ```
 
 ## License

package/dist/BinaryHeap.d.ts

@@ -3,18 +3,20 @@ export declare class BinaryHeap {
     private dists;
     private _size;
     private capacity;
-    private lastPoppedValue;
-    constructor(capacity: number);
+    private readonly isMaxHeap;
+    constructor(capacity: number, isMaxHeap?: boolean);
     /**
      * Push an element onto the heap.
-     * When at capacity, simply returns without adding (caller manages bounds).
-     * This is the correct behavior for HNSW candidate exploration.
+     * Auto-grows when at capacity to avoid silently dropping elements.
      */
     push(id: number, dist: number): void;
+    /**
+     * Double the heap capacity when full.
+     */
+    private grow;
     pop(): number;
     peek(): number;
     peekValue(): number;
-    getLastPoppedValue(): number;
     size(): number;
     clear(): void;
     isEmpty(): boolean;
@@ -22,4 +24,13 @@ export declare class BinaryHeap {
     private heapifyUp;
     private heapifyDown;
 }
+/**
+ * MaxBinaryHeap - A max-heap for HNSW result tracking.
+ *
+ * Keeps the FURTHEST element at the top, allowing O(log n) eviction
+ * of the worst result when a better one is found.
+ */
+export declare class MaxBinaryHeap extends BinaryHeap {
+    constructor(capacity: number);
+}
 //# sourceMappingURL=BinaryHeap.d.ts.map

package/dist/BinaryHeap.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BinaryHeap.d.ts","sourceRoot":"","sources":["../src/BinaryHeap.ts"],"names":[],"mappings":"AAAA,qBAAa,UAAU;IACrB,OAAO,CAAC,GAAG,CAAc;IACzB,OAAO,CAAC,KAAK,CAAe;IAC5B,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,eAAe,CAAa;gBAExB,QAAQ,EAAE,MAAM;IAO5B;;;;OAIG;IACH,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAapC,GAAG,IAAI,MAAM;IAcb,IAAI,IAAI,MAAM;IAId,SAAS,IAAI,MAAM;IAInB,kBAAkB,IAAI,MAAM;IAI5B,IAAI,IAAI,MAAM;IAId,KAAK,IAAI,IAAI;IAIb,OAAO,IAAI,OAAO;IAIlB,WAAW,IAAI,MAAM;IAIrB,OAAO,CAAC,SAAS;IAuBjB,OAAO,CAAC,WAAW;CAiCpB"}
+{"version":3,"file":"BinaryHeap.d.ts","sourceRoot":"","sources":["../src/BinaryHeap.ts"],"names":[],"mappings":"AAAA,qBAAa,UAAU;IACrB,OAAO,CAAC,GAAG,CAAc;IACzB,OAAO,CAAC,KAAK,CAAe;IAC5B,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAU;gBAExB,QAAQ,EAAE,MAAM,EAAE,SAAS,GAAE,OAAe;IAQxD;;;OAGG;IACH,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAWpC;;OAEG;IACH,OAAO,CAAC,IAAI;IAWZ,GAAG,IAAI,MAAM;IAab,IAAI,IAAI,MAAM;IAId,SAAS,IAAI,MAAM;IAKnB,IAAI,IAAI,MAAM;IAId,KAAK,IAAI,IAAI;IAIb,OAAO,IAAI,OAAO;IAIlB,WAAW,IAAI,MAAM;IAIrB,OAAO,CAAC,SAAS;IAwBjB,OAAO,CAAC,WAAW;CAkCpB;AAED;;;;;GAKG;AACH,qBAAa,aAAc,SAAQ,UAAU;gBAC/B,QAAQ,EAAE,MAAM;CAG7B"}

package/dist/BinaryHeap.js

@@ -0,0 +1,138 @@
+export class BinaryHeap {
+    ids;
+    dists;
+    _size;
+    capacity;
+    isMaxHeap;
+    constructor(capacity, isMaxHeap = false) {
+        this.capacity = capacity;
+        this.isMaxHeap = isMaxHeap;
+        this.ids = new Uint32Array(capacity);
+        this.dists = new Float32Array(capacity);
+        this._size = 0;
+    }
+    /**
+     * Push an element onto the heap.
+     * Auto-grows when at capacity to avoid silently dropping elements.
+     */
+    push(id, dist) {
+        if (this._size >= this.capacity) {
+            this.grow();
+        }
+        this.ids[this._size] = id;
+        this.dists[this._size] = dist;
+        this._size++;
+        this.heapifyUp(this._size - 1);
+    }
+    /**
+     * Double the heap capacity when full.
+     */
+    grow() {
+        const newCapacity = Math.max(this.capacity * 2, 16);
+        const newIds = new Uint32Array(newCapacity);
+        const newDists = new Float32Array(newCapacity);
+        newIds.set(this.ids);
+        newDists.set(this.dists);
+        this.ids = newIds;
+        this.dists = newDists;
+        this.capacity = newCapacity;
+    }
+    pop() {
+        if (this._size === 0)
+            return -1;
+        const result = this.ids[0];
+        this._size--;
+        if (this._size > 0) {
+            this.ids[0] = this.ids[this._size];
+            this.dists[0] = this.dists[this._size];
+            this.heapifyDown(0);
+        }
+        return result;
+    }
+    peek() {
+        return this._size > 0 ? this.ids[0] : -1;
+    }
+    peekValue() {
+        if (this._size > 0)
+            return this.dists[0];
+        return this.isMaxHeap ? -Infinity : Infinity;
+    }
+    size() {
+        return this._size;
+    }
+    clear() {
+        this._size = 0;
+    }
+    isEmpty() {
+        return this._size === 0;
+    }
+    getCapacity() {
+        return this.capacity;
+    }
+    heapifyUp(index) {
+        // Cache array references to avoid repeated property lookups
+        const ids = this.ids;
+        const dists = this.dists;
+        const isMax = this.isMaxHeap;
+        while (index > 0) {
+            // Use bitwise shift for faster integer division
+            const parentIndex = (index - 1) >> 1;
+            if (isMax ? dists[parentIndex] >= dists[index] : dists[parentIndex] <= dists[index])
+                break;
+            // Inline swap for performance
+            const tmpId = ids[index];
+            ids[index] = ids[parentIndex];
+            ids[parentIndex] = tmpId;
+            const tmpDist = dists[index];
+            dists[index] = dists[parentIndex];
+            dists[parentIndex] = tmpDist;
+            index = parentIndex;
+        }
+    }
+    heapifyDown(index) {
+        // Cache array references to avoid repeated property lookups
+        const ids = this.ids;
+        const dists = this.dists;
+        const size = this._size;
+        const isMax = this.isMaxHeap;
+        while (true) {
+            const leftChild = (index << 1) + 1; // 2 * index + 1
+            const rightChild = leftChild + 1; // 2 * index + 2
+            let best = index;
+            if (isMax) {
+                if (leftChild < size && dists[leftChild] > dists[best])
+                    best = leftChild;
+                if (rightChild < size && dists[rightChild] > dists[best])
+                    best = rightChild;
+            }
+            else {
+                if (leftChild < size && dists[leftChild] < dists[best])
+                    best = leftChild;
+                if (rightChild < size && dists[rightChild] < dists[best])
+                    best = rightChild;
+            }
+            if (best === index)
+                break;
+            // Inline swap for performance
+            const tmpId = ids[index];
+            ids[index] = ids[best];
+            ids[best] = tmpId;
+            const tmpDist = dists[index];
+            dists[index] = dists[best];
+            dists[best] = tmpDist;
+            index = best;
+        }
+    }
+}
+/**
+ * MaxBinaryHeap - A max-heap for HNSW result tracking.
+ *
+ * Keeps the FURTHEST element at the top, allowing O(log n) eviction
+ * of the worst result when a better one is found.
+ */
+export class MaxBinaryHeap extends BinaryHeap {
+    constructor(capacity) {
+        super(capacity, true);
+    }
+}
+//# sourceMappingURL=BinaryHeap.js.map

package/dist/BinaryHeap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BinaryHeap.js","sourceRoot":"","sources":["../src/BinaryHeap.ts"],"names":[],"mappings":"AAAA,MAAM,OAAO,UAAU;IACb,GAAG,CAAc;IACjB,KAAK,CAAe;IACpB,KAAK,CAAS;IACd,QAAQ,CAAS;IACR,SAAS,CAAU;IAEpC,YAAY,QAAgB,EAAE,YAAqB,KAAK;QACtD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,GAAG,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,EAAU,EAAE,IAAY;QAC3B,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChC,IAAI,CAAC,IAAI,EAAE,CAAC;QACd,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;QAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACK,IAAI;QACV,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,WAAW,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACrB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,WAAW,CAAC;IAC9B,CAAC;IAED,GAAG;QACD,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC;QAEhC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED,SAAS;QACP,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;IAC/C,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAEO,SAAS,CAAC,KAAa;QAC7B,4DAA4D;QAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC;QAE7B,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACjB,gDAAgD;YAChD,MAAM,WAAW,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC;gBAAE,MAAM;YAE3F,8BAA8B;YAC9B,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;YACzB,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,WAAW,CAAC,CAAC;YAC9B,GAAG,CAAC,WAAW,CAAC,GAAG,KAAK,CAAC;YAEzB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YAC7B,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC;YAClC,KAAK,CAAC,WAAW,CAAC,GAAG,OAAO,CAAC;YAE7B,KAAK,GAAG,WAAW,CAAC;QACtB,CAAC;IACH,CAAC;IAEO,WAAW,CAAC,KAAa;QAC/B,4DAA4D;QAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC;QAE7B,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,SAAS,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB;YACpD,MAAM,UAAU,GAAG,SAAS,GAAG,CAAC,CAAC,CAAG,gBAAgB;YACpD,IAAI,IAAI,GAAG,KAAK,CAAC;YAEjB,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,SAAS,GAAG,IAAI,IAAI,KAAK,CAAC,SAAS,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;oBAAE,IAAI,GAAG,SAAS,CAAC;gBACzE,IAAI,UAAU,GAAG,IAAI,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;oBAAE,IAAI,GAAG,UAAU,CAAC;YAC9E,CAAC;iBAAM,CAAC;gBACN,IAAI,SAAS,GAAG,IAAI,IAAI,KAAK,CAAC,SAAS,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;oBAAE,IAAI,GAAG,SAAS,CAAC;gBACzE,IAAI,UAAU,GAAG,IAAI,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;oBAAE,IAAI,GAAG,UAAU,CAAC;YAC9E,CAAC;YAED,IAAI,IAAI,KAAK,KAAK;gBAAE,MAAM;YAE1B,8BAA8B;YAC9B,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;YACzB,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;YAElB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YAC7B,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;YAEtB,KAAK,GAAG,IAAI,CAAC;QACf,CAAC;IACH,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,OAAO,aAAc,SAAQ,UAAU;IAC3C,YAAY,QAAgB;QAC1B,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC;CACF"}