Ordered key-value map with next/previous neighbor lookups, built on btree-core.

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.

just emit 'log' events on the process object

Semrush NeighborLocation Component

Calculate the influence or weight of points over an area based on their distances.

Dashboard for OHF Matter Server

a glob matcher in javascript

btree-core is a high-performance B+ tree implementation designed for modern JavaScript applications. It provides efficient ordered data structures, predictable performance characteristics, and a clean, developer-friendly API.

A kdtree data structure

Package of layput utilities for cytoscape.js

Compute contour polygons using marching squares.

Infer strong typings for commander options and action handlers

Conditionals for 📣 stentor

Lean output compaction for terminal-heavy agent workflows.

A cross-browser, numerically stable algorithm to add floats accurately

A small library implementing the principle of Kalman filters, without any dependencies, to filter out noise in 1D systems.

An extension lib for jest

Run Open Image Denoiser on the Web

very fast JS GIF encoder

Neighbor Joining library for NPM.