Gecko [ beriskala.com ]

Name	Size	Permission	Date
all%3f-i.ri	1.86 KB	-rw-r--r--	2025-04-28 21:06
any%3f-i.ri	1.81 KB	-rw-r--r--	2025-04-28 21:06
cdesc-Enumerable.ri	10.31 KB	-rw-r--r--	2025-04-28 21:06
chain-i.ri	533 B	-rw-r--r--	2025-04-28 21:06
chunk-i.ri	3.92 KB	-rw-r--r--	2025-04-28 21:06
chunk_while-i.ri	2.26 KB	-rw-r--r--	2025-04-28 21:06
collect-i.ri	808 B	-rw-r--r--	2025-04-28 21:06
collect_concat-i.ri	1.04 KB	-rw-r--r--	2025-04-28 21:06
compact-i.ri	526 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.2 KB	-rw-r--r--	2025-04-28 21:06
detect-i.ri	1.06 KB	-rw-r--r--	2025-04-28 21:06
drop-i.ri	713 B	-rw-r--r--	2025-04-28 21:06
drop_while-i.ri	815 B	-rw-r--r--	2025-04-28 21:06
each_cons-i.ri	888 B	-rw-r--r--	2025-04-28 21:06
each_entry-i.ri	1.16 KB	-rw-r--r--	2025-04-28 21:06
each_slice-i.ri	889 B	-rw-r--r--	2025-04-28 21:06
each_with_index-i.ri	1.11 KB	-rw-r--r--	2025-04-28 21:06
each_with_object-i.ri	842 B	-rw-r--r--	2025-04-28 21:06
entries-i.ri	510 B	-rw-r--r--	2025-04-28 21:06
filter-i.ri	851 B	-rw-r--r--	2025-04-28 21:06
filter_map-i.ri	886 B	-rw-r--r--	2025-04-28 21:06
find-i.ri	1.16 KB	-rw-r--r--	2025-04-28 21:06
find_all-i.ri	930 B	-rw-r--r--	2025-04-28 21:06
find_index-i.ri	1.13 KB	-rw-r--r--	2025-04-28 21:06
first-i.ri	1.1 KB	-rw-r--r--	2025-04-28 21:06
flat_map-i.ri	1.1 KB	-rw-r--r--	2025-04-28 21:06
grep-i.ri	1.11 KB	-rw-r--r--	2025-04-28 21:06
grep_v-i.ri	1.15 KB	-rw-r--r--	2025-04-28 21:06
group_by-i.ri	1 KB	-rw-r--r--	2025-04-28 21:06
include%3f-i.ri	956 B	-rw-r--r--	2025-04-28 21:06
inject-i.ri	5.64 KB	-rw-r--r--	2025-04-28 21:06
lazy-i.ri	1.19 KB	-rw-r--r--	2025-04-28 21:06
map-i.ri	750 B	-rw-r--r--	2025-04-28 21:06
max-i.ri	2.66 KB	-rw-r--r--	2025-04-28 21:06
max_by-i.ri	1.54 KB	-rw-r--r--	2025-04-28 21:06
member%3f-i.ri	995 B	-rw-r--r--	2025-04-28 21:06
min-i.ri	2.65 KB	-rw-r--r--	2025-04-28 21:06
min_by-i.ri	1.54 KB	-rw-r--r--	2025-04-28 21:06
minmax-i.ri	1.46 KB	-rw-r--r--	2025-04-28 21:06
minmax_by-i.ri	966 B	-rw-r--r--	2025-04-28 21:06
none%3f-i.ri	1.77 KB	-rw-r--r--	2025-04-28 21:06
one%3f-i.ri	1.93 KB	-rw-r--r--	2025-04-28 21:06
partition-i.ri	1.26 KB	-rw-r--r--	2025-04-28 21:06
reduce-i.ri	5.47 KB	-rw-r--r--	2025-04-28 21:06
reject-i.ri	894 B	-rw-r--r--	2025-04-28 21:06
reverse_each-i.ri	1.01 KB	-rw-r--r--	2025-04-28 21:06
select-i.ri	851 B	-rw-r--r--	2025-04-28 21:06
slice_after-i.ri	1.62 KB	-rw-r--r--	2025-04-28 21:06
slice_before-i.ri	5.34 KB	-rw-r--r--	2025-04-28 21:06
slice_when-i.ri	2.85 KB	-rw-r--r--	2025-04-28 21:06
sort-i.ri	1.52 KB	-rw-r--r--	2025-04-28 21:06
sort_by-i.ri	3.39 KB	-rw-r--r--	2025-04-28 21:06
sum-i.ri	1.45 KB	-rw-r--r--	2025-04-28 21:06
take-i.ri	584 B	-rw-r--r--	2025-04-28 21:06
take_while-i.ri	820 B	-rw-r--r--	2025-04-28 21:06
tally-i.ri	1.23 KB	-rw-r--r--	2025-04-28 21:06
to_a-i.ri	527 B	-rw-r--r--	2025-04-28 21:06
to_h-i.ri	1004 B	-rw-r--r--	2025-04-28 21:06
to_set-i.ri	413 B	-rw-r--r--	2025-04-28 21:06
uniq-i.ri	986 B	-rw-r--r--	2025-04-28 21:06
zip-i.ri	2.5 KB	-rw-r--r--	2025-04-28 21:06

