Results for array-to-tree-nodes

Construct a complete binary tree from given array

Attach comments to estree nodes

Simple dependency graph.

Walk any kind of tree structure depth- or breadth-first. Supports promises and advanced map-reduce operations with a very small API.

ECMAScript (ESTree) AST walker

Incremental parser

A utility for managing the `processinfo` folder that NYC uses.

Force-directed graph layout using velocity Verlet integration.

TypeScript definitions for dom4

mdast extension to parse and serialize GFM task list items

PEGjs grammars and tools for constructing unified-latex ASTs

TypeScript definitions for toposort

D3 sankey with circular links

mdast extension to parse and serialize GFM tables

A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.

mdast extension to parse and serialize MDX or MDX.js JSX

mdast extension to parse and serialize MDX.js ESM (import/exports)

mdast extension to parse and serialize MDX (or MDX.js) expressions

mdast extension to parse and serialize GFM footnotes

mdast extension to parse and serialize GFM strikethrough

Tools necessary for parsing stage of ApiDOM, specifically for syntactic analysis.

A package to build, construct, and deconstruct an arbitrary tree of nodes.

Keep a tree trimmed from longer-than-necessary branches

Constants and utilities about visitor keys to traverse AST.

Interface for very simple trees. You only have to implement parent (returns the single parent of the current node) and children (returns an Array of all the children of this node) and initialize. Drop this class in via include and presto!