Assigns a set of structure meta data for each node in your tree structure useful for tree data display and data traversal
This package provides support for the [RedisBloom](https://redis.io/docs/data-types/probabilistic/) module, which adds additional probabilistic data structures to Redis.
unist utility to serialize a node, position, or point as a human readable location
unist utility to get the position of a node
unist utility to check if a node passes a test
mdast utility to get the plain text content of a node
hast utility to get the plain-text value of a node according to the `innerText` algorithm
unist utility to find a node after another node
Node.js bindings to the Tree-sitter parsing library
ECMAScript (ESTree) AST walker
mdast utility to check if a node is phrasing content
TypeScript definitions for node-fetch
hast utility to check if a node is inter-element whitespace
Get the dependency tree of a module
A light-weight module that brings Fetch API to node.js
unist utility to get a position from an estree node
unist utility to check if a node is generated
Regular Expressions parser in JavaScript
OpenTelemetry Node SDK provides automatic telemetry (tracing, metrics, etc) for Node.js applications
hast utility to get the plain-text value of a node
TypeScript definitions for node
hast utility to check if a node is a (certain) element
TypeScript definitions for pg
Layout algorithms for visualizing hierarchical data.
RubyTree is a Ruby implementation of the generic tree data structure. It provides simple APIs to store named nodes, and to access, modify, and traverse the tree. The data model is node-centric, where nodes in the tree are the primary structural elements. It supports all common tree-traversal methods (pre-order, post-order, and breadth first). RubyTree mixes in the Enumerable and Comparable modules and behaves like a standard Ruby collection (iteration, comparison, etc.). RubyTree also includes a binary tree implementation, which provides in-order node traversal besides the other methods. RubyTree can import from and export to JSON, and supports Ruby’s object marshaling.
Provides a generic tree data structure with ability to store keyed node elements in the tree. The implementation mixes in the Enumerable module.
A generic tree data structure supporting depth-first and breadth-first traversal, node search, path finding, and hash serialization. Each node tracks its parent, children, depth, height, and size.
An utility gem that contains useful data structures, like tree node, etc.
Hitsuji is a library that implements a tree data structure, where each node is represented by a value, points to other values, or performs a function on some values. When the tree is updated, the inputs to the functions will change, hence changing the outputs, eventually propagating the update through the entire tree. Data structures can also be exported to disk, allowing for wide applications of this software, e.g. handling big data, managing content, etc.
Arboreal is yet another extension to ActiveRecord to support tree-shaped data structures. Internally, Arboreal maintains a computed "ancestry_string" column, which caches the path from the root of a tree to each node, allowing efficient retrieval of both ancestors and descendants. Arboreal surfaces relationships within the tree like "children", "ancestors", "descendants", and "siblings" as scopes, so that additional filtering/pagination can be performed.
This is a data structure to represent and manage k-trees, primarily created for use in RubyNEAT, but may see other possible applications. The goal here is to be roebust in the creation of your k-tree, to allow you to prune during creation, since, especially for higher-dimensional trees, the number of leaf node can become very large. So a parent will have children nodes created down to the desired resolution, and immediately after the creation of the children, will check to see if there's enough variance among the children to keep them. If not, they are pruned immediately.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.