Sort Tree or List Structures by Drag n Drop

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

ParseTree is a C extension (using RubyInline) that extracts the parse tree for an entire class or a specific method and returns it as a s-expression (aka sexp) using ruby's arrays, strings, symbols, and integers. As an example: def conditional1(arg1) if arg1 == 0 then return 1 e...

Sycamore is an unordered tree data structure.

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

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

Drop Zone is a solution to the problem of restricted sales in censored markets. The proposal is for the design of a protocol and reference client that encodes the location and a brief description of a good onto The Blockchain. Those wishing to purchase the good can search for items within a user-...

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 ...

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.

ActiveRecord extension for sorted adjacency lists support

Burkhard Keller Tree implementation in Ruby

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...

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...

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.

Selection list management and form and view helpers. Manages one table to hold all selections items/dropdown lists ( tree ). Dynamic lookup to find parent or children ( eg. Selection.priorities ). Form helper to display lists ( eg. f.selections :priorities ). Handling of archived items ( disp...

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...

Allows delimited Solr facets to become hierarchical trees in Blacklight.

A Ruby SQL parser based on Treetop.

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...

Ancestry tree view in ActiveAdmin resource