JavaScript k-d Tree Implementation
100% JS k-d tree. Port of kd-tree-javascript.
100% JS k-d tree. Port of kd-tree-javascript.
100% JS k-d tree. Port of kd-tree-javascript.
A TypeScript implementation of k-d tree specifically for 2-dimensional uses. This was built to provide fast nearest-neighbor searches of sets of latitude/longitude coordinates, but works for any 2D (x, y) coordinates.
TypeScript definitions for ms
filter in array tree
A fully persistent balanced binary search tree
Turns off all rules that are unnecessary or might conflict with Prettier.
ECMAScript (ESTree) AST walker
Turn any collection of objects into its own efficient tree or linked list using Symbol
Storybook Themes addon: Switch between themes from the toolbar
TypeScript definitions for ndarray
Layout algorithms for visualizing hierarchical data.
Node.js bindings to the Tree-sitter parsing library
Tree or binary tree printer, print any tree to terminal or debug window
Convert a directory tree to a JS object.
Browser running for Vitest using playwright
kill trees of processes
This package provides support for the [RedisBloom](https://redis.io/docs/data-types/probabilistic/) module, which adds additional probabilistic data structures to Redis.
Get the dependency tree of a module
A basic but super fast JavaScript implementation of the k-dimensional tree data structure.
Fast Splay tree for Node and browser
hast utility to create trees
A simple Ruby implementation of a k-d tree.
My implementation of a 2d k-d tree
Ruby & JRuby gem with a fast k-d tree C implementation using FFI bindings with support for latitude/longitude and geo distance range search
A GeoTree is a variant of a k-d tree, and stores data points that have a latitude and longitude, a unique integer identifier, and an optional 'weight' (e.g., the size of a city). GeoTrees are disk-based data structures and can store a very large number of points efficiently. If desired, for smaller data sets, memory-only trees can be constructed instead. The gem includes MultiTree, a GeoTree variant that supports queries at multiple levels of detail. For example, when focusing on a small region it can return points that would be omitted when querying a much larger region.
No description provided.
No description provided.
No description provided.