Gecko [ beriskala.com ]

Name	Size	Permission	Date
%26-i.ri	759 B	-rw-r--r--	2023-07-26 18:33
%2a-i.ri	663 B	-rw-r--r--	2023-07-26 18:33
%2b-i.ri	1002 B	-rw-r--r--	2023-07-26 18:33
%2d-i.ri	825 B	-rw-r--r--	2023-07-26 18:33
%3c%3c-i.ri	674 B	-rw-r--r--	2023-07-26 18:33
%3c%3d%3e-i.ri	1.58 KB	-rw-r--r--	2023-07-26 18:33
%3d%3d-i.ri	708 B	-rw-r--r--	2023-07-26 18:33
%5b%5d%3d-i.ri	1.77 KB	-rw-r--r--	2023-07-26 18:33
%5b%5d-c.ri	529 B	-rw-r--r--	2023-07-26 18:33
%5b%5d-i.ri	1.68 KB	-rw-r--r--	2023-07-26 18:33
%7c-i.ri	775 B	-rw-r--r--	2023-07-26 18:33
abbrev-i.ri	1007 B	-rw-r--r--	2023-07-26 18:33
all%3f-i.ri	379 B	-rw-r--r--	2023-07-26 18:33
any%3f-i.ri	379 B	-rw-r--r--	2023-07-26 18:33
append-i.ri	238 B	-rw-r--r--	2023-07-26 18:33
assoc-i.ri	930 B	-rw-r--r--	2023-07-26 18:33
at-i.ri	604 B	-rw-r--r--	2023-07-26 18:33
bsearch-i.ri	2.57 KB	-rw-r--r--	2023-07-26 18:33
bsearch_index-i.ri	829 B	-rw-r--r--	2023-07-26 18:33
cdesc-Array.ri	11.71 KB	-rw-r--r--	2023-07-26 18:33
clear-i.ri	444 B	-rw-r--r--	2023-07-26 18:33
collect%21-i.ri	843 B	-rw-r--r--	2023-07-26 18:33
collect-i.ri	907 B	-rw-r--r--	2023-07-26 18:33
combination-i.ri	1.15 KB	-rw-r--r--	2023-07-26 18:33
compact%21-i.ri	604 B	-rw-r--r--	2023-07-26 18:33
compact-i.ri	509 B	-rw-r--r--	2023-07-26 18:33
concat-i.ri	858 B	-rw-r--r--	2023-07-26 18:33
count-i.ri	848 B	-rw-r--r--	2023-07-26 18:33
cycle-i.ri	908 B	-rw-r--r--	2023-07-26 18:33
dclone-i.ri	378 B	-rw-r--r--	2023-07-26 18:33
delete-i.ri	1021 B	-rw-r--r--	2023-07-26 18:33
delete_at-i.ri	686 B	-rw-r--r--	2023-07-26 18:33
delete_if-i.ri	806 B	-rw-r--r--	2023-07-26 18:33
difference-i.ri	971 B	-rw-r--r--	2023-07-26 18:33
dig-i.ri	809 B	-rw-r--r--	2023-07-26 18:33
drop-i.ri	636 B	-rw-r--r--	2023-07-26 18:33
drop_while-i.ri	796 B	-rw-r--r--	2023-07-26 18:33
each-i.ri	714 B	-rw-r--r--	2023-07-26 18:33
each_index-i.ri	715 B	-rw-r--r--	2023-07-26 18:33
empty%3f-i.ri	432 B	-rw-r--r--	2023-07-26 18:33
eql%3f-i.ri	427 B	-rw-r--r--	2023-07-26 18:33
fetch-i.ri	1.16 KB	-rw-r--r--	2023-07-26 18:33
fill-i.ri	1.45 KB	-rw-r--r--	2023-07-26 18:33
filter%21-i.ri	859 B	-rw-r--r--	2023-07-26 18:33
filter-i.ri	845 B	-rw-r--r--	2023-07-26 18:33
find_index-i.ri	1.02 KB	-rw-r--r--	2023-07-26 18:33
first-i.ri	713 B	-rw-r--r--	2023-07-26 18:33
flatten%21-i.ri	849 B	-rw-r--r--	2023-07-26 18:33
flatten-i.ri	1019 B	-rw-r--r--	2023-07-26 18:33
hash-i.ri	495 B	-rw-r--r--	2023-07-26 18:33
include%3f-i.ri	615 B	-rw-r--r--	2023-07-26 18:33
index-i.ri	1020 B	-rw-r--r--	2023-07-26 18:33
initialize_copy-i.ri	652 B	-rw-r--r--	2023-07-26 18:33
insert-i.ri	874 B	-rw-r--r--	2023-07-26 18:33
inspect-i.ri	508 B	-rw-r--r--	2023-07-26 18:33
join-i.ri	884 B	-rw-r--r--	2023-07-26 18:33
keep_if-i.ri	770 B	-rw-r--r--	2023-07-26 18:33
last-i.ri	635 B	-rw-r--r--	2023-07-26 18:33
length-i.ri	508 B	-rw-r--r--	2023-07-26 18:33
map%21-i.ri	835 B	-rw-r--r--	2023-07-26 18:33
map-i.ri	899 B	-rw-r--r--	2023-07-26 18:33
max-i.ri	1.1 KB	-rw-r--r--	2023-07-26 18:33
min-i.ri	1.09 KB	-rw-r--r--	2023-07-26 18:33
new-c.ri	2.15 KB	-rw-r--r--	2023-07-26 18:33
none%3f-i.ri	384 B	-rw-r--r--	2023-07-26 18:33
one%3f-i.ri	379 B	-rw-r--r--	2023-07-26 18:33
pack-i.ri	7.51 KB	-rw-r--r--	2023-07-26 18:33
permutation-i.ri	1.38 KB	-rw-r--r--	2023-07-26 18:33
pop-i.ri	785 B	-rw-r--r--	2023-07-26 18:33
prepend-i.ri	243 B	-rw-r--r--	2023-07-26 18:33
product-i.ri	1.08 KB	-rw-r--r--	2023-07-26 18:33
push-i.ri	810 B	-rw-r--r--	2023-07-26 18:33
rassoc-i.ri	790 B	-rw-r--r--	2023-07-26 18:33
reject%21-i.ri	719 B	-rw-r--r--	2023-07-26 18:33
reject-i.ri	635 B	-rw-r--r--	2023-07-26 18:33
repeated_combination-i.ri	1.49 KB	-rw-r--r--	2023-07-26 18:33
repeated_permutation-i.ri	1.17 KB	-rw-r--r--	2023-07-26 18:33
replace-i.ri	627 B	-rw-r--r--	2023-07-26 18:33
reverse%21-i.ri	496 B	-rw-r--r--	2023-07-26 18:33
reverse-i.ri	520 B	-rw-r--r--	2023-07-26 18:33
reverse_each-i.ri	610 B	-rw-r--r--	2023-07-26 18:33
rindex-i.ri	1.03 KB	-rw-r--r--	2023-07-26 18:33
rotate%21-i.ri	845 B	-rw-r--r--	2023-07-26 18:33
rotate-i.ri	865 B	-rw-r--r--	2023-07-26 18:33
sample-i.ri	1.18 KB	-rw-r--r--	2023-07-26 18:33
select%21-i.ri	859 B	-rw-r--r--	2023-07-26 18:33
select-i.ri	845 B	-rw-r--r--	2023-07-26 18:33
shelljoin-i.ri	524 B	-rw-r--r--	2023-07-26 18:33
shift-i.ri	1.05 KB	-rw-r--r--	2023-07-26 18:33
shuffle%21-i.ri	737 B	-rw-r--r--	2023-07-26 18:33
shuffle-i.ri	756 B	-rw-r--r--	2023-07-26 18:33
size-i.ri	231 B	-rw-r--r--	2023-07-26 18:33
slice%21-i.ri	896 B	-rw-r--r--	2023-07-26 18:33
slice-i.ri	1.55 KB	-rw-r--r--	2023-07-26 18:33
sort%21-i.ri	1.13 KB	-rw-r--r--	2023-07-26 18:33
sort-i.ri	1.16 KB	-rw-r--r--	2023-07-26 18:33
sort_by%21-i.ri	759 B	-rw-r--r--	2023-07-26 18:33
sum-i.ri	1.66 KB	-rw-r--r--	2023-07-26 18:33
take-i.ri	586 B	-rw-r--r--	2023-07-26 18:33
take_while-i.ri	758 B	-rw-r--r--	2023-07-26 18:33
to_a-i.ri	410 B	-rw-r--r--	2023-07-26 18:33
to_ary-i.ri	295 B	-rw-r--r--	2023-07-26 18:33
to_h-i.ri	762 B	-rw-r--r--	2023-07-26 18:33
to_s-i.ri	232 B	-rw-r--r--	2023-07-26 18:33
transpose-i.ri	609 B	-rw-r--r--	2023-07-26 18:33
try_convert-c.ri	851 B	-rw-r--r--	2023-07-26 18:33
union-i.ri	859 B	-rw-r--r--	2023-07-26 18:33
uniq%21-i.ri	1.07 KB	-rw-r--r--	2023-07-26 18:33
uniq-i.ri	949 B	-rw-r--r--	2023-07-26 18:33
unshift-i.ri	684 B	-rw-r--r--	2023-07-26 18:33
values_at-i.ri	875 B	-rw-r--r--	2023-07-26 18:33
zip-i.ri	1.14 KB	-rw-r--r--	2023-07-26 18:33

