Gecko [ beriskala.com ]

Name	Size	Permission	Date
%26-i.ri	951 B	-rw-r--r--	2026-04-07 16:51
%2a-i.ri	768 B	-rw-r--r--	2026-04-07 16:51
%2b-i.ri	600 B	-rw-r--r--	2026-04-07 16:51
%2d-i.ri	915 B	-rw-r--r--	2026-04-07 16:51
%3c%3c-i.ri	717 B	-rw-r--r--	2026-04-07 16:51
%3c%3d%3e-i.ri	1.6 KB	-rw-r--r--	2026-04-07 16:51
%3d%3d-i.ri	1.18 KB	-rw-r--r--	2026-04-07 16:51
%5b%5d%3d-i.ri	5.02 KB	-rw-r--r--	2026-04-07 16:51
%5b%5d-c.ri	619 B	-rw-r--r--	2026-04-07 16:51
%5b%5d-i.ri	4.45 KB	-rw-r--r--	2026-04-07 16:51
%7c-i.ri	725 B	-rw-r--r--	2026-04-07 16:51
all%3f-i.ri	1.74 KB	-rw-r--r--	2026-04-07 16:51
any%3f-i.ri	1.74 KB	-rw-r--r--	2026-04-07 16:51
append-i.ri	861 B	-rw-r--r--	2026-04-07 16:51
assoc-i.ri	727 B	-rw-r--r--	2026-04-07 16:51
at-i.ri	1002 B	-rw-r--r--	2026-04-07 16:51
bsearch-i.ri	631 B	-rw-r--r--	2026-04-07 16:51
bsearch_index-i.ri	670 B	-rw-r--r--	2026-04-07 16:51
cdesc-Array.ri	27.96 KB	-rw-r--r--	2026-04-07 16:51
clear-i.ri	529 B	-rw-r--r--	2026-04-07 16:51
collect%21-i.ri	900 B	-rw-r--r--	2026-04-07 16:51
collect-i.ri	901 B	-rw-r--r--	2026-04-07 16:51
combination-i.ri	1.73 KB	-rw-r--r--	2026-04-07 16:51
compact%21-i.ri	757 B	-rw-r--r--	2026-04-07 16:51
compact-i.ri	678 B	-rw-r--r--	2026-04-07 16:51
concat-i.ri	658 B	-rw-r--r--	2026-04-07 16:51
count-i.ri	1.19 KB	-rw-r--r--	2026-04-07 16:51
cycle-i.ri	1.46 KB	-rw-r--r--	2026-04-07 16:51
delete-i.ri	1.45 KB	-rw-r--r--	2026-04-07 16:51
delete_at-i.ri	1.12 KB	-rw-r--r--	2026-04-07 16:51
delete_if-i.ri	811 B	-rw-r--r--	2026-04-07 16:51
difference-i.ri	1 KB	-rw-r--r--	2026-04-07 16:51
dig-i.ri	885 B	-rw-r--r--	2026-04-07 16:51
drop-i.ri	789 B	-rw-r--r--	2026-04-07 16:51
drop_while-i.ri	904 B	-rw-r--r--	2026-04-07 16:51
each-i.ri	1.05 KB	-rw-r--r--	2026-04-07 16:51
each_index-i.ri	1.06 KB	-rw-r--r--	2026-04-07 16:51
empty%3f-i.ri	492 B	-rw-r--r--	2026-04-07 16:51
eql%3f-i.ri	844 B	-rw-r--r--	2026-04-07 16:51
fetch-i.ri	1.74 KB	-rw-r--r--	2026-04-07 16:51
fetch_values-i.ri	1.62 KB	-rw-r--r--	2026-04-07 16:51
fill-i.ri	9.09 KB	-rw-r--r--	2026-04-07 16:51
filter%21-i.ri	879 B	-rw-r--r--	2026-04-07 16:51
filter-i.ri	788 B	-rw-r--r--	2026-04-07 16:51
find_index-i.ri	1.41 KB	-rw-r--r--	2026-04-07 16:51
first-i.ri	1.04 KB	-rw-r--r--	2026-04-07 16:51
flatten%21-i.ri	1.94 KB	-rw-r--r--	2026-04-07 16:51
flatten-i.ri	1.92 KB	-rw-r--r--	2026-04-07 16:51
freeze-i.ri	633 B	-rw-r--r--	2026-04-07 16:51
hash-i.ri	657 B	-rw-r--r--	2026-04-07 16:51
include%3f-i.ri	669 B	-rw-r--r--	2026-04-07 16:51
index-i.ri	1.19 KB	-rw-r--r--	2026-04-07 16:51
initialize_copy-i.ri	821 B	-rw-r--r--	2026-04-07 16:51
insert-i.ri	1.56 KB	-rw-r--r--	2026-04-07 16:51
inspect-i.ri	645 B	-rw-r--r--	2026-04-07 16:51
intersect%3f-i.ri	741 B	-rw-r--r--	2026-04-07 16:51
intersection-i.ri	978 B	-rw-r--r--	2026-04-07 16:51
join-i.ri	1.3 KB	-rw-r--r--	2026-04-07 16:51
keep_if-i.ri	802 B	-rw-r--r--	2026-04-07 16:51
last-i.ri	1.05 KB	-rw-r--r--	2026-04-07 16:51
length-i.ri	568 B	-rw-r--r--	2026-04-07 16:51
map%21-i.ri	765 B	-rw-r--r--	2026-04-07 16:51
map-i.ri	815 B	-rw-r--r--	2026-04-07 16:51
max-i.ri	2.03 KB	-rw-r--r--	2026-04-07 16:51
min-i.ri	2.02 KB	-rw-r--r--	2026-04-07 16:51
minmax-i.ri	1.05 KB	-rw-r--r--	2026-04-07 16:51
new-c.ri	2.25 KB	-rw-r--r--	2026-04-07 16:51
none%3f-i.ri	1.49 KB	-rw-r--r--	2026-04-07 16:51
one%3f-i.ri	1.56 KB	-rw-r--r--	2026-04-07 16:51
pack-i.ri	438 B	-rw-r--r--	2026-04-07 16:51
permutation-i.ri	1.75 KB	-rw-r--r--	2026-04-07 16:51
pop-i.ri	1.09 KB	-rw-r--r--	2026-04-07 16:51
prepend-i.ri	593 B	-rw-r--r--	2026-04-07 16:51
product-i.ri	2.28 KB	-rw-r--r--	2026-04-07 16:51
push-i.ri	913 B	-rw-r--r--	2026-04-07 16:51
rassoc-i.ri	761 B	-rw-r--r--	2026-04-07 16:51
reject%21-i.ri	904 B	-rw-r--r--	2026-04-07 16:51
reject-i.ri	795 B	-rw-r--r--	2026-04-07 16:51
repeated_combination-i.ri	1.72 KB	-rw-r--r--	2026-04-07 16:51
repeated_permutation-i.ri	1.74 KB	-rw-r--r--	2026-04-07 16:51
replace-i.ri	741 B	-rw-r--r--	2026-04-07 16:51
reverse%21-i.ri	595 B	-rw-r--r--	2026-04-07 16:51
reverse-i.ri	553 B	-rw-r--r--	2026-04-07 16:51
reverse_each-i.ri	999 B	-rw-r--r--	2026-04-07 16:51
rindex-i.ri	1.22 KB	-rw-r--r--	2026-04-07 16:51
rotate%21-i.ri	1.32 KB	-rw-r--r--	2026-04-07 16:51
rotate-i.ri	1.33 KB	-rw-r--r--	2026-04-07 16:51
sample-i.ri	1.86 KB	-rw-r--r--	2026-04-07 16:51
select%21-i.ri	1018 B	-rw-r--r--	2026-04-07 16:51
select-i.ri	962 B	-rw-r--r--	2026-04-07 16:51
shelljoin-i.ri	524 B	-rw-r--r--	2026-04-07 16:51
shift-i.ri	1.28 KB	-rw-r--r--	2026-04-07 16:51
shuffle%21-i.ri	1.08 KB	-rw-r--r--	2026-04-07 16:51
shuffle-i.ri	1.08 KB	-rw-r--r--	2026-04-07 16:51
size-i.ri	526 B	-rw-r--r--	2026-04-07 16:51
slice%21-i.ri	3.24 KB	-rw-r--r--	2026-04-07 16:51
slice-i.ri	4.21 KB	-rw-r--r--	2026-04-07 16:51
sort%21-i.ri	489 B	-rw-r--r--	2026-04-07 16:51
sort-i.ri	1.36 KB	-rw-r--r--	2026-04-07 16:51
sort_by%21-i.ri	990 B	-rw-r--r--	2026-04-07 16:51
sum-i.ri	1.82 KB	-rw-r--r--	2026-04-07 16:51
take-i.ri	781 B	-rw-r--r--	2026-04-07 16:51
take_while-i.ri	1.02 KB	-rw-r--r--	2026-04-07 16:51
to_a-i.ri	760 B	-rw-r--r--	2026-04-07 16:51
to_ary-i.ri	298 B	-rw-r--r--	2026-04-07 16:51
to_h-i.ri	1.18 KB	-rw-r--r--	2026-04-07 16:51
to_s-i.ri	595 B	-rw-r--r--	2026-04-07 16:51
transpose-i.ri	731 B	-rw-r--r--	2026-04-07 16:51
try_convert-c.ri	827 B	-rw-r--r--	2026-04-07 16:51
union-i.ri	1.01 KB	-rw-r--r--	2026-04-07 16:51
uniq%21-i.ri	1.28 KB	-rw-r--r--	2026-04-07 16:51
uniq-i.ri	1.19 KB	-rw-r--r--	2026-04-07 16:51
unshift-i.ri	651 B	-rw-r--r--	2026-04-07 16:51
values_at-i.ri	4.53 KB	-rw-r--r--	2026-04-07 16:51
zip-i.ri	3.24 KB	-rw-r--r--	2026-04-07 16:51

