Socket for Annoy (Approximate Nearest Neighbors Oh Yeah)

Node bindings for Annoy, an efficient Approximate Nearest Neighbors implementation written in C++.

Locality-Sensitive Hashing implementation in node.js for fast and scalable approximate nearest neighbors search

k-neareset neighbors search for RBush

javascript implementation of Dunning's T-Digest for streaming quantile approximation

A geographic extension for [KDBush](https://github.com/mourner/kdbush), the fastest static spatial index for points in JavaScript.

Native Node.js bindings for Spotify's Annoy — fast approximate nearest neighbor search

The official TypeScript library for the Turbopuffer API

Find the nearest point to a sample point

Translates latitude / longitude geolocations to the nearest corresponding U.S. zip code

Converts numbers into a more human-friendly format, similar to `ls`'s `--human-readable` flag (`ls -lh`) or Stack Overflow's reputation numbers. For example, 123456 becomes '123k'.

OpenCode plugin that gives coding agents persistent memory using local Turso/libSQL vector search

Calculates an index based the average distances between points in the dataset, thereby providing inference as to whether the data is clustered, dispersed, or randomly distributed within the study area.

k-neareset neighbors search for RBush-3d

graph algorithm

A geographic extension for [flatbush](https://github.com/mourner/flatbush), a very fast static 2D spatial index. Performs nearest neighbors queries for geographic bounding boxes, taking Earth curvature and date line wrapping into account. Similar to [geok

Finds the nearest point based on a delaunay diagram

Finds the nearest point from a FeatureCollection of Features with Point geometries to a given point.

Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein

Find the nearest value of a discrete periodic function, given a point.