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"	fill:ETI"Array#fill;TF:publico:RDoc::Markup::Document:@parts[o:RDoc::Markup::Paragraph;	[I"+Replaces selected elements in +self+; ;TI"!may add elements to +self+; ;TI"/always returns +self+ (never a new array).;To:RDoc::Markup::BlankLine�o;
;	[I"In brief:;T@o:RDoc::Markup::Verbatim;	[I"# Non-negative start.
;TI"M['a', 'b', 'c', 'd'].fill('-', 1, 2)          # => ["a", "-", "-", "d"]
;TI"M['a', 'b', 'c', 'd'].fill(1, 2) {|e| e.to_s } # => ["a", "1", "2", "d"]
;TI"
;TI"3# Extends with specified values if necessary.
;TI"R['a', 'b', 'c', 'd'].fill('-', 3, 2)          # => ["a", "b", "c", "-", "-"]
;TI"R['a', 'b', 'c', 'd'].fill(3, 2) {|e| e.to_s } # => ["a", "b", "c", "3", "4"]
;TI"
;TI"%# Fills with nils if necessary.
;TI"a['a', 'b', 'c', 'd'].fill('-', 6, 2)          # => ["a", "b", "c", "d", nil, nil, "-", "-"]
;TI"a['a', 'b', 'c', 'd'].fill(6, 2) {|e| e.to_s } # => ["a", "b", "c", "d", nil, nil, "6", "7"]
;TI"
;TI":# For negative start, counts backwards from the end.
;TI"N['a', 'b', 'c', 'd'].fill('-', -3, 3)          # => ["a", "-", "-", "-"]
;TI"N['a', 'b', 'c', 'd'].fill(-3, 3) {|e| e.to_s } # => ["a", "1", "2", "3"]
;TI"
;TI"# Range.
;TI"M['a', 'b', 'c', 'd'].fill('-', 1..2)          # => ["a", "-", "-", "d"]
;TI"M['a', 'b', 'c', 'd'].fill(1..2) {|e| e.to_s } # => ["a", "1", "2", "d"]
;T:@format0o;
;	[
I"3When arguments +start+ and +count+ are given, ;TI"8they select the elements of +self+ to be replaced; ;TI"each must be an ;TI"a{integer-convertible object}[rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects] ;TI"(or +nil+):;T@o:RDoc::Markup::List:
@type:BULLET:@items[o:RDoc::Markup::ListItem:@label0;	[o;
;	[I"R+start+ specifies the zero-based offset of the first element to be replaced; ;TI"+nil+ means zero.;To;;0;	[o;
;	[I"C+count+ is the number of consecutive elements to be replaced; ;TI" +nil+ means "all the rest.";T@o;
;	[I"#With argument +object+ given, ;TI"2that one object is used for all replacements:;T@o;;	[	I"@o = Object.new           # => #<Object:0x0000014e7bff7600>
;TI"8a = ['a', 'b', 'c', 'd'] # => ["a", "b", "c", "d"]
;TI"a.fill(o, 1, 2)
;TI"Q# => ["a", #<Object:0x0000014e7bff7600>, #<Object:0x0000014e7bff7600>, "d"]
;T;
0o;
;	[	I"SWith a block given, the block is called once for each element to be replaced; ;TI"Pthe value passed to the block is the _index_ of the element to be replaced ;TI"(not the element itself); ;TI"3the block's return value replaces the element:;T@o;;	[I"Fa = ['a', 'b', 'c', 'd']               # => ["a", "b", "c", "d"]
;TI"Fa.fill(1, 2) {|element| element.to_s } # => ["a", "1", "2", "d"]
;T;
0o;
;	[I"'For arguments +start+ and +count+:;T@o;;;;[o;;0;	[o;
;	[I"!If +start+ is non-negative, ;TI";replaces +count+ elements beginning at offset +start+:;T@o;;	[I"D['a', 'b', 'c', 'd'].fill('-', 0, 2) # => ["-", "-", "c", "d"]
;TI"D['a', 'b', 'c', 'd'].fill('-', 1, 2) # => ["a", "-", "-", "d"]
;TI"D['a', 'b', 'c', 'd'].fill('-', 2, 2) # => ["a", "b", "-", "-"]
;TI"
;TI"M['a', 'b', 'c', 'd'].fill(0, 2) {|e| e.to_s } # => ["0", "1", "c", "d"]
;TI"M['a', 'b', 'c', 'd'].fill(1, 2) {|e| e.to_s } # => ["a", "1", "2", "d"]
;TI"M['a', 'b', 'c', 'd'].fill(2, 2) {|e| e.to_s } # => ["a", "b", "2", "3"]
;T;
0o;
;	[I"!Extends +self+ if necessary:;T@o;;	[
I"I['a', 'b', 'c', 'd'].fill('-', 3, 2) # => ["a", "b", "c", "-", "-"]
;TI"N['a', 'b', 'c', 'd'].fill('-', 4, 2) # => ["a", "b", "c", "d", "-", "-"]
;TI"
;TI"R['a', 'b', 'c', 'd'].fill(3, 2) {|e| e.to_s } # => ["a", "b", "c", "3", "4"]
;TI"W['a', 'b', 'c', 'd'].fill(4, 2) {|e| e.to_s } # => ["a", "b", "c", "d", "4", "5"]
;T;
0o;
;	[I"#Fills with +nil+ if necessary:;T@o;;	[
I"S['a', 'b', 'c', 'd'].fill('-', 5, 2) # => ["a", "b", "c", "d", nil, "-", "-"]
;TI"X['a', 'b', 'c', 'd'].fill('-', 6, 2) # => ["a", "b", "c", "d", nil, nil, "-", "-"]
;TI"
;TI"\['a', 'b', 'c', 'd'].fill(5, 2) {|e| e.to_s } # => ["a", "b", "c", "d", nil, "5", "6"]
;TI"a['a', 'b', 'c', 'd'].fill(6, 2) {|e| e.to_s } # => ["a", "b", "c", "d", nil, nil, "6", "7"]
;T;
0o;
;	[I"-Does nothing if +count+ is non-positive:;T@o;;	[I"G['a', 'b', 'c', 'd'].fill('-', 2, 0)    # => ["a", "b", "c", "d"]
;TI"G['a', 'b', 'c', 'd'].fill('-', 2, -100) # => ["a", "b", "c", "d"]
;TI"G['a', 'b', 'c', 'd'].fill('-', 6, -100) # => ["a", "b", "c", "d"]
;TI"
;TI"^['a', 'b', 'c', 'd'].fill(2, 0) {|e| fail 'Cannot happen' }    # => ["a", "b", "c", "d"]
;TI"^['a', 'b', 'c', 'd'].fill(2, -100) {|e| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
;TI"^['a', 'b', 'c', 'd'].fill(6, -100) {|e| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
;T;
0o;;0;	[o;
;	[I"EIf +start+ is negative, counts backwards from the end of +self+:;T@o;;	[
I"E['a', 'b', 'c', 'd'].fill('-', -4, 3) # => ["-", "-", "-", "d"]
;TI"E['a', 'b', 'c', 'd'].fill('-', -3, 3) # => ["a", "-", "-", "-"]
;TI"
;TI"N['a', 'b', 'c', 'd'].fill(-4, 3) {|e| e.to_s } # => ["0", "1", "2", "d"]
;TI"N['a', 'b', 'c', 'd'].fill(-3, 3) {|e| e.to_s } # => ["a", "1", "2", "3"]
;T;
0o;
;	[I"!Extends +self+ if necessary:;T@o;;	[
I"J['a', 'b', 'c', 'd'].fill('-', -2, 3) # => ["a", "b", "-", "-", "-"]
;TI"O['a', 'b', 'c', 'd'].fill('-', -1, 3) # => ["a", "b", "c", "-", "-", "-"]
;TI"
;TI"S['a', 'b', 'c', 'd'].fill(-2, 3) {|e| e.to_s } # => ["a", "b", "2", "3", "4"]
;TI"X['a', 'b', 'c', 'd'].fill(-1, 3) {|e| e.to_s } # => ["a", "b", "c", "3", "4", "5"]
;T;
0o;
;	[I"OStarts at the beginning of +self+ if +start+ is negative and out-of-range:;T@o;;	[
I"E['a', 'b', 'c', 'd'].fill('-', -5, 2) # => ["-", "-", "c", "d"]
;TI"E['a', 'b', 'c', 'd'].fill('-', -6, 2) # => ["-", "-", "c", "d"]
;TI"
;TI"N['a', 'b', 'c', 'd'].fill(-5, 2) {|e| e.to_s } # => ["0", "1", "c", "d"]
;TI"N['a', 'b', 'c', 'd'].fill(-6, 2) {|e| e.to_s } # => ["0", "1", "c", "d"]
;T;
0o;
;	[I"-Does nothing if +count+ is non-positive:;T@o;;	[
I"F['a', 'b', 'c', 'd'].fill('-', -2, 0)  # => ["a", "b", "c", "d"]
;TI"F['a', 'b', 'c', 'd'].fill('-', -2, -1) # => ["a", "b", "c", "d"]
;TI"
;TI"]['a', 'b', 'c', 'd'].fill(-2, 0) {|e| fail 'Cannot happen' }  # => ["a", "b", "c", "d"]
;TI"]['a', 'b', 'c', 'd'].fill(-2, -1) {|e| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
;T;
0o;
;	[	I"%When argument +range+ is given, ;TI":it must be a Range object whose members are numeric; ;TI"Cits +begin+ and +end+ values determine the elements of +self+ ;TI"to be replaced:;T@o;;;;[
o;;0;	[o;
;	[I"VIf both +begin+ and +end+ are positive, they specify the first and last elements ;TI"to be replaced:;T@o;;	[I"M['a', 'b', 'c', 'd'].fill('-', 1..2)          # => ["a", "-", "-", "d"]
;TI"M['a', 'b', 'c', 'd'].fill(1..2) {|e| e.to_s } # => ["a", "1", "2", "d"]
;T;
0o;
;	[I"<If +end+ is smaller than +begin+, replaces no elements:;T@o;;	[I"M['a', 'b', 'c', 'd'].fill('-', 2..1)          # => ["a", "b", "c", "d"]
;TI"M['a', 'b', 'c', 'd'].fill(2..1) {|e| e.to_s } # => ["a", "b", "c", "d"]
;T;
0o;;0;	[o;
;	[I"[If either is negative (or both are negative), counts backwards from the end of +self+:;T@o;;	[I"F['a', 'b', 'c', 'd'].fill('-', -3..2)  # => ["a", "-", "-", "d"]
;TI"F['a', 'b', 'c', 'd'].fill('-', 1..-2)  # => ["a", "-", "-", "d"]
;TI"F['a', 'b', 'c', 'd'].fill('-', -3..-2) # => ["a", "-", "-", "d"]
;TI"
;TI"O['a', 'b', 'c', 'd'].fill(-3..2) {|e| e.to_s }  # => ["a", "1", "2", "d"]
;TI"O['a', 'b', 'c', 'd'].fill(1..-2) {|e| e.to_s }  # => ["a", "1", "2", "d"]
;TI"O['a', 'b', 'c', 'd'].fill(-3..-2) {|e| e.to_s } # => ["a", "1", "2", "d"]
;T;
0o;;0;	[o;
;	[I"YIf the +end+ value is excluded (see Range#exclude_end?), omits the last replacement:;T@o;;	[
I"F['a', 'b', 'c', 'd'].fill('-', 1...2)  # => ["a", "-", "c", "d"]
;TI"F['a', 'b', 'c', 'd'].fill('-', 1...-2) # => ["a", "-", "c", "d"]
;TI"
;TI"O['a', 'b', 'c', 'd'].fill(1...2) {|e| e.to_s }  # => ["a", "1", "c", "d"]
;TI"O['a', 'b', 'c', 'd'].fill(1...-2) {|e| e.to_s } # => ["a", "1", "c", "d"]
;T;
0o;;0;	[o;
;	[I"TIf the range is endless (see {Endless Ranges}[rdoc-ref:Range@Endless+Ranges]), ;TI",replaces elements to the end of +self+:;T@o;;	[I"L['a', 'b', 'c', 'd'].fill('-', 1..)          # => ["a", "-", "-", "-"]
;TI"L['a', 'b', 'c', 'd'].fill(1..) {|e| e.to_s } # => ["a", "1", "2", "3"]
;T;
0o;;0;	[o;
;	[I"ZIf the range is beginless (see {Beginless Ranges}[rdoc-ref:Range@Beginless+Ranges]), ;TI"4replaces elements from the beginning of +self+:;T@o;;	[I"L['a', 'b', 'c', 'd'].fill('-', ..2)          # => ["-", "-", "-", "d"]
;TI"L['a', 'b', 'c', 'd'].fill(..2) {|e| e.to_s } # => ["0", "1", "2", "d"]
;T;
0o;
;	[I"PRelated: see {Methods for Assigning}[rdoc-ref:Array@Methods+for+Assigning].;T:
@fileI"array.c;T:0@omit_headings_from_table_of_contents_below0I"�fill(object, start = nil, count = nil) -> new_array
fill(object, range) -> new_array
fill(start = nil, count = nil) {|element| ... } -> new_array
fill(range) {|element| ... } -> new_array
;T0[�I"(p1 = v1, p2 = v2);T@�FI"
Array;TcRDoc::NormalClass00