1berry/ruby
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

* array.c: Improve documentation about

Browse Source 
comparison by hash for concerned methods. [ruby-core:51266]

git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@38974 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
eregon 2013-01-29 10:32:27 +00:00
parent 18a8812e36
commit d5b7fc432f
2 changed files with 13 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
ChangeLog
View File

@ -1,3 +1,8 @@
Tue Jan 29 19:27:18 2013 Benoit Daloze <eregontp@gmail.com>
* array.c: Improve documentation about
comparison by hash for concerned methods. [ruby-core:51266]
Tue Jan 29 17:03:28 2013 Koichi Sasada <ko1@atdot.net> Tue Jan 29 17:03:28 2013 Koichi Sasada <ko1@atdot.net>
* vm_backtrace.c: fix issue of rb_debug_inspector_open(). * vm_backtrace.c: fix issue of rb_debug_inspector_open().

11
array.c
View File

@ -3800,7 +3800,7 @@ ary_recycle_hash(VALUE hash)
* Returns a new array that is a copy of the original array, removing any * Returns a new array that is a copy of the original array, removing any
* items that also appear in +other_ary+. * items that also appear in +other_ary+.
* *
* It compares elements using their hash (returned by the Object#hash method). * It compares elements using their #hash and #eql? methods for efficiency.
* *
* [ 1, 1, 2, 2, 3, 3, 4, 5 ] - [ 1, 2, 4 ] #=> [ 3, 3, 5 ] * [ 1, 1, 2, 2, 3, 3, 4, 5 ] - [ 1, 2, 4 ] #=> [ 3, 3, 5 ]
* *
@ -3832,6 +3832,8 @@ rb_ary_diff(VALUE ary1, VALUE ary2)
* Set Intersection --- Returns a new array containing elements common to the * Set Intersection --- Returns a new array containing elements common to the
* two arrays, excluding any duplicates. * two arrays, excluding any duplicates.
* *
* It compares elements using their #hash and #eql? methods for efficiency.
*
* [ 1, 1, 3, 5 ] & [ 1, 2, 3 ] #=> [ 1, 3 ] * [ 1, 1, 3, 5 ] & [ 1, 2, 3 ] #=> [ 1, 3 ]
* [ 'a', 'b', 'b', 'z' ] & [ 'a', 'b', 'c' ] #=> [ 'a', 'b' ] * [ 'a', 'b', 'b', 'z' ] & [ 'a', 'b', 'c' ] #=> [ 'a', 'b' ]
* *
@ -3872,6 +3874,8 @@ rb_ary_and(VALUE ary1, VALUE ary2)
* Set Union --- Returns a new array by joining +ary+ with +other_ary+, * Set Union --- Returns a new array by joining +ary+ with +other_ary+,
* excluding any duplicates. * excluding any duplicates.
* *
* It compares elements using their #hash and #eql? methods for efficiency.
*
* [ "a", "b", "c" ] | [ "c", "d", "a" ] #=> [ "a", "b", "c", "d" ] * [ "a", "b", "c" ] | [ "c", "d", "a" ] #=> [ "a", "b", "c", "d" ]
* *
* See also Array#uniq. * See also Array#uniq.
@ -3921,6 +3925,8 @@ push_value(st_data_t key, st_data_t val, st_data_t ary)
* If a block is given, it will use the return value of the block for * If a block is given, it will use the return value of the block for
* comparison. * comparison.
* *
* It compares values using their #hash and #eql? methods for efficiency.
*
* Returns +nil+ if no changes are made (that is, no duplicates are found). * Returns +nil+ if no changes are made (that is, no duplicates are found).
* *
* a = [ "a", "a", "b", "b", "c" ] * a = [ "a", "a", "b", "b", "c" ]
@ -3983,8 +3989,7 @@ rb_ary_uniq_bang(VALUE ary)
* *
* If a block is given, it will use the return value of the block for comparison. * If a block is given, it will use the return value of the block for comparison.
* *
* It compares elements using their hash (provided by the Object#hash method) * It compares values using their #hash and #eql? methods for efficiency.
* then compares hashes with Object#eql?.
* *
* a = [ "a", "a", "b", "b", "c" ] * a = [ "a", "a", "b", "b", "c" ]
* a.uniq # => ["a", "b", "c"] * a.uniq # => ["a", "b", "c"]