summaryrefslogtreecommitdiff
path: root/array.c
diff options
context:
space:
mode:
authorNobuyoshi Nakada <nobu@ruby-lang.org>2021-02-07 10:30:15 +0900
committerNobuyoshi Nakada <nobu@ruby-lang.org>2021-02-07 10:30:43 +0900
commit947d93b715436b13eefa39f87737bdad3c1f870a (patch)
tree2cd3132be187d754a9027e2aa9ba099b80bd07cb /array.c
parent93ebfed0a97ba97a4a7421eca63c1c2883471d54 (diff)
[DOC] {Array,MatchData}#values_at understand ranges [ci skip]
Diffstat (limited to 'array.c')
-rw-r--r--array.c4
1 files changed, 3 insertions, 1 deletions
diff --git a/array.c b/array.c
index ad7e11afb7..07b3df0861 100644
--- a/array.c
+++ b/array.c
@@ -3728,15 +3728,17 @@ append_values_at_single(VALUE result, VALUE ary, long olen, VALUE idx)
* array.values_at(*indexes) -> new_array
*
* Returns a new \Array whose elements are the elements
- * of +self+ at the given \Integer +indexes+.
+ * of +self+ at the given \Integer or \Range +indexes+.
*
* For each positive +index+, returns the element at offset +index+:
* a = [:foo, 'bar', 2]
* a.values_at(0, 2) # => [:foo, 2]
+ * a.values_at(0..1) # => [:foo, "bar"]
*
* The given +indexes+ may be in any order, and may repeat:
* a = [:foo, 'bar', 2]
* a.values_at(2, 0, 1, 0, 2) # => [2, :foo, "bar", :foo, 2]
+ * a.values_at(1, 0..2) # => ["bar", :foo, "bar", 2]
*
* Assigns +nil+ for an +index+ that is too large:
* a = [:foo, 'bar', 2]