@harperfast/harper 5.0.0-alpha.10

package/dist/resources/indexes/HierarchicalNavigableSmallWorld.js

@@ -0,0 +1,598 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.HierarchicalNavigableSmallWorld = void 0;
+const vector_ts_1 = require("./vector.js");
+const msgpackr_1 = require("msgpackr");
+const logger_ts_1 = require("../../utility/logging/logger.js");
+const hdbError_js_1 = require("../../utility/errors/hdbError.js");
+const logger = (0, logger_ts_1.loggerWithTag)('HNSW');
+/**
+ * Implementation of a vector index for Harper, using hierarchical navigable small world graphs.
+ */
+const ENTRY_POINT = Symbol.for('entryPoint');
+const KEY_PREFIX = Symbol.for('key');
+const MAX_LEVEL = 10; // should give good high-level skip list performance up to trillions of nodes
+/**
+ * Represents a Hierarchical Navigable Small World (HNSW) index for approximate nearest neighbor search.
+ * This implementation is based on hierarchical graph navigation to efficiently index and search high-dimensional vectors.
+ * A HNSW is basically a multi-dimensional skip list. Each node has (potentially) higher levels that are used for quickly
+ * traversing the graph get in the neighborhood of the node, and then lower levels are used to more accurately find the
+ * closest neighbors.
+ *
+ * This implementation is based on the paper "Efficient and Robust Approximate Nearest Neighbor Search in High Dimensions"
+ * (mostly influenced AI's contributions)
+ */
+class HierarchicalNavigableSmallWorld {
+    static useObjectStore = true;
+    indexStore;
+    M = 16; // max number of connections per layer
+    efConstruction = 100; // size of dynamic candidate list
+    efConstructionSearch = 50; // size of dynamic candidate list for search
+    mL = 1 / Math.log(this.M); // normalization factor for level generation
+    // how aggressive do we avoid connections that have alternate indirect routes; a value of 0 never avoids connections,
+    // a value of 1 is extremely aggressive.
+    optimizeRouting = 0.5;
+    nodesVisitedCount = 0;
+    idIncrementer;
+    distance;
+    constructor(indexStore, options) {
+        this.indexStore = indexStore;
+        if (indexStore) {
+            // use float32 representation of numbers as it is twice as space efficient as typical float64 and plenty accurate
+            // (we would actually like to use float16 if it were available)
+            this.indexStore.encoder.useFloat32 = msgpackr_1.FLOAT32_OPTIONS.ALWAYS;
+        }
+        this.distance = options?.distance === 'euclidean' ? vector_ts_1.euclideanDistance : vector_ts_1.cosineDistance;
+        if (options) {
+            // allow all the HNSW parameters to be configured/tuned
+            if (options.M !== undefined) {
+                this.M = options.M;
+                this.mL = 1 / Math.log(this.M); // recalculate
+            }
+            if (options.efConstruction !== undefined)
+                this.efConstruction = this.efConstructionSearch = options.efConstruction;
+            if (options.efConstructionSearch !== undefined)
+                this.efConstructionSearch = options.efConstructionSearch;
+            if (options.mL !== undefined)
+                this.mL = options.mL;
+            if (options.optimizeRouting !== undefined)
+                this.optimizeRouting = options.optimizeRouting;
+        }
+    }
+    index(primaryKey, vector, existingVector, options = {}) {
+        // first get the node id for the primary key; we use internal node ids for better efficiency,
+        // but we must use a safe key that won't collide with the node ids
+        const safeKey = typeof primaryKey === 'number' ? [KEY_PREFIX, primaryKey] : primaryKey;
+        let nodeId = this.indexStore.getSync(safeKey, options);
+        // if the node id is not found, create a new node (and store it in the index store)
+        // (note that we don't need to check if the node id is already in the index store,
+        // because we use internal node ids for better efficiency, and we use a safe key
+        // that won't collide with the node ids, so we can't have a collision with internal
+        if (!nodeId) {
+            if (!vector)
+                return; // didn't exist before, doesn't exist now, nothing to do
+            if (!this.idIncrementer) {
+                let largestNodeId = 0;
+                for (const key of this.indexStore.getKeys({
+                    reverse: true,
+                    limit: 1,
+                    start: Infinity,
+                    end: 0,
+                    transaction: options.transaction,
+                })) {
+                    if (typeof key === 'number')
+                        largestNodeId = key;
+                }
+                this.idIncrementer = new BigInt64Array([BigInt(largestNodeId) + 1n]);
+                this.idIncrementer = new BigInt64Array(this.indexStore.getUserSharedBuffer('next-id', this.idIncrementer.buffer));
+            }
+            nodeId = Number(Atomics.add(this.idIncrementer, 0, 1n));
+            this.indexStore.put(safeKey, nodeId, options);
+        }
+        const updatedNodes = new Map();
+        let oldNode;
+        // If this is the first entry, create it as the entry point
+        let entryPointId = this.indexStore.getSync(ENTRY_POINT, options);
+        if (existingVector) {
+            // If we are updating an existing entry, we need to update the entry point
+            // if the new entry is closer to the entry point than the old one
+            oldNode = { ...this.indexStore.getSync(nodeId, options) };
+        }
+        else
+            oldNode = {};
+        if (vector) {
+            let entryPoint = entryPointId && this.indexStore.getSync(entryPointId, options);
+            if (entryPoint == null) {
+                const level = Math.floor(-Math.log(Math.random()) * this.mL);
+                const node = {
+                    vector,
+                    level,
+                    primaryKey,
+                };
+                for (let i = 0; i <= level; i++) {
+                    node[i] = [];
+                }
+                this.indexStore.put(nodeId, node, options);
+                if (typeof nodeId !== 'number') {
+                    throw new Error('Invalid nodeId: ' + nodeId);
+                }
+                logger.debug?.('setting entry point to', nodeId);
+                this.indexStore.put(ENTRY_POINT, nodeId, options);
+                return;
+            }
+            // Generate random level for this new element
+            const level = oldNode.level ?? Math.min(Math.floor(-Math.log(Math.random()) * this.mL), MAX_LEVEL);
+            let currentLevel = entryPoint.level;
+            if (level >= currentLevel) {
+                // if we are at this level or higher, make this the new entry point
+                if (typeof nodeId !== 'number') {
+                    throw new Error('Invalid nodeId: ' + nodeId);
+                }
+                logger.debug?.('setting entry point to', nodeId);
+                this.indexStore.put(ENTRY_POINT, nodeId, options);
+            }
+            // For each level from top to bottom
+            while (currentLevel > level) {
+                // Search for closest neighbors at current level
+                const neighbors = this.searchLayer(vector, entryPointId, entryPoint, this.efConstruction, currentLevel);
+                if (neighbors.length > 0) {
+                    entryPointId = neighbors[0].id; // closest neighbor becomes new entry point
+                    entryPoint = neighbors[0].node;
+                }
+                currentLevel--;
+            }
+            const connections = new Array(level + 1);
+            for (let i = 0; i <= level; i++) {
+                connections[i] = [];
+            }
+            // Connect the new element to neighbors at its level and below
+            for (let l = Math.min(level, currentLevel); l >= 0; l--) {
+                let neighbors = this.searchLayer(vector, entryPointId, entryPoint, this.efConstruction, l);
+                neighbors = neighbors.slice(0, this.M << 1);
+                if (neighbors.length === 0 && l === 0) {
+                    logger.info?.('should not have zero connections for', entryPointId);
+                }
+                const connectionsAtLevel = connections[l];
+                // Create bidirectional connections
+                for (let i = 0; i < neighbors.length; i++) {
+                    const { id, distance, node } = neighbors[i];
+                    if (id === nodeId)
+                        continue; // don't connect to self
+                    const connectionsToBeReplaced = [];
+                    if (this.optimizeRouting) {
+                        // if we have existing connections through other nodes, we deprioritize new connections through them.
+                        // I believe this yields better HNSW graphs, avoiding redundant paths, with better directed connectivity
+                        // towards desired results
+                        let skipping = false;
+                        const neighborNeighbors = node[l];
+                        const distanceThreshold = 1 + this.optimizeRouting * (1 + (0.5 * i) / this.M);
+                        for (let i2 = 0; i2 < neighborNeighbors?.length; i2++) {
+                            const { id: neighborId, distance: neighborDistance } = neighborNeighbors[i2];
+                            const neighborDistanceThreshold = 1 + this.optimizeRouting * (1 + (0.5 * i2) / this.M);
+                            for (let i3 = 0; i3 < connectionsAtLevel.length; i3++) {
+                                const { id: addedId, distance: addedDistance } = connectionsAtLevel[i3];
+                                if (addedId === neighborId) {
+                                    if (distance * distanceThreshold > addedDistance + neighborDistance) {
+                                        // if the new distance is relatively low compared to existing indirect connections,
+                                        // we skip this neighbor since it is of less value
+                                        skipping = true;
+                                    }
+                                    else if (neighborDistance * neighborDistanceThreshold > distance + addedDistance) {
+                                        // potentially remove the neighbor's neighbor, because we are adding a better route (if we do add it)
+                                        connectionsToBeReplaced.push({ fromId: addedId, toId: id });
+                                        connectionsToBeReplaced.push({ fromId: id, toId: addedId });
+                                    }
+                                    break;
+                                }
+                            }
+                            if (skipping)
+                                break;
+                        }
+                        if (skipping)
+                            continue;
+                    }
+                    else if (i >= (l > 0 ? this.M : this.M << 1)) {
+                        // fallback to traditional HNSW level limiting; if we are at the maximum number of neighbors, we skip this one
+                        continue;
+                    }
+                    // Add connection to the new element
+                    connectionsAtLevel.push({ id, distance });
+                    for (const { fromId, toId } of connectionsToBeReplaced) {
+                        let from = updateNode(fromId);
+                        if (!from)
+                            from = updateNode(fromId, this.indexStore.getSync(fromId, options));
+                        for (let i = 0; i < from[l].length; i++) {
+                            if (from[l][i].id === toId) {
+                                if (Object.isFrozen(from[l])) {
+                                    from[l] = from[l].slice();
+                                }
+                                from[l].splice(i, 1);
+                                break;
+                            }
+                        }
+                    }
+                    // Add reverse connection from neighbor to new element if it didn't exist before
+                    // First check to see if we had an existing neighbor connection before. If we did we can
+                    // just remove from the list of the connections to remove (don't remove, leave it in place)
+                    let oldConnections = oldNode[l];
+                    const oldConnection = oldConnections?.find(({ id: nid }) => nid === id);
+                    if (oldConnection) {
+                        const oldPosition = oldConnections?.indexOf(oldConnection);
+                        if (!oldConnections.copied) {
+                            // make a copy, it is likely frozen
+                            oldConnections = [...oldConnections];
+                            oldConnections.copied = true;
+                            oldNode[l] = oldConnections;
+                        }
+                        oldConnections.splice(oldPosition, 1);
+                    }
+                    else {
+                        // add new connection since this is truly a new connection now
+                        this.addConnection(id, updateNode(id, node), nodeId, l, distance, updateNode, options);
+                    }
+                }
+            }
+            // Store the new element
+            this.indexStore.put(nodeId, {
+                vector,
+                level,
+                primaryKey,
+                ...connections,
+            }, options);
+        }
+        else {
+            // removal of this node, but first make sure we have a valid entry point
+            if (entryPointId === nodeId) {
+                // if this is the entry point, find a new entry point
+                const lastLevel = oldNode.level ?? 0;
+                for (let l = lastLevel; l >= 0; l--) {
+                    entryPointId = oldNode[l]?.[0]?.id;
+                    if (entryPointId !== undefined)
+                        break;
+                }
+                if (entryPointId === undefined) {
+                    // scan through all nodes to find one with highest level
+                    let highestLevel = -1;
+                    for (const { key, value } of this.indexStore.getRange({
+                        start: 0,
+                        end: Infinity,
+                    })) {
+                        if (value.level > highestLevel) {
+                            entryPointId = key;
+                            if (value.level === lastLevel)
+                                break; // if we found a node at the same level as the last entry point, we can stop
+                            highestLevel = value.level;
+                        }
+                    }
+                }
+                if (entryPointId === undefined) {
+                    // no nodes left in index
+                    this.indexStore.remove(ENTRY_POINT, options);
+                }
+                else {
+                    // set the new entry point
+                    if (typeof entryPointId !== 'number') {
+                        throw new Error('Invalid nodeId: ' + entryPointId);
+                    }
+                    logger.debug?.('setting entry point to', entryPointId);
+                    this.indexStore.put(ENTRY_POINT, entryPointId, options);
+                }
+            }
+            this.indexStore.remove(nodeId, options);
+        }
+        const needsReindexing = new Map();
+        // remove connections to this node that are no longer valid
+        if (oldNode.level !== undefined) {
+            for (let l = 0; l <= oldNode.level; l++) {
+                const oldConnections = oldNode[l];
+                for (const { id: neighborId } of oldConnections) {
+                    // get and copy the neighbor node so we can modify it
+                    const neighborNode = updateNode(neighborId, this.indexStore.getSync(neighborId, options));
+                    if (!neighborNode)
+                        continue;
+                    for (let l2 = 0; l2 <= l; l2++) {
+                        // remove the connection to this node from the neighbor node
+                        neighborNode[l2] = neighborNode[l2]?.filter(({ id: nid }) => {
+                            return nid !== nodeId;
+                        });
+                        if (neighborNode[l2]?.length === 0) {
+                            logger.trace?.('node was left orphaned, will reindex', neighborId);
+                            needsReindexing.set(neighborNode.primaryKey, neighborNode.vector);
+                        }
+                    }
+                }
+            }
+        }
+        function updateNode(id, node) {
+            // keep a record of all our changes, maintaining any changes that are queued to be written
+            let updatedNode = updatedNodes.get(id);
+            if (!updatedNode && node) {
+                // copy the node so we can modify it
+                updatedNode = { ...node };
+                updatedNodes.set(id, updatedNode);
+            }
+            return updatedNode;
+        }
+        for (const [id, updatedNode] of updatedNodes) {
+            this.indexStore.put(id, updatedNode, options);
+        }
+        for (const [key, vector] of needsReindexing) {
+            this.index(key, vector, vector);
+        }
+        this.checkSymmetry(nodeId, this.indexStore.getSync(nodeId, options), options);
+    }
+    getEntryPoint() {
+        // Get entry point
+        const entryPointId = this.indexStore.getSync(ENTRY_POINT);
+        if (entryPointId === undefined)
+            return;
+        const node = this.indexStore.getSync(entryPointId);
+        return { id: entryPointId, ...node };
+    }
+    /**
+     * Search one layer of the skip-list using HNSW algorithm for creating a candidate list and navigating the graph
+     * TODO: This should be async, but we can't really do that with lmdb-js's transaction system right now. Should be
+     * doable with RocksDB. We could also create an async version for searching.
+     * @param queryVector
+     * @param entryPointId
+     * @param entryPoint
+     * @param ef
+     * @param level
+     * @param distanceFunction
+     * @private
+     */
+    searchLayer(queryVector, entryPointId, entryPoint, ef, level, distanceFunction = this.distance) {
+        const visited = new Set([entryPointId]);
+        const candidates = [
+            {
+                id: entryPointId,
+                distance: this.distance(queryVector, entryPoint.vector),
+                node: entryPoint,
+            },
+        ];
+        const results = [...candidates];
+        while (candidates.length > 0) {
+            // Get closest unvisited element
+            candidates.sort((a, b) => a.distance - b.distance);
+            const current = candidates.shift();
+            // Get least result distance
+            const furthestDistance = results[results.length - 1].distance;
+            // If current candidate is less similar than our worst result, we're done
+            if (current.distance > furthestDistance)
+                break;
+            // Check neighbors of current point
+            const currentNode = current.node;
+            for (const { id: neighborId } of currentNode[level] || []) {
+                if (visited.has(neighborId) || neighborId === undefined)
+                    continue;
+                visited.add(neighborId);
+                const neighbor = this.indexStore.getSync(neighborId);
+                if (!neighbor)
+                    continue;
+                this.nodesVisitedCount++;
+                const distance = distanceFunction(queryVector, neighbor.vector);
+                if (distance < furthestDistance || results.length < ef) {
+                    const candidate = {
+                        id: neighborId,
+                        distance,
+                        node: neighbor,
+                    };
+                    candidates.push(candidate);
+                    results.push(candidate);
+                }
+            }
+            results.sort((a, b) => a.distance - b.distance);
+            if (results.length > ef)
+                results.splice(ef, results.length - ef);
+        }
+        results.visited = visited.size;
+        return results;
+    }
+    /**
+     * This the main entry from Harper's query functionality, where we actually search for an ordered list of nearest
+     * neighbors, using the provided sort/order definition object and performing the multi-layer skip-list search.
+     * This returns an iterable of the nearest neighbors to the provided target vector, with nearest ordered first.
+     * @param target
+     * @param value
+     * @param descending
+     * @param distance
+     * @param comparator
+     * @param context
+     */
+    search({ target, value, descending, distance, comparator, }) {
+        let limit = 0; // zero is ignored, only used if set below
+        switch (comparator) {
+            case 'lt':
+            case 'le':
+                limit = value;
+            // fallthrough
+            case 'sort':
+                break;
+            default:
+                throw new hdbError_js_1.ClientError(`Can not use "${comparator}" comparator with HNSW`);
+        }
+        if (descending)
+            throw new hdbError_js_1.ClientError(`Can not use descending sort order with HNSW`);
+        let distanceFunction;
+        if (distance === 'cosine')
+            distanceFunction = vector_ts_1.cosineDistance;
+        else if (distance === 'euclidean')
+            distanceFunction = vector_ts_1.euclideanDistance;
+        else if (distance)
+            throw new hdbError_js_1.ClientError('Unknown distance function');
+        else
+            distanceFunction = this.distance;
+        if (!target)
+            throw new hdbError_js_1.ClientError('A target vector must be provided for an HNSW query');
+        if (!Array.isArray(target))
+            throw new hdbError_js_1.ClientError('The target vector must be an array');
+        let entryPoint = this.getEntryPoint();
+        if (!entryPoint)
+            return [];
+        let entryPointId = entryPoint.id;
+        let results = [];
+        // For each level from top to bottom
+        for (let l = entryPoint.level; l >= 0; l--) {
+            // Search for closest neighbors at current level
+            results = this.searchLayer(target, entryPointId, entryPoint, this.efConstructionSearch, l, distanceFunction);
+            if (results.length > 0) {
+                const neighbor = results[0]; // closest neighbor becomes new entry point
+                entryPoint = neighbor.node;
+                entryPointId = neighbor.id;
+            }
+        }
+        if (limit)
+            results = results.filter((candidate) => candidate.distance < limit);
+        return results.map((candidate) => ({
+            // we return the result as an entry so we can provide distance as metadata
+            key: candidate.node.primaryKey, // return value
+            distance: candidate.distance,
+        }));
+    }
+    checkSymmetry(id, node, options) {
+        if (!node)
+            return;
+        let l = 0;
+        let connections;
+        while ((connections = node[l])) {
+            // verify that the level is not empty, otherwise this means we have an orphaned node
+            if (connections.length === 0)
+                break;
+            for (const { id: neighbor } of connections) {
+                const neighborNode = this.indexStore.getSync(neighbor, options);
+                if (!neighborNode) {
+                    logger.info?.('could not find neighbor node', neighborNode);
+                    continue;
+                }
+                // verify that the connection is symmetrical
+                const symmetrical = neighborNode[l]?.find(({ id: nid }) => nid == id);
+                if (!symmetrical) {
+                    logger.info?.('asymmetry detected', neighborNode[l]);
+                }
+            }
+            l++;
+        }
+    }
+    addConnection(fromId, node, toId, level, distance, updateNode, options) {
+        if (!node[level]) {
+            node[level] = [];
+        }
+        let maxConnections = level === 0 ? this.M << 1 : this.M;
+        if (this.optimizeRouting)
+            maxConnections <<= 2; // bump up the max connections beyond traditional HNSW because we are naturally limiting
+        // have we exceeded the max connections (with 25% grace period)
+        if (node[level].length >= maxConnections + (maxConnections >> 2)) {
+            logger.debug?.('maxConnections reached, removing some connections', maxConnections);
+            // Get all connections with their similarities
+            // Sort by distance but prioritize nodes that have reverse connections
+            const connections = [...node[level]];
+            connections.sort((a, b) => {
+                return a.distance - b.distance;
+            });
+            // Keep the best connections
+            const keptConnections = connections.slice(0, maxConnections);
+            const removedConnections = connections.slice(maxConnections);
+            // Update this node's connections
+            node[level] = keptConnections;
+            // For removed connections, ensure there's still a path to them
+            for (const removed of removedConnections) {
+                let removedNode = updateNode(removed.id) ?? this.indexStore.getSync(removed.id, options);
+                if (removedNode) {
+                    // Remove the reverse connection if it exists
+                    if (removedNode[level]) {
+                        removedNode = updateNode(removed.id, removedNode);
+                        removedNode[level] = removedNode[level].filter(({ id }) => id !== fromId);
+                        if (level === 0 && removedNode[level].length === 0) {
+                            logger.info?.('should not remove last connection', fromId, toId);
+                        }
+                    }
+                }
+            }
+        }
+        if (node[level].find(({ id }) => id === toId)) {
+            logger.debug?.('already connected', fromId, toId);
+        }
+        else {
+            node[level] = [...node[level], { id: toId, distance }]; // add
+        }
+        //this.indexStore.put(fromId, node, options);
+        //this.checkSymmetry(fromId, node, options);
+    }
+    validateConnectivity(startLevel = 0) {
+        const entryPoint = this.getEntryPoint();
+        const visited = new Set();
+        // BFS from entry point to ensure all nodes are reachable
+        const queue = [entryPoint.id];
+        visited.add(entryPoint.id);
+        let connections = 0;
+        while (queue.length > 0) {
+            const currentId = queue.shift();
+            const current = this.indexStore.getSync(currentId);
+            for (let level = startLevel; level <= current.level; level++) {
+                for (const { id: neighborId } of current[level] || []) {
+                    connections++;
+                    if (!visited.has(neighborId)) {
+                        visited.add(neighborId);
+                        queue.push(neighborId);
+                    }
+                }
+            }
+        }
+        // Check if all nodes are reachable
+        // This would require maintaining a separate set/count of all nodes
+        if (visited.size !== this.totalNodes) {
+            console.log('visited', visited.size, 'total', this.totalNodes);
+        }
+        return {
+            isFullyConnected: visited.size === this.totalNodes,
+            averageConnections: connections / visited.size,
+        };
+    }
+    get totalNodes() {
+        return Array.from(this.indexStore.getKeys({ start: 0, end: Infinity })).length;
+    }
+    /**
+     * This is used by the query planner to determine what order to apply conditions. It is our best guess at an estimated count.
+     * This unit is typically the number of records that need to be accessed to satisfy the query. We know that we will visit
+     * a minimum of efConstructionSearch nodes and a maximum of the total nodes (in absolute worst case).
+     * The original paper described the complexity as polylogarithmic. From my testing, the
+     * best and simplest guess at the number of nodes that need to be accessed is the geometric mean of the total number of nodes
+     * and the efConstruction parameter (for search), which clearly constrains the estimate to the correct range and is
+     * similar to polylogarithmic for realistic values.
+     *
+     * @returns
+     */
+    estimateCountAsSort() {
+        return Math.sqrt(this.indexStore.getStats().entryCount * this.efConstructionSearch);
+    }
+    /**
+     * This is used to resolve the vector property, which should be resolved to the distance when used in a sort comparator
+     * We also want to cache distance calculations so they can be accessed efficently later
+     * @param vector
+     * @param context
+     * @param entry
+     */
+    propertyResolver(vector, context, entry) {
+        const sortDefinition = context?.sort;
+        if (sortDefinition) {
+            // set up a cache for these so they can be accessed by $distance and not be recalculated during a sort
+            let vectorDistances = sortDefinition.vectorDistances;
+            if (vectorDistances) {
+                const difference = vectorDistances.get(entry);
+                if (difference)
+                    return difference;
+            }
+            else
+                vectorDistances = context.vectorDistances = sortDefinition.vectorDistances = new Map();
+            let distanceFunction = this.distance;
+            if (sortDefinition.type)
+                distanceFunction = sortDefinition.distance === 'euclidean' ? vector_ts_1.euclideanDistance : vector_ts_1.cosineDistance;
+            const distance = distanceFunction(sortDefinition.target, vector);
+            vectorDistances.set(entry, distance);
+            return distance;
+        }
+        return vector;
+    }
+}
+exports.HierarchicalNavigableSmallWorld = HierarchicalNavigableSmallWorld;
+//# sourceMappingURL=HierarchicalNavigableSmallWorld.js.map

