List current action handlers for all Signals, without having to override the current action handlers to retrieve the same information.

Access to SIMD (Single Instruction Multiple Data) instructions in Ruby

A SIMD-optimized replacement for Ruby's String#length method for x86_64 architectures

A simple gem for accessing the clipboard, based on libclipboard

A simplistic interface for reading memory mapped files

3D operation libray

Ruby bindings for sjpeg

Blink Protocol in Ruby

Matrix store the hash like this: {'234234' => {'id' => '23232', 'name' => 'haha'}, ...}

Add snapshot method to coverage lib

A thing for sockets

EventMachine implements a fast, single-threaded engine for arbitrary network communications. It's extremely easy to use in Ruby. EventMachine wraps all interactions with IP sockets, allowing programs to concentrate on the implementation of network protocols. It can be used to create both network servers and clients. To create a server or client, a Ruby program only needs to specify the IP address and port, and provide a Module that implements the communications protocol. Implementations of several standard network protocols are provided with the package, primarily to serve as examples. The real goal of EventMachine is to enable programs to easily interface with other programs using TCP/IP, especially if custom protocols are required.

Sooth is a simple stochastic predictive model.

Soundex library written in C

An ActiveRecord/PostGIS extension that provides statistical methods to spatial postgresql databases. It integrates with ActiveRecord to perform spatial weighting in PostGIS and performs statistical computations inside your rails app. Supports contiguious and distance-based calculations.

Native libspf2 basic wrapper

Ruby bindings for SPIRV-Cross to provide reflection of SPIR-V shaders.

A Splay Tree is a self adjusting binary search tree with the additional property that recently accessed elements are quick to access again. This makes it useful for caches because the most commonly accessed elements will be the fastest ones to access. This tree has an additional feature that allows it's maximum size to be restricted. When it exceeds it's maximum size, it will drop all of the nodes which are at the terminal ends of the tree structure, leaving many of the more commonly accessed nodes intact. This implementation is written in C++ with a Ruby wrapper.

A JRuby extension wrapping the latest spymemcached client (v2.11.4).

Detailed per-request metrics for Sqreen