usearch 2.8.10 → 2.8.13

package/.github/workflows/prerelease.yml

@@ -127,7 +127,7 @@ jobs:
           wget https://apt.llvm.org/llvm.sh
           chmod +x llvm.sh
           sudo ./llvm.sh 16
-          cmake -B build_artifacts -DCMAKE_BUILD_TYPE=RelWithDebInfo -DUSEARCH_BUILD_TEST_CPP=1 -DUSEARCH_BUILD_TEST_C=1 -DUSEARCH_BUILD_LIB_C=1 -DDUSEARCH_USE_OPENMP=0 -DUSEARCH_USE_SIMSIMD=1 -DUSEARCH_USE_JEMALLOC=1
+          cmake -B build_artifacts -DCMAKE_BUILD_TYPE=RelWithDebInfo -DUSEARCH_BUILD_TEST_CPP=1 -DUSEARCH_BUILD_TEST_C=1 -DUSEARCH_BUILD_LIB_C=1 -DUSEARCH_USE_OPENMP=0 -DUSEARCH_USE_SIMSIMD=1 -DUSEARCH_USE_JEMALLOC=1
           cmake --build build_artifacts --config RelWithDebInfo
       - name: Test C++
         run: ./build_artifacts/test_cpp

package/.github/workflows/release.yml

@@ -432,6 +432,7 @@ jobs:
           npm install
           npm ci
           npm test
+          npm run typegen
 
       - name: Publish
         uses: JS-DevTools/npm-publish@v2

package/CITATION.cff

@@ -5,7 +5,7 @@ authors:
   given-names: "Ash"
   orcid: "https://orcid.org/0000-0002-4882-1815"
 title: "USearch by Unum Cloud"
-version: 2.8.10
+version: 2.8.13
 doi: 10.5281/zenodo.7949416
 date-released: 2023-10-22
 url: "https://github.com/unum-cloud/usearch"

package/CONTRIBUTING.md

@@ -232,21 +232,30 @@ Afterwards, in a new terminal:
 
 ```sh
 gradle clean build
-java -cp . -Djava.library.path="$(pwd)/build/libs/usearch/shared" java/cloud/unum/usearch/Index.java
+gradle test
+```
+
+Alternatively, to run the `Index.main`:
+
+```sh
+java -cp "$(pwd)/build/classes/java/main" -Djava.library.path="$(pwd)/build/libs/usearch/shared" java/cloud/unum/usearch/Index.java
 ```
 
 Or step by-step:
 
 ```sh
-cs java/unum/cloud/usearch
-javac -h . Index.java
+cd java/cloud/unum/usearch
+javac -h . Index.java NativeUtils.java
+
+# Ensure JAVA_HOME system environment variable has been set
+# e.g. export JAVA_HOME=/usr/lib/jvm/java-11-openjdk-amd64
 
 # Ubuntu:
-g++ -c -fPIC -I${JAVA_HOME}/include -I${JAVA_HOME}/include/linux cloud_unum_usearch_Index.cpp -o cloud_unum_usearch_Index.o
-g++ -shared -fPIC -o libusearch_c.so cloud_unum_usearch_Index.o -lc
+g++ -c -fPIC -I${JAVA_HOME}/include -I${JAVA_HOME}/include/linux -I../../../../include cloud_unum_usearch_Index.cpp -o cloud_unum_usearch_Index.o
+g++ -shared -fPIC -o libusearch.so cloud_unum_usearch_Index.o -lc
 
 # Windows
-g++ -c -I%JAVA_HOME%\include -I%JAVA_HOME%\include\win32 cloud_unum_usearch_Index.cpp -o cloud_unum_usearch_Index.o
+g++ -c -I%JAVA_HOME%\include -I%JAVA_HOME%\include\win32 cloud_unum_usearch_Index.cpp -I..\..\..\..\include -o cloud_unum_usearch_Index.o
 g++ -shared -o USearchJNI.dll cloud_unum_usearch_Index.o -Wl,--add-stdcall-alias
 
 # MacOS
@@ -256,9 +265,11 @@ g++ -std=c++11 -c -fPIC \
     -I../../../../simsimd/include \
     -I${JAVA_HOME}/include -I${JAVA_HOME}/include/darwin cloud_unum_usearch_Index.cpp -o cloud_unum_usearch_Index.o
 g++ -dynamiclib -o libusearch.dylib cloud_unum_usearch_Index.o -lc
+
 # Run linking to that directory
-java -cp . -Djava.library.path="$(pwd)/java/cloud/unum/usearch/" Index.java
-java -cp . -Djava.library.path="$(pwd)/java" cloud.unum.usearch.Index
+cd ../../../..
+cp cloud/unum/usearch/libusearch.* .
+java -cp . -Djava.library.path="$(pwd)" cloud.unum.usearch.Index
 ```
 
 ## Wolfram

package/Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "usearch"
-version = "2.8.10"
+version = "2.8.13"
 authors = ["Ash Vardanian <1983160+ashvardanian@users.noreply.github.com>"]
 description = "Smaller & Faster Single-File Vector Search Engine from Unum"
 edition = "2021"

