Search API for craigslist

A simple API client with built-in segment/header proxy support. "... It could be better." ™️

The Ruby tool for auditing and reporting on user permissions based on groups

Ever wanted some dumber, crazier (fancier?) lorem ipsum? Here you go!

Control Crazyflie via ZMQ protocol

Client for accessing the Crea blockchain.

Mixin adds create, and attribute methods. Use these instead of attr_ and the #create method is automatically generated.

Ruby program with command-line interface that creates a changelog from log lines in a git repository that can be read and understood by end users.

A script that manages your gem version and creates a GitHub branch, PR, and release for a new gem version.

Simple project creation gem.

The Credere plugin provides a complete double entry accounting system for use in any Ruby on Rails application. The plugin follows general Double Entry Bookkeeping practices. All calculations are done using BigDecimal in order to prevent floating point rounding errors. The plugin requires a decimal type on your database as well. It is strongly based off of the Plutus gem.

Unofficial Ruby Client for interacting with the Cloud Foundry CredHub credential store

Detects issuer from a number, has ActiveModel validations and translations support.

An upgrade/port of ActiveMerchant's credit card class

Credova API Ruby library.

This gem converts creole to html, then converts html to markdown.

Constructs and parses Crestron IP packets allowing you to communicate with Crestron devices without a controller

A crit bit tree, also known as a Binary Patricia Trie is a trie (https://en.wikipedia.org/wiki/Trie), also called digital tree and sometimes radix tree or prefix tree (as they can be searched by prefixes), is an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings. Unlike a binary search tree, no node in the tree stores the key associated with that node; instead, its position in the tree defines the key with which it is associated. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string. Values are normally not associated with every node, only with leaves and some inner nodes that correspond to keys of interest. For the space-optimized presentation of prefix tree, see compact prefix tree. This code is a wrapper around https://github.com/jfager/functional-critbit. For more information go to: http://cr.yp.to/critbit.html

Ruby client for the 38 Degrees CRMP system.

Easy setting of hook chains on Ruby methods calls in rubtime