From f142cfb878249a44f02d2b37773dc29b65d96439 Mon Sep 17 00:00:00 2001 From: nobu Date: Tue, 26 Jan 2016 10:37:12 +0000 Subject: array.c: reword [ci skip] * array.c (permute0, rpermute0): [DOC] Substitute indexes -> indices in documentation for consistency. [Fix GH-1222] git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@53660 b2dd03c8-39d4-4d8f-98ff-823fe69b080e --- ChangeLog | 5 +++++ array.c | 8 ++++---- 2 files changed, 9 insertions(+), 4 deletions(-) diff --git a/ChangeLog b/ChangeLog index 3e155ca3ea..95dc877616 100644 --- a/ChangeLog +++ b/ChangeLog @@ -1,3 +1,8 @@ +Tue Jan 26 19:36:15 2016 Aggelos Avgerinos + + * array.c (permute0, rpermute0): [DOC] Substitute indexes -> + indices in documentation for consistency. [Fix GH-1222] + Tue Jan 26 15:21:37 2016 Eric Wong * compile.c (caller_location): use rb_fstring_cstr for "" diff --git a/array.c b/array.c index 050e3a39ce..ca10789d0e 100644 --- a/array.c +++ b/array.c @@ -4828,8 +4828,8 @@ yield_indexed_values(const VALUE values, const long r, const long *const p) /* * Compute permutations of +r+ elements of the set [0..n-1]. * - * When we have a complete permutation of array indexes, copy the values - * at those indexes into a new array and yield that array. + * When we have a complete permutation of array indices, copy the values + * at those indices into a new array and yield that array. * * n: the size of the set * r: the number of elements in each permutation @@ -5068,8 +5068,8 @@ rb_ary_combination(VALUE ary, VALUE num) * Compute repeated permutations of +r+ elements of the set * [0..n-1]. * - * When we have a complete repeated permutation of array indexes, copy the - * values at those indexes into a new array and yield that array. + * When we have a complete repeated permutation of array indices, copy the + * values at those indices into a new array and yield that array. * * n: the size of the set * r: the number of elements in each permutation -- cgit v1.2.3