Binary Search Trees
A JavaScript library for escaping CSS strings and identifiers while generating the shortest possible ASCII-only output.
For ruby and ruby on rails
Ruby SemVer in TypeScript.
Convention over configuration for using Vite in Ruby apps
Like ruby's abbrev module, but in js
Ruby grammar for tree-sitter
prettier plugin for the Ruby programming language
WebSocket framework for Ruby on Rails.
Keep a tree trimmed from longer-than-necessary branches
bootstrap-sass is a Sass-powered version of Bootstrap 3, ready to drop right into your Sass powered applications.
Convention over configuration for using Vite in Rails apps
JavaScript client for graphql-ruby
realistic password strength estimation
A Stimulus Wrapper for Flatpickr library
Provide I18n to your React Native application
Prism Ruby parser
A pure JavaScript implementation of Sass.
## Installation
Ruby on Rails unobtrusive scripting adapter
Subresource Integrity hashes for the Vite.js manifest.
A lightweight Sass tool set.
Compass stylesheets
JS lib with TS typings to manipulate strings according to the word parsing rules of the UNIX Bourne shell.
A high-performance pure Ruby Red-Black Tree implementation. Features: O(1) key lookup via hybrid hash index, O(log n) insert/delete, lazy Enumerator-based range queries (lt/gt/between), nearest/prev/succ search, memory-efficient node pooling, and MultiRBTree for duplicate keys with first/last value access.
This is a pure-ruby port of Takuma Ozawa's RBTree. (it has an identical interface and uses the identical unit tests from his version 0.3.0, however it is *not* a Red-Black tree.) It's intended for doing lookups and not for doing lots of insertions or deletions. Please see RBTree docs for a sense of how this is supposed to be used. (This one runs the unit tests about 15% slower than Ozawa's C-version, and 80% less lines of code ;)
This is a pure-ruby implementation of the rbtree gem.
A RBTree is a sorted associative collection that is implemented with a Red-Black Tree. It maps keys to values like a Hash, but maintains its elements in ascending key order. The interface is the almost identical to that of Hash. This is a fork of the original gem that fixes various bugs on Ruby 2.3+.