Sort Tree or List Structures by Drag n Drop

The Lorax is a full diff and patch library for XML/HTML documents, based on Nokogiri. It can tell you whether two XML/HTML documents are identical, or if they're not, tell you what's different. In trivial cases, it can even apply the patch. It's based loosely on Gregory Cobena's master's thesis...

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

Burkhard Keller Tree implementation in Ruby

Sycamore is an unordered tree data structure.

Port of the old, venerable ActsAsTree with a bit of a twist

A Ruby tool for transforming existing markdown documentation into AI-friendly formats following the llms.txt standard. Features include: generating llms.txt files from documentation directories with automatic file prioritization, transforming individual markdown files by expanding relative links ...

A priority queue which implements a lazy binomial heap. It supports the change priority operation, being suitable for algorithms like Dijkstra's shortest path and Prim's minimum spanning tree. It can be instantiated as a min-priority queue as well as a max-priority queue.

Yadriggy builds the abstract syntax tree (AST) of a method, checks its syntax and types, and runs it. When checking the syntax and types, it is treated as the code written in a domain specific language (DSL). It also provide simple DSLs for computation offloading from Ruby to C, Python, etc.

A comprehensive Ruby tool for building and optimizing documentation for Large Language Models. Features include: generating llms.txt files from documentation directories with automatic file prioritization, transforming individual markdown files by expanding relative links to absolute URLs, bulk t...

Port of the old, venerable ActsAsTree with a bit of a twist

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

ActiveRecord extension for sorted adjacency lists support

Graph data structure supporting directed and undirected modes with adjacency list storage. Includes BFS, DFS, Dijkstra shortest path, topological sort, cycle detection, connected components, minimum spanning tree, maximum flow, graph coloring, bipartiteness checking, strongly connected components...

Tokyo 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. There i...

Fully featured tree implementation for Mongoid using the nested set model

monos - monorepo / mono source tree tools and (startup) scripts

A Ruby SQL parser based on Treetop.

A Ruby GEDCOM text file parser and producer, that produces a tree of objects from each of the GEDCOM file types and subtypes. Understands the full GEDCOM 5.5 grammar, and will handle unknown tags hierarchies as a Note class.

Pegarus is, broadly, an implementation of LPEG on Rubinius. LPEG implements a Parsing Expression Grammar using a parsing machine rather than the Packrat algorithm. (See "A Text Pattern-Matching Tool based on Parsing Expression Grammars" by Roberto Ierusalimschy.) Pegarus actually implements an a...