Kyle Banker
|
af6552ed3c
|
RUBY-265 semantics should == Hash#reject!
|
2011-04-15 16:19:00 -04:00 |
|
Kyle Banker
|
d0a4483713
|
RUBY-265 fix OrderedHash#reject!
|
2011-04-15 16:10:38 -04:00 |
|
Kyle Banker
|
113eeb4254
|
minor: remove unused code in OrderedHash
|
2011-04-01 12:26:56 -04:00 |
Hongli Lai (Phusion)
|
08daf9c5f9
|
Implement BSON::OrderedHash#dup
|
2011-03-28 11:16:46 -04:00 |
|
Kyle Banker
|
0d91faf6b1
|
RUBY-226 minor: license update
|
2011-01-17 12:26:32 -05:00 |
Jari Bakken
|
112870b537
|
Get rid of missing parentheses warning.
|
2010-10-04 13:32:46 -04:00 |
|
Jari Bakken
|
9d2f3fbc27
|
Call super in BSON::OrderedHash#== instead of doing the comparison in Ruby.
This has a notable performance impact for large hashes.
|
2010-10-04 13:32:33 -04:00 |
|
Hongli Lai (Phusion)
|
026e409d6d
|
Optimize Ruby 1.8 implementation of BSON::OrderedHash.
The set in there is unnecessary. Use the hash itself as "set". This makes
BSON::OrderedHash 148% faster on Ruby 1.8.
|
2010-09-13 10:49:50 -04:00 |
|
Kyle Banker
|
2eaca6bc8e
|
RUBY-172 fix for OrderedHash#clone
|
2010-08-27 15:50:42 -04:00 |
|
Kyle Banker
|
bacb1ee69e
|
RUBY-167 fix OrderedHash#reject
|
2010-08-23 14:19:32 -04:00 |
Ryan Angilly
|
a7de4f2eed
|
make BSON::OrderedHash equal to other types of hashes in both directions
|
2010-06-24 12:52:28 -05:00 |
justindossey
|
222040f82d
|
Added Set for use in membership tests, optimizing out the expensive call to Array#include?
|
2010-06-15 09:58:52 -04:00 |
|
Kyle Banker
|
97ee66be02
|
minor: source file encoding with magic comment
|
2010-05-07 15:33:27 -04:00 |
sleverbor
|
ed76126a12
|
namespaced the OrderedHash class
|
2010-05-06 18:25:18 -07:00 |
|
Kyle Banker
|
8426a06244
|
minor: some minor details
|
2010-04-05 14:09:06 -04:00 |