Gecko [ beriskala.com ]

Name	Size	Permission	Date
_enumerable_collect-i.ri	663 B	-rw-r--r--	2024-06-26 17:25
_enumerable_collect_concat-i.ri	1.17 KB	-rw-r--r--	2024-06-26 17:25
_enumerable_drop-i.ri	394 B	-rw-r--r--	2024-06-26 17:25
_enumerable_drop_while-i.ri	416 B	-rw-r--r--	2024-06-26 17:25
_enumerable_filter-i.ri	400 B	-rw-r--r--	2024-06-26 17:25
_enumerable_filter_map-i.ri	575 B	-rw-r--r--	2024-06-26 17:25
_enumerable_find_all-i.ri	406 B	-rw-r--r--	2024-06-26 17:25
_enumerable_flat_map-i.ri	1.15 KB	-rw-r--r--	2024-06-26 17:25
_enumerable_grep-i.ri	394 B	-rw-r--r--	2024-06-26 17:25
_enumerable_grep_v-i.ri	402 B	-rw-r--r--	2024-06-26 17:25
_enumerable_map-i.ri	651 B	-rw-r--r--	2024-06-26 17:25
_enumerable_reject-i.ri	400 B	-rw-r--r--	2024-06-26 17:25
_enumerable_select-i.ri	400 B	-rw-r--r--	2024-06-26 17:25
_enumerable_take-i.ri	394 B	-rw-r--r--	2024-06-26 17:25
_enumerable_take_while-i.ri	416 B	-rw-r--r--	2024-06-26 17:25
_enumerable_uniq-i.ri	392 B	-rw-r--r--	2024-06-26 17:25
_enumerable_with_index-i.ri	748 B	-rw-r--r--	2024-06-26 17:25
_enumerable_zip-i.ri	472 B	-rw-r--r--	2024-06-26 17:25
cdesc-Lazy.ri	4.15 KB	-rw-r--r--	2024-06-26 17:25
chunk-i.ri	824 B	-rw-r--r--	2024-06-26 17:25
chunk_while-i.ri	395 B	-rw-r--r--	2024-06-26 17:25
collect-i.ri	665 B	-rw-r--r--	2024-06-26 17:25
collect_concat-i.ri	1.17 KB	-rw-r--r--	2024-06-26 17:25
drop-i.ri	413 B	-rw-r--r--	2024-06-26 17:25
drop_while-i.ri	441 B	-rw-r--r--	2024-06-26 17:25
eager-i.ri	359 B	-rw-r--r--	2024-06-26 17:25
enum_for-i.ri	1.04 KB	-rw-r--r--	2024-06-26 17:25
filter-i.ri	405 B	-rw-r--r--	2024-06-26 17:25
filter_map-i.ri	599 B	-rw-r--r--	2024-06-26 17:25
find_all-i.ri	411 B	-rw-r--r--	2024-06-26 17:25
flat_map-i.ri	1.26 KB	-rw-r--r--	2024-06-26 17:25
force-i.ri	372 B	-rw-r--r--	2024-06-26 17:25
grep-i.ri	477 B	-rw-r--r--	2024-06-26 17:25
grep_v-i.ri	489 B	-rw-r--r--	2024-06-26 17:25
lazy-i.ri	316 B	-rw-r--r--	2024-06-26 17:25
map-i.ri	738 B	-rw-r--r--	2024-06-26 17:25
new-c.ri	970 B	-rw-r--r--	2024-06-26 17:25
reject-i.ri	420 B	-rw-r--r--	2024-06-26 17:25
select-i.ri	557 B	-rw-r--r--	2024-06-26 17:25
slice_after-i.ri	395 B	-rw-r--r--	2024-06-26 17:25
slice_before-i.ri	398 B	-rw-r--r--	2024-06-26 17:25
slice_when-i.ri	392 B	-rw-r--r--	2024-06-26 17:25
take-i.ri	413 B	-rw-r--r--	2024-06-26 17:25
take_while-i.ri	440 B	-rw-r--r--	2024-06-26 17:25
to_a-i.ri	396 B	-rw-r--r--	2024-06-26 17:25
to_enum-i.ri	1.28 KB	-rw-r--r--	2024-06-26 17:25
uniq-i.ri	457 B	-rw-r--r--	2024-06-26 17:25
with_index-i.ri	908 B	-rw-r--r--	2024-06-26 17:25
zip-i.ri	543 B	-rw-r--r--	2024-06-26 17:25

Rename

