| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Import set 1.0.1 | Akinori MUSHA | 2020-12-22 | 1 | -66/+64 |
| * | Import set 1.0.0 | Akinori MUSHA | 2020-12-22 | 1 | -0/+8 |
| * | [ruby/set] Add `Set#<=>` | Marc-Andre Lafortune | 2020-12-04 | 1 | -3/+16 |
| * | [ruby/set] Remove SortedSet implementations | Akinori MUSHA | 2020-12-04 | 1 | -246/+1 |
| * | [ruby/set] Resurrect support for Ruby 2.x | Akinori MUSHA | 2020-12-04 | 1 | -4/+12 |
| * | Make mutating the result of SortedSet#to_a not affect the set | Jeremy Evans | 2020-06-11 | 1 | -1/+1 |
| * | Support obj.clone(freeze: true) for freezing clone | Jeremy Evans | 2020-03-22 | 1 | -1/+1 |
| * | Call initialize_clone with freeze: false if clone called with freeze: false | Jeremy Evans | 2020-01-03 | 1 | -2/+2 |
| * | speed up set intersect | Oleg Zubchenko | 2019-12-31 | 1 | -1/+9 |
| * | Deprecate taint/trust and related methods, and make the methods no-ops | Jeremy Evans | 2019-11-18 | 1 | -10/+0 |
| * | Fix SortedSet subclasses that override initialize | Jeremy Evans | 2019-09-06 | 1 | -1/+2 |
| * | raise FrozenError instead of RuntimeError | kazu | 2019-01-20 | 1 | -1/+1 |
| * | Add a new #filter alias for #select | eregon | 2018-02-25 | 1 | -0/+3 |
| * | lib/set.rb: [DOC] remove empty comments | stomar | 2017-11-22 | 1 | -4/+4 |
| * | set.rb: improve docs for Set | stomar | 2017-11-22 | 1 | -33/+28 |
| * | Add examples to Set documentation [ci skip] | knu | 2017-11-17 | 1 | -7/+47 |
| * | lib/set.rb: improve docs for Set#=== | stomar | 2017-10-29 | 1 | -6/+11 |
| * | Add `Set#reset` | knu | 2017-10-22 | 1 | -0/+18 |
| * | Avoid use of `self.class.new(self)` in Set#collect! | knu | 2017-10-21 | 1 | -1/+3 |
| * | Fix comparison methods of Set to check if `@hash` is actually comparable | knu | 2017-10-21 | 1 | -4/+4 |
| * | Use a mutex to make SortedSet.setup thread-safe | knu | 2017-10-21 | 1 | -90/+92 |
| * | Remove redundant use of module_eval | knu | 2017-10-21 | 1 | -8/+6 |
| * | Allow a SortedSet to be frozen and still functional [Bug #12091] | knu | 2017-10-21 | 1 | -0/+5 |
| * | Alias Set#=== to #include? | knu | 2017-09-19 | 1 | -0/+17 |
| * | Alias Set#to_s to #inspect [ruby-core:81753] [Feature #13676] | knu | 2017-07-14 | 1 | -0/+2 |
| * | Add Set#compare_by_identity and Set#compare_by_identity? | knu | 2016-11-05 | 1 | -2/+20 |
| * | * lib/set.rb: [DOC] add documentation that Set#{delete_if,keep_if,collect!,re... | ktsj | 2016-05-04 | 1 | -4/+11 |
| * | * lib/set.rb (Set#{delete_if,keep_if,collect!,reject!,select!,classify,divide}, | ktsj | 2016-05-04 | 1 | -9/+9 |
| * | * lib/set.rb: Enable frozen_string_literal. | knu | 2015-11-16 | 1 | -1/+3 |
| * | Explain the reason for calling do_with_enum without a block [ci skip] | knu | 2015-11-16 | 1 | -1/+1 |
| * | * lib/set.rb (Hash#flatten!, #add?, #delete?, #collect!, #reject!, | knu | 2015-11-16 | 1 | -23/+8 |
| * | * lib/set.rb (#>=, #>, #<=, #<): Make use of Hash#>=, #>, #<, and | knu | 2015-11-16 | 1 | -12/+32 |
| * | * lib/set.rb: Make Set#each and SortedSet#each generate a sized | knu | 2015-06-15 | 1 | -2/+2 |
| * | * hash.c: Added docs to explain that #include? and #member? do not | hsbt | 2015-02-17 | 1 | -0/+5 |
| * | set: speed up Set#include? | normal | 2015-02-11 | 1 | -2/+2 |
| * | * lib/set.rb (Set#replace): Check if an object given is enumerable | knu | 2014-08-06 | 1 | -4/+4 |
| * | Implement Set#clone. [Fixes GH-661] | knu | 2014-08-06 | 1 | -2/+9 |
| * | * lib/set.rb: [DOC] Fix grammatical error by @bouk [fix GH-524] | hsbt | 2014-02-05 | 1 | -1/+1 |
| * | * lib/set.rb: [DOC] Add examples for Set#intersect? and Set#disjoint? | zzak | 2014-01-28 | 1 | -0/+13 |
| * | * lib/set.rb (class SortedSet): Fix source_location for methods defined via e... | tmm1 | 2013-11-22 | 1 | -4/+4 |
| * | * lib/set.rb: [DOC] Add a couple of notes on Hash as storage. | knu | 2013-07-31 | 1 | -3/+10 |
| * | * lib/set.rb: [DOC] Fix example result. Hash is now ordered. | knu | 2013-07-31 | 1 | -1/+1 |
| * | Use the term "sorted" instead "ordered" when mentioning SortSet. | knu | 2013-07-31 | 1 | -1/+1 |
| * | Add Set#intersect? and #disjoint?. | knu | 2013-07-30 | 1 | -0/+17 |
| * | Define Set#to_set so that aSet.to_set returns self. | knu | 2013-07-19 | 1 | -0/+10 |
| * | * lib/set.rb (Set#freeze, taint, untaint): Save a "self" by | knu | 2013-06-01 | 1 | -6/+3 |
| * | * lib/set.rb (Set#delete_if, Set#keep_if): Avoid blockless call of | knu | 2013-05-20 | 1 | -3/+3 |
| * | * lib/set.rb (Set#delete_if, Set#keep_if): Add comments. | knu | 2013-05-19 | 1 | -0/+4 |
| * | * lib/set.rb (Set#delete_if, Set#keep_if): Make Set#delete_if and | knu | 2013-05-18 | 1 | -2/+2 |
| * | Move tests embedded in lib/set.rb to test/test_set.rb. | knu | 2012-11-24 | 1 | -644/+1 |
