Skip to content
This repository

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
branch: master

May 08, 2012

  1. Hiroshi Nakamura

    Version bump to 1.1.3

    authored
  2. Hiroshi Nakamura

    Graceful handling of uncomparable keys

    h["a"] = 1
    h[1.1] = 2    # => TypeError because "a" <=> 1.1 returns nil
    h.delete(1.1) # => ditto
    h[1.1]        # => nil, not error
    
    Closes #4.
    authored
  3. Eric Lindvall

    Failing tests for trying to delete a different key type

    eric authored committed

Mar 27, 2012

  1. Hiroshi Nakamura

    Version bump to 1.1.2

    authored
  2. Hiroshi Nakamura

    RedBlackTree: eager rebalance after insert

    Change internal rebalance timing.  Do convert (b (r r)) -> (r (b b)) to
    make balance of tree be perfect after insert.  Before this commit, the
    above convert run at the next insert.
    
    It includes related 4 updates for the test.  2 tests for delete indicate
    that the balance of the tree is better than before.  Other 2 tests for
    insert indicate that the balance of the tree is better than before at
    the first insert, and the balance is the same as before at the second
    insert.
    authored
  3. Hiroshi Nakamura

    Make EmptyNode a subclass of Node

    To reduce the same method definitions for Node and EmptyNode.
    authored
  4. Hiroshi Nakamura

    Merge pull request #3 from eric/fix-values-for-empty-node

    Allow #values to be called on empty trees
    authored
  5. Eric Lindvall

    Allow #value to be called on empty trees

    eric authored

Mar 23, 2012

  1. Hiroshi Nakamura

    Remove RadixTree benchmark

    Remove extra dependency
    authored

Mar 19, 2012

  1. Hiroshi Nakamura

    Version bump to 1.1.1

    authored
  2. Hiroshi Nakamura

    Merge pull request #2 from eric/remove-to_s-on-keys

    Do not force keys to be strings
    authored
  3. Eric Lindvall

    Do not force keys to be strings

    Keys must be Comparable (defines the <=> method).
    eric authored

Feb 05, 2012

  1. Hiroshi Nakamura

    Update README for Red-black addition

    authored
  2. Hiroshi Nakamura

    Cosmetic comment update.

    authored
  3. Hiroshi Nakamura

    Version bump to 1.1.0

    authored
  4. Hiroshi Nakamura

    Update benchmark scripts

    authored
  5. Hiroshi Nakamura

    Perf improvement for insert

    Do red pull-up check and rotation at a time.
    authored
  6. Hiroshi Nakamura

    Reduce method dispatch

    authored
  7. Hiroshi Nakamura

    Fix reversed name (rotation)

    authored
  8. Hiroshi Nakamura

    Red/black tree implementation

    authored

Feb 04, 2012

  1. Hiroshi Nakamura

    Internal method name change: 'insert' -> 'store'

    Follows name convention of tree data structure.
    authored
  2. Hiroshi Nakamura

    Replace LR and RL as combination of L and R

    With help from 'protected' of Ruby.
    authored
  3. Hiroshi Nakamura

    Cosmetic: typo fixed

    authored

Jan 16, 2012

  1. Hiroshi Nakamura

    Enable Travis CI

    authored
  2. Hiroshi Nakamura

    Make it work on 1.8

    Use OpenSSL::Random instead of Random#bytes
    authored

Jan 13, 2012

  1. Hiroshi Nakamura

    Version bump to 1.0.0

    authored
  2. Hiroshi Nakamura

    Add profiling script

    run this with ruby-prof
    authored
  3. Hiroshi Nakamura

    Add elements size benchmark

    authored
  4. Hiroshi Nakamura

    Fix Encoding test

    It's the only different behavior between AVLTree and RadixTree.
    RadixTree compares keys by char-to-char comparison but AVLTree just uses
    String#<=>
    authored
  5. Hiroshi Nakamura

    Add graphs for tree rotation

    authored
  6. Hiroshi Nakamura

    Cosmetic

    authored
  7. Hiroshi Nakamura

    Add benchmark comparing with Hash and RadixTree

    RadixTree is from https://github.com/nahi/radix_tree
    You can install it with 'gem install radix_tree'
    authored
  8. Hiroshi Nakamura

    Fix a bug for node delete

    It utilized delete_min for node delete always but the right branch of
    the deleted node can be EMPTY.  Use delete_min/delete_max properly.
    authored
  9. Hiroshi Nakamura

    Do update height manually at rotation

    authored
  10. Hiroshi Nakamura

    Use 2 values comparison instead of Array.new#max

    Perf!
    authored
Something went wrong with that request. Please try again.