Gecko [ beriskala.com ]

Name	Size	Permission	Date
all%3f-i.ri	1.96 KB	-rw-r--r--	2026-04-07 16:51
any%3f-i.ri	1.91 KB	-rw-r--r--	2026-04-07 16:51
cdesc-Enumerable.ri	10.44 KB	-rw-r--r--	2026-04-07 16:51
chain-i.ri	532 B	-rw-r--r--	2026-04-07 16:51
chunk-i.ri	3.91 KB	-rw-r--r--	2026-04-07 16:51
chunk_while-i.ri	2.26 KB	-rw-r--r--	2026-04-07 16:51
collect-i.ri	806 B	-rw-r--r--	2026-04-07 16:51
collect_concat-i.ri	1.04 KB	-rw-r--r--	2026-04-07 16:51
compact-i.ri	525 B	-rw-r--r--	2026-04-07 16:51
count-i.ri	1.13 KB	-rw-r--r--	2026-04-07 16:51
cycle-i.ri	1.2 KB	-rw-r--r--	2026-04-07 16:51
detect-i.ri	1.06 KB	-rw-r--r--	2026-04-07 16:51
drop-i.ri	712 B	-rw-r--r--	2026-04-07 16:51
drop_while-i.ri	814 B	-rw-r--r--	2026-04-07 16:51
each_cons-i.ri	887 B	-rw-r--r--	2026-04-07 16:51
each_entry-i.ri	1.16 KB	-rw-r--r--	2026-04-07 16:51
each_slice-i.ri	888 B	-rw-r--r--	2026-04-07 16:51
each_with_index-i.ri	1.16 KB	-rw-r--r--	2026-04-07 16:51
each_with_object-i.ri	861 B	-rw-r--r--	2026-04-07 16:51
entries-i.ri	442 B	-rw-r--r--	2026-04-07 16:51
filter-i.ri	849 B	-rw-r--r--	2026-04-07 16:51
filter_map-i.ri	884 B	-rw-r--r--	2026-04-07 16:51
find-i.ri	1.16 KB	-rw-r--r--	2026-04-07 16:51
find_all-i.ri	928 B	-rw-r--r--	2026-04-07 16:51
find_index-i.ri	1.13 KB	-rw-r--r--	2026-04-07 16:51
first-i.ri	1.1 KB	-rw-r--r--	2026-04-07 16:51
flat_map-i.ri	1.1 KB	-rw-r--r--	2026-04-07 16:51
grep-i.ri	1.11 KB	-rw-r--r--	2026-04-07 16:51
grep_v-i.ri	1.15 KB	-rw-r--r--	2026-04-07 16:51
group_by-i.ri	1 KB	-rw-r--r--	2026-04-07 16:51
include%3f-i.ri	884 B	-rw-r--r--	2026-04-07 16:51
inject-i.ri	6 KB	-rw-r--r--	2026-04-07 16:51
lazy-i.ri	1.19 KB	-rw-r--r--	2026-04-07 16:51
map-i.ri	748 B	-rw-r--r--	2026-04-07 16:51
max-i.ri	2.66 KB	-rw-r--r--	2026-04-07 16:51
max_by-i.ri	1.54 KB	-rw-r--r--	2026-04-07 16:51
member%3f-i.ri	923 B	-rw-r--r--	2026-04-07 16:51
min-i.ri	2.65 KB	-rw-r--r--	2026-04-07 16:51
min_by-i.ri	1.54 KB	-rw-r--r--	2026-04-07 16:51
minmax-i.ri	1.46 KB	-rw-r--r--	2026-04-07 16:51
minmax_by-i.ri	965 B	-rw-r--r--	2026-04-07 16:51
none%3f-i.ri	1.77 KB	-rw-r--r--	2026-04-07 16:51
one%3f-i.ri	1.93 KB	-rw-r--r--	2026-04-07 16:51
partition-i.ri	1.25 KB	-rw-r--r--	2026-04-07 16:51
reduce-i.ri	5.82 KB	-rw-r--r--	2026-04-07 16:51
reject-i.ri	892 B	-rw-r--r--	2026-04-07 16:51
reverse_each-i.ri	1.01 KB	-rw-r--r--	2026-04-07 16:51
select-i.ri	849 B	-rw-r--r--	2026-04-07 16:51
slice_after-i.ri	1.62 KB	-rw-r--r--	2026-04-07 16:51
slice_before-i.ri	5.34 KB	-rw-r--r--	2026-04-07 16:51
slice_when-i.ri	2.84 KB	-rw-r--r--	2026-04-07 16:51
sort-i.ri	1.52 KB	-rw-r--r--	2026-04-07 16:51
sort_by-i.ri	3.39 KB	-rw-r--r--	2026-04-07 16:51
sum-i.ri	1.45 KB	-rw-r--r--	2026-04-07 16:51
take-i.ri	583 B	-rw-r--r--	2026-04-07 16:51
take_while-i.ri	819 B	-rw-r--r--	2026-04-07 16:51
tally-i.ri	2.29 KB	-rw-r--r--	2026-04-07 16:51
to_a-i.ri	466 B	-rw-r--r--	2026-04-07 16:51
to_h-i.ri	1017 B	-rw-r--r--	2026-04-07 16:51
to_set-i.ri	412 B	-rw-r--r--	2026-04-07 16:51
uniq-i.ri	994 B	-rw-r--r--	2026-04-07 16:51
zip-i.ri	2.5 KB	-rw-r--r--	2026-04-07 16:51

