When a function is not enough
Function tree utils for integration with redux
Color helpers to ease transformation between formats, gamut, etc
kill trees of processes
A function tree that understands generator functions and lets you use simple javascript objects as execution queries
Get all children of a pid
A fully persistent balanced binary search tree
Turn any collection of objects into its own efficient tree or linked list using Symbol
Binary Search Trees
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 stack-utils
Transform JSX in estrees to function calls (for react, preact, and most hyperscript interfaces)
The two-way function tree
Angular Schematics - Library
TypeScript definitions for is-function
hast utility to create trees
Backs out file tree changes
function tree
ECMAScript (ESTree) AST walker
Firebase admin execution and provider
Use hwb() color functions in CSS
Use the color() function in CSS
TypeScript definitions for ms
TypeScript definitions for mime-types
Tree structure visualization function library
Graph functionality for ActiveRecord
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.
Add hierarchy tree functionality to MongoRecord (MongoDB) models.
Create and track parallel inheritance hierarchies. Hook parallel hierarchies (by including a module) to automatically update/register ancestry at include and extend, or update/register only manually. Manual registration permits definitions of ancestry across, for example, instances of the same type or instances of entirely different types. Implementation is provided by simple child/parent trees with an block to choose which parent. This permits a simple multiple inheritance model very similar to how Ruby handles modules. Conflicts for multiple inheritance are resolved by the parent most recently named for the block match. Used heavily by CascadingConfiguration gem (cascading-configuration) as well as by forthcoming Persistence and Magnets gems (persistence and magnets).
Create and track parallel inheritance hierarchies. Hook parallel hierarchies (by including a module) to automatically update/register ancestry at include and extend, or update/register only manually. Manual registration permits definitions of ancestry across, for example, instances of the same type or instances of entirely different types. Implementation is provided by simple child/parent trees with an block to choose which parent. This permits a simple multiple inheritance model very similar to how Ruby handles modules. Conflicts for multiple inheritance are resolved by the parent most recently named for the block match. Used heavily by CascadingConfiguration gem (cascading-configuration) as well as by forthcoming Persistence and Magnets gems (persistence and magnets).
A gem to add tree structure functionality to Rails models.
This class provides an enumeration function to have the object which I added tree information to in an argument. The instance receives an enumerable object and provides #each and #each_method. The #each method calls a block in an argument in own. The #each_method method calls the method of an object appointed own in an argument. I have the information of the object equal to the ancestors in own and front and back and hierarchy structure, and a block and the argument handed to a method maintain the state flag in the enumeration again. It is necessary to appoint the information about the descendant in the hierarchy structure in a block - a method explicitly. When the #into method receives an enumerable object, and a block is not exhibited, a block - a method is used recursively. This class provides a function to enumerate it, but it is not the object which it can enumerate.
CompTree is a parallel computation tree structure based upon concepts from pure functional programming.
Simple function to find the root of a project tree
Simple function to find the root of a project tree
Set of functions to create, modify and search in a binary tree from a list.
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.