Tree Structure

Use this acts_as extension if you want to model a tree structure by providing a parent association and a children association.

Parses the taxonomy of GOV.UK into a browseable tree structure.

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, the number of leaf node can become very large. So a parent will have children nodes created down to the desired resolution, and immediately after the creation of the children, will check to see if there's enough variance among the children to keep them. If not, they are pruned immediately.

A crit bit tree, also known as a Binary Patricia Trie is a trie (https://en.wikipedia.org/wiki/Trie), also called digital tree and sometimes radix tree or prefix tree (as they can be searched by prefixes), is an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings. Unlike a binary search tree, no node in the tree stores the key associated with that node; instead, its position in the tree defines the key with which it is associated. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string. Values are normally not associated with every node, only with leaves and some inner nodes that correspond to keys of interest. For the space-optimized presentation of prefix tree, see compact prefix tree. This code is a wrapper around https://github.com/jfager/functional-critbit. For more information go to: http://cr.yp.to/critbit.html

Stores data in a B+tree structure

A lightweight solution for creating and managing tree data structures

Organise Mongoid model into a tree structure

Module that defines a tree data structure based on a path.

pandoc - structured text document model / abstract syntax tree for all the world's formats

This gem offers you a convenient settings structure for parameterizing your application. Those settings are read from a YAML file. Inheritance of settings (like in development modes) and multiple settings groups are available. Great for a rails app but can be used for any ruby app.

Ruby implementations of a Stack, Queue, Linked List, Binary Tree, LRU Cache, Heap, Priority Queue, Graph and Weighted Graph. More to come!

Study Ruby objects, hashes, and arrays by exposing their internal structure with trees, colors, and indentation

Find leaves in tree-like json structures

fast_tree is an implementation of tree structure using nested sets model

Tree structure for MongoMapper with rational number sorting

Forester is a library to work with tree data structures.

Forestify brings a tree data-structure to your Active Record models

A simple tool for printing the structure of a JSON object

This library allows you to input a tree structure (node with children), a context, and comparators then outputs you the matching tree structure.

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.

Pure Ruby YANG parser and tree structure data store implementation

A simple gem implementing different kind of tree structures

Interval Tree Data Structure

Calculates algorithms and data structures for sorting and searching. Selects best one to use for particular data set. Currently supports: Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, Heap Sort, Stack, Queue, Linked List, Binary Search Tree

API documentaiton at: http://www.rubydoc.info/gems/taxonomite Manages objects classified within a taxonomy and enforces a hierarchical tree structure. Works only with MongoDB currently - may try to abstract the database layer with later versions.

Rack::Config::Flexible is an alternative to Rack::Config, offering much greater flexibility. Configuration options are stored as key-value pairs in _sections_, partitioned by _environments_. For example: + environment + section key -> value pairs A simple DSL is provided and can be used either within a passed configuration block (to ::new), or to the #configuration method. Facilities are also provided to load whole environments, and sections from either a single YAML file structured like, or from a directory tree. See the README file or RDoc documentation for more info.

Specify this acts_as extension if you want to model a tree structure by providing a parent association and a children association.

Takes a XSD string and parses it into a tree structure of nodes. A lot similar to Nokogiri but with few more useful methods.

An efficient tree structure for querying on data with overlapping ranges

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

This gem lets you manage partitioned tree structures or graphs using PostgreSQL as data store

This library can be used to build a tree structure, and render or print it like an ASCII graph. It can be used to implement a directory tree viewer or something like that.

NdcTree is a library outputs a list of NDC(Nippon Decimal Classification) as a tree-structured data.

Allows ActiveRecord Models to be easily structured as a tree

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.

A plugin for DataMapper that allows model objects to be a part of a heirarchal tree structure. Based on the acts_as_tree plugin for ActiveRecord.

Turns indented-line input into a tree structure.

An utility gem that contains useful data structures, like tree node, etc.

Task Tree is a CLI tool that helps you keep track of your tasks in a tree structure

Generate a tree structure from a text file indented by spaces.

This gem bundles layered instances to tree structured instances.

ProtoBuffer::Converter can be inherited by a class and then multiple `structure` blocks define each structure, and trees can be made. For a sample usage, look at http://wiki.github.com/danopia/protobuffer

A tree structure for Mongoid documents using the materialized path pattern and rational number sorting.

Trie-like, prefix-tree data structures. First, a prefix-tree based on Arrays, which differs from a traditional trie, which maps strings to values. Second, a more general prefix-tree data structure that works for any type of keys, provided those keys can be transformed to and from an array. Both of these data structures are implemented in terms of hashes.

neartree is a Ruby library binding to the NearTree C library for storing point/value pairs in an R-Tree structure and searching it for the nearest neighbour for any given point.

Add roles to models with tree structure via postgres_tree. It's average because it doesn't do much else.

Create file system tree structure for BOSH plugin development.

Rails config store gem used for project has complex config structure

A thor extension for generating directory structures from file trees defined in YAML

Safely make queries against tree data structure with ability to serialize queries for later usage