usearch 2.10.3 → 2.11.0

package/simsimd/include/simsimd/types.h

@@ -0,0 +1,309 @@
+/**
+ *  @file       types.h
+ *  @brief      Shared definitions for the SimSIMD library.
+ *  @author     Ash Vardanian
+ *  @date       October 2, 2023
+ *
+ *  Defines:
+ *  - Sized aliases for numeric types, like: `simsimd_i32_t` and `simsimd_f64_t`.
+ *  - Macros for compiler/hardware checks, like: `SIMSIMD_TARGET_NEON`
+ */
+#ifndef SIMSIMD_TYPES_H
+#define SIMSIMD_TYPES_H
+
+/*  Annotation for the public API symbols:
+ *
+ *  - `SIMSIMD_PUBLIC` is used for functions that are part of the public API.
+ *  - `SIMSIMD_INTERNAL` is used for internal helper functions with unstable APIs.
+ *  - `SIMSIMD_DYNAMIC` is used for functions that are part of the public API, but are dispatched at runtime.
+ */
+#if defined(_WIN32) || defined(__CYGWIN__)
+#define SIMSIMD_DYNAMIC __declspec(dllexport)
+#define SIMSIMD_PUBLIC inline static
+#define SIMSIMD_INTERNAL inline static
+#elif defined(__GNUC__) || defined(__clang__)
+#define SIMSIMD_DYNAMIC __attribute__((visibility("default")))
+#define SIMSIMD_PUBLIC __attribute__((unused)) inline static
+#define SIMSIMD_INTERNAL __attribute__((always_inline)) inline static
+#else
+#define SIMSIMD_DYNAMIC inline static
+#define SIMSIMD_PUBLIC inline static
+#define SIMSIMD_INTERNAL inline static
+#endif
+
+// Compiling for Arm: SIMSIMD_TARGET_ARM
+#if !defined(SIMSIMD_TARGET_ARM)
+#if defined(__aarch64__) || defined(_M_ARM64)
+#define SIMSIMD_TARGET_ARM 1
+#else
+#define SIMSIMD_TARGET_ARM 0
+#endif // defined(__aarch64__) || defined(_M_ARM64)
+#endif // !defined(SIMSIMD_TARGET_ARM)
+
+// Compiling for x86: SIMSIMD_TARGET_X86
+#if !defined(SIMSIMD_TARGET_X86)
+#if defined(__x86_64__) || defined(_M_X64)
+#define SIMSIMD_TARGET_X86 1
+#else
+#define SIMSIMD_TARGET_X86 0
+#endif // defined(__x86_64__) || defined(_M_X64)
+#endif // !defined(SIMSIMD_TARGET_X86)
+
+// Compiling for Arm: SIMSIMD_TARGET_NEON
+#if !defined(SIMSIMD_TARGET_NEON) || (SIMSIMD_TARGET_NEON && !SIMSIMD_TARGET_ARM)
+#if defined(__ARM_NEON)
+#define SIMSIMD_TARGET_NEON SIMSIMD_TARGET_ARM
+#else
+#undef SIMSIMD_TARGET_NEON
+#define SIMSIMD_TARGET_NEON 0
+#endif // defined(__ARM_NEON)
+#endif // !defined(SIMSIMD_TARGET_NEON)
+
+// Compiling for Arm: SIMSIMD_TARGET_SVE
+#if !defined(SIMSIMD_TARGET_SVE) || (SIMSIMD_TARGET_SVE && !SIMSIMD_TARGET_ARM)
+#if defined(__ARM_FEATURE_SVE)
+#define SIMSIMD_TARGET_SVE SIMSIMD_TARGET_ARM
+#else
+#undef SIMSIMD_TARGET_SVE
+#define SIMSIMD_TARGET_SVE 0
+#endif // defined(__ARM_FEATURE_SVE)
+#endif // !defined(SIMSIMD_TARGET_SVE)
+
+// Compiling for x86: SIMSIMD_TARGET_HASWELL
+//
+// Starting with Ivy Bridge, Intel supports the `F16C` extensions for fast half-precision
+// to single-precision floating-point conversions. On AMD those instructions
+// are supported on all CPUs starting with Jaguar 2009.
+// Starting with Sandy Bridge, Intel adds basic AVX support in their CPUs and in 2013
+// extends it with AVX2 in the Haswell generation. Moreover, Haswell adds FMA support.
+#if !defined(SIMSIMD_TARGET_HASWELL) || (SIMSIMD_TARGET_HASWELL && !SIMSIMD_TARGET_X86)
+#if defined(__AVX2__) && defined(__FMA__) && defined(__F16C__)
+#define SIMSIMD_TARGET_HASWELL 1
+#else
+#undef SIMSIMD_TARGET_HASWELL
+#define SIMSIMD_TARGET_HASWELL 0
+#endif // defined(__AVX2__)
+#endif // !defined(SIMSIMD_TARGET_HASWELL)
+
+// Compiling for x86: SIMSIMD_TARGET_SKYLAKE, SIMSIMD_TARGET_ICE, SIMSIMD_TARGET_SAPPHIRE
+//
+// It's important to provide fine-grained controls over AVX512 families, as they are very fragmented:
+// - Intel Skylake servers: F, CD, VL, DQ, BW
+// - Intel Cascade Lake workstations: F, CD, VL, DQ, BW, VNNI
+//      > In other words, it extends Skylake with VNNI support
+// - Intel Sunny Cove (Ice Lake) servers:
+//        F, CD, VL, DQ, BW, VNNI, VPOPCNTDQ, IFMA, VBMI, VAES, GFNI, VBMI2, BITALG, VPCLMULQDQ
+// - AMD Zen4 (Genoa):
+//        F, CD, VL, DQ, BW, VNNI, VPOPCNTDQ, IFMA, VBMI, VAES, GFNI, VBMI2, BITALG, VPCLMULQDQ, BF16
+//      > In other words, it extends Sunny Cove with BF16 support
+// - Golden Cove (Sapphire Rapids): extends Zen4 and Sunny Cove with FP16 support
+//
+// Intel Palm Cove was an irrelevant intermediate release extending Skylake with IFMA and VBMI.
+// Intel Willow Cove was an irrelevant intermediate release extending Sunny Cove with VP2INTERSECT,
+// that aren't supported by any other CPU built to date... and those are only available in Tiger Lake laptops.
+// Intel Cooper Lake was the only intermediary platform, that supported BF16, but not FP16.
+// It's mostly used in 4-socket and 8-socket high-memory configurations.
+//
+// In practical terms, it makes sense to differentiate only 3 AVX512 generations:
+// 1. Skylake (pre 2019): supports single-precision dot-products.
+// 2. Ice Lake (2019-2021): advanced integer algorithms.
+// 3. Sapphire Rapids (2023+): advanced mixed-precision float processing.
+//
+// To list all available macros for x86, take a recent compiler, like GCC 12 and run:
+//      gcc-12 -march=sapphirerapids -dM -E - < /dev/null | egrep "SSE|AVX" | sort
+// On Arm machines you may want to check for other flags:
+//      gcc-12 -march=native -dM -E - < /dev/null | egrep "NEON|SVE|FP16|FMA" | sort
+#if !defined(SIMSIMD_TARGET_SKYLAKE) || (SIMSIMD_TARGET_SKYLAKE && !SIMSIMD_TARGET_X86)
+#if defined(__AVX512F__) && defined(__AVX512CD__) && defined(__AVX512VL__) && defined(__AVX512DQ__) &&                 \
+    defined(__AVX512BW__)
+#define SIMSIMD_TARGET_SKYLAKE 1
+#else
+#undef SIMSIMD_TARGET_SKYLAKE
+#define SIMSIMD_TARGET_SKYLAKE 0
+#endif
+#endif // !defined(SIMSIMD_TARGET_SKYLAKE)
+#if !defined(SIMSIMD_TARGET_ICE) || (SIMSIMD_TARGET_ICE && !SIMSIMD_TARGET_X86)
+#if defined(__AVX512VNNI__) && defined(__AVX512IFMA__) && defined(__AVX512BITALG__) && defined(__AVX512VBMI2__) &&     \
+    defined(__AVX512VPOPCNTDQ__)
+#define SIMSIMD_TARGET_ICE 1
+#else
+#undef SIMSIMD_TARGET_ICE
+#define SIMSIMD_TARGET_ICE 0
+#endif
+#endif // !defined(SIMSIMD_TARGET_ICE)
+#if !defined(SIMSIMD_TARGET_SAPPHIRE) || (SIMSIMD_TARGET_SAPPHIRE && !SIMSIMD_TARGET_X86)
+#if defined(__AVX512FP16__)
+#define SIMSIMD_TARGET_SAPPHIRE 1
+#else
+#undef SIMSIMD_TARGET_SAPPHIRE
+#define SIMSIMD_TARGET_SAPPHIRE 0
+#endif
+#endif // !defined(SIMSIMD_TARGET_SAPPHIRE)
+
+#ifdef _MSC_VER
+#include <intrin.h>
+#else
+
+#if SIMSIMD_TARGET_NEON
+#include <arm_neon.h>
+#endif
+
+#if SIMSIMD_TARGET_SVE
+#include <arm_sve.h>
+#endif
+
+#if SIMSIMD_TARGET_HASWELL || SIMSIMD_TARGET_SKYLAKE
+#include <immintrin.h>
+#endif
+
+#endif
+
+#ifndef SIMSIMD_RSQRT
+#include <math.h>
+#define SIMSIMD_RSQRT(x) (1 / sqrtf(x))
+#endif
+
+#ifndef SIMSIMD_LOG
+#include <math.h>
+#define SIMSIMD_LOG(x) (logf(x))
+#endif
+
+#ifndef SIMSIMD_F32_DIVISION_EPSILON
+#define SIMSIMD_F32_DIVISION_EPSILON (1e-7)
+#endif
+
+#ifndef SIMSIMD_F16_DIVISION_EPSILON
+#define SIMSIMD_F16_DIVISION_EPSILON (1e-3)
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+typedef int simsimd_i32_t;
+typedef float simsimd_f32_t;
+typedef double simsimd_f64_t;
+typedef signed char simsimd_i8_t;
+typedef unsigned char simsimd_b8_t;
+typedef unsigned long long simsimd_u64_t;
+
+typedef simsimd_u64_t simsimd_size_t;
+typedef simsimd_f64_t simsimd_distance_t;
+
+#if !defined(SIMSIMD_NATIVE_F16) || SIMSIMD_NATIVE_F16
+/**
+ *  @brief  Half-precision floating-point type.
+ *
+ *  - GCC or Clang on 64-bit ARM: `__fp16`, may require `-mfp16-format` option.
+ *  - GCC or Clang on 64-bit x86: `_Float16`.
+ *  - Default: `unsigned short`.
+ */
+#if (defined(__GNUC__) || defined(__clang__)) && (defined(__ARM_ARCH) || defined(__aarch64__)) &&                      \
+    (defined(__ARM_FP16_FORMAT_IEEE))
+#if !defined(SIMSIMD_NATIVE_F16)
+#define SIMSIMD_NATIVE_F16 1
+#endif
+typedef __fp16 simsimd_f16_t;
+#elif ((defined(__GNUC__) || defined(__clang__)) && (defined(__x86_64__) || defined(__i386__)) &&                      \
+       (defined(__SSE2__) || defined(__AVX512F__)))
+typedef _Float16 simsimd_f16_t;
+#if !defined(SIMSIMD_NATIVE_F16)
+#define SIMSIMD_NATIVE_F16 1
+#endif
+#else // Unknown compiler or architecture
+#define SIMSIMD_NATIVE_F16 0
+#endif // Unknown compiler or architecture
+#endif // !SIMSIMD_NATIVE_F16
+
+#if !SIMSIMD_NATIVE_F16
+typedef unsigned short simsimd_f16_t;
+#endif
+
+/**
+ *  @brief  Alias for the half-precision floating-point type on Arm.
+ *          Clang and GCC bring the `float16_t` symbol when you compile for Aarch64.
+ *          MSVC lacks it, and it's `vld1_f16`-like intrinsics are in reality macros,
+ *          that cast to 16-bit integers internally, instead of using floats.
+ */
+#if SIMSIMD_TARGET_ARM
+#if defined(_MSC_VER)
+typedef simsimd_f16_t simsimd_f16_for_arm_simd_t;
+#else
+typedef float16_t simsimd_f16_for_arm_simd_t;
+#endif
+#endif
+
+#define SIMSIMD_IDENTIFY(x) (x)
+
+/**
+ *  @brief  Returns the value of the half-precision floating-point number,
+ *          potentially decompressed into single-precision.
+ */
+#ifndef SIMSIMD_UNCOMPRESS_F16
+#if SIMSIMD_NATIVE_F16
+#define SIMSIMD_UNCOMPRESS_F16(x) SIMSIMD_IDENTIFY(x)
+#else
+#define SIMSIMD_UNCOMPRESS_F16(x) simsimd_uncompress_f16(x)
+#endif
+#endif
+
+typedef union {
+    unsigned i;
+    float f;
+} simsimd_f32i32_t;
+
+/**
+ *  @brief  Computes `1/sqrt(x)` using the trick from Quake 3, replacing
+ *          magic numbers with the ones suggested by Jan Kadlec.
+ */
+SIMSIMD_PUBLIC simsimd_f32_t simsimd_approximate_inverse_square_root(simsimd_f32_t number) {
+    simsimd_f32i32_t conv;
+    conv.f = number;
+    conv.i = 0x5F1FFFF9 - (conv.i >> 1);
+    conv.f *= 0.703952253f * (2.38924456f - number * conv.f * conv.f);
+    return conv.f;
+}
+
+/**
+ *  @brief  Computes `log(x)` using the Mercator series.
+ *          The series converges to the natural logarithm for args between -1 and 1.
+ *          Published in 1668 in "Logarithmotechnia".
+ */
+SIMSIMD_PUBLIC simsimd_f32_t simsimd_approximate_log(simsimd_f32_t number) {
+    simsimd_f32_t x = number - 1;
+    simsimd_f32_t x2 = x * x;
+    simsimd_f32_t x3 = x * x * x;
+    return x - x2 / 2 + x3 / 3;
+}
+
+/**
+ *  @brief  For compilers that don't natively support the `_Float16` type,
+ *          upcasts contents into a more conventional `float`.
+ *
+ *  @warning  This function won't handle boundary conditions well.
+ *
+ *  https://stackoverflow.com/a/60047308
+ *  https://gist.github.com/milhidaka/95863906fe828198f47991c813dbe233
+ *  https://github.com/OpenCyphal/libcanard/blob/636795f4bc395f56af8d2c61d3757b5e762bb9e5/canard.c#L811-L834
+ */
+SIMSIMD_PUBLIC simsimd_f32_t simsimd_uncompress_f16(unsigned short x) {
+    union float_or_unsigned_int_t {
+        float f;
+        unsigned int i;
+    };
+    unsigned int exponent = (x & 0x7C00) >> 10;
+    unsigned int mantissa = (x & 0x03FF) << 13;
+    union float_or_unsigned_int_t mantissa_union;
+    mantissa_union.f = (float)mantissa;
+    unsigned int v = (mantissa_union.i) >> 23;
+    union float_or_unsigned_int_t result_union;
+    result_union.i = (x & 0x8000) << 16 | (exponent != 0) * ((exponent + 112) << 23 | mantissa) |
+                     ((exponent == 0) & (mantissa != 0)) * ((v - 37) << 23 | ((mantissa << (150 - v)) & 0x007FE000));
+    return result_union.f;
+}
+
+#ifdef __cplusplus
+} // extern "C"
+#endif
+
+#endif

