Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Commits on Apr 7, 2015
  1. @alexdowad

    Use 'concurrent-ruby' gem rather than (deprecated) 'atomic'

    alexdowad authored
    Suggested by Rory O'Kane in GH issue #167.
Commits on Apr 3, 2015
  1. @alexdowad

    Remove use of long-ago removed #filter method in README code sample

    alexdowad authored
    The #filter method was renamed to #select in 3917c76, to match the Ruby
    standard library.
Commits on Mar 19, 2015
  1. @elben @alexdowad

    Hamster.from/to_ruby: convert mixed, nested data.

    elben authored alexdowad committed
  2. @elben @alexdowad

    Hamster.from/to_ruby support for SortedSet.

    elben authored alexdowad committed
  3. @elben @alexdowad

    Add Hamster.to_ruby and #to_ruby.

    elben authored alexdowad committed
    Recursively convert Hamster data to a Ruby collection.
Commits on Mar 7, 2015
  1. @krainboltgreene
Commits on Jan 20, 2015
  1. @alexdowad
  2. @alexdowad
  3. @alexdowad
  4. @alexdowad
  5. @alexdowad

    Add header on LICENSE file

    alexdowad authored
  6. @alexdowad
  7. @alexdowad
  8. @alexdowad
  9. @alexdowad
  10. @alexdowad
  11. @alexdowad
Commits on Dec 31, 2014
  1. @dubek
Commits on Dec 30, 2014
  1. @alexdowad
  2. @alexdowad

    Checked break-even points for #superset? and #subset? optimizations m…

    alexdowad authored
    …ore carefully
    
    It turns out the point where the optimization becomes useful is higher than I
    previously thought.
  3. @alexdowad

    Use Ruby's Set rather than Hamster::Set for optimizing #subset? and #…

    alexdowad authored
    …superset? when Array is passed
    
    This gives a *big* boost in performance.
  4. @krainboltgreene @alexdowad

    Notes about ambiguity on inner immutability

    krainboltgreene authored alexdowad committed
  5. @alexdowad

    Optimization for SortedSets which keep items in natural order

    alexdowad authored
    Introduce a subclass of AVLNode which doesn't use a comparator function.
Commits on Dec 28, 2014
  1. @alexdowad

    Refactoring of SortedSet

    alexdowad authored
    Now each AVLNode holds its own 'comparator' block, rather than the SortedSet
    passing it down each time it makes a call. This seems to make for better and
    more readable code.
  2. @alexdowad
  3. @alexdowad

    SortedSet#delete does not lose the set's order when deleting the last…

    alexdowad authored
    … item
    
    If a SortedSet has a custom order, it should be maintained *even when* the set
    is emptied -- because subsequently, more items might be added again.
  4. @alexdowad
  5. @alexdowad

    Remove redundant List#find_indices and #elem_indices methods

    alexdowad authored
    List#indices already does everything which #find_indices and #elem_indices can do.
    This implementation of #indices is a bit clumsy, especially the way it passes
    arguments on recursive calls. Maybe it can be improved later.
    
    All the specs for #find_indices and #elem_indices have been combined in a single
    spec file for #indices.
Commits on Dec 27, 2014
  1. @alexdowad

    Code example for List#fill

    alexdowad authored
  2. @alexdowad
Commits on Dec 26, 2014
  1. @alexdowad

    Minor performance boost for SortedSet#delete

    alexdowad authored
    Same principle as the previous commit, which optimized SortedSet#insert. As with
    that commit, this gives about 8% performance boost to SortedSet#delete.
  2. @alexdowad

    Minor performance boost for SortedSet#insert

    alexdowad authored
    Rather than traversing the tree twice, once to check if an item is there, and
    again to insert it, we just traverse down once, and use 'throw' to bail if
    we discover the item is already there.
    
    This gives about 8% speed boost to #insert.
  3. @alexdowad
  4. @alexdowad

    Performance boost for Set#subset? when called with a large Array

    alexdowad authored
    If passed a large Array, convert it to a Set to avoid O(n^2) runtime.
    The extra checks incur a 4-5% penalty when doing many #subset? checks on small
    collections, but the method is enormously faster when passed larger Arrays.
  5. @alexdowad
Something went wrong with that request. Please try again.