A JavaScript library for escaping CSS strings and identifiers while generating the shortest possible ASCII-only output.
Binary Search Trees
For ruby and ruby on rails
Ruby SemVer in TypeScript.
Delightful JavaScript Testing.
Convention over configuration for using Vite in Ruby apps
Broccoli plugin to merge multiple trees into one
Like ruby's abbrev module, but in js
Utilities for watching file trees.
Delightful JavaScript Testing.
Ruby grammar for tree-sitter
prettier plugin for the Ruby programming language
hast utility to create trees
Simple parser to replace variables inside templates/strings and files for node js and browser.
WebSocket framework for Ruby on Rails.
No description provided.
unist utility to create a new trees with a nice syntax
Incrementally merge directories.
Highlighting system for Lezer parse trees
JavaScript client for graphql-ruby
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
realistic password strength estimation
File system snapshot - serialize and deserialize file system trees to binary or JSON
Ruby trees
AVL tree, Red black tree and Lock-free Red black tree in Ruby
Arbre makes it easy to generate HTML directly in Ruby
RubyTree is a Ruby implementation of the generic tree data structure. It provides simple APIs to store named nodes, and to access, modify, and traverse the tree. The data model is node-centric, where nodes in the tree are the primary structural elements. It supports all common tree-traversal methods (pre-order, post-order, and breadth first). RubyTree mixes in the Enumerable and Comparable modules and behaves like a standard Ruby collection (iteration, comparison, etc.). RubyTree also includes a binary tree implementation, which provides in-order node traversal besides the other methods. RubyTree can import from and export to JSON, and supports Ruby’s object marshaling.
http://wikipedia.com/wiki/Interval_tree
Ruby bindings for Tree-Sitter
A simple library to create and manage basic tree-esque structures.
Provides a generic tree data structure with ability to store keyed node elements in the tree. The implementation mixes in the Enumerable module.
Burkhard Keller Tree implementation in Ruby
A Ruby implementation of the Centered Interval Tree data structure. See also: http://en.wikipedia.org/wiki/Interval_tree
behavior trees for ruby
Sycamore is an unordered tree data structure.