Native implementation of Dijkstra algorithm for finding the shortest path between two vertices in a large, sparse graphs. Underlying algorithm is implemented in C using a priority queue. Edges are represented using linked lists rather than an adjacency matrix to reduce memory footprint when operating on very large graphs where the average number of edges between nodes is relatively small (e.g. < 1/10 the number of nodes). See https://en.wikipedia.org/wiki/Dijkstra's_algorithm for additional information.

To calculate the directory size

Efficient test generation strategies

Implements the DataObjects API for Derby

Implements the DataObjects API for H2

Implements the DataObjects API for Hsqldb

Provides JDBC support for usage in DO drivers for JRuby

Implements the DataObjects API for OpenEdge

Implements the DataObjects API for Microsoft SQL Server

A simple, fast Mysql and Drizzle library for Ruby, binding to libdrizzle. Still in early alpha

A ruby tool to simplify the development workflow with Docker Compose and Docker.

A PoC to include DTRACE_PROBE in Ruby.

Dualcone encrypts your Ruby source code.

Manipulate easily BMA endpoints in Duniter's nodes.

A port of dynamodb_geo to Ruby. Includes a geohash module.

EasyCRC let's you calculate CRC32 checksums of files without locking the whole Ruby process

Ruby library for ed25519, but with blake2b as the hashing function as required by the Nano cryptocurrency.

Generate EdgeCast access tokens in Ruby using EdgeCast's encryption algorithm in C.

Calculate edit distance (levenshtein distance)

Very fast and memory-efficient way to join ruby lists of numbers and strings.