LipaWeb - micro webframework for web access to treelike structures

LittleBoxes is a light library that provides a dependency tree that represents your application configuration. It automatically configures your dependencies and lazy-loads by default.

Hierarchical logger for Ruby. The loggers are arranged in a tree. Output can be controlled using Levels, Appenders and Formatters.

Port of classic Rails ActsAsTree for MongoMapper

Move object up and down with Rails and nested set tree

Parse MTGJSON and build a tree of Ruby objects

a simple program for suggest or spellcheck keyword use trie tree

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.

Definitely just use the real liquid gem, forked only to use parse tree visitor on aws lambda

Use OrderTree when you need both insertion order access and nested hash path style access

Renders markup Wiki pages in the browser or generates static files. Hierarchical tree navigation for all pages is provided.

It starts from the arbitrary page you provide and descents into the tree of links until it has either traversed all possible content on the web site or has stopped at some predefined traversal depth. It is written in Ruby and implemented as a CLI application. Based on user preference, it can outp...

==== QDox - http://qdox.codehaus.org QDox is a high speed, small footprint parser for extracting class/interface/method definitions from Java source files complete with JavaDoc @tags. It is designed to be used by active code generators or documentation tools. QDox is a Java library. Therefore th...

QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net 2.0 and up. QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc... ...

Kiwi is a schema-based binary format for efficiently encoding trees of data.

EncodeM v3.0 brings complete M language (MUMPS) subscript encoding to Ruby, supporting numbers, strings, and composite keys with perfect sort order. Build hierarchical database keys like M("users", 42, "email") that sort correctly as raw bytes. This 40-year production-tested algorithm from YottaD...

The RKelly library will parse JavaScript and return a parse tree, fixed to support ruby 1.9.3

Rockit is a potent parser generator and gives you AST's (Abstract Syntax Tree's) which you can pattern match and pretty-print. Rockit does not distinghuish between lexing and parsing so the generated parsers are scanner-/lexer-less. The vision is to extend Rockit with more advanced compiler-relat...

Parses simple mathematical expressions, creates a fully object-oriented expression tree. Evaluation can have injected variables.

Pure Ruby YANG parser and tree structure data store implementation