From b4baeb5af656d7a5999f867760e2db6b7fa7aa2e Mon Sep 17 00:00:00 2001 From: stomar Date: Sat, 4 Mar 2017 13:13:50 +0000 Subject: documentation for sort methods * array.c: [DOC] fix grammar in Array#sort, #sort!, #sort_by!, move references below the code example, add a missing reference. * enum.c: [DOC] fix grammar in Enumerable#sort, #sort_by. git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@57771 b2dd03c8-39d4-4d8f-98ff-823fe69b080e --- enum.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'enum.c') diff --git a/enum.c b/enum.c index 3e79a35cb5..0c35efc6e5 100644 --- a/enum.c +++ b/enum.c @@ -935,7 +935,7 @@ enum_first(int argc, VALUE *argv, VALUE obj) * an integer less than 0 when +b+ follows +a+, +0+ when +a+ and +b+ * are equivalent, or an integer greater than 0 when +a+ follows +b+. * - * The result is not guaranteed as stable. When comparison of two + * The result is not guaranteed to be stable. When the comparison of two * elements returns +0+, the order of the elements is unpredictable. * * %w(rhea kea flea).sort #=> ["flea", "kea", "rhea"] @@ -1011,7 +1011,7 @@ sort_by_cmp(const void *ap, const void *bp, void *data) * Sorts enum using a set of keys generated by mapping the * values in enum through the given block. * - * The result is not guaranteed as stable. When two keys are equal, + * The result is not guaranteed to be stable. When two keys are equal, * the order of the corresponding elements is unpredictable. * * If no block is given, an enumerator is returned instead. -- cgit v1.2.3