CrackLib is a library for checking that a password is not based on a simple character pattern or on a dictionary word.

A simple wrapper around the CraftClicks API

Rack middleware to notify HTTP endpoint with application notifications

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

Ruby Crawlspace client

CrazyHarry is a high-level html fragment sanitiser/cleaner based on Loofah.

Simple money wrapper

CrazyValidators enables easy validation of attributs of an ActiveModel class, such as alphanumericality, presence in a Blacklist.

Cre reduces the amount of code you have to write when fetching rails credentials. If your encrypted credentials look like this: production: password: 'foobar' development: password: 'foobar' test: password: 'foobar' Usually you have to get it like this: `Rails.application.credentials.dig(Rails.env, :password)` with Cre you can just do: `Cre.dig(:password)`. By default it grabs the current Rails environment. To overwrite this behavior add the enviroment as the first argument: `Cre.dig(:production, :password)`

Client for accessing the Crea blockchain.

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

The Ruby gem for the Creatary REST APIs

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

Campaign Monitor transactional email adapter for ActionMailer

Creative's assorted hacks, fixes and monkeypatches to Ruby and Rails base classes

Provides token-based authentication for Rails API apps.

Credova API Ruby library.

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

critiques your code

Cron parsing