Provides a native Doubly Linked List data structure in Ruby, focusing on O(1) performance for head/tail operations and standard Enumerable compatibility.

DotKey provides an elegant way to read, write, and manipulate deeply nested Hashes and Arrays using dot-delimited strings. It supports wildcards for pattern matching, custom delimiters, and flexible handling of missing values - making it ideal for working with complex data structures, configuration objects, and API responses.

Specifically designed as an OpenStruct-like tool for consuming APIs, dynamic_class lets your classes define their own getters and setters at runtime based on the data instances receive at instantiation.

E11y (Easy Telemetry) - Observability for Rails developers who hate noise. UNIQUE FEATURES: • Request-scoped debug buffering - buffers debug logs in memory, flushes ONLY on errors • Zero-config SLO tracking - automatic Service Level Objectives for HTTP endpoints and jobs • Schema-validated events - catch bugs before production with dry-schema DEVELOPER EXPERIENCE: • 5-minute setup (not 2-week migration) • Auto-metrics from events (no manual Yabeda.increment) • Rails-first design (follows Rails conventions) • Pluggable adapters (Loki, Sentry, OpenTelemetry, custom backends) COST SAVINGS: • Reduce log storage costs by 90% (request-scoped buffering) • Replace expensive APM SaaS ($500-5k/month → infra costs only) • Own your observability data (no vendor lock-in) PRODUCTION-READY: • Thread-safe for multi-threaded Rails + Sidekiq • Adaptive sampling (error-based, load-based, value-based) • PII filtering (GDPR-compliant masking/hashing) • Performance optimized (hash-based events, minimal allocations) Perfect for Rails 7.0+ teams who need observability without complexity or high costs.

Edit distance algorithms including Levenshtein, Restricted Edit (Optimal Alignment) and Damerau-Levenshtein distances, and Jaro & Jaro-Winkler similarity.

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 YottaDB/GT.M powers Epic (70% of US hospitals) and VistA. Perfect for B-tree indexes, key-value stores, and any system requiring sortable hierarchical keys. All types maintain correct ordering when compared as byte strings - no decoding needed.

Prints origin of a word

ROM-compatible data mapper

Active Support impelementation in C for the ones who need for speed.

an attempt at a fast_blank for JRuby

A simple example of how to write a Ruby native extension in OCaml

Serialize and deserialize Open Sound Control messages using rtosc

A faster implementation of getting the current local 4 digit year.

Fast Base64 C extension

libhydrogen + encoding = cryptographically sound, URL safe string = libhydrogen + encoding

Extends Ruby FFI and uses LLVM to generate JIT wrappers for attached native functions. Works only on MRI

radix tree implementation in c++ with FFI bindings

Get the fibonacci number

FigureSet is the library which treats set operation.

A library to lazily collect a list of files by path and a set of filters.