Loop through nodelist / the result of querySelectorAll
Tiny DOM-element-creation utility
D3 sankey with circular links
Tools necessary for parsing stage of ApiDOM, specifically for syntactic analysis.
Attach comments to estree nodes
Simple dependency graph.
Helpers for programatically building ProseMirror test documents
Layout algorithms for visualizing hierarchical data.
Used to build a list of nodes, each node defines it's constraints in a configuration file. The list of nodes has to be built using the configuration file.
all the types of nodes in htmlparser2's dom
Base for creating objects that behave like a Property Graph.
Force-directed graph layout using velocity Verlet integration.
Simple force-directed layout algorithm for graphology.
lezer-based HTML grammar
A graph data structure with topological sort.
Gatsby source plugin for building websites from local data. Markdown, JSON, images, YAML, CSV, and dozens of other data types supported.
hast utility for `querySelector`, `querySelectorAll`, and `matches`
Incremental parser
Types for Oxc AST nodes
Javascript implementation of a doubly linked-list data structure
n8n node for bitrix rest api
Emmet standalone abbreviation parser
js consistent hash ring
Generate a signature for Apollo usage reporting
Parallel tests across CI server nodes based on each test file's time execution. It generates a test time execution report and uses it for future test runs.
Knapsack Pro wraps your current test runner(s) and works with your existing CI infrastructure to parallelize tests optimally. It dynamically splits your tests based on up-to-date test execution data. It's designed from the ground up for CI and supports all of them.
Runs a search against Chef server and executes a command for each returned node. See the project home page for more information.
Split XML files on an element, yielding (streaming, so constant memory usage) each node in turn. Uses sgrep internally.
gets list of nodes and pings from each to each storing results
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.
Builds trees of commands for the terminal, each node is either a group of commands or the command itself, every node is associated with a character to access it.
Manage a rolling deploy over opsworks stack instances, removing each node from ELB while deploying to it
Operations Workflow in Ruby. This implements a workflow/process flow using multiple task nodes that each have their own queues and execution thread.
Topologically sorts a Directed Acyclic Graph using Kahn's Algorithm. Lets you include some custom data on each node.
Build composite ERB templates
This Gem eagerly loads trees by indexing the nodes of the tree. The number of queries needed for loading a tree is N, Where N is the number of different models(ActiveRecords) in the tree. Each inner object in the tree have an index node instance that is connecting it to the root. When the root of the tree is loaded, only the objects that are in the tree are fetched(Pruning). The index nodes are created when the root element is saved and stored in the IndexNode model.
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.