Rename

U:RDoc::AnyMethod[iI"
slice:ETI"Array#slice;TF:publico:RDoc::Markup::Document:@parts[4o:RDoc::Markup::Paragraph;	[I":Returns elements from +self+; does not modify +self+.;To:RDoc::Markup::BlankLine�o;
;	[I"In brief:;T@o:RDoc::Markup::Verbatim;	[I"a = [:foo, 'bar', 2]
;TI"
;TI"3# Single argument index: returns one element.
;TI"5a[0]     # => :foo          # Zero-based index.
;TI"Ma[-1]    # => 2             # Negative index counts backwards from end.
;TI"
;TI"5# Arguments start and length: returns an array.
;TI"a[1, 2]  # => ["bar", 2]
;TI"Ma[-2, 2] # => ["bar", 2]    # Negative start counts backwards from end.
;TI"
;TI"0# Single argument range: returns an array.
;TI"!a[0..1]  # => [:foo, "bar"]
;TI"Sa[0..-2] # => [:foo, "bar"] # Negative range-begin counts backwards from end.
;TI"Qa[-2..2] # => ["bar", 2]    # Negative range-end counts backwards from end.
;T:@format0o;
;	[I"\When a single integer argument +index+ is given, returns the element at offset +index+:;T@o;;	[	I"a = [:foo, 'bar', 2]
;TI"a[0] # => :foo
;TI"a[2] # => 2
;TI"a # => [:foo, "bar", 2]
;T;
0o;
;	[I"EIf +index+ is negative, counts backwards from the end of +self+:;T@o;;	[I"a = [:foo, 'bar', 2]
;TI"a[-1] # => 2
;TI"a[-2] # => "bar"
;T;
0o;
;	[I"/If +index+ is out of range, returns +nil+.;T@o;
;	[I"@When two Integer arguments +start+ and +length+ are given, ;TI"greturns a new +Array+ of size +length+ containing successive elements beginning at offset +start+:;T@o;;	[I"a = [:foo, 'bar', 2]
;TI" a[0, 2] # => [:foo, "bar"]
;TI"a[1, 2] # => ["bar", 2]
;T;
0o;
;	[I"FIf <tt>start + length</tt> is greater than <tt>self.length</tt>, ;TI"9returns all elements from offset +start+ to the end:;T@o;;	[	I"a = [:foo, 'bar', 2]
;TI"#a[0, 4] # => [:foo, "bar", 2]
;TI"a[1, 3] # => ["bar", 2]
;TI"a[2, 2] # => [2]
;T;
0o;
;	[I">If <tt>start == self.size</tt> and <tt>length >= 0</tt>, ;TI"!returns a new empty +Array+.;T@o;
;	[I",If +length+ is negative, returns +nil+.;T@o;
;	[I"4When a single Range argument +range+ is given, ;TI"0treats <tt>range.min</tt> as +start+ above ;TI"/and <tt>range.size</tt> as +length+ above:;T@o;;	[I"a = [:foo, 'bar', 2]
;TI" a[0..1] # => [:foo, "bar"]
;TI"a[1..2] # => ["bar", 2]
;T;
0o;
;	[I"RSpecial case: If <tt>range.start == a.size</tt>, returns a new empty +Array+.;T@o;
;	[I"NIf <tt>range.end</tt> is negative, calculates the end index from the end:;T@o;;	[	I"a = [:foo, 'bar', 2]
;TI"$a[0..-1] # => [:foo, "bar", 2]
;TI"!a[0..-2] # => [:foo, "bar"]
;TI"a[0..-3] # => [:foo]
;T;
0o;
;	[I"RIf <tt>range.start</tt> is negative, calculates the start index from the end:;T@o;;	[	I"a = [:foo, 'bar', 2]
;TI"a[-1..2] # => [2]
;TI"a[-2..2] # => ["bar", 2]
;TI"$a[-3..2] # => [:foo, "bar", 2]
;T;
0o;
;	[I"JIf <tt>range.start</tt> is larger than the array size, returns +nil+.;T@o;;	[	I"a = [:foo, 'bar', 2]
;TI"a[4..1] # => nil
;TI"a[4..0] # => nil
;TI"a[4..-1] # => nil
;T;
0o;
;	[I"LWhen a single Enumerator::ArithmeticSequence argument +aseq+ is given, ;TI"Mreturns an +Array+ of elements corresponding to the indexes produced by ;TI"the sequence.;T@o;;	[I"7a = ['--', 'data1', '--', 'data2', '--', 'data3']
;TI"7a[(1..).step(2)] # => ["data1", "data2", "data3"]
;T;
0o;
;	[I"SUnlike slicing with range, if the start or the end of the arithmetic sequence ;TI"2is larger than array size, throws RangeError.;T@o;;	[
I"7a = ['--', 'data1', '--', 'data2', '--', 'data3']
;TI"a[(1..11).step(2)]
;TI"3# RangeError (((1..11).step(2)) out of range)
;TI"a[(7..).step(2)]
;TI"1# RangeError (((7..).step(2)) out of range)
;T;
0o;
;	[I"QIf given a single argument, and its type is not one of the listed, tries to ;TI";convert it to Integer, and raises if it is impossible:;T@o;;	[I"a = [:foo, 'bar', 2]
;TI"I# Raises TypeError (no implicit conversion of Symbol into Integer):
;TI"
a[:foo]
;T;
0o;
;	[I"NRelated: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].;T:
@fileI"array.c;T:0@omit_headings_from_table_of_contents_below000[�I"(*args);T@�FI"
Array;TcRDoc::NormalClass0[@�FI"[];T