Rename

U:RDoc::AnyMethod[iI"inject:ETI"Enumerable#inject;TF:publico:RDoc::Markup::Document:@parts[Ao:RDoc::Markup::Paragraph;	[	I"FReturns the result of applying a reducer to an initial value and ;TI"Sthe first element of the Enumerable. It then takes the result and applies the ;TI"Mfunction to it and the second element of the collection, and so on. The ;TI"Kreturn value is the result returned by the final call to the function.;To:RDoc::Markup::BlankLine�o;
;	[I"You can think of;T@o:RDoc::Markup::Verbatim;	[I"2[ a, b, c, d ].inject(i) { |r, v| fn(r, v) }
;T:@format0o;
;	[I"
as being;T@o;;	[I"#fn(fn(fn(fn(i, a), b), c), d)
;T;
0o;
;	[I";In a way the +inject+ function _injects_ the function ;TI",between the elements of the enumerable.;T@o;
;	[I"B+inject+ is aliased as +reduce+. You use it when you want to ;TI"-_reduce_ a collection to a single value.;T@o;
;	[I"!The Calling Sequences;T@o;
;	[I"'Let's start with the most verbose:;T@o;;	[I"8enum.inject(initial_value) do |result, next_value|
;TI"5 # do something with +result+ and +next_value+
;TI"5 # the value returned by the block becomes the
;TI"/ # value passed in to the next iteration
;TI" # as +result+
;TI"	end
;T;
0o;
;	[I"For example:;T@o;;	[	I"=product = [ 2, 3, 4 ].inject(1) do |result, next_value|
;TI" result * next_value
;TI"	end
;TI"product #=> 24
;T;
0o;
;	[I"PWhen this runs, the block is first called with +1+ (the initial value) and ;TI"Q+2+ (the first element of the array). The block returns <tt>1*2</tt>, so on ;TI"Othe next iteration the block is called with +2+ (the previous result) and ;TI"O+3+. The block returns +6+, and is called one last time with +6+ and +4+. ;TI"PThe result of the block, +24+ becomes the value returned by +inject+. This ;TI"@code returns the product of the elements in the enumerable.;T@o;
;	[I"1First Shortcut: Default Initial value;T@o;
;	[I"PIn the case of the previous example, the initial value, +1+, wasn't really ;TI"Vnecessary: the calculation of the product of a list of numbers is self-contained.;T@o;
;	[I"RIn these circumstances, you can omit the +initial_value+ parameter. +inject+ ;TI"Qwill then initially call the block with the first element of the collection ;TI"Jas the +result+ parameter and the second element as the +next_value+.;T@o;;	[I"0[ 2, 3, 4 ].inject do |result, next_value|
;TI" result * next_value
;TI"	end
;T;
0o;
;	[I"XThis shortcut is convenient, but can only be used when the block produces a result ;TI"9which can be passed back to it as a first parameter.;T@o;
;	[I"]Here's an example where that's not the case: it returns a hash where the keys are words ;TI"Qand the values are the number of occurrences of that word in the enumerable.;T@o;;	[I"$freqs = File.read("README.md")
;TI" .scan(/\w{2,}/)
;TI". .reduce(Hash.new(0)) do |counts, word|
;TI" counts[word] += 1
;TI" counts
;TI" end
;TI"freqs #=> {"Actions"=>4,
;TI" "Status"=>5,
;TI" "MinGW"=>3,
;TI" "https"=>27,
;TI" "github"=>10,
;TI" "com"=>15, ...
;T;
0o;
;	[I"VNote that the last line of the block is just the word +counts+. This ensures the ;TI"Ereturn value of the block is the result that's being calculated.;T@o;
;	[I"/Second Shortcut: a Reducer function;T@o;
;	[I"]A reducer function is a function that takes a partial result and the next value, ;TI"Yreturning the next partial result. The block that is given to +inject+ is a reducer.;T@o;
;	[I"SYou can also write a reducer as a function and pass the name of that function ;TI"G(as a symbol) to +inject+. However, for this to work, the function;T@o:RDoc::Markup::List:
@type:NUMBER:@items[o:RDoc::Markup::ListItem:@label0;	[o;
;	[I"4Must be defined on the type of the result value;To;;0;	[o;
;	[I"JMust accept a single parameter, the next value in the collection, and;To;;0;	[o;
;	[I"JMust return an updated result which will also implement the function.;T@o;
;	[I"ZHere's an example that adds elements to a string. The two calls invoke the functions ;TI"PString#concat and String#+ on the result so far, passing it the next value.;T@o;;	[	I"3s = [ "cat", " ", "dog" ].inject("", :concat)
;TI"s #=> "cat dog"
;TI"<s = [ "cat", " ", "dog" ].inject("The result is:", :+)
;TI"$s #=> "The result is: cat dog"
;T;
0o;
;	[I"DHere's a more complex example when the result object maintains ;TI":state of a different type to the enumerable elements.;T@o;;	[I"class Turtle
;TI"
;TI" def initialize
;TI" @x = @y = 0
;TI" end
;TI"
;TI" def move(dir)
;TI" case dir
;TI" when "n" then @y += 1
;TI" when "s" then @y -= 1
;TI" when "e" then @x += 1
;TI" when "w" then @x -= 1
;TI"
 end
;TI" self
;TI" end
;TI"	end
;TI"
;TI":position = "nnneesw".chars.reduce(Turtle.new, :move)
;TI"<position #=>> #<Turtle:0x00000001052f4698 @y=2, @x=1>
;T;
0o;
;	[I"9Third Shortcut: Reducer With no Initial Value;T@o;
;	[I"QIf your reducer returns a value that it can accept as a parameter, then you ;TI"Qdon't have to pass in an initial value. Here <tt>:*</tt> is the name of the ;TI"_times_ function:;T@o;;	[I"&product = [ 2, 3, 4 ].inject(:*)
;TI"product # => 24
;T;
0o;
;	[I" String concatenation again:;T@o;;	[I"*s = [ "cat", " ", "dog" ].inject(:+)
;TI"s #=> "cat dog"
;T;
0o;
;	[I"NAnd an example that converts a hash to an array of two-element subarrays.;T@o;;	[I"1nested = {foo: 0, bar: 1}.inject([], :push)
;TI"'nested # => [[:foo, 0], [:bar, 1]];T;
0:
@fileI"enum.c;T:0@omit_headings_from_table_of_contents_below0I"�inject(symbol) -> object
inject(initial_value, symbol) -> object
inject {|memo, value| ... } -> object
inject(initial_value) {|memo, value| ... } -> object
;T0[[I"reduce;T@	I"(p1 = v1, p2 = v2);T@�FI"Enumerable;TcRDoc::NormalModule00