package/dist/resources/indexes/HierarchicalNavigableSmallWorld.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HierarchicalNavigableSmallWorld.js","sourceRoot":"","sources":["../../../resources/indexes/HierarchicalNavigableSmallWorld.ts"],"names":[],"mappings":";;;AAAA,2CAAgE;AAChE,uCAA2C;AAC3C,+DAAgE;AAChE,kEAA+D;AAG/D,MAAM,MAAM,GAAG,IAAA,yBAAa,EAAC,MAAM,CAAC,CAAC;AACrC;;GAEG;AACH,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;AAC7C,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AACrC,MAAM,SAAS,GAAG,EAAE,CAAC,CAAC,6EAA6E;AAWnG;;;;;;;;;GASG;AACH,MAAa,+BAA+B;IAC3C,MAAM,CAAC,cAAc,GAAG,IAAI,CAAC;IAC7B,UAAU,CAAM;IAChB,CAAC,GAAW,EAAE,CAAC,CAAC,sCAAsC;IACtD,cAAc,GAAW,GAAG,CAAC,CAAC,iCAAiC;IAC/D,oBAAoB,GAAW,EAAE,CAAC,CAAC,4CAA4C;IAC/E,EAAE,GAAW,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,4CAA4C;IAC/E,qHAAqH;IACrH,wCAAwC;IACxC,eAAe,GAAG,GAAG,CAAC;IACtB,iBAAiB,GAAG,CAAC,CAAC;IAEtB,aAAa,CAA4B;IACzC,QAAQ,CAAuC;IAC/C,YAAY,UAAe,EAAE,OAAY;QACxC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,UAAU,EAAE,CAAC;YAChB,iHAAiH;YACjH,+DAA+D;YAC/D,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,UAAU,GAAG,0BAAe,CAAC,MAAM,CAAC;QAC7D,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,OAAO,EAAE,QAAQ,KAAK,WAAW,CAAC,CAAC,CAAC,6BAAiB,CAAC,CAAC,CAAC,0BAAc,CAAC;QACvF,IAAI,OAAO,EAAE,CAAC;YACb,uDAAuD;YACvD,IAAI,OAAO,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;gBAC7B,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;gBACnB,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc;YAC/C,CAAC;YACD,IAAI,OAAO,CAAC,cAAc,KAAK,SAAS;gBACvC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,oBAAoB,GAAG,OAAO,CAAC,cAAc,CAAC;YAC1E,IAAI,OAAO,CAAC,oBAAoB,KAAK,SAAS;gBAAE,IAAI,CAAC,oBAAoB,GAAG,OAAO,CAAC,oBAAoB,CAAC;YACzG,IAAI,OAAO,CAAC,EAAE,KAAK,SAAS;gBAAE,IAAI,CAAC,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC;YACnD,IAAI,OAAO,CAAC,eAAe,KAAK,SAAS;gBAAE,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,eAAe,CAAC;QAC3F,CAAC;IACF,CAAC;IACD,KAAK,CAAC,UAAc,EAAE,MAAgB,EAAE,cAAyB,EAAE,UAAe,EAAE;QACnF,6FAA6F;QAC7F,kEAAkE;QAClE,MAAM,OAAO,GAAG,OAAO,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QACvF,IAAI,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACvD,mFAAmF;QACnF,kFAAkF;QAClF,gFAAgF;QAChF,mFAAmF;QACnF,IAAI,CAAC,MAAM,EAAE,CAAC;YACb,IAAI,CAAC,MAAM;gBAAE,OAAO,CAAC,wDAAwD;YAC7E,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;gBACzB,IAAI,aAAa,GAAG,CAAC,CAAC;gBACtB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC;oBACzC,OAAO,EAAE,IAAI;oBACb,KAAK,EAAE,CAAC;oBACR,KAAK,EAAE,QAAQ;oBACf,GAAG,EAAE,CAAC;oBACN,WAAW,EAAE,OAAO,CAAC,WAAW;iBAChC,CAAC,EAAE,CAAC;oBACJ,IAAI,OAAO,GAAG,KAAK,QAAQ;wBAAE,aAAa,GAAG,GAAG,CAAC;gBAClD,CAAC;gBAED,IAAI,CAAC,aAAa,GAAG,IAAI,aAAa,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;gBACrE,IAAI,CAAC,aAAa,GAAG,IAAI,aAAa,CACrC,IAAI,CAAC,UAAU,CAAC,mBAAmB,CAAC,SAAS,EAAE,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CACzE,CAAC;YACH,CAAC;YACD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACxD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QAC/C,CAAC;QACD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAgB,CAAC;QAC7C,IAAI,OAAa,CAAC;QAClB,2DAA2D;QAC3D,IAAI,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;QACjE,IAAI,cAAc,EAAE,CAAC;YACpB,0EAA0E;YAC1E,iEAAiE;YACjE,OAAO,GAAG,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;QAC3D,CAAC;;YAAM,OAAO,GAAG,EAAU,CAAC;QAC5B,IAAI,MAAM,EAAE,CAAC;YACZ,IAAI,UAAU,GAAG,YAAY,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;YAChF,IAAI,UAAU,IAAI,IAAI,EAAE,CAAC;gBACxB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC7D,MAAM,IAAI,GAAG;oBACZ,MAAM;oBACN,KAAK;oBACL,UAAU;iBACV,CAAC;gBACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;oBACjC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACd,CAAC;gBACD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;gBAC3C,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;oBAChC,MAAM,IAAI,KAAK,CAAC,kBAAkB,GAAG,MAAM,CAAC,CAAC;gBAC9C,CAAC;gBACD,MAAM,CAAC,KAAK,EAAE,CAAC,wBAAwB,EAAE,MAAM,CAAC,CAAC;gBACjD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBAClD,OAAO;YACR,CAAC;YAED,6CAA6C;YAC7C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;YACnG,IAAI,YAAY,GAAG,UAAU,CAAC,KAAK,CAAC;YACpC,IAAI,KAAK,IAAI,YAAY,EAAE,CAAC;gBAC3B,mEAAmE;gBACnE,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;oBAChC,MAAM,IAAI,KAAK,CAAC,kBAAkB,GAAG,MAAM,CAAC,CAAC;gBAC9C,CAAC;gBACD,MAAM,CAAC,KAAK,EAAE,CAAC,wBAAwB,EAAE,MAAM,CAAC,CAAC;gBACjD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;YACnD,CAAC;YAED,oCAAoC;YACpC,OAAO,YAAY,GAAG,KAAK,EAAE,CAAC;gBAC7B,gDAAgD;gBAChD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,IAAI,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;gBAExG,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC1B,YAAY,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,2CAA2C;oBAC3E,UAAU,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;gBAChC,CAAC;gBACD,YAAY,EAAE,CAAC;YAChB,CAAC;YACD,MAAM,WAAW,GAAG,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACrB,CAAC;YAED,8DAA8D;YAC9D,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzD,IAAI,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;gBAC3F,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAkB,CAAC;gBAE7D,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBACvC,MAAM,CAAC,IAAI,EAAE,CAAC,sCAAsC,EAAE,YAAY,CAAC,CAAC;gBACrE,CAAC;gBACD,MAAM,kBAAkB,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBAC1C,mCAAmC;gBACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3C,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;oBAC5C,IAAI,EAAE,KAAK,MAAM;wBAAE,SAAS,CAAC,wBAAwB;oBACrD,MAAM,uBAAuB,GAAuC,EAAE,CAAC;oBACvE,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;wBAC1B,qGAAqG;wBACrG,wGAAwG;wBACxG,0BAA0B;wBAC1B,IAAI,QAAQ,GAAG,KAAK,CAAC;wBACrB,MAAM,iBAAiB,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;wBAClC,MAAM,iBAAiB,GAAG,CAAC,GAAG,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;wBAC9E,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,iBAAiB,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;4BACvD,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,QAAQ,EAAE,gBAAgB,EAAE,GAAG,iBAAiB,CAAC,EAAE,CAAC,CAAC;4BAC7E,MAAM,yBAAyB,GAAG,CAAC,GAAG,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;4BACvF,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,kBAAkB,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;gCACvD,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;gCACxE,IAAI,OAAO,KAAK,UAAU,EAAE,CAAC;oCAC5B,IAAI,QAAQ,GAAG,iBAAiB,GAAG,aAAa,GAAG,gBAAgB,EAAE,CAAC;wCACrE,mFAAmF;wCACnF,kDAAkD;wCAClD,QAAQ,GAAG,IAAI,CAAC;oCACjB,CAAC;yCAAM,IAAI,gBAAgB,GAAG,yBAAyB,GAAG,QAAQ,GAAG,aAAa,EAAE,CAAC;wCACpF,qGAAqG;wCACrG,uBAAuB,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;wCAC5D,uBAAuB,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;oCAC7D,CAAC;oCACD,MAAM;gCACP,CAAC;4BACF,CAAC;4BACD,IAAI,QAAQ;gCAAE,MAAM;wBACrB,CAAC;wBACD,IAAI,QAAQ;4BAAE,SAAS;oBACxB,CAAC;yBAAM,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;wBAChD,8GAA8G;wBAC9G,SAAS;oBACV,CAAC;oBACD,oCAAoC;oBACpC,kBAAkB,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC;oBAE1C,KAAK,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,uBAAuB,EAAE,CAAC;wBACxD,IAAI,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;wBAC9B,IAAI,CAAC,IAAI;4BAAE,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;wBAC/E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;4BACzC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;gCAC5B,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oCAC9B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;gCAC3B,CAAC;gCACD,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gCACrB,MAAM;4BACP,CAAC;wBACF,CAAC;oBACF,CAAC;oBAED,gFAAgF;oBAChF,wFAAwF;oBACxF,2FAA2F;oBAC3F,IAAI,cAAc,GAAG,OAAO,CAAC,CAAC,CAAe,CAAC;oBAC9C,MAAM,aAAa,GAAG,cAAc,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;oBACxE,IAAI,aAAa,EAAE,CAAC;wBACnB,MAAM,WAAW,GAAG,cAAc,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC;wBAC3D,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC;4BAC5B,mCAAmC;4BACnC,cAAc,GAAG,CAAC,GAAG,cAAc,CAAe,CAAC;4BACnD,cAAc,CAAC,MAAM,GAAG,IAAI,CAAC;4BAC7B,OAAO,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC;wBAC7B,CAAC;wBACD,cAAc,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;oBACvC,CAAC;yBAAM,CAAC;wBACP,8DAA8D;wBAC9D,IAAI,CAAC,aAAa,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;oBACxF,CAAC;gBACF,CAAC;YACF,CAAC;YAED,wBAAwB;YACxB,IAAI,CAAC,UAAU,CAAC,GAAG,CAClB,MAAM,EACN;gBACC,MAAM;gBACN,KAAK;gBACL,UAAU;gBACV,GAAG,WAAW;aACd,EACD,OAAO,CACP,CAAC;QACH,CAAC;aAAM,CAAC;YACP,wEAAwE;YACxE,IAAI,YAAY,KAAK,MAAM,EAAE,CAAC;gBAC7B,qDAAqD;gBACrD,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC;gBACrC,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;oBACnC,IAAI,YAAY,KAAK,SAAS;wBAAE,MAAM;gBACvC,CAAC;gBACD,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;oBAChC,wDAAwD;oBACxD,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;oBACtB,KAAK,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC;wBACrD,KAAK,EAAE,CAAC;wBACR,GAAG,EAAE,QAAQ;qBACb,CAAC,EAAE,CAAC;wBACJ,IAAI,KAAK,CAAC,KAAK,GAAG,YAAY,EAAE,CAAC;4BAChC,YAAY,GAAG,GAAG,CAAC;4BACnB,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;gCAAE,MAAM,CAAC,4EAA4E;4BAClH,YAAY,GAAG,KAAK,CAAC,KAAK,CAAC;wBAC5B,CAAC;oBACF,CAAC;gBACF,CAAC;gBACD,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;oBAChC,yBAAyB;oBACzB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;gBAC9C,CAAC;qBAAM,CAAC;oBACP,0BAA0B;oBAC1B,IAAI,OAAO,YAAY,KAAK,QAAQ,EAAE,CAAC;wBACtC,MAAM,IAAI,KAAK,CAAC,kBAAkB,GAAG,YAAY,CAAC,CAAC;oBACpD,CAAC;oBACD,MAAM,CAAC,KAAK,EAAE,CAAC,wBAAwB,EAAE,YAAY,CAAC,CAAC;oBACvD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,WAAW,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC;gBACzD,CAAC;YACF,CAAC;YACD,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACzC,CAAC;QACD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAE,CAAC;QAClC,2DAA2D;QAC3D,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,cAAc,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBAClC,KAAK,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,cAAc,EAAE,CAAC;oBACjD,qDAAqD;oBACrD,MAAM,YAAY,GAAG,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC;oBAC1F,IAAI,CAAC,YAAY;wBAAE,SAAS;oBAC5B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;wBAChC,4DAA4D;wBAC5D,YAAY,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE;4BAC3D,OAAO,GAAG,KAAK,MAAM,CAAC;wBACvB,CAAC,CAAC,CAAC;wBACH,IAAI,YAAY,CAAC,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC,EAAE,CAAC;4BACpC,MAAM,CAAC,KAAK,EAAE,CAAC,sCAAsC,EAAE,UAAU,CAAC,CAAC;4BACnE,eAAe,CAAC,GAAG,CAAC,YAAY,CAAC,UAAU,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;wBACnE,CAAC;oBACF,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QACD,SAAS,UAAU,CAAC,EAAU,EAAE,IAAW;YAC1C,0FAA0F;YAC1F,IAAI,WAAW,GAAS,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7C,IAAI,CAAC,WAAW,IAAI,IAAI,EAAE,CAAC;gBAC1B,oCAAoC;gBACpC,WAAW,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;gBAC1B,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;YACnC,CAAC;YACD,OAAO,WAAW,CAAC;QACpB,CAAC;QACD,KAAK,MAAM,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,YAAY,EAAE,CAAC;YAC9C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;QAC/C,CAAC;QACD,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,eAAe,EAAE,CAAC;YAC7C,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;IAC/E,CAAC;IAEO,aAAa;QACpB,kBAAkB;QAClB,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAC1D,IAAI,YAAY,KAAK,SAAS;YAAE,OAAO;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QACnD,OAAO,EAAE,EAAE,EAAE,YAAY,EAAE,GAAG,IAAI,EAAE,CAAC;IACtC,CAAC;IAED;;;;;;;;;;;OAWG;IACK,WAAW,CAClB,WAAqB,EACrB,YAAoB,EACpB,UAAe,EACf,EAAU,EACV,KAAa,EACb,gBAAgB,GAAG,IAAI,CAAC,QAAQ;QAEhC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;QACxC,MAAM,UAAU,GAAG;YAClB;gBACC,EAAE,EAAE,YAAY;gBAChB,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,MAAM,CAAC;gBACvD,IAAI,EAAE,UAAU;aAChB;SACD,CAAC;QACF,MAAM,OAAO,GAAG,CAAC,GAAG,UAAU,CAAkB,CAAC;QAEjD,OAAO,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,gCAAgC;YAChC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;YACnD,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;YAEnC,4BAA4B;YAC5B,MAAM,gBAAgB,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;YAE9D,yEAAyE;YACzE,IAAI,OAAO,CAAC,QAAQ,GAAG,gBAAgB;gBAAE,MAAM;YAE/C,mCAAmC;YACnC,MAAM,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;YACjC,KAAK,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,WAAW,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC3D,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,UAAU,KAAK,SAAS;oBAAE,SAAS;gBAClE,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAExB,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;gBACrD,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBACxB,IAAI,CAAC,iBAAiB,EAAE,CAAC;gBACzB,MAAM,QAAQ,GAAG,gBAAgB,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;gBAEhE,IAAI,QAAQ,GAAG,gBAAgB,IAAI,OAAO,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;oBACxD,MAAM,SAAS,GAAG;wBACjB,EAAE,EAAE,UAAU;wBACd,QAAQ;wBACR,IAAI,EAAE,QAAQ;qBACd,CAAC;oBACF,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBAC3B,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACzB,CAAC;YACF,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;YAChD,IAAI,OAAO,CAAC,MAAM,GAAG,EAAE;gBAAE,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;QAClE,CAAC;QACD,OAAO,CAAC,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QAC/B,OAAO,OAAO,CAAC;IAChB,CAAC;IAED;;;;;;;;;;OAUG;IACH,MAAM,CAAC,EACN,MAAM,EACN,KAAK,EACL,UAAU,EACV,QAAQ,EACR,UAAU,GAOV;QACA,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,0CAA0C;QACzD,QAAQ,UAAU,EAAE,CAAC;YACpB,KAAK,IAAI,CAAC;YACV,KAAK,IAAI;gBACR,KAAK,GAAG,KAAK,CAAC;YACf,cAAc;YACd,KAAK,MAAM;gBACV,MAAM;YACP;gBACC,MAAM,IAAI,yBAAW,CAAC,gBAAgB,UAAU,wBAAwB,CAAC,CAAC;QAC5E,CAAC;QACD,IAAI,UAAU;YAAE,MAAM,IAAI,yBAAW,CAAC,6CAA6C,CAAC,CAAC;QACrF,IAAI,gBAAsD,CAAC;QAC3D,IAAI,QAAQ,KAAK,QAAQ;YAAE,gBAAgB,GAAG,0BAAc,CAAC;aACxD,IAAI,QAAQ,KAAK,WAAW;YAAE,gBAAgB,GAAG,6BAAiB,CAAC;aACnE,IAAI,QAAQ;YAAE,MAAM,IAAI,yBAAW,CAAC,2BAA2B,CAAC,CAAC;;YACjE,gBAAgB,GAAG,IAAI,CAAC,QAAQ,CAAC;QACtC,IAAI,CAAC,MAAM;YAAE,MAAM,IAAI,yBAAW,CAAC,oDAAoD,CAAC,CAAC;QACzF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,MAAM,IAAI,yBAAW,CAAC,oCAAoC,CAAC,CAAC;QAExF,IAAI,UAAU,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QACtC,IAAI,CAAC,UAAU;YAAE,OAAO,EAAE,CAAC;QAC3B,IAAI,YAAY,GAAG,UAAU,CAAC,EAAE,CAAC;QACjC,IAAI,OAAO,GAAgB,EAAE,CAAC;QAC9B,oCAAoC;QACpC,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,gDAAgD;YAChD,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,IAAI,CAAC,oBAAoB,EAAE,CAAC,EAAE,gBAAgB,CAAC,CAAC;YAE7G,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,2CAA2C;gBACxE,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC;gBAC3B,YAAY,GAAG,QAAQ,CAAC,EAAE,CAAC;YAC5B,CAAC;QACF,CAAC;QACD,IAAI,KAAK;YAAE,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC;QAC/E,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YAClC,0EAA0E;YAC1E,GAAG,EAAE,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,eAAe;YAC/C,QAAQ,EAAE,SAAS,CAAC,QAAQ;SAC5B,CAAC,CAAC,CAAC;IACL,CAAC;IACO,aAAa,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO;QACtC,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,WAAwB,CAAC;QAC7B,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,oFAAoF;YACpF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;YACpC,KAAK,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,WAAW,EAAE,CAAC;gBAC5C,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;gBAChE,IAAI,CAAC,YAAY,EAAE,CAAC;oBACnB,MAAM,CAAC,IAAI,EAAE,CAAC,8BAA8B,EAAE,YAAY,CAAC,CAAC;oBAC5D,SAAS;gBACV,CAAC;gBACD,4CAA4C;gBAC5C,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;gBACtE,IAAI,CAAC,WAAW,EAAE,CAAC;oBAClB,MAAM,CAAC,IAAI,EAAE,CAAC,oBAAoB,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtD,CAAC;YACF,CAAC;YACD,CAAC,EAAE,CAAC;QACL,CAAC;IACF,CAAC;IACO,aAAa,CACpB,MAAc,EACd,IAAS,EACT,IAAY,EACZ,KAAa,EACb,QAAgB,EAChB,UAA4C,EAC5C,OAAY;QAEZ,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QAClB,CAAC;QAED,IAAI,cAAc,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACxD,IAAI,IAAI,CAAC,eAAe;YAAE,cAAc,KAAK,CAAC,CAAC,CAAC,wFAAwF;QACxI,+DAA+D;QAC/D,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,IAAI,cAAc,GAAG,CAAC,cAAc,IAAI,CAAC,CAAC,EAAE,CAAC;YAClE,MAAM,CAAC,KAAK,EAAE,CAAC,mDAAmD,EAAE,cAAc,CAAC,CAAC;YACpF,8CAA8C;YAE9C,sEAAsE;YACtE,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACrC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACzB,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;YAChC,CAAC,CAAC,CAAC;YAEH,4BAA4B;YAC5B,MAAM,eAAe,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;YAC7D,MAAM,kBAAkB,GAAG,WAAW,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;YAE7D,iCAAiC;YACjC,IAAI,CAAC,KAAK,CAAC,GAAG,eAAe,CAAC;YAC9B,+DAA+D;YAC/D,KAAK,MAAM,OAAO,IAAI,kBAAkB,EAAE,CAAC;gBAC1C,IAAI,WAAW,GAAG,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBACzF,IAAI,WAAW,EAAE,CAAC;oBACjB,6CAA6C;oBAC7C,IAAI,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;wBACxB,WAAW,GAAG,UAAU,CAAC,OAAO,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;wBAClD,WAAW,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;wBAC1E,IAAI,KAAK,KAAK,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;4BACpD,MAAM,CAAC,IAAI,EAAE,CAAC,mCAAmC,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;wBAClE,CAAC;oBACF,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YAC/C,MAAM,CAAC,KAAK,EAAE,CAAC,mBAAmB,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACnD,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,MAAM;QAC/D,CAAC;QAED,6CAA6C;QAC7C,4CAA4C;IAC7C,CAAC;IACD,oBAAoB,CAAC,aAAqB,CAAC;QAC1C,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,yDAAyD;QACzD,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAC9B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YACjC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAEnD,KAAK,IAAI,KAAK,GAAG,UAAU,EAAE,KAAK,IAAI,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC;gBAC9D,KAAK,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;oBACvD,WAAW,EAAE,CAAC;oBACd,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC9B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;wBACxB,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBACxB,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QAED,mCAAmC;QACnC,mEAAmE;QACnE,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,CAAC,UAAU,EAAE,CAAC;YACtC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAChE,CAAC;QACD,OAAO;YACN,gBAAgB,EAAE,OAAO,CAAC,IAAI,KAAK,IAAI,CAAC,UAAU;YAClD,kBAAkB,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI;SAC9C,CAAC;IACH,CAAC;IACD,IAAI,UAAU;QACb,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;IAChF,CAAC;IAED;;;;;;;;;;OAUG;IACH,mBAAmB;QAClB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,UAAU,GAAG,IAAI,CAAC,oBAAoB,CAAC,CAAC;IACrF,CAAC;IAED;;;;;;OAMG;IACH,gBAAgB,CAAC,MAAgB,EAAE,OAAY,EAAE,KAAU;QAC1D,MAAM,cAAc,GAAG,OAAO,EAAE,IAAI,CAAC;QACrC,IAAI,cAAc,EAAE,CAAC;YACpB,sGAAsG;YACtG,IAAI,eAAe,GAAG,cAAc,CAAC,eAAe,CAAC;YACrD,IAAI,eAAe,EAAE,CAAC;gBACrB,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC9C,IAAI,UAAU;oBAAE,OAAO,UAAU,CAAC;YACnC,CAAC;;gBAAM,eAAe,GAAG,OAAO,CAAC,eAAe,GAAG,cAAc,CAAC,eAAe,GAAG,IAAI,GAAG,EAAE,CAAC;YAE9F,IAAI,gBAAgB,GAAG,IAAI,CAAC,QAAQ,CAAC;YACrC,IAAI,cAAc,CAAC,IAAI;gBACtB,gBAAgB,GAAG,cAAc,CAAC,QAAQ,KAAK,WAAW,CAAC,CAAC,CAAC,6BAAiB,CAAC,CAAC,CAAC,0BAAc,CAAC;YACjG,MAAM,QAAQ,GAAG,gBAAgB,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACjE,eAAe,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;YACrC,OAAO,QAAQ,CAAC;QACjB,CAAC;QACD,OAAO,MAAM,CAAC;IACf,CAAC;;AAplBF,0EAqlBC"}

