An implmentation of Hash- and Set-compatible objects using a binary tree.
This was an exercise done to test the performance of the interpreted version as compared to the native data types. It seems that MRI's version of Hash uses a binary tree internally anyway, and because it is implemented in C, it's much faster.
This has not been published as a gem, and it's not likely to be. Don't use it in a production application.
a = BinaryTree::Hash.new
a[:the_answer] = 42
a[:the_answer] # => 42- Fork it ( https://github.com/[my-github-username]/binary_tree/fork )
- Create your feature branch (
git checkout -b my-new-feature) - Commit your changes (
git commit -am 'Add some feature') - Push to the branch (
git push origin my-new-feature) - Create a new Pull Request