Gecko [ beriskala.com ]

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

Rename

U:RDoc::AnyMethod[iI"min:ETI"Enumerable#min;TF:privateo:RDoc::Markup::Document:@parts[o:RDoc::Markup::Paragraph;	[I"RReturns the element with the minimum element according to a given criterion. ;TI"IThe ordering of equal elements is indeterminate and may be unstable.;To:RDoc::Markup::BlankLine�o;
;	[I"AWith no argument and no block, returns the minimum element, ;TI"@using the elements' own method <tt><=></tt> for comparison:;T@o:RDoc::Markup::Verbatim;	[
I")(1..4).min                   # => 1
;TI"*(-4..-1).min                 # => -4
;TI"+%w[d c b a].min              # => "a"
;TI"1{foo: 0, bar: 1, baz: 2}.min # => [:bar, 1]
;TI"+[].min                       # => nil
;T:@format0o;
;	[I"=With positive integer argument +n+ given, and no block, ;TI"Kreturns an array containing the first +n+ minimum elements that exist:;T@o;;	[
I"1(1..4).min(2)                   # => [1, 2]
;TI"3(-4..-1).min(2)                 # => [-4, -3]
;TI"5%w[d c b a].min(2)              # => ["a", "b"]
;TI"A{foo: 0, bar: 1, baz: 2}.min(2) # => [[:bar, 1], [:baz, 2]]
;TI"-[].min(2)                       # => []
;T;
0o;
;	[I"DWith a block given, the block determines the minimum elements. ;TI"HThe block is called with two elements +a+ and +b+, and must return:;T@o:RDoc::Markup::List:
@type:BULLET:@items[o:RDoc::Markup::ListItem:@label0;	[o;
;	[I"*A negative integer if <tt>a < b</tt>.;To;;0;	[o;
;	[I"Zero if <tt>a == b</tt>.;To;;0;	[o;
;	[I"*A positive integer if <tt>a > b</tt>.;T@o;
;	[I")With a block given and no argument, ;TI"<returns the minimum element as determined by the block:;T@o;;	[	I"@%w[xxx x xxxx xx].min {|a, b| a.size <=> b.size } # => "x"
;TI""h = {foo: 0, bar: 1, baz: 2}
;TI"Bh.min {|pair1, pair2| pair1[1] <=> pair2[1] } # => [:foo, 0]
;TI"@[].min {|a, b| a <=> b }                          # => nil
;T;
0o;
;	[I"AWith a block given and positive integer argument +n+ given, ;TI"Lreturns an array containing the first +n+ minimum elements that exist, ;TI" as determined by the block.;T@o;;	[
I"K%w[xxx x xxxx xx].min(2) {|a, b| a.size <=> b.size } # => ["x", "xx"]
;TI""h = {foo: 0, bar: 1, baz: 2}
;TI"6h.min(2) {|pair1, pair2| pair1[1] <=> pair2[1] }
;TI"!# => [[:foo, 0], [:bar, 1]]
;TI"B[].min(2) {|a, b| a <=> b }                          # => []
;T;
0o;
;	[I"%Related: #min_by, #minmax, #max.;T:
@fileI"enum.c;T:0@omit_headings_from_table_of_contents_below0I"|min                  -> element
min(n)               -> array
min {|a, b| ... }    -> element
min(n) {|a, b| ... } -> array
;T0[�I"(*args);T@TFI"Enumerable;TcRDoc::NormalModule00