a somehow virtual dom and a 'virtual data object model' ;-) with redo/undo
merges two trees guided with hints
`lothlorien` exports two trees, some helpers and a bunch of types.
Utilities for watching file trees.
Binary Search Trees
Utilities for watching file trees.
Delightful JavaScript Testing.
Broccoli plugin to merge multiple trees into one
Delightful JavaScript Testing.
A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.
hast utility to create trees
No description provided.
Different binary search tree implementations, including a self-balancing one (AVL)
unist utility to create a new trees with a nice syntax
Incrementally merge directories.
Highlighting system for Lezer parse trees
SaxonJS XSLT 3.0 processor: a conformant high-performance implementation of XSLT 3.0 for Node.js
File system snapshot - serialize and deserialize file system trees to binary or JSON
UI-Router Sticky States: Keep states and their components alive while a different state is activated
Parses well-formed HTML (meaning all tags closed) into an AST and back. quickly.
SaxonJS XSLT 3.0 processor: command line interface to SaxonJS
Incremental parser
Draw non-layered tidy trees in linear time
The primary functions of the world state package are to maintain the collection of Merkle Trees comprising the global state of the system and to offer an interface with which the trees can be queried.
An intelligent, persistent, and concurrent key-value store for Rust, designed to manage data with a lifecycle through frequency tracking and TTL.
An intelligent, persistent, and concurrent key-value store for Rust, designed to manage data with a lifecycle through frequency tracking and TTL.
Calculates the differences between two tree-like structures. Similar to Rubys built-in TSort module.
This is a collection of extensions to Rails internals that I've found to be absolutely indispensible since I implimented them. The real action is happening in the following two files at the moment: http://github.com/brendan/entrails/tree/master/lib/entrails/active_record/better_conditions.rb http://github.com/brendan/entrails/tree/master/lib/entrails/active_record/find_by_association.rb
Hirb provides a mini view framework for console applications and uses it to improve ripl(irb)'s default inspect output. Given an object or array of objects, hirb renders a view based on the object's class and/or ancestry. Hirb offers reusable views in the form of helper classes. The two main helpers, Hirb::Helpers::Table and Hirb::Helpers::Tree, provide several options for generating ascii tables and trees. Using Hirb::Helpers::AutoTable, hirb has useful default views for at least ten popular database gems i.e. Rails' ActiveRecord::Base. Other than views, hirb offers a smart pager and a console menu. The smart pager only pages when the output exceeds the current screen size. The menu is used in conjunction with tables to offer two dimensional menus.
Hirb provides a mini view framework for console applications and uses it to improve ripl(irb)'s default inspect output. Given an object or array of objects, hirb renders a view based on the object's class and/or ancestry. Hirb offers reusable views in the form of helper classes. The two main helpers, Hirb::Helpers::Table and Hirb::Helpers::Tree, provide several options for generating ascii tables and trees. Using Hirb::Helpers::AutoTable, hirb has useful default views for at least ten popular database gems i.e. Rails' ActiveRecord::Base. Other than views, hirb offers a smart pager and a console menu. The smart pager only pages when the output exceeds the current screen size. The menu is used in conjunction with tables to offer two dimensional menus.
A tool to download and compare the source trees of two different versions of a Ruby gem, displaying differences in diff format
Hirb provides a mini view framework for console applications and uses it to improve ripl(irb)'s default inspect output. Given an object or array of objects, hirb renders a view based on the object's class and/or ancestry. Hirb offers reusable views in the form of helper classes. The two main helpers, Hirb::Helpers::Table and Hirb::Helpers::Tree, provide several options for generating ascii tables and trees. Using Hirb::Helpers::AutoTable, hirb has useful default views for at least ten popular database gems i.e. Rails' ActiveRecord::Base. Other than views, hirb offers a smart pager and a console menu. The smart pager only pages when the output exceeds the current screen size. The menu is used in conjunction with tables to offer two dimensional menus.
treestore stores two different types of data: 1) values, which are stored according to their SHA-1 hashcode 2) trees, which are sets of values and/or other trees, stored via a SHA-1 hashcode In addition, there are references that allow you to 'bookmark' a SHA-1 hashcode for easier lookup. If you think of the core git, but on any key-value backend store (like the included Redis one), you've got the right idea.
The Lorax is a full diff and patch library for XML/HTML documents, based on Nokogiri. It can tell you whether two XML/HTML documents are identical, or if they're not, tell you what's different. In trivial cases, it can even apply the patch. It's based loosely on Gregory Cobena's master's thesis paper, which generates deltas in less than O(n * log n) time, accepting some tradeoffs in the size of the delta set. You can find his paper at http://gregory.cobena.free.fr/www/Publications/thesis.html. "I am the Lorax, I speak for the trees."
In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that keeps track of a set of elements partitioned into a number of disjoint (non-overlapping) subsets. It provides near-constant-time operations (bounded by the inverse Ackermann function) to add new sets, to merge existing sets, and to determine whether elements are in the same set. In addition to many other uses (see the Applications section), disjoint-sets play a key role in Kruskal's algorithm for finding the minimum spanning tree of a graph. A disjoint-set forest consists of a number of elements each of which stores an id, a parent pointer, and, in efficient algorithms, a value called the "rank". The parent pointers of elements are arranged to form one or more trees, each representing a set. If an element's parent pointer points to no other element, then the element is the root of a tree and is the representative member of its set. A set may consist of only a single element. However, if the element has a parent, the element is part of whatever set is identified by following the chain of parents upwards until a representative element (one without a parent) is reached at the root of the tree. Forests can be represented compactly in memory as arrays in which parents are indicated by their array index. Disjoint-set data structures model the partitioning of a set, for example to keep track of the connected components of an undirected graph. This model can then be used to determine whether two vertices belong to the same component, or whether adding an edge between them would result in a cycle. The Union–Find algorithm is used in high-performance implementations of unification. This data structure is used by the Boost Graph Library to implement its Incremental Connected Components functionality. It is also a key component in implementing Kruskal's algorithm to find the minimum spanning tree of a graph. Note that the implementation as disjoint-set forests doesn't allow the deletion of edges, even without path compression or the rank heuristic. Sharir and Agarwal report connections between the worst-case behavior of disjoint-sets and the length of Davenport–Schinzel sequences, a combinatorial structure from computational geometry.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.