Rename

U:RDoc::NormalModule[iI"Enumerable:ET@0o:RDoc::Markup::Document:@parts[o;;[;S:RDoc::Markup::Heading:
leveli:	textI"What's Here;To:RDoc::Markup::BlankLine�o:RDoc::Markup::Paragraph;[I"T\Module \Enumerable provides methods that are useful to a collection class for:;To:RDoc::Markup::List:
@type:BULLET:@items[o:RDoc::Markup::ListItem:@label0;[o;
;[I">{Querying}[#module-Enumerable-label-Methods+for+Querying];To;;0;[o;
;[I">{Fetching}[#module-Enumerable-label-Methods+for+Fetching];To;;0;[o;
;[I"@{Searching}[#module-Enumerable-label-Methods+for+Searching];To;;0;[o;
;[I"<{Sorting}[#module-Enumerable-label-Methods+for+Sorting];To;;0;[o;
;[I"@{Iterating}[#module-Enumerable-label-Methods+for+Iterating];To;;0;[o;
;[I";{And more....}[#module-Enumerable-label-Other+Methods];T@S;	;
i;I"Methods for Querying;T@o;
;[I"_These methods return information about the \Enumerable other than the elements themselves:;T@o;;:	NOTE;[o;;[I"#include?, #member?;T;[o;
;[I"9Returns +true+ if self == object, +false+ otherwise.;To;;[I"
#all?;T;[o;
;[I"RReturns +true+ if all elements meet a specified criterion; +false+ otherwise.;To;;[I"
#any?;T;[o;
;[I"RReturns +true+ if any element meets a specified criterion; +false+ otherwise.;To;;[I"#none?;T;[o;
;[I"QReturns +true+ if no element meets a specified criterion; +false+ otherwise.;To;;[I"
#one?;T;[o;
;[I"ZReturns +true+ if exactly one element meets a specified criterion; +false+ otherwise.;To;;[I"#count;T;[o;
;[I"$Returns the count of elements, ;TI"7based on an argument or block criterion, if given.;To;;[I"#tally;T;[o;
;[I"NReturns a new \Hash containing the counts of occurrences of each element.;T@S;	;
i;I"Methods for Fetching;T@o;
;[I"MThese methods return entries from the \Enumerable, without modifying it:;T@o;
;[I"/Leading, trailing, or all elements:;To;;;;[o;;[I"#entries, #to_a;T;[o;
;[I"Returns all elements.;To;;[I"#first;T;[o;
;[I"3Returns the first element or leading elements.;To;;[I"
#take;T;[o;
;[I"4Returns a specified number of leading elements.;To;;[I"
#drop;T;[o;
;[I"5Returns a specified number of trailing elements.;To;;[I"#take_while;T;[o;
;[I">Returns leading elements as specified by the given block.;To;;[I"#drop_while;T;[o;
;[I"?Returns trailing elements as specified by the given block.;T@o;
;[I"/Minimum and maximum value elements:;To;;;;[o;;[I"	#min;T;[o;
;[I"HReturns the elements whose values are smallest among the elements, ;TI"4as determined by <tt><=></tt> or a given block.;To;;[I"	#max;T;[o;
;[I"GReturns the elements whose values are largest among the elements, ;TI"4as determined by <tt><=></tt> or a given block.;To;;[I"#minmax;T;[o;
;[I"MReturns a 2-element \Array containing the smallest and largest elements.;To;;[I"#min_by;T;[o;
;[I"DReturns the smallest element, as determined by the given block.;To;;[I"#max_by;T;[o;
;[I"CReturns the largest element, as determined by the given block.;To;;[I"#minmax_by;T;[o;
;[I"QReturns the smallest and largest elements, as determined by the given block.;T@o;
;[I"+Groups, slices, and partitions:;To;;;;[o;;[I"#group_by;T;[o;
;[I">Returns a \Hash that partitions the elements into groups.;To;;[I"#partition;T;[o;
;[I"XReturns elements partitioned into two new Arrays, as determined by the given block.;To;;[I"#slice_after;T;[o;
;[I"HReturns a new \Enumerator whose entries are a partition of +self+, ;TI"7based either on a given +object+ or a given block.;To;;[I"#slice_before;T;[o;
;[I"HReturns a new \Enumerator whose entries are a partition of +self+, ;TI"7based either on a given +object+ or a given block.;To;;[I"#slice_when;T;[o;
;[I"GReturns a new \Enumerator whose entries are a partition of +self+ ;TI"based on the given block.;To;;[I"#chunk;T;[o;
;[I"LReturns elements organized into chunks as specified by the given block.;To;;[I"#chunk_while;T;[o;
;[I"LReturns elements organized into chunks as specified by the given block.;T@S;	;
i;I"(Methods for Searching and Filtering;T@o;
;[I"CThese methods return elements that meet a specified criterion.;T@o;;;;[
o;;[I"#find, #detect;T;[o;
;[I".Returns an element selected by the block.;To;;[I" #find_all, #filter, #select;T;[o;
;[I",Returns elements selected by the block.;To;;[I"#find_index;T;[o;
;[I"IReturns the index of an element selected by a given object or block.;To;;[I"#reject;T;[o;
;[I"0Returns elements not rejected by the block.;To;;[I"
#uniq;T;[o;
;[I".Returns elements that are not duplicates.;T@S;	;
i;I"Methods for Sorting;T@o;
;[I"3These methods return elements in sorted order.;T@o;;;;[o;;[I"
#sort;T;[o;
;[I"EReturns the elements, sorted by <tt><=></tt> or the given block.;To;;[I"
#sort_by;T;[o;
;[I"5Returns the elements, sorted by the given block.;T@S;	;
i;I"Methods for Iterating;T@o;;;;[o;;[I"#each_entry;T;[o;
;[I"2Calls the block with each successive element ;TI"%(slightly different from #each).;To;;[I"#each_with_index;T;[o;
;[I"@Calls the block with each successive element and its index.;To;;[I"#each_with_object;T;[o;
;[I"ECalls the block with each successive element and a given object.;To;;[I"#each_slice;T;[o;
;[I"<Calls the block with successive non-overlapping slices.;To;;[I"#each_cons;T;[o;
;[I"9Calls the block with successive overlapping slices. ;TI""(different from #each_slice).;To;;[I"#reverse_each;T;[o;
;[I"DCalls the block with each successive element, in reverse order.;T@S;	;
i;I"Other Methods;T@o;;;;[o;;[I"#map, #collect;T;[o;
;[I"+Returns objects returned by the block.;To;;[I"#filter_map;T;[o;
;[I"2Returns truthy objects returned by the block.;To;;[I"#flat_map, #collect_concat;T;[o;
;[I"5Returns flattened objects returned by the block.;To;;[I"
#grep;T;[o;
;[I"1Returns elements selected by a given object ;TI"*or objects returned by a given block.;To;;[I"#grep_v;T;[o;
;[I"1Returns elements selected by a given object ;TI"*or objects returned by a given block.;To;;[I"#reduce, #inject;T;[o;
;[I"9Returns the object formed by combining all elements.;To;;[I"	#sum;T;[o;
;[I"7Returns the sum of the elements, using method +++.;To;;[I"	#zip;T;[o;
;[I"ACombines each element with elements from other enumerables; ;TI"7returns the n-tuples or calls the block with each.;To;;[I"#cycle;T;[o;
;[I";Calls the block with each element, cycling repeatedly.;T@S;	;
i;I"
Usage;T@o;
;[I"5To use module \Enumerable in a collection class:;T@o;;;;[o;;0;[o;
;[I"Include it:;T@o:RDoc::Markup::Verbatim;[I"include Enumerable
;T:@format0o;;0;[o;
;[I"%Implement method <tt>#each</tt> ;TI"=which must yield successive elements of the collection. ;TI"@The method will be called by almost any \Enumerable method.;T@o;
;[I"
Example:;T@o;;[I"class Foo
;TI" include Enumerable
;TI" def each
;TI" yield 1
;TI" yield 1, 2
;TI" yield
;TI" end
;TI"	end
;TI"/Foo.new.each_entry{ |element| p element }
;T;0o;
;[I"Output:;T@o;;[I"1
;TI"[1, 2]
;TI"	nil
;T;0S;	;
i;I"%\Enumerable in Ruby Core Classes;To;
;[I"+Some Ruby classes include \Enumerable:;To;;;;[o;;0;[o;
;[I"
Array;To;;0;[o;
;[I"Dir;To;;0;[o;
;[I"	Hash;To;;0;[o;
;[I"IO;To;;0;[o;
;[I"
Range;To;;0;[o;
;[I"Set;To;;0;[o;
;[I"Struct;To;
;[I"UVirtually all methods in \Enumerable call method +#each+ in the including class:;To;;;;[o;;0;[o;
;[I"M<tt>Hash#each</tt> yields the next key-value pair as a 2-element \Array.;To;;0;[o;
;[I"P<tt>Struct#each</tt> yields the next name-value pair as a 2-element \Array.;To;;0;[o;
;[I"UFor the other classes above, +#each+ yields the next object from the collection.;T@S;	;
i;I"About the Examples;To;
;[I";The example code snippets for the \Enumerable methods:;To;;;;[o;;0;[o;
;[I"RAlways show the use of one or more \Array-like classes (often \Array itself).;To;;0;[o;
;[I"3Sometimes show the use of a \Hash-like class. ;TI"?For some methods, though, the usage would not make sense, ;TI"Yand so it is not shown. Example: #tally would find exactly one of each \Hash entry.;T:
@fileI"enum.c;T:0@omit_headings_from_table_of_contents_below0o;;[�;I"lib/set.rb;T;0;0;0[�[�[�[[I"
class;T[[:public[�[:protected[�[:private[�[I"
instance;T[[;[�[;[�[;[B[I"	all?;TI"enum.c;T[I"	any?;T@R[I"
chain;TI"enumerator.c;T[I"
chunk;T@R[I"chunk_while;T@R[I"collect;T@R[I"collect_concat;T@R[I"compact;T@R[I"
count;T@R[I"
cycle;T@R[I"detect;T@R[I"	drop;T@R[I"drop_while;T@R[I"each_cons;T@R[I"each_entry;T@R[I"each_slice;T@R[I"each_with_index;T@R[I"each_with_object;T@R[I"entries;T@R[I"filter;T@R[I"filter_map;T@R[I"	find;T@R[I"
find_all;T@R[I"find_index;T@R[I"
first;T@R[I"
flat_map;T@R[I"	grep;T@R[I"grep_v;T@R[I"
group_by;T@R[I"
include?;T@R[I"inject;T@R[I"	lazy;T@W[I"map;T@R[I"max;T@R[I"max_by;T@R[I"member?;T@R[I"min;T@R[I"min_by;T@R[I"minmax;T@R[I"minmax_by;T@R[I"
none?;T@R[I"	one?;T@R[I"partition;T@R[I"reduce;T@R[I"reject;T@R[I"reverse_each;T@R[I"select;T@R[I"slice_after;T@R[I"slice_before;T@R[I"slice_when;T@R[I"	sort;T@R[I"sort_by;T@R[I"sum;T@R[I"	take;T@R[I"take_while;T@R[I"
tally;T@R[I"	to_a;T@R[I"	to_h;T@R[I"to_set;TI"lib/set.rb;T[I"	uniq;T@R[I"zip;T@R[�[U:RDoc::Context::Section[i�0o;;[�;0;0[I"enum.c;TI"enumerator.c;TI"lib/set.rb;T@9cRDoc::TopLevel