package/README.md

@@ -36,18 +36,18 @@ Linux • MacOS • Windows • iOS • WebAssembly
 </p>
 
 <div align="center">
-<a href="https://pypi.org/project/usearch/"> <img alt="PyPI" src="https://img.shields.io/pypi/dm/usearch?label=PyPi%20pulls"> </a>
-<a href="https://www.npmjs.com/package/usearch"> <img alt="NPM" src="https://img.shields.io/npm/dy/usearch?label=NPM%20pulls"> </a>
-<a href="https://crates.io/crates/usearch"> <img alt="Crate" src="https://img.shields.io/crates/d/usearch?label=Crate%20pulls"> </a>
-<a href="https://www.nuget.org/packages/Cloud.Unum.USearch"> <img alt="NuGet" src="https://img.shields.io/nuget/dt/Cloud.Unum.USearch?label=NuGet%20pulls"> </a>
+<a href="https://pepy.tech/project/usearch"> <img alt="PyPI" src="https://static.pepy.tech/personalized-badge/usearch?period=month&units=abbreviation&left_color=black&right_color=blue&left_text=Python%20monthly%20installs"> </a>
+<a href="https://www.npmjs.com/package/usearch"> <img alt="NPM" src="https://img.shields.io/npm/dy/usearch?label=NPM%20installs"> </a>
+<a href="https://crates.io/crates/usearch"> <img alt="Crate" src="https://img.shields.io/crates/d/usearch?label=Crate%20installs"> </a>
+<a href="https://www.nuget.org/packages/Cloud.Unum.USearch"> <img alt="NuGet" src="https://img.shields.io/nuget/dt/Cloud.Unum.USearch?label=NuGet%20installs"> </a>
 <a href="https://central.sonatype.com/artifact/cloud.unum/usearch/overview"> <img alt="Maven" src="https://img.shields.io/nexus/r/cloud.unum/usearch?server=https%3A%2F%2Fs01.oss.sonatype.org%2F&label=Maven%20version"> </a>
-<a href="https://hub.docker.com/r/unum/usearch"> <img alt="Docker" src="https://img.shields.io/docker/pulls/unum/usearch?label=Docker%20pulls"> </a>
+<a href="https://hub.docker.com/r/unum/usearch"> <img alt="Docker" src="https://img.shields.io/docker/pulls/unum/usearch?label=Docker%20installs"> </a>
 <img alt="GitHub code size in bytes" src="https://img.shields.io/github/languages/code-size/unum-cloud/usearch?label=Repo%20size">
 </div>
 
 ---
 
