Skip to content

Latest commit

 

History

History
38 lines (21 loc) · 1.55 KB

README.md

File metadata and controls

38 lines (21 loc) · 1.55 KB

LLRBTree

LLRBTree is a implementation of Left-Leaning Red-Black Trees which is 2–3 balanced binary search trees for Ruby.
Left-Leaning Red-Black Trees was presented by Robert Sedgewick in 2008 on his paper http://www.cs.princeton.edu/~rs/talks/LLRB/LLRB.pdf.

Installation

Add this line to your application's Gemfile:

gem 'llrbtree'

And then execute:

$ bundle

Or install it yourself as:

$ gem install llrbtree

Usage

TODO: Write usage instructions here

Development

After checking out the repo, run bin/setup to install dependencies. Then, run rake test to run the tests. You can also run bin/console for an interactive prompt that will allow you to experiment.

To install this gem onto your local machine, run bundle exec rake install. To release a new version, update the version number in version.rb, and then run bundle exec rake release, which will create a git tag for the version, push git commits and tags, and push the .gem file to rubygems.org.

Contributing

Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/llrbtree. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the Contributor Covenant code of conduct.

Code of Conduct

Everyone interacting in the LLRBTree project’s codebases, issue trackers, chat rooms and mailing lists is expected to follow the code of conduct.