diff options
author | nobu <nobu@b2dd03c8-39d4-4d8f-98ff-823fe69b080e> | 2016-10-13 02:35:34 +0000 |
---|---|---|
committer | nobu <nobu@b2dd03c8-39d4-4d8f-98ff-823fe69b080e> | 2016-10-13 02:35:34 +0000 |
commit | 5b3b8554c9f851a958c03fc707bd69e6ad6c5c13 (patch) | |
tree | 29e5819aba6363dd5bc502f1abe88b436bb9233f /enum.c | |
parent | 7e9112a4413156cce4393983ecbb98639517765a (diff) |
unstable sort [ci skip]
* array.c (rb_ary_sort_bang, rb_ary_sort, rb_ary_sort_by_bang):
[DOC] describe that sort may not be stable.
* enum.c (enum_sort, enum_sort_by): ditto.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@56413 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
Diffstat (limited to 'enum.c')
-rw-r--r-- | enum.c | 6 |
1 files changed, 6 insertions, 0 deletions
@@ -934,6 +934,9 @@ enum_first(int argc, VALUE *argv, VALUE obj) * built-in Schwartzian Transform, useful when key computation or * comparison is expensive. * + * The result is not guaranteed as stable. When comparison of two + * elements returns +0+, the order of the elements is unpredictable. + * * %w(rhea kea flea).sort #=> ["flea", "kea", "rhea"] * (1..10).sort { |a, b| b <=> a } #=> [10, 9, 8, 7, 6, 5, 4, 3, 2, 1] */ @@ -1004,6 +1007,9 @@ sort_by_cmp(const void *ap, const void *bp, void *data) * Sorts <i>enum</i> using a set of keys generated by mapping the * values in <i>enum</i> through the given block. * + * The result is not guaranteed as stable. When two keys are equal, + * the order of the corresponding elements is unpredictable. + * * If no block is given, an enumerator is returned instead. * * %w{apple pear fig}.sort_by { |word| word.length} |