U:RDoc::NormalClass[iI"	Lazy:ETI"Enumerator::Lazy;TI"Enumerator;To:RDoc::Markup::Document:@parts[o;;[o:RDoc::Markup::Paragraph;[	I"PEnumerator::Lazy is a special type of Enumerator, that allows constructing ;TI"Nchains of operations without evaluating them immediately, and evaluating ;TI"Rvalues on as-needed basis. In order to do so it redefines most of Enumerable ;TI"Amethods so that they just construct another lazy enumerator.;To:RDoc::Markup::BlankLine�o;	;[I"FEnumerator::Lazy can be constructed from any Enumerable with the ;TI"Enumerable#lazy method.;T@o:RDoc::Markup::Verbatim;[I"Xlazy = (1..Float::INFINITY).lazy.select(&:odd?).drop(10).take_while { |i| i < 30 }
;TI"�# => #<Enumerator::Lazy: #<Enumerator::Lazy: #<Enumerator::Lazy: #<Enumerator::Lazy: 1..Infinity>:select>:drop(10)>:take_while>
;T:@format0o;	;[I"PThe real enumeration is performed when any non-redefined Enumerable method ;TI"Pis called, like Enumerable#first or Enumerable#to_a (the latter is aliased ;TI"'as #force for more semantic code):;T@o;;[
I"lazy.first(2)
;TI"#=> [21, 23]
;TI"
;TI"lazy.force
;TI"#=> [21, 23, 25, 27, 29]
;T;0o;	;[I"LNote that most Enumerable methods that could be called with or without ;TI">a block, on Enumerator::Lazy will always require a block:;T@o;;[I":[1, 2, 3].map       #=> #<Enumerator: [1, 2, 3]:map>
;TI"Q[1, 2, 3].lazy.map  # ArgumentError: tried to call lazy map without a block
;T;0o;	;[I"UThis class allows idiomatic calculations on long or infinite sequences, as well ;TI"Jas chaining of calculations without constructing intermediate arrays.;T@o;	;[I";Example for working with a slowly calculated sequence:;T@o;;[I"require 'open-uri'
;TI"
;TI"1# This will fetch all URLs before selecting
;TI"# necessary data
;TI"/URLS.map { |u| JSON.parse(open(u).read) }
;TI"-  .select { |data| data.key?('stats') }
;TI"  .first(5)
;TI"
;TI"2# This will fetch URLs one-by-one, only till
;TI"5# there is enough data to satisfy the condition
;TI"4URLS.lazy.map { |u| JSON.parse(open(u).read) }
;TI"-  .select { |data| data.key?('stats') }
;TI"  .first(5)
;T;0o;	;[I"IEnding a chain with ".eager" generates a non-lazy enumerator, which ;TI"Iis suitable for returning or passing to another method that expects ;TI"a normal enumerator.;T@o;;[I"def active_items
;TI"  groups
;TI"    .lazy
;TI"    .flat_map(&:items)
;TI"    .reject(&:disabled)
;TI"    .eager
;TI"	end
;TI"
;TI"?# This works lazily; if a checked item is found, it stops
;TI":# iteration and does not look into remaining groups.
;TI"2first_checked = active_items.find(&:checked)
;TI"
;TI"E# This returns an array of items like a normal enumerator does.
;TI"1all_checked = active_items.select(&:checked);T;0:
@fileI"enumerator.c;T:0@omit_headings_from_table_of_contents_below0;
0;0[�[�[�[[I"
class;T[[:public[�[:protected[�[:private[[I"new;TI"enumerator.c;T[I"
instance;T[[;[�[;[�[;[4[I"_enumerable_collect;T@l[I"_enumerable_collect_concat;T@l[I"_enumerable_drop;T@l[I"_enumerable_drop_while;T@l[I"_enumerable_filter;T@l[I"_enumerable_filter_map;T@l[I"_enumerable_find_all;T@l[I"_enumerable_flat_map;T@l[I"_enumerable_grep;T@l[I"_enumerable_grep_v;T@l[I"_enumerable_map;T@l[I"_enumerable_reject;T@l[I"_enumerable_select;T@l[I"_enumerable_take;T@l[I"_enumerable_take_while;T@l[I"_enumerable_uniq;T@l[I"_enumerable_with_index;T@l[I"_enumerable_zip;T@l[I"
chunk;T@l[I"chunk_while;T@l[I"collect;T@l[I"collect_concat;T@l[I"	drop;T@l[I"drop_while;T@l[I"
eager;T@l[I"
enum_for;T@l[I"filter;T@l[I"filter_map;T@l[I"
find_all;T@l[I"
flat_map;T@l[I"
force;T@l[I"	grep;T@l[I"grep_v;T@l[I"	lazy;T@l[I"map;T@l[I"reject;T@l[I"select;T@l[I"slice_after;T@l[I"slice_before;T@l[I"slice_when;T@l[I"	take;T@l[I"take_while;T@l[I"	to_a;T@l[I"to_enum;T@l[I"	uniq;T@l[I"with_index;T@l[I"zip;T@l[�[U:RDoc::Context::Section[i�0o;;[�;
0;0[I"enumerator.c;TI"Enumerator;TcRDoc::NormalClass