Generate CCN Treemap based on saikuro analysis

Kyoto Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. Each key...

Data structures (lists, stacks, trees, heaps, graphs..) in pure Ruby.

AVL tree, Red black tree and Lock-free Red black tree in Ruby

Ruby & JRuby gem with a fast k-d tree C implementation using FFI bindings with support for latitude/longitude and geo distance range search

Built on Treetop, this gem will parse interface declarations in WebIDL and generate ruby code

Binary streamable bit-effective protocol to effectively store object tree hierarchies

bcdatabase is a tool for storing passwords and other configuration information outside of your application source tree.

A simple tree structure for working with FilePath objects in ruby. I simply took the simple_tree module from https://github.com/ealdent/simple-tree and hacked it into Pathname (http://www.ruby-doc.org/stdlib-2.0/libdoc/pathname/rdoc/Pathname.html) from the std-lib. This means you get all the awes...

DataMapper plugin allowing the creation of tree structures from data models

The Simple Declarative Language provides an easy way to describe lists, maps, and trees of typed data in a compact, easy to read representation. For property files, configuration files, logs, and simple serialization requirements, SDL provides a compelling alternative to XML and P...

The RKelly library will parse JavaScript and return a parse tree.

tests strings of Ruby code for unauthorized patterns (exit, eval, ...)

Treefell is a simple debug-logging library for ruby.

Test assertion for directories equality by tree and content comparison

syntax_tree plugin to prevent converting `if` expressions to ternary.

A Ruby implementation of the Centered Interval Tree data structure. See also: http://en.wikipedia.org/wiki/Interval_tree

This module implements ordered n-ary branching tree structures. It includes support for breadth- and depth- first iteration, and serialization to and from a bracketed tree string.

This is the original commit of the rtags source code as written by Keiju ISHITSUKA as part of the irb project. Now irb has moved into the main Ruby source tree rtags has become an independent project

Gem renamed to tree.rb (https://rubygems.org/gems/tree.rb). Please update your dependencies. Implementation of visitor design pattern. It contains a 'tree.rb' command line clone of the tree unix tool.