Linux heracles.o2switch.net 4.18.0-553.62.1.lve.el8.x86_64 #1 SMP Mon Jul 21 17:50:35 UTC 2025 x86_64
/
opt
/
alt
/
ruby27
/
share
/
ri
/
system
/
Enumerable
/
//opt/alt/ruby27/share/ri/system/Enumerable/cdesc-Enumerable.ri
U:RDoc::NormalModule[iI"Enumerable:ET@0o:RDoc::Markup::Document: @parts[o;;[o: RDoc::Markup::Paragraph;[ I"CThe Enumerable mixin provides collection classes with several ;TI"Htraversal and searching methods, and with the ability to sort. The ;TI"5class must provide a method #each, which yields ;TI"Gsuccessive members of the collection. If Enumerable#max, #min, or ;TI"H#sort is used, the objects in the collection must also implement a ;TI"Gmeaningful <code><=></code> operator, as these methods rely on an ;TI"0ordering between members of the collection.;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[[; [ [; [ [;[A[I" all?;TI" enum.c;T[I" any?;T@1[I" chain;TI"enumerator.c;T[I" chunk;T@1[I"chunk_while;T@1[I" collect;T@1[I"collect_concat;T@1[I" count;T@1[I" cycle;T@1[I" detect;T@1[I" drop;T@1[I"drop_while;T@1[I"each_cons;T@1[I"each_entry;T@1[I"each_slice;T@1[I"each_with_index;T@1[I"each_with_object;T@1[I" entries;T@1[I" filter;T@1[I"filter_map;T@1[I" find;T@1[I" find_all;T@1[I"find_index;T@1[I" first;T@1[I" flat_map;T@1[I" grep;T@1[I" grep_v;T@1[I" group_by;T@1[I" include?;T@1[I" inject;T@1[I" lazy;T@6[I"map;T@1[I"max;T@1[I" max_by;T@1[I" member?;T@1[I"min;T@1[I" min_by;T@1[I" minmax;T@1[I"minmax_by;T@1[I" none?;T@1[I" one?;T@1[I"partition;T@1[I" reduce;T@1[I" reject;T@1[I"reverse_each;T@1[I" select;T@1[I"slice_after;T@1[I"slice_before;T@1[I"slice_when;T@1[I" sort;T@1[I" sort_by;T@1[I"sum;T@1[I" take;T@1[I"take_while;T@1[I" tally;T@1[I" to_a;T@1[I" to_h;T@1[I" to_set;TI"lib/set.rb;T[I" uniq;T@1[I"zip;T@1[ [U:RDoc::Context::Section[i 0o;;[ ; 0; 0[I" enum.c;TI"enumerator.c;TI"lib/set.rb;T@cRDoc::TopLevel