A collection of holdings-related utilities for the UC Berkeley Library

A collection of location-related utilities for the UC Berkeley Library

A gem providing MARC-related utility code and extensions to ruby-marc for the UC Berkeley Library

UC Berkeley Library utility gem for working with the TIND DA digital archive.

A collection of miscellaneous Ruby routines for the UC Berkeley Library.

Allows to use alternative words endings: -ise instead of -ize etc. Defines `is_an?` as an alias of the is_a? method. Provides a module to use `initialise` in your classes.

This is a simple tool to profile single web requests in Rails using the power or ruby-prof.

BCF admins have a hard live. Their user's don't keep their $HOMES and other working places clean. It appears that some users don't know that they use too much space in their home or don't clean used directories on cluster (or other) machines. This tools helps users find unused and unwanted directories, which could make BCF admins happier.

AWS CloudSearch Query DSL

Colloquy is an evented framework for building fast and efficient USSD applications in Ruby.

Provides Extract, Transform and Load functionality for loading data from CSV files to a Greenplum database.

Personalized High-Frequency Trading Bot

CSV++

A simple ruby wrapper for Daisy Diff.

Daru (Data Analysis in RUby) is a library for analysis, manipulation and visualization of data. Daru works seamlessly accross interpreters and leverages interpreter-specific optimizations whenever they are available. It is the default data storage gem for all the statsample gems (glm, timeseries, etc.) and can be used with many others like mixed_models, gnuplotrb and iruby. Daru Lite is a fork of Daru that aims to focus on data manipulation and stability.

Helps building data pipelines. It handles recomputing dependencies and parallel execution.

This small gem contains several data structures that I have implemented in Ruby to learn how they work. Sometimes it is not enough to read the description of a data structure and accompanying pseudo-code. Actually implementing it is often helpful in understanding what is going on. It is also usually fun. The gem contains basic implementions of Disjoint Union, Heap, Priority Search Tree, and Segment Tree. See the homepage for more details.

Deferred for Delayer.

A C extension implementation of a d-ary heap data structure, suitable for use in e.g. priority queues or Djikstra's algorithm.

A utility that makes it easy to create "on-the-fly databases"