Gecko [ beriskala.com ]

Name	Size	Permission	Date
%26-i.ri	799 B	-rw-r--r--	2026-04-07 17:22
%2a-i.ri	778 B	-rw-r--r--	2026-04-07 17:22
%2b-i.ri	546 B	-rw-r--r--	2026-04-07 17:22
%2d-i.ri	737 B	-rw-r--r--	2026-04-07 17:22
%3c%3c-i.ri	645 B	-rw-r--r--	2026-04-07 17:22
%3c%3d%3e-i.ri	1.2 KB	-rw-r--r--	2026-04-07 17:22
%3d%3d-i.ri	781 B	-rw-r--r--	2026-04-07 17:22
%5b%5d%3d-i.ri	4.12 KB	-rw-r--r--	2026-04-07 17:22
%5b%5d-c.ri	530 B	-rw-r--r--	2026-04-07 17:22
%5b%5d-i.ri	3.71 KB	-rw-r--r--	2026-04-07 17:22
%7c-i.ri	681 B	-rw-r--r--	2026-04-07 17:22
abbrev-i.ri	1008 B	-rw-r--r--	2026-04-07 17:22
all%3f-i.ri	1.47 KB	-rw-r--r--	2026-04-07 17:22
any%3f-i.ri	1.47 KB	-rw-r--r--	2026-04-07 17:22
append-i.ri	814 B	-rw-r--r--	2026-04-07 17:22
assoc-i.ri	641 B	-rw-r--r--	2026-04-07 17:22
at-i.ri	467 B	-rw-r--r--	2026-04-07 17:22
bsearch-i.ri	485 B	-rw-r--r--	2026-04-07 17:22
bsearch_index-i.ri	501 B	-rw-r--r--	2026-04-07 17:22
cdesc-Array.ri	26.29 KB	-rw-r--r--	2026-04-07 17:22
clear-i.ri	431 B	-rw-r--r--	2026-04-07 17:22
collect%21-i.ri	788 B	-rw-r--r--	2026-04-07 17:22
collect-i.ri	829 B	-rw-r--r--	2026-04-07 17:22
combination-i.ri	1.71 KB	-rw-r--r--	2026-04-07 17:22
compact%21-i.ri	434 B	-rw-r--r--	2026-04-07 17:22
compact-i.ri	498 B	-rw-r--r--	2026-04-07 17:22
concat-i.ri	524 B	-rw-r--r--	2026-04-07 17:22
count-i.ri	1.14 KB	-rw-r--r--	2026-04-07 17:22
cycle-i.ri	1.44 KB	-rw-r--r--	2026-04-07 17:22
delete-i.ri	1.36 KB	-rw-r--r--	2026-04-07 17:22
delete_at-i.ri	922 B	-rw-r--r--	2026-04-07 17:22
delete_if-i.ri	780 B	-rw-r--r--	2026-04-07 17:22
difference-i.ri	860 B	-rw-r--r--	2026-04-07 17:22
dig-i.ri	806 B	-rw-r--r--	2026-04-07 17:22
drop-i.ri	671 B	-rw-r--r--	2026-04-07 17:22
drop_while-i.ri	998 B	-rw-r--r--	2026-04-07 17:22
each-i.ri	1.3 KB	-rw-r--r--	2026-04-07 17:22
each_index-i.ri	1.25 KB	-rw-r--r--	2026-04-07 17:22
empty%3f-i.ri	378 B	-rw-r--r--	2026-04-07 17:22
eql%3f-i.ri	759 B	-rw-r--r--	2026-04-07 17:22
fetch-i.ri	1.43 KB	-rw-r--r--	2026-04-07 17:22
fill-i.ri	8.04 KB	-rw-r--r--	2026-04-07 17:22
filter%21-i.ri	892 B	-rw-r--r--	2026-04-07 17:22
filter-i.ri	808 B	-rw-r--r--	2026-04-07 17:22
find_index-i.ri	1.43 KB	-rw-r--r--	2026-04-07 17:22
first-i.ri	1.14 KB	-rw-r--r--	2026-04-07 17:22
flatten%21-i.ri	1.34 KB	-rw-r--r--	2026-04-07 17:22
flatten-i.ri	1.52 KB	-rw-r--r--	2026-04-07 17:22
hash-i.ri	599 B	-rw-r--r--	2026-04-07 17:22
include%3f-i.ri	549 B	-rw-r--r--	2026-04-07 17:22
index-i.ri	1.3 KB	-rw-r--r--	2026-04-07 17:22
initialize_copy-i.ri	568 B	-rw-r--r--	2026-04-07 17:22
insert-i.ri	1.3 KB	-rw-r--r--	2026-04-07 17:22
inspect-i.ri	540 B	-rw-r--r--	2026-04-07 17:22
intersect%3f-i.ri	752 B	-rw-r--r--	2026-04-07 17:22
intersection-i.ri	984 B	-rw-r--r--	2026-04-07 17:22
join-i.ri	1.23 KB	-rw-r--r--	2026-04-07 17:22
keep_if-i.ri	806 B	-rw-r--r--	2026-04-07 17:22
last-i.ri	1.13 KB	-rw-r--r--	2026-04-07 17:22
length-i.ri	345 B	-rw-r--r--	2026-04-07 17:22
map%21-i.ri	713 B	-rw-r--r--	2026-04-07 17:22
map-i.ri	751 B	-rw-r--r--	2026-04-07 17:22
max-i.ri	1.77 KB	-rw-r--r--	2026-04-07 17:22
min-i.ri	1.76 KB	-rw-r--r--	2026-04-07 17:22
minmax-i.ri	1.17 KB	-rw-r--r--	2026-04-07 17:22
new-c.ri	1.79 KB	-rw-r--r--	2026-04-07 17:22
none%3f-i.ri	1.37 KB	-rw-r--r--	2026-04-07 17:22
one%3f-i.ri	1.52 KB	-rw-r--r--	2026-04-07 17:22
pack-i.ri	439 B	-rw-r--r--	2026-04-07 17:22
permutation-i.ri	2.3 KB	-rw-r--r--	2026-04-07 17:22
pop-i.ri	1.08 KB	-rw-r--r--	2026-04-07 17:22
prepend-i.ri	523 B	-rw-r--r--	2026-04-07 17:22
product-i.ri	2.22 KB	-rw-r--r--	2026-04-07 17:22
push-i.ri	847 B	-rw-r--r--	2026-04-07 17:22
rassoc-i.ri	642 B	-rw-r--r--	2026-04-07 17:22
reject%21-i.ri	854 B	-rw-r--r--	2026-04-07 17:22
reject-i.ri	800 B	-rw-r--r--	2026-04-07 17:22
repeated_combination-i.ri	2.06 KB	-rw-r--r--	2026-04-07 17:22
repeated_permutation-i.ri	2.12 KB	-rw-r--r--	2026-04-07 17:22
replace-i.ri	519 B	-rw-r--r--	2026-04-07 17:22
reverse%21-i.ri	459 B	-rw-r--r--	2026-04-07 17:22
reverse-i.ri	516 B	-rw-r--r--	2026-04-07 17:22
reverse_each-i.ri	1.36 KB	-rw-r--r--	2026-04-07 17:22
rindex-i.ri	1.39 KB	-rw-r--r--	2026-04-07 17:22
rotate%21-i.ri	1.55 KB	-rw-r--r--	2026-04-07 17:22
rotate-i.ri	1.7 KB	-rw-r--r--	2026-04-07 17:22
sample-i.ri	1.65 KB	-rw-r--r--	2026-04-07 17:22
select%21-i.ri	976 B	-rw-r--r--	2026-04-07 17:22
select-i.ri	888 B	-rw-r--r--	2026-04-07 17:22
shelljoin-i.ri	525 B	-rw-r--r--	2026-04-07 17:22
shift-i.ri	1.19 KB	-rw-r--r--	2026-04-07 17:22
shuffle%21-i.ri	664 B	-rw-r--r--	2026-04-07 17:22
shuffle-i.ri	674 B	-rw-r--r--	2026-04-07 17:22
size-i.ri	310 B	-rw-r--r--	2026-04-07 17:22
slice%21-i.ri	2.4 KB	-rw-r--r--	2026-04-07 17:22
slice-i.ri	3.43 KB	-rw-r--r--	2026-04-07 17:22
sort%21-i.ri	1.57 KB	-rw-r--r--	2026-04-07 17:22
sort-i.ri	1.65 KB	-rw-r--r--	2026-04-07 17:22
sort_by%21-i.ri	1.09 KB	-rw-r--r--	2026-04-07 17:22
sum-i.ri	1.58 KB	-rw-r--r--	2026-04-07 17:22
take-i.ri	679 B	-rw-r--r--	2026-04-07 17:22
take_while-i.ri	1.06 KB	-rw-r--r--	2026-04-07 17:22
to_a-i.ri	814 B	-rw-r--r--	2026-04-07 17:22
to_ary-i.ri	299 B	-rw-r--r--	2026-04-07 17:22
to_h-i.ri	1.1 KB	-rw-r--r--	2026-04-07 17:22
to_s-i.ri	503 B	-rw-r--r--	2026-04-07 17:22
transpose-i.ri	578 B	-rw-r--r--	2026-04-07 17:22
try_convert-c.ri	705 B	-rw-r--r--	2026-04-07 17:22
union-i.ri	836 B	-rw-r--r--	2026-04-07 17:22
uniq%21-i.ri	1.22 KB	-rw-r--r--	2026-04-07 17:22
uniq-i.ri	1.02 KB	-rw-r--r--	2026-04-07 17:22
unshift-i.ri	561 B	-rw-r--r--	2026-04-07 17:22
values_at-i.ri	1.61 KB	-rw-r--r--	2026-04-07 17:22
zip-i.ri	2.14 KB	-rw-r--r--	2026-04-07 17:22