Rename

U:RDoc::NormalClass[iI"
Array:ET@I"Object;To:RDoc::Markup::Document:@parts[
o;;[}o:RDoc::Markup::Paragraph;[I"CArrays are ordered, integer-indexed collections of any object.;To:RDoc::Markup::BlankLine�o;	;[	I"OArray indexing starts at 0, as in C or Java.  A negative index is assumed ;TI"Pto be relative to the end of the array---that is, an index of -1 indicates ;TI"Jthe last element of the array, -2 is the next to last element in the ;TI"array, and so on.;T@S:RDoc::Markup::Heading:
leveli:	textI"Creating Arrays;T@o;	;[I"AA new array can be created by using the literal constructor ;TI"K<code>[]</code>.  Arrays can contain different types of objects.  For ;TI"Hexample, the array below contains an Integer, a String and a Float:;T@o:RDoc::Markup::Verbatim;[I"/ary = [1, "two", 3.0] #=> [1, "two", 3.0]
;T:@format0o;	;[I"QAn array can also be created by explicitly calling Array.new with zero, one ;TI"N(the initial size of the Array) or two arguments (the initial size and a ;TI"default object).;T@o;;[I"ary = Array.new    #=> []
;TI",Array.new(3)       #=> [nil, nil, nil]
;TI"/Array.new(3, true) #=> [true, true, true]
;T;0o;	;[	I"NNote that the second argument populates the array with references to the ;TI"Osame object.  Therefore, it is only recommended in cases when you need to ;TI"Iinstantiate arrays with natively immutable objects such as Symbols, ;TI"numbers, true or false.;T@o;	;[I"MTo create an array with separate objects a block can be passed instead. ;TI"PThis method is safe to use with mutable objects such as hashes, strings or ;TI"other arrays:;T@o;;[I"5Array.new(4) {Hash.new}    #=> [{}, {}, {}, {}]
;TI"9Array.new(4) {|i| i.to_s } #=> ["0", "1", "2", "3"]
;T;0o;	;[I"CThis is also a quick way to build up multi-dimensional arrays:;T@o;;[I"/empty_table = Array.new(3) {Array.new(3)}
;TI"=#=> [[nil, nil, nil], [nil, nil, nil], [nil, nil, nil]]
;T;0o;	;[I"KAn array can also be created by using the Array() method, provided by ;TI"EKernel, which tries to call #to_ary, then #to_a on its argument.;T@o;;[I">Array({:a => "a", :b => "b"}) #=> [[:a, "a"], [:b, "b"]]
;T;0S;;i;
I"Example Usage;T@o;	;[I"OIn addition to the methods it mixes in through the Enumerable module, the ;TI"PArray class has proprietary methods for accessing, searching and otherwise ;TI"manipulating arrays.;T@o;	;[I"8Some of the more common ones are illustrated below.;T@S;;i;
I"Accessing Elements;T@o;	;[	I"NElements in an array can be retrieved using the Array#[] method.  It can ;TI"Ktake a single integer argument (a numeric index), a pair of arguments ;TI"R(start and length) or a range. Negative indices start counting from the end, ;TI"$with -1 being the last element.;T@o;;[I"arr = [1, 2, 3, 4, 5, 6]
;TI"arr[2]    #=> 3
;TI"arr[100]  #=> nil
;TI"arr[-3]   #=> 4
;TI"arr[2, 3] #=> [3, 4, 5]
;TI" arr[1..4] #=> [2, 3, 4, 5]
;TI"arr[1..-3] #=> [2, 3, 4]
;T;0o;	;[I"PAnother way to access a particular array element is by using the #at method;T@o;;[I"arr.at(0) #=> 1
;T;0o;	;[I"@The #slice method works in an identical manner to Array#[].;T@o;	;[I"JTo raise an error for indices outside of the array bounds or else to ;TI"Cprovide a default value when that happens, you can use #fetch.;T@o;;[I"*arr = ['a', 'b', 'c', 'd', 'e', 'f']
;TI"Narr.fetch(100) #=> IndexError: index 100 outside of array bounds: -6...6
;TI"'arr.fetch(100, "oops") #=> "oops"
;T;0o;	;[I"IThe special methods #first and #last will return the first and last ;TI"(elements of an array, respectively.;T@o;;[I"arr.first #=> 1
;TI"arr.last  #=> 6
;T;0o;	;[I"<To return the first +n+ elements of an array, use #take;T@o;;[I"arr.take(3) #=> [1, 2, 3]
;T;0o;	;[I"K#drop does the opposite of #take, by returning the elements after +n+ ;TI" elements have been dropped:;T@o;;[I"arr.drop(3) #=> [4, 5, 6]
;T;0S;;i;
I")Obtaining Information about an Array;T@o;	;[I"LArrays keep track of their own length at all times.  To query an array ;TI"Labout the number of elements it contains, use #length, #count or #size.;T@o;;[I"?browsers = ['Chrome', 'Firefox', 'Safari', 'Opera', 'IE']
;TI"browsers.length #=> 5
;TI"browsers.count #=> 5
;T;0o;	;[I";To check whether an array contains any elements at all;T@o;;[I"browsers.empty? #=> false
;T;0o;	;[I"@To check whether a particular item is included in the array;T@o;;[I".browsers.include?('Konqueror') #=> false
;T;0S;;i;
I"Adding Items to Arrays;T@o;	;[I"KItems can be added to the end of an array by using either #push or #<<;T@o;;[I"arr = [1, 2, 3, 4]
;TI"%arr.push(5) #=> [1, 2, 3, 4, 5]
;TI"(arr << 6    #=> [1, 2, 3, 4, 5, 6]
;T;0o;	;[I"?#unshift will add a new item to the beginning of an array.;T@o;;[I".arr.unshift(0) #=> [0, 1, 2, 3, 4, 5, 6]
;T;0o;	;[I"HWith #insert you can add a new element to an array at any position.;T@o;;[I"@arr.insert(3, 'apple')  #=> [0, 1, 2, 'apple', 3, 4, 5, 6]
;T;0o;	;[I"KUsing the #insert method, you can also insert multiple values at once:;T@o;;[I"3arr.insert(3, 'orange', 'pear', 'grapefruit')
;TI"H#=> [0, 1, 2, "orange", "pear", "grapefruit", "apple", 3, 4, 5, 6]
;T;0S;;i;
I"!Removing Items from an Array;T@o;	;[I"IThe method #pop removes the last element in an array and returns it:;T@o;;[I"arr =  [1, 2, 3, 4, 5, 6]
;TI"arr.pop #=> 6
;TI"arr #=> [1, 2, 3, 4, 5]
;T;0o;	;[I"HTo retrieve and at the same time remove the first item, use #shift:;T@o;;[I"arr.shift #=> 1
;TI"arr #=> [2, 3, 4, 5]
;T;0o;	;[I"0To delete an element at a particular index:;T@o;;[I"arr.delete_at(2) #=> 4
;TI"arr #=> [2, 3, 5]
;T;0o;	;[I"FTo delete a particular element anywhere in an array, use #delete:;T@o;;[I"arr = [1, 2, 2, 3]
;TI"arr.delete(2) #=> 2
;TI"arr #=> [1,3]
;T;0o;	;[I"IA useful method if you need to remove +nil+ values from an array is ;TI"#compact:;T@o;;[
I"1arr = ['foo', 0, nil, 'bar', 7, 'baz', nil]
;TI"2arr.compact  #=> ['foo', 0, 'bar', 7, 'baz']
;TI"<arr          #=> ['foo', 0, nil, 'bar', 7, 'baz', nil]
;TI"2arr.compact! #=> ['foo', 0, 'bar', 7, 'baz']
;TI"2arr          #=> ['foo', 0, 'bar', 7, 'baz']
;T;0o;	;[I"GAnother common need is to remove duplicate elements from an array.;T@o;	;[I"DIt has the non-destructive #uniq, and destructive method #uniq!;T@o;;[I"3arr = [2, 5, 6, 556, 6, 6, 8, 9, 0, 123, 556]
;TI"/arr.uniq #=> [2, 5, 6, 556, 8, 9, 0, 123]
;T;0S;;i;
I"Iterating over Arrays;T@o;	;[	I"LLike all classes that include the Enumerable module, Array has an each ;TI"Nmethod, which defines what elements should be iterated over and how.  In ;TI"Ncase of Array's #each, all elements in the Array instance are yielded to ;TI"$the supplied block in sequence.;T@o;	;[I"9Note that this operation leaves the array unchanged.;T@o;;[	I"arr = [1, 2, 3, 4, 5]
;TI"'arr.each {|a| print a -= 10, " "}
;TI"# prints: -9 -8 -7 -6 -5
;TI"#=> [1, 2, 3, 4, 5]
;T;0o;	;[I"PAnother sometimes useful iterator is #reverse_each which will iterate over ;TI"0the elements in the array in reverse order.;T@o;;[	I"7words = %w[first second third fourth fifth sixth]
;TI"str = ""
;TI"3words.reverse_each {|word| str += "#{word} "}
;TI"8p str #=> "sixth fifth fourth third second first "
;T;0o;	;[I"MThe #map method can be used to create a new array based on the original ;TI"?array, but with the values modified by the supplied block:;T@o;;[	I"0arr.map {|a| 2*a}     #=> [2, 4, 6, 8, 10]
;TI"/arr                   #=> [1, 2, 3, 4, 5]
;TI"1arr.map! {|a| a**2}   #=> [1, 4, 9, 16, 25]
;TI"1arr                   #=> [1, 4, 9, 16, 25]
;T;0S;;i;
I""Selecting Items from an Array;T@o;	;[
I"OElements can be selected from an array according to criteria defined in a ;TI"Lblock.  The selection can happen in a destructive or a non-destructive ;TI"Omanner.  While the destructive operations will modify the array they were ;TI"Pcalled on, the non-destructive methods usually return a new array with the ;TI"?selected elements, but leave the original array unchanged.;T@S;;i;
I"Non-destructive Selection;T@o;;[
I"arr = [1, 2, 3, 4, 5, 6]
;TI"0arr.select {|a| a > 3}       #=> [4, 5, 6]
;TI"3arr.reject {|a| a < 3}       #=> [3, 4, 5, 6]
;TI"0arr.drop_while {|a| a < 4}   #=> [4, 5, 6]
;TI"9arr                          #=> [1, 2, 3, 4, 5, 6]
;T;0S;;i;
I"Destructive Selection;T@o;	;[I"P#select! and #reject! are the corresponding destructive methods to #select ;TI"and #reject;T@o;	;[I"LSimilar to #select vs. #reject, #delete_if and #keep_if have the exact ;TI"7opposite result when supplied with the same block:;T@o;;[I"/arr.delete_if {|a| a < 4}   #=> [4, 5, 6]
;TI"/arr                         #=> [4, 5, 6]
;TI"
;TI"arr = [1, 2, 3, 4, 5, 6]
;TI"-arr.keep_if {|a| a < 4}   #=> [1, 2, 3]
;TI",arr                       #=> [1, 2, 3];T;0:
@fileI"array.c;T:0@omit_headings_from_table_of_contents_below0o;;[�;I"lib/abbrev.rb;T;0o;;[�;I"lib/mkmf.rb;T;0o;;[�;I"lib/rexml/xpath_parser.rb;T;0o;;[�;I"lib/shellwords.rb;T;0;0;0[�[�[[I"Enumerable;To;;[�;@7;0I"array.c;T[[I"
class;T[[:public[[I"[];T@K[I"new;T@K[I"try_convert;T@K[:protected[�[:private[�[I"
instance;T[[;[q[I"&;T@K[I"*;T@K[I"+;T@K[I"-;T@K[I"<<;T@K[I"<=>;T@K[I"==;T@K[I"[];T@K[I"[]=;T@K[I"abbrev;TI"lib/abbrev.rb;T[I"	all?;T@K[I"	any?;T@K[I"append;T@K[I"
assoc;T@K[I"at;T@K[I"bsearch;T@K[I"bsearch_index;T@K[I"
clear;T@K[I"collect;T@K[I"
collect!;T@K[I"combination;T@K[I"compact;T@K[I"
compact!;T@K[I"concat;T@K[I"
count;T@K[I"
cycle;T@K[I"dclone;TI"lib/rexml/xpath_parser.rb;T[I"delete;T@K[I"delete_at;T@K[I"delete_if;T@K[I"difference;T@K[I"dig;T@K[I"	drop;T@K[I"drop_while;T@K[I"	each;T@K[I"each_index;T@K[I"empty?;T@K[I"	eql?;T@K[I"
fetch;T@K[I"	fill;T@K[I"filter;T@K[I"filter!;T@K[I"find_index;T@K[I"
first;T@K[I"flatten;T@K[I"
flatten!;T@K[I"	hash;T@K[I"
include?;T@K[I"
index;T@K[I"initialize_copy;T@K[I"insert;T@K[I"inspect;T@K[I"	join;T@K[I"keep_if;T@K[I"	last;T@K[I"length;T@K[I"map;T@K[I"	map!;T@K[I"max;T@K[I"min;T@K[I"
none?;T@K[I"	one?;T@K[I"	pack;TI"pack.c;T[I"permutation;T@K[I"pop;T@K[I"prepend;T@K[I"product;T@K[I"	push;T@K[I"rassoc;T@K[I"reject;T@K[I"reject!;T@K[I"repeated_combination;T@K[I"repeated_permutation;T@K[I"replace;T@K[I"reverse;T@K[I"
reverse!;T@K[I"reverse_each;T@K[I"rindex;T@K[I"rotate;T@K[I"rotate!;T@K[I"sample;T@K[I"select;T@K[I"select!;T@K[I"shelljoin;TI"lib/shellwords.rb;T[I"
shift;T@K[I"shuffle;T@K[I"
shuffle!;T@K[I"	size;T@K[I"
slice;T@K[I"slice!;T@K[I"	sort;T@K[I"
sort!;T@K[I"
sort_by!;T@K[I"sum;T@K[I"	take;T@K[I"take_while;T@K[I"	to_a;T@K[I"to_ary;T@K[I"	to_h;T@K[I"	to_s;T@K[I"transpose;T@K[I"
union;T@K[I"	uniq;T@K[I"
uniq!;T@K[I"unshift;T@K[I"values_at;T@K[I"zip;T@K[I"|;T@K[;[�[;[�[�[U:RDoc::Context::Section[i�0o;;[�;0;0[
@7@:I"lib/csv/core_ext/array.rb;T@=I"lib/pp.rb;T@@@CI"pack.c;T@JcRDoc::TopLevel