-- ✅ [20x faster than][faster-than-faiss] [FAISS][faiss] implementation of [HNSW algorithm][hnsw-algorithm].
+- ✅ [10x faster][faster-than-faiss] [HNSW][hnsw-algorithm] implementation than [FAISS][faiss].
 - ✅ Simple and extensible [single C++11 header][usearch-header] implementation.
 - ✅ Compatible with a dozen programming languages out of the box.
 - ✅ [Trusted](#integrations) by some of the most loved Datalakes and Databases, like [ClickHouse][clickhouse-docs].
@@ -86,28 +86,32 @@ FAISS is a widely recognized standard for high-performance vector search engines
 USearch and FAISS both employ the same HNSW algorithm, but they differ significantly in their design principles.
 USearch is compact and broadly compatible without sacrificing performance, primarily focusing on user-defined metrics and fewer dependencies.
 
-|                                              |                         FAISS |                        USearch |            Improvement |
-| :------------------------------------------- | ----------------------------: | -----------------------------: | ---------------------: |
-| Indexing time ⁰                              |                               |                                |                        |
-| 100 Million 96d `f32`, `f16`, `i8` vectors   |           2.6 h, 2.6 h, 2.6 h |            0.3 h, 0.2 h, 0.2 h | __9.6x, 10.4x, 10.7x__ |
-| 100 Million 1536d `f32`, `f16`, `i8` vectors |           5.0 h, 4.1 h, 3.8 h |            2.1 h, 1.1 h, 0.8 h |    __2.3x 3.6x, 4.4x__ |
-|                                              |                               |                                |                        |
-| Codebase length ¹                            | 84 K [SLOC][sloc] in `faiss/` | 3 K [SLOC][sloc] in `usearch/` |           maintainable |
-| Supported metrics ²                          |               9 fixed metrics |       any user-defined metrics |             extendible |
-| Supported languages ³                        |                   C++, Python |                   10 languages |               portable |
-| Supported ID types ⁴                         |                32-bit, 64-bit |         32-bit, 40-bit, 64-bit |              efficient |
-| Required dependencies ⁵                      |                  BLAS, OpenMP |                              - |           light-weight |
-| Bindings ⁶                                   |                          SWIG |                         Native |            low-latency |
+|                                              |                   FAISS |                  USearch |             Improvement |
+| :------------------------------------------- | ----------------------: | -----------------------: | ----------------------: |
+| Indexing time ⁰                              |                         |                          |                         |
+| 100 Million 96d `f32`, `f16`, `i8` vectors   |       2.6 · 2.6 · 2.6 h |        0.3 · 0.2 · 0.2 h | __9.6 · 10.4 · 10.7 x__ |
+| 100 Million 1536d `f32`, `f16`, `i8` vectors |       5.0 · 4.1 · 3.8 h |        2.1 · 1.1 · 0.8 h |   __2.3 · 3.6 · 4.4 x__ |
+|                                              |                         |                          |                         |
+| Codebase length ¹                            |       84 K [SLOC][sloc] |         3 K [SLOC][sloc] |            maintainable |
+| Supported metrics ²                          |         9 fixed metrics |               any metric |              extendible |
+| Supported languages ³                        |             C++, Python |             10 languages |                portable |
+| Supported ID types ⁴                         |          32-bit, 64-bit |   32-bit, 40-bit, 64-bit |               efficient |
+| Required dependencies ⁵                      |            BLAS, OpenMP |                        - |            light-weight |
+| Bindings ⁶                                   |                    SWIG |                   Native |             low-latency |
+| Python binding size ⁷                        | [~ 10 MB][faiss-weight] | [< 1 MB][usearch-weight] |              deployable |
 
 [sloc]: https://en.wikipedia.org/wiki/Source_lines_of_code
+[faiss-weight]: https://pypi.org/project/faiss-cpu/#files
+[usearch-weight]: https://pypi.org/project/usearch/#files
 
 > ⁰ [Tested][intel-benchmarks] on Intel Sapphire Rapids, with the simplest inner-product distance, equivalent recall, and memory consumption while also providing far superior search speed.
-> ¹ A shorter codebase makes the project easier to maintain and audit.
+> ¹ A shorter codebase of `usearch/` over `faiss/` makes the project easier to maintain and audit.
 > ² User-defined metrics allow you to customize your search for various applications, from GIS to creating custom metrics for composite embeddings from multiple AI models or hybrid full-text and semantic search.
 > ³ With USearch, you can reuse the same preconstructed index in various programming languages.
 > ⁴ The 40-bit integer allows you to store 4B+ vectors without allocating 8 bytes for every neighbor reference in the proximity graph.
 > ⁵ Lack of obligatory dependencies makes USearch much more portable.
 > ⁶ Native bindings introduce lower call latencies than more straightforward approaches.
+> ⁷ Lighter bindings make downloads and deployments faster.
 
 [intel-benchmarks]: https://www.unum.cloud/blog/2023-11-07-scaling-vector-search-with-intel
 
@@ -141,6 +145,7 @@ index = Index(
     connectivity=16, # Optional: Limit number of neighbors per graph node
     expansion_add=128, # Optional: Control the recall of indexing
     expansion_search=64, # Optional: Control the quality of the search
+    multi=False, # Optional: Allow multiple vectors per key, default = False
 )
 ```
 
@@ -161,7 +166,7 @@ index.save("index.usearch")
 loaded_copy = index.load("index.usearch")
 view = Index.restore("index.usearch", view=True)
 
-other_view = Index(ndim=..., metric=CompiledMetric(...))
+other_view = Index(ndim=..., metric=...)
 other_view.view("index.usearch")
 ```
 
@@ -208,7 +213,9 @@ multi_index.search(...)
 
 ## Clustering
 
-Once the index is constructed, it can cluster entries much faster than using a separate clustering algorithm implementation.
+Once the index is constructed, USearch can perform K-Nearest Neighbors Clustering much faster than standalone clustering libraries, like SciPy, 
+UMap, and tSNE.
+Same for dimensionality reduction with PCA. 
 Essentially, the `Index` itself can be seen as a clustering, allowing iterative deepening.
 
 ```py
@@ -396,6 +403,8 @@ index.add(keys, fingerprints)
 matches = index.search(fingerprints, 10)
 ```
 
+That method was used to build the ["USearch Molecules"](https://github.com/ashvardanian/usearch-molecules), one of the largest Chem-Informatics datasets, containing 7 billion small molecules and 28 billion fingerprints.
+
 [smiles]: https://en.wikipedia.org/wiki/Simplified_molecular-input_line-entry_system
 [rdkit-fingerprints]: https://www.rdkit.org/docs/RDKit_Book.html#additional-information-about-the-fingerprints
 
@@ -424,7 +433,7 @@ doi = {10.5281/zenodo.7949416},
 author = {Vardanian, Ash},
 title = {{USearch by Unum Cloud}},
 url = {https://github.com/unum-cloud/usearch},
-version = {2.8.10},
+version = {2.8.13},
 year = {2023},
 month = oct,
 }

package/VERSION

@@ -1 +1 @@
-2.8.10
+2.8.13

package/build.gradle

@@ -23,6 +23,11 @@ sourceSets {
             srcDir "java/"
             exclude "test/"
         }
+        // Ensure native libraries are included in the main source set
+        resources {
+            srcDirs "$buildDir/libs"
+            include "usearch/**"
+        }
     }
     test {
         java {
@@ -98,15 +103,25 @@ test {
 
     // Rearrange test classpath, add compiled JAR instead of main classes
     classpath = project.sourceSets.test.output + configurations.testRuntimeClasspath + files(jar.archiveFile)
+
+    // Enable detailed test logging
+    testLogging {
+        // Ensure that we get output from all tests, not just failing ones
+        showStandardStreams = true
+        exceptionFormat = 'full' // Can be 'short', 'full', or 'summary'
+
+        // More detailed test result logging
+        events "passed", "skipped", "failed"
+    }
 }
 
 jar {
     dependsOn("usearchSharedLibrary")
-    into("usearch") {
-        from("$buildDir/libs/usearch/shared/libusearch.dylib")
-        from("$buildDir/libs/usearch/shared/libusearch.dll")
-        from("$buildDir/libs/usearch/shared/libusearch.so")
+    from("$buildDir/libs/usearch/shared") {
+        include "libusearch.so", "libusearch.dylib", "libusearch.dll"
+        into "usearch"
     }
+    from sourceSets.main.output
 }
 
 signing {
@@ -180,4 +195,10 @@ publishing {
             }
         }
     }
-}
+}
+
+// Ensure that the native library is built before the Java code
+compileJava.dependsOn tasks.withType(SharedLibraryBinarySpec)
+tasks.named("processResources").configure {
+    dependsOn tasks.named("linkUsearchSharedLibrary")
+}

package/conanfile.py

@@ -7,7 +7,7 @@ required_conan_version = ">=1.53.0"
 class USearchConan(ConanFile):
 
     name = "usearch"
-    version = '2.8.10'
+    version = '2.8.13'
     license = "Apache-2.0"
     description = "Smaller & Faster Single-File Vector Search Engine from Unum"
     homepage = "https://github.com/unum-cloud/usearch"

package/include/usearch/index.hpp

@@ -11,7 +11,7 @@
 
 #define USEARCH_VERSION_MAJOR 2
 #define USEARCH_VERSION_MINOR 8
-#define USEARCH_VERSION_PATCH 10
+#define USEARCH_VERSION_PATCH 13
 
 // Inferring C++ version
 // https://stackoverflow.com/a/61552074

package/include/usearch/index_dense.hpp

@@ -108,13 +108,10 @@ struct index_dense_config_t : public index_config_t {
 
     index_dense_config_t(index_config_t base) noexcept : index_config_t(base) {}
 
-    index_dense_config_t(                                  //
-        std::size_t connectivity = default_connectivity(), //
-        std::size_t expansion_add = default_expansion_add(),
-        std::size_t expansion_search = default_expansion_search()) noexcept
-        : index_config_t(connectivity), //
-          expansion_add(expansion_add ? expansion_add : default_expansion_add()),
-          expansion_search(expansion_search ? expansion_search : default_expansion_search()) {}
+    index_dense_config_t(std::size_t c = default_connectivity(), std::size_t ea = default_expansion_add(),
+                         std::size_t es = default_expansion_search()) noexcept
+        : index_config_t(c), expansion_add(ea ? ea : default_expansion_add()),
+          expansion_search(es ? es : default_expansion_search()) {}
 };
 
 struct index_dense_clustering_config_t {
@@ -1312,11 +1309,10 @@ class index_dense_gt {
         shared_lock_t lock(slot_lookup_mutex_);
         offset = (std::min)(offset, slot_lookup_.size());
         slot_lookup_.for_each([&](key_and_slot_t const& key_and_slot) {
-            if (offset) {
+            if (offset)
+                // Skip the first `offset` entries
                 --offset;
-                return;
-            }
-            if (limit) {
+            else if (limit) {
                 *keys = key_and_slot.key;
                 ++keys;
                 --limit;

package/include/usearch/index_plugins.hpp

@@ -1343,11 +1343,13 @@ class metric_punned_t {
           scalar_kind_(scalar_kind) {
 
 #if USEARCH_USE_SIMSIMD
-        if (configure_with_simsimd())
-            return;
+        if (!configure_with_simsimd())
+            configure_with_auto_vectorized();
 #endif
-
         configure_with_auto_vectorized();
+
+        if (scalar_kind == scalar_kind_t::b1x8_k)
+            raw_arg3_ = raw_arg4_ = divide_round_up<CHAR_BIT>(dimensions_);
     }
 
     inline metric_punned_t(                                                 //
@@ -1499,18 +1501,9 @@ class metric_punned_t {
             break;
         }
         case metric_kind_t::jaccard_k: // Equivalent to Tanimoto
-        case metric_kind_t::tanimoto_k:
-            raw_ptr_ = (punned_ptr_t)&equidimensional_<metric_tanimoto_gt<b1x8_t>>,
-            raw_arg3_ = raw_arg4_ = divide_round_up<CHAR_BIT>(dimensions_), scalar_kind_ = scalar_kind_t::b1x8_k;
-            break;
-        case metric_kind_t::hamming_k:
-            raw_ptr_ = (punned_ptr_t)&equidimensional_<metric_hamming_gt<b1x8_t>>,
-            raw_arg3_ = raw_arg4_ = divide_round_up<CHAR_BIT>(dimensions_), scalar_kind_ = scalar_kind_t::b1x8_k;
-            break;
-        case metric_kind_t::sorensen_k:
-            raw_ptr_ = (punned_ptr_t)&equidimensional_<metric_sorensen_gt<b1x8_t>>,
-            raw_arg3_ = raw_arg4_ = divide_round_up<CHAR_BIT>(dimensions_), scalar_kind_ = scalar_kind_t::b1x8_k;
-            break;
+        case metric_kind_t::tanimoto_k: raw_ptr_ = (punned_ptr_t)&equidimensional_<metric_tanimoto_gt<b1x8_t>>; break;
+        case metric_kind_t::hamming_k: raw_ptr_ = (punned_ptr_t)&equidimensional_<metric_hamming_gt<b1x8_t>>; break;
+        case metric_kind_t::sorensen_k: raw_ptr_ = (punned_ptr_t)&equidimensional_<metric_sorensen_gt<b1x8_t>>; break;
         default: return;
         }
     }

package/javascript/types/usearch.d.ts

@@ -0,0 +1,237 @@
+export class Index {
+    /**
+     * Constructs a new index.
+     *
+     * @param {(number | {dimensions: number, metric: MetricKind = MetricKind.Cos, quantization: ScalarKind = ScalarKind.F32, connectivity: number = 0, expansion_add: number = 0, expansion_search: number = 0, multi: boolean = false})} dimensionsOrConfigs
+     * @param {MetricKind} [metric=MetricKind.Cos] - Optional, default is 'cos'.
+     * @param {ScalarKind} [quantization=ScalarKind.F32] - Optional, default is 'f32'.
+     * @param {number} [connectivity=0] - Optional, default is 0.
+     * @param {number} [expansion_add=0] - Optional, default is 0.
+     * @param {number} [expansion_search=0] - Optional, default is 0.
+     * @param {boolean} [multi=false] - Optional, default is false.
+     * @throws Will throw an error if any of the parameters are of incorrect type or invalid value.
+     */
+    constructor(dimensionsOrConfigs: number | {
+        dimensions: number;
+        metric: MetricKind;
+        quantization: ScalarKind;
+        connectivity: number;
+        expansion_add: number;
+        expansion_search: number;
+        multi: boolean;
+    }, metric?: MetricKind, quantization?: ScalarKind, connectivity?: number, expansion_add?: number, expansion_search?: number, multi?: boolean);
+    _compiledIndex: any;
+    /**
+     * Add vectors to the index.
+     *
+     * This method accepts vectors and their corresponding keys for indexing.
+     * Each key should correspond to a vector. If a single key is provided,
+     * it is broadcasted to match the number of provided vectors.
+     *
+     * Vectors should be provided as a flat typed array representing a matrix
+     * where each row is a vector to be indexed. The matrix should have a size
+     * of n * d, where n is the number of vectors, and d is the dimensionality
+     * of the vectors.
+     *
+     * Keys should be provided as a BigInt or an array-like object of BigInts
+     * representing the unique identifier for each vector.
+     *
+     * @param {bigint|bigint[]|BigUint64Array} keys - Input identifiers for every vector.
+     *        If a single key is provided, it is associated with all provided vectors.
+     * @param {Float32Array|Float64Array|Int8Array} vectors - Input matrix representing vectors,
+     *        matrix of size n * d, where n is the number of vectors, and d is their dimensionality.
+     * @throws Will throw an error if the length of keys doesn't match the number of vectors
+     *         or if it's not a single key.
+     */
+    add(keys: bigint | bigint[] | BigUint64Array, vectors: Float32Array | Float64Array | Int8Array): void;
+    /**
+     * Perform a k-nearest neighbor search on the index.
+     *
+     * This method accepts a matrix of query vectors and returns the closest vectors
+     * from the index for each query. The method returns an object containing the keys,
+     * distances, and counts of the matches found.
+     *
+     * Vectors should be provided as a flat typed array representing a matrix where
+     * each row is a vector. The matrix should be of size n * d, where n is the
+     * number of query vectors, and d is their dimensionality.
+     *
+     * The parameter `k` specifies the number of nearest neighbors to return for each
+     * query vector. If there are not enough results for a query, the result array is
+     * padded with -1s.
+     *
+     * @param {Float32Array|Float64Array|Int8Array|Array<Array<number>>} vectors - Input matrix representing query vectors, can be a TypedArray or an array of arrays.
+     * @param {number} k - The number of nearest neighbors to search for each query vector.
+     * @return {Matches|BatchMatches} - Search results for one or more queries, containing keys, distances, and counts of the matches found.
+     * @throws Will throw an error if `k` is not a positive integer or if the size of the vectors is not a multiple of dimensions.
+     * @throws Will throw an error if `vectors` is not a valid input type (TypedArray or an array of arrays) or if its flattened size is not a multiple of dimensions.
+     */
+    search(vectors: Float32Array | Float64Array | Int8Array | Array<Array<number>>, k: number): Matches | BatchMatches;
+    /**
+     * Verifies the presence of one or more keys in the index.
+     *
+     * This method accepts one or multiple keys as input and returns a boolean or
+     * an array of booleans indicating whether each key is present in the index.
+     *
+     * @param {bigint|bigint[]|BigUint64Array} keys - The identifier(s) of the vector(s) to be checked for presence in the index.
+     * @return {boolean|boolean[]} - Returns true if a single key is contained in the index, false otherwise. Returns an array of booleans corresponding to the presence of each key in the index when multiple keys are provided.
+     * @throws Will throw an error if keys are not integers.
+     */
+    contains(keys: bigint | bigint[] | BigUint64Array): boolean | boolean[];
+    /**
+     * Counts the number of times keys shows up in the index.
+     *
+     * @param {bigint|bigint[]|BigUint64Array} keys - The identifier(s) of the vector(s) to be enumerated.
+     * @return {number|number[]} - Returns the number of vectors found when a single key is provided. Returns an array of big integers corresponding to the number of vectors found for each key when multiple keys are provided.
+     * @throws Will throw an error if keys are not integers.
+     */
+    count(keys: bigint | bigint[] | BigUint64Array): number | number[];
+    /**
+     * Removes one or multiple vectors from the index.
+     *
+     * This method accepts one or multiple keys as input and removes the corresponding vectors from the index.
+     * It returns the number of vectors actually removed for each key provided.
+     *
+     * @param {bigint|bigint[]|BigUint64Array} keys - The identifier(s) of the vector(s) to be removed.
+     * @return {number|number[]} - Returns the number of vectors deleted when a single key is provided. Returns an array of big integers corresponding to the number of vectors deleted for each key when multiple keys are provided.
+     * @throws Will throw an error if keys are not integers.
+     */
+    remove(keys: bigint | bigint[] | BigUint64Array): number | number[];
+    /**
+     * Returns the dimensionality of vectors.
+     * @return {number} The dimensionality of vectors.
+     */
+    dimensions(): number;
+    /**
+     * Returns connectivity.
+     * @return {number} The connectivity of index.
+     */
+    connectivity(): number;
+    /**
+     * Returns the number of vectors currently indexed.
+     * @return {number} The number of vectors currently indexed.
+     */
+    size(): number;
+    /**
+     * Returns index capacity.
+     * @return {number} The capacity of index.
+     */
+    capacity(): number;
+    /**
+     * Write index to a file.
+     * @param {string} path File path to write.
+     * @throws Will throw an error if `path` is not a string.
+     */
+    save(path: string): void;
+    /**
+     * Load index from a file.
+     * @param {string} path File path to read.
+     * @throws Will throw an error if `path` is not a string.
+     */
+    load(path: string): void;
+    /**
+     * View index from a file, without loading into RAM.
+     * @param {string} path File path to read.
+     * @throws Will throw an error if `path` is not a string.
+     */
+    view(path: string): void;
+}
+/**
+ * *
+ */
+export type MetricKind = string;
+export namespace MetricKind {
+    let Unknown: string;
+    let Cos: string;
+    let IP: string;
+    let L2sq: string;
+    let Haversine: string;
+    let Divergence: string;
+    let Pearson: string;
+    let Jaccard: string;
+    let Hamming: string;
+    let Tanimoto: string;
+    let Sorensen: string;
+}
+/**
+ * *
+ */
+export type ScalarKind = string;
+export namespace ScalarKind {
+    let Unknown_1: string;
+    export { Unknown_1 as Unknown };
+    export let F32: string;
+    export let F64: string;
+    export let F16: string;
+    export let I8: string;
+    export let B1: string;
+}
+/**
+ * Represents a set of search results.
+ */
+export class Matches {
+    /**
+     * Constructs a Matches object.
+     *
+     * @param {BigUint64Array} keys - The keys of the nearest neighbors found.
+     * @param {Float32Array} distances - The distances of the nearest neighbors found.
+     */
+    constructor(keys: BigUint64Array, distances: Float32Array);
+    keys: BigUint64Array;
+    distances: Float32Array;
+}
+/**
+ * Represents a set of batched search results.
+ */
+export class BatchMatches {
+    /**
+     * Constructs a BatchMatches object.
+     *
+     * @param {BigUint64Array} keys - The keys of the nearest neighbors found in the batch.
+     * @param {Float32Array} distances - The distances of the nearest neighbors found in the batch.
+     * @param {BigUint64Array} counts - The number of neighbors found for each query in the batch.
+     * @param {bigint} k - The limit for search results per query in the batch.
+     */
+    constructor(keys: BigUint64Array, distances: Float32Array, counts: BigUint64Array, k: bigint);
+    keys: BigUint64Array;
+    distances: Float32Array;
+    counts: BigUint64Array;
+    k: bigint;
+    /**
+     * Retrieves a Matches object at the specified index in the batch.
+     *
+     * @param {number} i - The index at which to retrieve the Matches object.
+     * @returns {Matches} - A Matches object representing the search results at the specified index in the batch.
+     */
+    get(i: number): Matches;
+}
+/**
+ * Performs an exact search on the given dataset to find the best matching vectors for each query.
+ *
+ * @param {Float32Array|Float64Array|Int8Array|Array<Array<number>>} dataset - The dataset containing vectors to be searched. It can be a TypedArray or an array of arrays.
+ * @param {Float32Array|Float64Array|Int8Array|Array<Array<number>>} queries - The queries containing vectors to search for in the dataset. It can be a TypedArray or an array of arrays.
+ * @param {number} dimensions - The dimensionality of the vectors in both the dataset and the queries. It defines the number of elements in each vector.
+ * @param {number} count - The number of nearest neighbors to return for each query. If the dataset contains fewer vectors than the specified count, the result will contain only the available vectors.
+ * @param {MetricKind} metric - The distance metric to be used for the search.
+ * @return {Matches|BatchMatches} - Returns a `Matches` or `BatchMatches` object containing the results of the search.
+ * @throws Will throw an error if `dimensions` and `count` are not positive integers.
+ * @throws Will throw an error if `metric` is not a valid MetricKind.
+ * @throws Will throw an error if `dataset` and `queries` are not valid input types (TypedArray or an array of arrays).
+ * @throws Will throw an error if the sizes of the flattened `dataset` and `queries` are not multiples of `dimensions`.
+ * @throws Will throw an error if `count` is greater than the number of vectors in the `dataset`.
+ *
+ * @example
+ * const dataset = [[1.0, 2.0], [3.0, 4.0]]; // Two vectors: [1.0, 2.0] and [3.0, 4.0]
+ * const queries = [[1.5, 2.5]]; // One vector: [1.5, 2.5]
+ * const dimensions = 2; // The number of elements in each vector.
+ * const count = 1; // The number of nearest neighbors to return for each query.
+ * const metric = MetricKind.IP; // Using the Inner Product distance metric.
+ *
+ * const result = exactSearch(dataset, queries, dimensions, count, metric);
+ * // result might be:
+ * // {
+ * //    keys: BigUint64Array [ 1n ],
+ * //    distances: Float32Array [ some_value ],
+ * // }
+ */
+export function exactSearch(dataset: Float32Array | Float64Array | Int8Array | Array<Array<number>>, queries: Float32Array | Float64Array | Int8Array | Array<Array<number>>, dimensions: number, count: number, metric: MetricKind): Matches | BatchMatches;
+//# sourceMappingURL=usearch.d.ts.map

package/javascript/types/usearch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"usearch.d.ts","sourceRoot":"","sources":["../usearch.js"],"names":[],"mappings":"AAsIA;IAEI;;;;;;;;;;;OAWG;IACH;oBATkC,MAAM;gBAAU,UAAU;sBAAiC,UAAU;sBAAiC,MAAM;uBAAqB,MAAM;0BAAwB,MAAM;eAAa,OAAO;gBAChN,UAAU,iBACV,UAAU,iBACV,MAAM,kBACN,MAAM,qBACN,MAAM,UACN,OAAO,EAgCjB;IADG,oBAAwI;IAG5I;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,UAPW,MAAM,GAAC,MAAM,EAAE,GAAC,cAAc,WAE9B,YAAY,GAAC,YAAY,GAAC,SAAS,QAoB7C;IAED;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,gBANW,YAAY,GAAC,YAAY,GAAC,SAAS,GAAC,MAAM,MAAM,MAAM,CAAC,CAAC,KACxD,MAAM,GACL,OAAO,GAAC,YAAY,CAqB/B;IAED;;;;;;;;;OASG;IACH,eAJW,MAAM,GAAC,MAAM,EAAE,GAAC,cAAc,GAC7B,OAAO,GAAC,OAAO,EAAE,CAU5B;IAED;;;;;;OAMG;IACH,YAJW,MAAM,GAAC,MAAM,EAAE,GAAC,cAAc,GAC7B,MAAM,GAAC,MAAM,EAAE,CAU1B;IAED;;;;;;;;;OASG;IACH,aAJW,MAAM,GAAC,MAAM,EAAE,GAAC,cAAc,GAC7B,MAAM,GAAC,MAAM,EAAE,CAU1B;IAED;;;OAGG;IACH,cAFY,MAAM,CAEsC;IAExD;;;OAGG;IACH,gBAFY,MAAM,CAE0C;IAE5D;;;OAGG;IACH,QAFY,MAAM,CAE0B;IAE5C;;;OAGG;IACH,YAFY,MAAM,CAEkC;IAEpD;;;;OAIG;IACH,WAHW,MAAM,QAMhB;IAED;;;;OAIG;IACH,WAHW,MAAM,QAMhB;IAED;;;;OAIG;IACH,WAHW,MAAM,QAMhB;CACJ;;;;yBAzWS,MAAM;;;;;;;;;;;;;;;;;yBAmBN,MAAM;;;;;;;;;;AAYhB;;GAEG;AACH;IACI;;;;;OAKG;IACH,kBAHW,cAAc,aACd,YAAY,EAKtB;IAFG,qBAAgB;IAChB,wBAA0B;CAEjC;AAED;;GAEG;AACH;IACI;;;;;;;OAOG;IACH,kBALW,cAAc,aACd,YAAY,UACZ,cAAc,KACd,MAAM,EAOhB;IAJG,qBAAgB;IAChB,wBAA0B;IAC1B,uBAAoB;IACpB,UAAU;IAGd;;;;;OAKG;IACH,OAHW,MAAM,GACJ,OAAO,CAQnB;CACJ;AA4RD;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,qCA1BW,YAAY,GAAC,YAAY,GAAC,SAAS,GAAC,MAAM,MAAM,MAAM,CAAC,CAAC,WACxD,YAAY,GAAC,YAAY,GAAC,SAAS,GAAC,MAAM,MAAM,MAAM,CAAC,CAAC,cACxD,MAAM,SACN,MAAM,UACN,UAAU,GACT,OAAO,GAAC,YAAY,CA0D/B"}

package/javascript/usearch.js

@@ -137,7 +137,7 @@ class Index {
     /**
      * Constructs a new index.
      * 
-     * @param {number} dimensionsOrConfigs
+     * @param {(number | {dimensions: number, metric: MetricKind = MetricKind.Cos, quantization: ScalarKind = ScalarKind.F32, connectivity: number = 0, expansion_add: number = 0, expansion_search: number = 0, multi: boolean = false})} dimensionsOrConfigs
      * @param {MetricKind} [metric=MetricKind.Cos] - Optional, default is 'cos'.
      * @param {ScalarKind} [quantization=ScalarKind.F32] - Optional, default is 'f32'.
      * @param {number} [connectivity=0] - Optional, default is 0.

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "usearch",
-    "version": "2.8.10",
+    "version": "2.8.13",
     "description": "Smaller & Faster Single-File Vector Search Engine from Unum",
     "author": "Ash Vardanian (https://ashvardanian.com/)",
     "license": "Apache 2.0",
@@ -25,9 +25,24 @@
     },
     "scripts": {
         "test": "node --test ./javascript/usearch.test.js",
-        "install": "node-gyp rebuild"
+        "install": "node-gyp rebuild",
+        "typegen": "npx tsc"
     },
     "devDependencies": {
         "typescript": "^5.1.6"
-    }
+    },
+    "exports": {
+        ".": {
+            "types": "./javascript/types/usearch.d.ts",
+            "require": "./javascript/usearch.js"
+        },
+        "./package.json": "./package.json"
+    },
+    "typesVersions": {
+      "*": {
+          "*": [
+              "./javascript/types/usearch.d.ts"
+          ]
+      }
+  }
 }

package/setup.py

@@ -1,6 +1,6 @@
 import os
 import sys
-import platform
+import subprocess
 from setuptools import setup
 
 from pybind11.setup_helpers import Pybind11Extension
@@ -19,11 +19,24 @@ def get_bool_env_w_name(name: str, preference: bool) -> tuple:
 
 
 # Check the environment variables
-is_gcc = "GCC" in platform.python_compiler().upper()
 is_linux: bool = sys.platform == "linux"
 is_macos: bool = sys.platform == "darwin"
 is_windows: bool = sys.platform == "win32"
 
+
+is_gcc = False
+if is_linux:
+    cxx = os.environ.get("CXX")
+    if cxx:
+        try:
+            command = "where" if os.name == "nt" else "which"
+            full_path = subprocess.check_output([command, cxx], text=True).strip()
+            compiler_name = os.path.basename(full_path)
+            is_gcc = ("g++" in compiler_name) and ("clang++" not in compiler_name)
+        except subprocess.CalledProcessError:
+            pass
+
+
 prefer_simsimd: bool = is_linux or is_macos
 prefer_fp16lib: bool = True
 prefer_openmp: bool = is_linux and is_gcc

package/tsconfig.json

@@ -0,0 +1,21 @@
+{
+  // Change this to match your project
+  "include": ["javascript/usearch.js"],
+  "compilerOptions": {
+    // Tells TypeScript to read JS files, as
+    // normally they are ignored as source files
+    "allowJs": true,
+    // Generate d.ts files
+    "declaration": true,
+    // This compiler run should
+    // only output d.ts files
+    "emitDeclarationOnly": true,
+    // Types should go into this directory.
+    // Removing this would place the .d.ts files
+    // next to the .js files
+    "outDir": "javascript/types",
+    // go to js file when using IDE functions like
+    // "Go to Definition" in VSCode
+    "declarationMap": true
+  }
+}

package/wasmer.toml

@@ -1,6 +1,6 @@
 [package]
 name="unum/usearch"
-version="2.8.10"
+version="2.8.13"
 description="Smaller & Faster Single-File Vector Search Engine from Unum"
 license="Apache-2.0"
 readme="README.md"