package/simsimd/javascript/bench.js

@@ -0,0 +1,127 @@
+const benchmark = require('benchmark');
+const math = require('mathjs');
+const usearch = require('usearch');
+const MetricKind = usearch.MetricKind;
+const simsimd = require("./dist/cjs/simsimd.js");
+
+// Assuming the vectors are of the same length
+function cosineDistance(a, b) {
+    let dotProduct = 0;
+    let magA = 0;
+    let magB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dotProduct += a[i] * b[i];
+        magA += a[i] * a[i];
+        magB += b[i] * b[i];
+    }
+    return 1 - (dotProduct / (Math.sqrt(magA) * Math.sqrt(magB)));
+}
+
+function cosineDistanceMathJS(a, b) {
+    let dotProduct = math.dot(a, b);
+    let magA = math.sqrt(math.dot(a, a));
+    let magB = math.sqrt(math.dot(b, b));
+    return 1 - (dotProduct / (magA * magB));
+}
+
+// Generate random data for testing
+const dimensions = 1536;  // Adjust dimensions as needed
+const array1 = Array.from({ length: dimensions }, () => Math.random() * 100);
+const array2 = Array.from({ length: dimensions }, () => Math.random() * 100);
+const mathm1 = math.matrix(Array.from({ length: dimensions }, () => Math.random() * 100));
+const mathm2 = math.matrix(Array.from({ length: dimensions }, () => Math.random() * 100));
+const floatArray1 = new Float32Array(array1);
+const floatArray2 = new Float32Array(array2);
+const intArray1 = new Int8Array(array1);
+const intArray2 = new Int8Array(array2);
+
+// Generate random batch data for testing
+const batchSize = 1000;
+const matrix1 = Array.from({ length: dimensions * batchSize }, () => Math.random() * 100);
+const matrix2 = Array.from({ length: dimensions * batchSize }, () => Math.random() * 100);
+const floatMatrix1 = new Float32Array(matrix1);
+const floatMatrix2 = new Float32Array(matrix2);
+const intMatrix1 = new Int8Array(matrix1);
+const intMatrix2 = new Int8Array(matrix2);
+
+// Create benchmark suite
+const singleSuite = new benchmark.Suite('Single Vector Processing');
+const batchSuite = new benchmark.Suite('Batch Vector Processing');
+
+// Single-vector processing benchmarks
+singleSuite
+
+    // Pure JavaScript
+    .add('Array of Numbers', () => {
+        cosineDistance(array1, array2);
+    })
+    .add('TypedArray of Float32', () => {
+        cosineDistance(floatArray1, floatArray2);
+    })
+    .add('TypedArray of Int8', () => {
+        cosineDistance(intArray1, intArray2);
+    })
+
+    // Math JS
+    .add('Array of Numbers with MathJS', () => {
+        cosineDistanceMathJS(array1, array2);
+    })
+    .add('MathMatrix with MathJS', () => {
+        cosineDistanceMathJS(mathm1, mathm2);
+    })
+
+    // SimSIMD
+    .add('TypedArray of Float32 with SimSIMD', () => {
+        simsimd.cosine(floatArray1, floatArray2);
+    })
+    .add('TypedArray of Int8 with SimSIMD', () => {
+        simsimd.cosine(intArray1, intArray2);
+    })
+
+    .on('cycle', (event) => {
+        if (event.target.error) {
+            console.error(String(event.target.error));
+        } else {
+            console.log(String(event.target));
+        }
+    })
+    .on('complete', () => {
+        console.log('Fastest Single-Vector Processing is ' + singleSuite.filter('fastest').map('name'));
+    })
+    .run({
+        noCache: true,
+        async: false,
+    });
+
+// Batch-vector processing benchmarks
+batchSuite
+    .add('2D Array of Numbers', () => {
+        for (let i = 0; i < batchSize; i++) {
+            for (let j = 0; j < batchSize; j++) {
+                const start = i * dimensions;
+                const end = start + dimensions;
+                cosineDistance(matrix1.slice(start, end), matrix2.slice(start, end));
+            }
+        }
+    })
+    .add('2D TypedArray of Float32 with exact USearch', () => {
+        usearch.exactSearch(floatMatrix1, floatMatrix2, dimensions, 1, MetricKind.Cos);
+    })
+    .add('2D TypedArray of Int8 with exact USearch', () => {
+        usearch.exactSearch(intMatrix1, intMatrix2, dimensions, 1, MetricKind.Cos);
+    })
+    .on('cycle', (event) => {
+        if (event.target.error) {
+            console.error(String(event.target.error));
+        } else {
+            console.log(String(event.target));
+        }
+    })
+    .on('complete', () => {
+        console.log('Fastest Batch-Vector Processing is ' + batchSuite.filter('fastest').map('name'));
+    })
+    .run({
+        noCache: true,
+        async: false,
+    });
+