package/dist/resources/indexes/customIndexes.d.ts

@@ -0,0 +1,4 @@
+import { HierarchicalNavigableSmallWorld } from './HierarchicalNavigableSmallWorld.ts';
+export declare const CUSTOM_INDEXES: {
+    HNSW: typeof HierarchicalNavigableSmallWorld;
+};

package/dist/resources/indexes/customIndexes.js

@@ -0,0 +1,10 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CUSTOM_INDEXES = void 0;
+const HierarchicalNavigableSmallWorld_ts_1 = require("./HierarchicalNavigableSmallWorld.js");
+exports.CUSTOM_INDEXES = {
+    HNSW: HierarchicalNavigableSmallWorld_ts_1.HierarchicalNavigableSmallWorld,
+    // TODO: next up, is a Z-Order LSH algorithm:
+    // ZOrder: ZOrderLSH,
+};
+//# sourceMappingURL=customIndexes.js.map

package/dist/resources/indexes/customIndexes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"customIndexes.js","sourceRoot":"","sources":["../../../resources/indexes/customIndexes.ts"],"names":[],"mappings":";;;AAAA,6FAAuF;AAE1E,QAAA,cAAc,GAAG;IAC7B,IAAI,EAAE,oEAA+B;IACrC,6CAA6C;IAC7C,qBAAqB;CACrB,CAAC"}

package/dist/resources/indexes/vector.d.ts

@@ -0,0 +1,2 @@
+export declare function euclideanDistance(a: number[], b: number[]): number;
+export declare function cosineDistance(a: number[], b: number[]): number;