Results for kdtree-fast

KD-tree implementation targeting WebAssembly, written in Rust and taylored for Node.js environments.

A basic but super fast JavaScript implementation of the k-dimensional tree data structure.

Efficient implementation of Levenshtein algorithm with locale-specific collator support.

Fast deep equal

Fastest deep equal comparison for React. Great for React.memo & shouldComponentUpdate. Also really fast general-purpose deep comparison.

A kdtree data structure

Property based testing framework for JavaScript (like QuickCheck)

React is a JavaScript library for building user interfaces.

Validate XML, Parse XML, Build XML without C/C++ based libraries

CSV parser and writer

fast-csv formatting module

fast-csv parsing package

Dependency-free RFC 3986 URI toolbox

deterministic `JSON.stringify()` - a faster version of substack's json-stable-strigify without jsonify

Build XML from JSON without C/C++ based libraries

A fast and minimal alternative to globby and fast-glob

fork of fast-memoize and support esm

Force V8 to use fast properties for an object

Parse HTTP Content-Type header according to RFC 7231

Build and manage the fast-json-stringify instances for the fastify framework

Stringify your JSON at max speed

PNG image decoder and encoder written entirely in JavaScript

Fast Javascript text diff

TypeScript definitions for static-kdtree