A library for working with Abstract Syntax Trees.

hax0r vim script to give you a tree explorer

Supervisors, Supervision Groups, and Supervision Trees for Celluloid.

Ancestry allows the records of a ActiveRecord model to be organized in a tree structure, using the materialized path pattern. It exposes the standard relations (ancestors, parent, root, children, siblings, descendants) and allows them to be fetched in a single query. Additional features include named scopes, integrity checking, integrity restoration, arrangement of (sub)tree into hashes and different strategies for dealing with orphaned records.

A Parsing Expression Grammar (PEG) Parser generator DSL for Ruby

A RBTree is a sorted associative collection that is implemented with a Red-Black Tree. It maps keys to values like a Hash, but maintains its elements in ascending key order. The interface is the almost identical to that of Hash.

Heap, Priority Queue, Deque, Stack, Queue, Red-Black Trees, Splay Trees, sorting algorithms, and more

Ruby wrapper around the escodegen JavaScript generator that generates ECMA script from an abstract syntax tree.

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.

Easily and efficiently make your ActiveRecord model support hierarchies

Routing tree web toolkit

A stackable dynamic tree based Rack router.

Tool that allows to generate Objective-C and Swift dependency tree from object files For usages examples run: objc_dependency_tree_generator -h

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

A gem that adds simple support for organizing ActiveRecord models into parent–children relationships.

A parser based on ripper

A RBTree is a sorted associative collection that is implemented with a Red-Black Tree. It maps keys to values like a Hash, but maintains its elements in ascending key order. The interface is the almost identical to that of Hash. This is a fork of the original gem that fixes various bugs on Ruby 2.3+.

Drag&Drop GUI helper for awesome_nested_set gem. Sortable tree view helper

Drag&Drop GUI for awesom_nested_set. Render Tree Helper. Very fast! Ready for Rails 4

RubyTree is a Ruby implementation of the generic tree data structure. It provides simple APIs to store named nodes, and to access, modify, and traverse the tree. The data model is node-centric, where nodes in the tree are the primary structural elements. It supports all common tree-traversal methods (pre-order, post-order, and breadth first). RubyTree mixes in the Enumerable and Comparable modules and behaves like a standard Ruby collection (iteration, comparison, etc.). RubyTree also includes a binary tree implementation, which provides in-order node traversal besides the other methods. RubyTree can import from and export to JSON, and supports Ruby’s object marshaling.