Conversion between tree data and array data
TypeScript definitions for d3-array
ECMAScript (ESTree) AST walker
filter in array tree
Curated collection of data structures for the JavaScript/TypeScript.
Walk any kind of tree structure depth- or breadth-first. Supports promises and advanced map-reduce operations with a very small API.
TypeScript definitions for range-parser
Array manipulation, ordering, searching, summarizing, etc.
TypeScript definitions for earcut
TypeScript definitions for d3-polygon
Rope-based persistent sequence type
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
TypeScript definitions for d3-contour
Attach comments to estree nodes
Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.
Tree utilities which provides a full-featured extend and object-cloning facility, and various tools to deal with nested object structures.
TypeScript definitions for cross-spawn
Resolve a nested selector in a PostCSS AST
[](https://discord.gg/poimandres)
A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.
An ES7/ES2016 spec-compliant `Array.prototype.includes` shim/polyfill/replacement that works as far down as ES3.
Run an array of functions in parallel
Webpack hot reloading you can attach to your own server
Create unique translations of a document based on its language, joined by a shared reference document.
Convert deeply nested Virtus or other objects that respond to attributes to hashes and arrays
Generates an array of permutations without duplicates using a tree
Yet another tree plugin for MongoMapper, built with an array of reference numbers
Convert a binary tree to array and vice versa.
Line-tree parses indented lines of text and returns an array representing a tree structure.
Study Ruby objects, hashes, and arrays by exposing their internal structure with trees, colors, and indentation
ParseTree is a C extension (using RubyInline) that extracts the parse tree for an entire class or a specific method and returns it as a s-expression (aka sexp) using ruby's arrays, strings, symbols, and integers. As an example: def conditional1(arg1) if arg1 == 0 then return 1 end return 0 end becomes: [:defn, :conditional1, [:scope, [:block, [:args, :arg1], [:if, [:call, [:lvar, :arg1], :==, [:array, [:lit, 0]]], [:return, [:lit, 1]], nil], [:return, [:lit, 0]]]]]
Filter arbitrary data trees with a concise query language.
This gem employs Breadth-First-Search or Depth-First-Search to search whether an element is in a tree.
A collection of containers: heap, sorted array, AVL tree
Tria is a multi-dimensional array based tree format, with a parent, child, and descendants for each branch of the tree.
Tree and flattened array data structures for traversing an ActiveRecord model graph