Gecko [ beriskala.com ]

Name	Size	Permission	Date
%26-i.ri	718 B	-rw-r--r--	2025-04-28 21:06
%2a-i.ri	751 B	-rw-r--r--	2025-04-28 21:06
%2b-i.ri	519 B	-rw-r--r--	2025-04-28 21:06
%2d-i.ri	710 B	-rw-r--r--	2025-04-28 21:06
%3c%3c-i.ri	616 B	-rw-r--r--	2025-04-28 21:06
%3c%3d%3e-i.ri	1.19 KB	-rw-r--r--	2025-04-28 21:06
%3d%3d-i.ri	779 B	-rw-r--r--	2025-04-28 21:06
%5b%5d%3d-i.ri	4.09 KB	-rw-r--r--	2025-04-28 21:06
%5b%5d-c.ri	530 B	-rw-r--r--	2025-04-28 21:06
%5b%5d-i.ri	3.74 KB	-rw-r--r--	2025-04-28 21:06
%7c-i.ri	654 B	-rw-r--r--	2025-04-28 21:06
abbrev-i.ri	1008 B	-rw-r--r--	2025-04-28 21:06
all%3f-i.ri	1.37 KB	-rw-r--r--	2025-04-28 21:06
any%3f-i.ri	1.36 KB	-rw-r--r--	2025-04-28 21:06
append-i.ri	868 B	-rw-r--r--	2025-04-28 21:06
assoc-i.ri	639 B	-rw-r--r--	2025-04-28 21:06
at-i.ri	468 B	-rw-r--r--	2025-04-28 21:06
bsearch-i.ri	485 B	-rw-r--r--	2025-04-28 21:06
bsearch_index-i.ri	501 B	-rw-r--r--	2025-04-28 21:06
cdesc-Array.ri	25.31 KB	-rw-r--r--	2025-04-28 21:06
clear-i.ri	404 B	-rw-r--r--	2025-04-28 21:06
collect%21-i.ri	869 B	-rw-r--r--	2025-04-28 21:06
collect-i.ri	859 B	-rw-r--r--	2025-04-28 21:06
combination-i.ri	1.69 KB	-rw-r--r--	2025-04-28 21:06
compact%21-i.ri	434 B	-rw-r--r--	2025-04-28 21:06
compact-i.ri	471 B	-rw-r--r--	2025-04-28 21:06
concat-i.ri	497 B	-rw-r--r--	2025-04-28 21:06
count-i.ri	1.13 KB	-rw-r--r--	2025-04-28 21:06
cycle-i.ri	1.43 KB	-rw-r--r--	2025-04-28 21:06
deconstruct-i.ri	229 B	-rw-r--r--	2025-04-28 21:06
delete-i.ri	1.37 KB	-rw-r--r--	2025-04-28 21:06
delete_at-i.ri	919 B	-rw-r--r--	2025-04-28 21:06
delete_if-i.ri	752 B	-rw-r--r--	2025-04-28 21:06
difference-i.ri	858 B	-rw-r--r--	2025-04-28 21:06
dig-i.ri	804 B	-rw-r--r--	2025-04-28 21:06
drop-i.ri	670 B	-rw-r--r--	2025-04-28 21:06
drop_while-i.ri	994 B	-rw-r--r--	2025-04-28 21:06
each-i.ri	1.29 KB	-rw-r--r--	2025-04-28 21:06
each_index-i.ri	1.24 KB	-rw-r--r--	2025-04-28 21:06
empty%3f-i.ri	378 B	-rw-r--r--	2025-04-28 21:06
eql%3f-i.ri	776 B	-rw-r--r--	2025-04-28 21:06
fetch-i.ri	1.42 KB	-rw-r--r--	2025-04-28 21:06
fill-i.ri	7.99 KB	-rw-r--r--	2025-04-28 21:06
filter%21-i.ri	949 B	-rw-r--r--	2025-04-28 21:06
filter-i.ri	889 B	-rw-r--r--	2025-04-28 21:06
find_index-i.ri	1.48 KB	-rw-r--r--	2025-04-28 21:06
first-i.ri	1.11 KB	-rw-r--r--	2025-04-28 21:06
flatten%21-i.ri	1.33 KB	-rw-r--r--	2025-04-28 21:06
flatten-i.ri	1.52 KB	-rw-r--r--	2025-04-28 21:06
hash-i.ri	597 B	-rw-r--r--	2025-04-28 21:06
include%3f-i.ri	522 B	-rw-r--r--	2025-04-28 21:06
index-i.ri	1.36 KB	-rw-r--r--	2025-04-28 21:06
initialize_copy-i.ri	541 B	-rw-r--r--	2025-04-28 21:06
insert-i.ri	1.29 KB	-rw-r--r--	2025-04-28 21:06
inspect-i.ri	571 B	-rw-r--r--	2025-04-28 21:06
intersect%3f-i.ri	636 B	-rw-r--r--	2025-04-28 21:06
intersection-i.ri	928 B	-rw-r--r--	2025-04-28 21:06
join-i.ri	1.22 KB	-rw-r--r--	2025-04-28 21:06
keep_if-i.ri	778 B	-rw-r--r--	2025-04-28 21:06
last-i.ri	1.1 KB	-rw-r--r--	2025-04-28 21:06
length-i.ri	345 B	-rw-r--r--	2025-04-28 21:06
map%21-i.ri	743 B	-rw-r--r--	2025-04-28 21:06
map-i.ri	781 B	-rw-r--r--	2025-04-28 21:06
max-i.ri	1.76 KB	-rw-r--r--	2025-04-28 21:06
min-i.ri	1.76 KB	-rw-r--r--	2025-04-28 21:06
minmax-i.ri	1.17 KB	-rw-r--r--	2025-04-28 21:06
new-c.ri	1.78 KB	-rw-r--r--	2025-04-28 21:06
none%3f-i.ri	1.36 KB	-rw-r--r--	2025-04-28 21:06
one%3f-i.ri	1.51 KB	-rw-r--r--	2025-04-28 21:06
pack-i.ri	8.11 KB	-rw-r--r--	2025-04-28 21:06
permutation-i.ri	2.28 KB	-rw-r--r--	2025-04-28 21:06
pop-i.ri	1.07 KB	-rw-r--r--	2025-04-28 21:06
prepend-i.ri	582 B	-rw-r--r--	2025-04-28 21:06
product-i.ri	2.21 KB	-rw-r--r--	2025-04-28 21:06
push-i.ri	901 B	-rw-r--r--	2025-04-28 21:06
rassoc-i.ri	640 B	-rw-r--r--	2025-04-28 21:06
reject%21-i.ri	851 B	-rw-r--r--	2025-04-28 21:06
reject-i.ri	772 B	-rw-r--r--	2025-04-28 21:06
repeated_combination-i.ri	2.04 KB	-rw-r--r--	2025-04-28 21:06
repeated_permutation-i.ri	2.11 KB	-rw-r--r--	2025-04-28 21:06
replace-i.ri	492 B	-rw-r--r--	2025-04-28 21:06
reverse%21-i.ri	432 B	-rw-r--r--	2025-04-28 21:06
reverse-i.ri	489 B	-rw-r--r--	2025-04-28 21:06
reverse_each-i.ri	1.35 KB	-rw-r--r--	2025-04-28 21:06
rindex-i.ri	1.38 KB	-rw-r--r--	2025-04-28 21:06
rotate%21-i.ri	1.54 KB	-rw-r--r--	2025-04-28 21:06
rotate-i.ri	1.69 KB	-rw-r--r--	2025-04-28 21:06
sample-i.ri	1.65 KB	-rw-r--r--	2025-04-28 21:06
select%21-i.ri	1.01 KB	-rw-r--r--	2025-04-28 21:06
select-i.ri	918 B	-rw-r--r--	2025-04-28 21:06
shelljoin-i.ri	525 B	-rw-r--r--	2025-04-28 21:06
shift-i.ri	1.19 KB	-rw-r--r--	2025-04-28 21:06
shuffle%21-i.ri	664 B	-rw-r--r--	2025-04-28 21:06
shuffle-i.ri	674 B	-rw-r--r--	2025-04-28 21:06
size-i.ri	310 B	-rw-r--r--	2025-04-28 21:06
slice%21-i.ri	2.39 KB	-rw-r--r--	2025-04-28 21:06
slice-i.ri	3.47 KB	-rw-r--r--	2025-04-28 21:06
sort%21-i.ri	1.56 KB	-rw-r--r--	2025-04-28 21:06
sort-i.ri	1.65 KB	-rw-r--r--	2025-04-28 21:06
sort_by%21-i.ri	1.09 KB	-rw-r--r--	2025-04-28 21:06
sum-i.ri	1.57 KB	-rw-r--r--	2025-04-28 21:06
take-i.ri	678 B	-rw-r--r--	2025-04-28 21:06
take_while-i.ri	1.06 KB	-rw-r--r--	2025-04-28 21:06
to_a-i.ri	785 B	-rw-r--r--	2025-04-28 21:06
to_ary-i.ri	299 B	-rw-r--r--	2025-04-28 21:06
to_h-i.ri	1.1 KB	-rw-r--r--	2025-04-28 21:06
to_s-i.ri	534 B	-rw-r--r--	2025-04-28 21:06
transpose-i.ri	551 B	-rw-r--r--	2025-04-28 21:06
try_convert-c.ri	705 B	-rw-r--r--	2025-04-28 21:06
union-i.ri	834 B	-rw-r--r--	2025-04-28 21:06
uniq%21-i.ri	1.22 KB	-rw-r--r--	2025-04-28 21:06
uniq-i.ri	1.01 KB	-rw-r--r--	2025-04-28 21:06
unshift-i.ri	620 B	-rw-r--r--	2025-04-28 21:06
values_at-i.ri	1.6 KB	-rw-r--r--	2025-04-28 21:06
zip-i.ri	2.12 KB	-rw-r--r--	2025-04-28 21:06

Rename

U:RDoc::AnyMethod[iI"	fill:ETI"Array#fill;TF:privateo:RDoc::Markup::Document:@parts[Go: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:;To: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"DWith 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:;To;;	[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:;To;;	[	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>):;To;;	[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:;To;;	[	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"XWith 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+:;To;;	[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:;To;;	[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+:;To;;	[	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:;To;;	[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"BWith 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>:;To;;	[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:;To;;	[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:;To;;	[	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:;To;;	[	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:;To;;	[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:;To;;	[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:;To;;	[	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:;To;;	[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:;To;;	[	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+:;To;;	[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:;To;;	[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+:;To;;	[	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:;To;;	[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>:;To;;	[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:;To;;	[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:;To;;	[	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:;To;;	[	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