Rename

U:RDoc::AnyMethod[iI"	fill:ETI"Array#fill;TF:privateo:RDoc::Markup::Document:@parts[ao:RDoc::Markup::Paragraph;	[I"RReplaces specified elements in +self+ with specified objects; returns +self+.;To:RDoc::Markup::BlankLine�o;
;	[I"XWith argument +obj+ and no block given, replaces all elements with that one object:;T@o:RDoc::Markup::Verbatim;	[I"a = ['a', 'b', 'c', 'd']
;TI"!a # => ["a", "b", "c", "d"]
;TI"&a.fill(:X) # => [:X, :X, :X, :X]
;T:@format0o;
;	[I"CWith arguments +obj+ and Integer +start+, and no block given, ;TI"0replaces elements based on the given start.;T@o;
;	[I"@If +start+ is in range (<tt>0 <= start < array.size</tt>), ;TI"?replaces all elements from offset +start+ through the end:;T@o;;	[I"a = ['a', 'b', 'c', 'd']
;TI"+a.fill(:X, 2) # => ["a", "b", :X, :X]
;T;
0o;
;	[I"JIf +start+ is too large (<tt>start >= array.size</tt>), does nothing:;T@o;;	[	I"a = ['a', 'b', 'c', 'd']
;TI"-a.fill(:X, 4) # => ["a", "b", "c", "d"]
;TI"a = ['a', 'b', 'c', 'd']
;TI"-a.fill(:X, 5) # => ["a", "b", "c", "d"]
;T;
0o;
;	[I"aIf +start+ is negative, counts from the end (starting index is <tt>start + array.size</tt>):;T@o;;	[I"a = ['a', 'b', 'c', 'd']
;TI",a.fill(:X, -2) # => ["a", "b", :X, :X]
;T;
0o;
;	[I"RIf +start+ is too small (less than and far from zero), replaces all elements:;T@o;;	[	I"a = ['a', 'b', 'c', 'd']
;TI"*a.fill(:X, -6) # => [:X, :X, :X, :X]
;TI"a = ['a', 'b', 'c', 'd']
;TI"+a.fill(:X, -50) # => [:X, :X, :X, :X]
;T;
0o;
;	[I"VWith arguments +obj+, Integer +start+, and Integer +length+, and no block given, ;TI"?replaces elements based on the given +start+ and +length+.;T@o;
;	[I"TIf +start+ is in range, replaces +length+ elements beginning at offset +start+:;T@o;;	[I"a = ['a', 'b', 'c', 'd']
;TI"/a.fill(:X, 1, 1) # => ["a", :X, "c", "d"]
;T;
0o;
;	[I"1If +start+ is negative, counts from the end:;T@o;;	[I"a = ['a', 'b', 'c', 'd']
;TI"0a.fill(:X, -2, 1) # => ["a", "b", :X, "d"]
;T;
0o;
;	[I"SIf +start+ is large (<tt>start >= array.size</tt>), extends +self+ with +nil+:;T@o;;	[	I"a = ['a', 'b', 'c', 'd']
;TI"5a.fill(:X, 5, 0) # => ["a", "b", "c", "d", nil]
;TI"a = ['a', 'b', 'c', 'd']
;TI"=a.fill(:X, 5, 2) # => ["a", "b", "c", "d", nil, :X, :X]
;T;
0o;
;	[I";If +length+ is zero or negative, replaces no elements:;T@o;;	[I"a = ['a', 'b', 'c', 'd']
;TI"0a.fill(:X, 1, 0) # => ["a", "b", "c", "d"]
;TI"1a.fill(:X, 1, -1) # => ["a", "b", "c", "d"]
;T;
0o;
;	[I"AWith arguments +obj+ and Range +range+, and no block given, ;TI"0replaces elements based on the given range.;T@o;
;	[I"UIf the range is positive and ascending (<tt>0 < range.begin <= range.end</tt>), ;TI"Greplaces elements from <tt>range.begin</tt> to <tt>range.end</tt>:;T@o;;	[I"a = ['a', 'b', 'c', 'd']
;TI"1a.fill(:X, (1..1)) # => ["a", :X, "c", "d"]
;T;
0o;
;	[I"?If <tt>range.first</tt> is negative, replaces no elements:;T@o;;	[I"a = ['a', 'b', 'c', 'd']
;TI"3a.fill(:X, (-1..1)) # => ["a", "b", "c", "d"]
;T;
0o;
;	[I"=If <tt>range.last</tt> is negative, counts from the end:;T@o;;	[	I"a = ['a', 'b', 'c', 'd']
;TI"0a.fill(:X, (0..-2)) # => [:X, :X, :X, "d"]
;TI"a = ['a', 'b', 'c', 'd']
;TI"1a.fill(:X, (1..-2)) # => ["a", :X, :X, "d"]
;T;
0o;
;	[I"GIf <tt>range.last</tt> and <tt>range.last</tt> are both negative, ;TI"*both count from the end of the array:;T@o;;	[	I"a = ['a', 'b', 'c', 'd']
;TI"3a.fill(:X, (-1..-1)) # => ["a", "b", "c", :X]
;TI"a = ['a', 'b', 'c', 'd']
;TI"3a.fill(:X, (-2..-2)) # => ["a", "b", :X, "d"]
;T;
0o;
;	[I"KWith no arguments and a block given, calls the block with each index; ;TI"Freplaces the corresponding element with the block's return value:;T@o;;	[I"a = ['a', 'b', 'c', 'd']
;TI"Qa.fill { |index| "new_#{index}" } # => ["new_0", "new_1", "new_2", "new_3"]
;T;
0o;
;	[I"NWith argument +start+ and a block given, calls the block with each index ;TI"Hfrom offset +start+ to the end; replaces the corresponding element ;TI"#with the block's return value.;T@o;
;	[I">If start is in range (<tt>0 <= start < array.size</tt>), ;TI"-replaces from offset +start+ to the end:;T@o;;	[I"a = ['a', 'b', 'c', 'd']
;TI"Pa.fill(1) { |index| "new_#{index}" } # => ["a", "new_1", "new_2", "new_3"]
;T;
0o;
;	[I"IIf +start+ is too large(<tt>start >= array.size</tt>), does nothing:;T@o;;	[	I"a = ['a', 'b', 'c', 'd']
;TI"Ja.fill(4) { |index| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
;TI"a = ['a', 'b', 'c', 'd']
;TI"Ja.fill(4) { |index| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
;T;
0o;
;	[I"1If +start+ is negative, counts from the end:;T@o;;	[I"a = ['a', 'b', 'c', 'd']
;TI"Ma.fill(-2) { |index| "new_#{index}" } # => ["a", "b", "new_2", "new_3"]
;T;
0o;
;	[I"QIf start is too small (<tt>start <= -array.size</tt>, replaces all elements:;T@o;;	[	I"a = ['a', 'b', 'c', 'd']
;TI"Ua.fill(-6) { |index| "new_#{index}" } # => ["new_0", "new_1", "new_2", "new_3"]
;TI"a = ['a', 'b', 'c', 'd']
;TI"Va.fill(-50) { |index| "new_#{index}" } # => ["new_0", "new_1", "new_2", "new_3"]
;T;
0o;
;	[I"=With arguments +start+ and +length+, and a block given, ;TI"?calls the block for each index specified by start length; ;TI"Freplaces the corresponding element with the block's return value.;T@o;
;	[I"TIf +start+ is in range, replaces +length+ elements beginning at offset +start+:;T@o;;	[I"a = ['a', 'b', 'c', 'd']
;TI"Ka.fill(1, 1) { |index| "new_#{index}" } # => ["a", "new_1", "c", "d"]
;T;
0o;
;	[I"/If start is negative, counts from the end:;T@o;;	[I"a = ['a', 'b', 'c', 'd']
;TI"La.fill(-2, 1) { |index| "new_#{index}" } # => ["a", "b", "new_2", "d"]
;T;
0o;
;	[I"SIf +start+ is large (<tt>start >= array.size</tt>), extends +self+ with +nil+:;T@o;;	[	I"a = ['a', 'b', 'c', 'd']
;TI"La.fill(5, 0) { |index| "new_#{index}" } # => ["a", "b", "c", "d", nil]
;TI"a = ['a', 'b', 'c', 'd']
;TI"^a.fill(5, 2) { |index| "new_#{index}" } # => ["a", "b", "c", "d", nil, "new_5", "new_6"]
;T;
0o;
;	[I"7If +length+ is zero or less, replaces no elements:;T@o;;	[I"a = ['a', 'b', 'c', 'd']
;TI"Ga.fill(1, 0) { |index| "new_#{index}" } # => ["a", "b", "c", "d"]
;TI"Ha.fill(1, -1) { |index| "new_#{index}" } # => ["a", "b", "c", "d"]
;T;
0o;
;	[I":With arguments +obj+ and +range+, and a block given, ;TI"9calls the block with each index in the given range; ;TI"Freplaces the corresponding element with the block's return value.;T@o;
;	[I"ZIf the range is positive and ascending (<tt>range 0 < range.begin <= range.end</tt>, ;TI"Greplaces elements from <tt>range.begin</tt> to <tt>range.end</tt>:;T@o;;	[I"a = ['a', 'b', 'c', 'd']
;TI"Ka.fill(1..1) { |index| "new_#{index}" } # => ["a", "new_1", "c", "d"]
;T;
0o;
;	[I"0If +range.first+ is negative, does nothing:;T@o;;	[I"a = ['a', 'b', 'c', 'd']
;TI"Na.fill(-1..1) { |index| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
;T;
0o;
;	[I"=If <tt>range.last</tt> is negative, counts from the end:;T@o;;	[	I"a = ['a', 'b', 'c', 'd']
;TI"Ta.fill(0..-2) { |index| "new_#{index}" } # => ["new_0", "new_1", "new_2", "d"]
;TI"a = ['a', 'b', 'c', 'd']
;TI"Pa.fill(1..-2) { |index| "new_#{index}" } # => ["a", "new_1", "new_2", "d"]
;T;
0o;
;	[I"HIf <tt>range.first</tt> and <tt>range.last</tt> are both negative, ;TI"both count from the end:;T@o;;	[	I"a = ['a', 'b', 'c', 'd']
;TI"Ma.fill(-1..-1) { |index| "new_#{index}" } # => ["a", "b", "c", "new_3"]
;TI"a = ['a', 'b', 'c', 'd']
;TI"La.fill(-2..-2) { |index| "new_#{index}" } # => ["a", "b", "new_2", "d"];T;
0:
@fileI"array.c;T:0@omit_headings_from_table_of_contents_below0I""array.fill(obj) -> self
array.fill(obj, start) -> self
array.fill(obj, start, length) -> self
array.fill(obj, range) -> self
array.fill {|index| ... } -> self
array.fill(start) {|index| ... } -> self
array.fill(start, length) {|index| ... } -> self
array.fill(range) {|index| ... } -> self
;T0[�I"(p1 = v1, p2 = v2);T@�FI"
Array;TcRDoc::NormalClass00