package/simsimd/javascript/dist-package-cjs.json

@@ -0,0 +1,3 @@
+{
+    "type": "commonjs"
+}

package/simsimd/javascript/dist-package-esm.json

@@ -0,0 +1,3 @@
+{
+    "type": "module"
+}

package/simsimd/javascript/fallback.ts

@@ -0,0 +1,203 @@
+/**
+ * @brief Computes the inner distance of two vectors (same as dot product).
+ * @param {Float64Array|Float32Array} a - The first vector.
+ * @param {Float64Array|Float32Array} b - The second vector.
+ * @returns {number} The inner distance of vectors a and b.
+ */
+export function inner(a: Float64Array | Float32Array, b: Float64Array | Float32Array): number {
+  if (a.length !== b.length) {
+    throw new Error("Vectors must have the same length");
+  }
+
+  let result = 0;
+  for (let i = 0; i < a.length; i++) {
+    result += a[i] * b[i];
+  }
+  return result;
+}
+
+/**
+ * @brief Computes the inner distance of two vectors (same as inner product).
+ * @param {Float64Array|Float32Array} a - The first vector.
+ * @param {Float64Array|Float32Array} b - The second vector.
+ * @returns {number} The inner distance of vectors a and b.
+ */
+export function dot(a: Float64Array | Float32Array, b: Float64Array | Float32Array): number {
+  return inner(a, b);
+}
+
+/**
+ * @brief Computes the squared Euclidean distance between two vectors.
+ * @param {Float64Array|Float32Array|Int8Array} a - The first vector.
+ * @param {Float64Array|Float32Array|Int8Array} b - The second vector.
+ * @returns {number} The squared Euclidean distance between vectors a and b.
+ */
+export function sqeuclidean(
+  a: Float64Array | Float32Array | Int8Array,
+  b: Float64Array | Float32Array | Int8Array
+): number {
+  if (a.length !== b.length) {
+    throw new Error("Vectors must have the same length");
+  }
+
+  let result = 0;
+  for (let i = 0; i < a.length; i++) {
+    result += (a[i] - b[i]) * (a[i] - b[i]);
+  }
+  return result;
+}
+
+/**
+ * @brief Computes the cosine distance between two vectors.
+ * @param {Float64Array|Float32Array|Int8Array} a - The first vector.
+ * @param {Float64Array|Float32Array|Int8Array} b - The second vector.
+ * @returns {number} The cosine distance between vectors a and b.
+ */
+export function cosine(
+  a: Float64Array | Float32Array | Int8Array,
+  b: Float64Array | Float32Array | Int8Array
+): number {
+  if (a.length !== b.length) {
+    throw new Error("Vectors must have the same length");
+  }
+
+  let dotProduct = 0;
+  let magnitudeA = 0;
+  let magnitudeB = 0;
+
+  for (let i = 0; i < a.length; i++) {
+    dotProduct += a[i] * b[i];
+    magnitudeA += a[i] * a[i];
+    magnitudeB += b[i] * b[i];
+  }
+
+  magnitudeA = Math.sqrt(magnitudeA);
+  magnitudeB = Math.sqrt(magnitudeB);
+
+  if (magnitudeA === 0 || magnitudeB === 0) {
+    console.warn(
+      "Warning: One of the magnitudes is zero. Cosine similarity is undefined."
+    );
+    return 0;
+  }
+
+  return 1 - dotProduct / (magnitudeA * magnitudeB);
+}
+
+/**
+ * @brief Computes the bitwise Hamming distance between two vectors.
+ * @param {Uint8Array} a - The first vector.
+ * @param {Uint8Array} b - The second vector.
+ * @returns {number} The Hamming distance between vectors a and b.
+ */
+export const hamming = (a: Uint8Array, b: Uint8Array): number => {
+  if (a.length !== b.length) {
+    throw new Error("Arrays must be of the same length");
+  }
+
+  let distance = 0;
+
+  for (let i = 0; i < a.length; i++) {
+    let xor = a[i] ^ b[i]; // XOR operation to find differing bits
+
+    // Count the number of set bits (differing bits)
+    while (xor > 0) {
+      distance += xor & 1;
+      xor >>= 1;
+    }
+  }
+
+  return distance;
+};
+
+/**
+ * @brief Computes the bitwise Jaccard similarity coefficient between two vectors.
+ * @param {Uint8Array} a - The first vector.
+ * @param {Uint8Array} b - The second vector.
+ * @returns {number} The Jaccard similarity coefficient between vectors a and b.
+ */
+export const jaccard = (a: Uint8Array, b: Uint8Array): number => {
+  if (a.length !== b.length) {
+    throw new Error("Arrays must be of the same length");
+  }
+
+  let intersection = 0;
+  let union = 0;
+
+  for (let i = 0; i < a.length; i++) {
+    let ai = a[i];
+    let bi = b[i];
+
+    // Count the number of set bits in a AND b for intersection
+    let and = ai & bi;
+    while (and > 0) {
+      intersection += and & 1;
+      and >>= 1;
+    }
+
+    // Count the number of set bits in a OR b for union
+    let or = ai | bi;
+    while (or > 0) {
+      union += or & 1;
+      or >>= 1;
+    }
+  }
+
+  if (union === 0) return 0; // Avoid division by zero
+
+  return 1 - intersection / union;
+};
+
+/**
+ * @brief Computes the kullbackleibler similarity coefficient between two vectors.
+ * @param {Float64Array|Float32Array} a - The first vector.
+ * @param {Float64Array|Float32Array} b - The second vector.
+ * @returns {number} The Jaccard similarity coefficient between vectors a and b.
+ */
+export const kullbackleibler = (a: Float64Array | Float32Array, b: Float64Array | Float32Array): number => {
+  if (a.length !== b.length) {
+    throw new Error("Arrays must be of the same length");
+  }
+
+  let divergence = 0.0;
+
+  for (let i = 0; i < a.length; i++) {
+    if (a[i] > 0) {
+      if (b[i] === 0) {
+        throw new Error(
+          "Division by zero encountered in KL divergence calculation"
+        );
+      }
+      divergence += a[i] * Math.log(a[i] / b[i]);
+    }
+  }
+
+  return divergence;
+};
+
+/**
+ * @brief Computes the jensenshannon similarity coefficient between two vectors.
+ * @param {Float64Array|Float32Array} a - The first vector.
+ * @param {Float64Array|Float32Array} b - The second vector.
+ * @returns {number} The Jaccard similarity coefficient between vectors a and b.
+ */
+export const jensenshannon = (a: Float64Array | Float32Array, b: Float64Array | Float32Array): number => {
+  if (a.length !== b.length) {
+    throw new Error("Arrays must be of the same length");
+  }
+
+  const m = a.map((value, index) => (value + b[index]) / 2);
+
+  const divergence = 0.5 * kullbackleibler(a, m) + 0.5 * kullbackleibler(b, m);
+  return Math.sqrt(divergence);
+};
+
+export default {
+  sqeuclidean,
+  cosine,
+  inner,
+  hamming,
+  jaccard,
+  kullbackleibler,
+  jensenshannon,
+};