System for accessing web services for tree-like things via the repl

A gem for generating tree-like format

Implementation of visitor design pattern. It contains a 'tree.rb' command line clone of the tree unix tool.

A Ruby port of the Android implementation of Java's java.util.TreeMap class. This is an AVL tree based implementation of Java's java.util.TreeMap structure. It implements Java's java.util.NavigableMap interface. The reference implementation is at https://android.googlesource.com/p...

This is a syntax highlighter plugin for Kramdown that leverages Tree-sitter's native syntax highlighter to highlight code blocks (and spans) when rendering HTML. Tree-sitter is a modern, general-purpose parsing library that outclasses many existing tools at the task of syntax highlighting. This ...

Ruby bindings to Tree-Sitter

Wood is a library for creating, manipulating and rewriting trees, in particular Abstract Syntax Trees (ASTs). It provides an easy to use DSL for searching and rewriting whole sub-trees in place, which can be used for things like translating a parse tree into a target language tree, doing type an...

Jumoku provides you with tree behaviors to mixin and tree classes to inherit from. Raw tree, common binary trees, custom trees...

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...

This is a data structure to represent and manage k-trees, primarily created for use in RubyNEAT, but may see other possible applications. The goal here is to be roebust in the creation of your k-tree, to allow you to prune during creation, since, especially for higher-dimensional trees, ...

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 yo...

ID3-based implementation of the M.L. Decision Tree algorithm

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 ...

Arboreal is yet another extension to ActiveRecord to support tree-shaped data structures. Internally, Arboreal maintains a computed "ancestry_string" column, which caches the path from the root of a tree to each node, allowing efficient retrieval of both ancestors and descendants. Arboreal surf...

Syntax Tree support for Haml

Syntax Tree support for RBS

Ive been consistently dissappointed with how limited normal decision trees, and how it's not really possible use both normal decision trees, and multi-factor trees in the same algorithm. Enter Dynamic Tree, which allows you to run a multi factor test and a single factor test for each individual f...

A syntax_tree plugin for force syntax_tree to using bracket array

TreeStruct allows to describe a structure with nested TreeStruct and with arrays of TreeStruct. The level of nesting is not limited.

Pure-Ruby implemention of Red-Black tree, a self-balancing binary search tree with O(log n) search, insert and delete operations.