Gecko [ beriskala.com ]

Name	Size	Permission	Date
%26-i.ri	379 B	-rw-r--r--	2023-07-26 17:38
%2b-i.ri	210 B	-rw-r--r--	2023-07-26 17:38
%2d-i.ri	404 B	-rw-r--r--	2023-07-26 17:38
%3c%3c-i.ri	209 B	-rw-r--r--	2023-07-26 17:38
%3c%3d-i.ri	211 B	-rw-r--r--	2023-07-26 17:38
%3c-i.ri	209 B	-rw-r--r--	2023-07-26 17:38
%3d%3d-i.ri	371 B	-rw-r--r--	2023-07-26 17:38
%3e%3d-i.ri	211 B	-rw-r--r--	2023-07-26 17:38
%3e-i.ri	209 B	-rw-r--r--	2023-07-26 17:38
%5b%5d-c.ri	298 B	-rw-r--r--	2023-07-26 17:38
%5e-i.ri	420 B	-rw-r--r--	2023-07-26 17:38
%7c-i.ri	400 B	-rw-r--r--	2023-07-26 17:38
add%3f-i.ri	359 B	-rw-r--r--	2023-07-26 17:38
add-i.ri	375 B	-rw-r--r--	2023-07-26 17:38
cdesc-Set.ri	2.86 KB	-rw-r--r--	2023-07-26 17:38
classify-i.ri	859 B	-rw-r--r--	2023-07-26 17:38
clear-i.ri	290 B	-rw-r--r--	2023-07-26 17:38
collect%21-i.ri	347 B	-rw-r--r--	2023-07-26 17:38
delete%3f-i.ri	366 B	-rw-r--r--	2023-07-26 17:38
delete-i.ri	363 B	-rw-r--r--	2023-07-26 17:38
delete_if-i.ri	359 B	-rw-r--r--	2023-07-26 17:38
difference-i.ri	228 B	-rw-r--r--	2023-07-26 17:38
divide-i.ri	960 B	-rw-r--r--	2023-07-26 17:38
each-i.ri	404 B	-rw-r--r--	2023-07-26 17:38
empty%3f-i.ri	299 B	-rw-r--r--	2023-07-26 17:38
flatten%21-i.ri	387 B	-rw-r--r--	2023-07-26 17:38
flatten-i.ri	351 B	-rw-r--r--	2023-07-26 17:38
include%3f-i.ri	340 B	-rw-r--r--	2023-07-26 17:38
initialize_copy-i.ri	295 B	-rw-r--r--	2023-07-26 17:38
inspect-i.ri	372 B	-rw-r--r--	2023-07-26 17:38
intersection-i.ri	232 B	-rw-r--r--	2023-07-26 17:38
keep_if-i.ri	356 B	-rw-r--r--	2023-07-26 17:38
length-i.ri	216 B	-rw-r--r--	2023-07-26 17:38
map%21-i.ri	212 B	-rw-r--r--	2023-07-26 17:38
member%3f-i.ri	219 B	-rw-r--r--	2023-07-26 17:38
merge-i.ri	342 B	-rw-r--r--	2023-07-26 17:38
new-c.ri	473 B	-rw-r--r--	2023-07-26 17:38
proper_subset%3f-i.ri	358 B	-rw-r--r--	2023-07-26 17:38
proper_superset%3f-i.ri	364 B	-rw-r--r--	2023-07-26 17:38
reject%21-i.ri	338 B	-rw-r--r--	2023-07-26 17:38
replace-i.ri	366 B	-rw-r--r--	2023-07-26 17:38
select%21-i.ri	336 B	-rw-r--r--	2023-07-26 17:38
size-i.ri	311 B	-rw-r--r--	2023-07-26 17:38
subset%3f-i.ri	338 B	-rw-r--r--	2023-07-26 17:38
subtract-i.ri	352 B	-rw-r--r--	2023-07-26 17:38
superset%3f-i.ri	344 B	-rw-r--r--	2023-07-26 17:38
to_a-i.ri	316 B	-rw-r--r--	2023-07-26 17:38
union-i.ri	218 B	-rw-r--r--	2023-07-26 17:38

Rename

U:RDoc::NormalClass[iI"Set:ET@I"Object;To:RDoc::Markup::Document:@parts[o;;[o:RDoc::Markup::Paragraph;[I"ISet implements a collection of unordered values with no duplicates. ;TI"JThis is a hybrid of Array's intuitive inter-operation facilities and ;TI"Hash's fast lookup.;To:RDoc::Markup::BlankLine�o;	;[I"HThe equality of each couple of elements is determined according to ;TI"AObject#eql? and Object#hash, since Set uses Hash as storage.;T@o;	;[	I"GSet is easy to use with Enumerable objects (implementing +each+). ;TI"IMost of the initializer methods and binary operators accept generic ;TI"GEnumerable objects besides sets and arrays.  An Enumerable object ;TI"7can be converted to Set using the +to_set+ method.;T@S:RDoc::Markup::Heading:
leveli:	textI"Comparison;T@o;	;[	I"AThe comparison operators <, >, <= and >= are implemented as ;TI"Hshorthand for the {proper_,}{subset?,superset?} methods.  However, ;TI"Jthe <=> operator is intentionally left out because not every pair of ;TI"6sets is comparable. ({x,y} vs. {x,z} for example);T@S;;i;
I"Example;T@o:RDoc::Markup::Verbatim;[
I"require 'set'
;TI"?s1 = Set.new [1, 2]                   # -> #<Set: {1, 2}>
;TI"?s2 = [1, 2].to_set                    # -> #<Set: {1, 2}>
;TI"5s1 == s2                              # -> true
;TI"Fs1.add("foo")                         # -> #<Set: {1, 2, "foo"}>
;TI"Is1.merge([2, 6])                      # -> #<Set: {6, 1, 2, "foo"}>
;TI"6s1.subset? s2                         # -> false
;TI"5s2.subset? s1                         # -> true
;T:@format0S;;i;
I"Contact;T@o;;[I"<- Akinori MUSHA <knu@iDaemons.org> (current maintainer);T;0:
@fileI"lib/set.rb;T:0@omit_headings_from_table_of_contents_below0;0;0[�[U:RDoc::Constant[i�I"InspectKey;FI"Set::InspectKey;T00o;;[�;@6;0@6@cRDoc::NormalClass0[[I"Enumerable;To;;[�;@6;0I"lib/set.rb;T[[I"
class;T[[:public[[I"[];F@E[I"new;T@E[:protected[�[:private[�[I"
instance;T[[;[2[I"&;T@E[I"+;T@E[I"-;T@E[I"<;T@E[I"<<;T@E[I"<=;T@E[I"==;T@E[I">;T@E[I">=;T@E[I"^;F@E[I"add;F@E[I"	add?;F@E[I"
classify;F@E[I"
clear;F@E[I"
collect!;F@E[I"delete;F@E[I"delete?;F@E[I"delete_if;F@E[I"difference;F@E[I"divide;F@E[I"	each;F@E[I"empty?;F@E[I"flatten;F@E[I"
flatten!;F@E[I"
include?;F@E[I"initialize_copy;F@E[I"inspect;F@E[I"intersection;F@E[I"keep_if;F@E[I"length;F@E[I"	map!;F@E[I"member?;F@E[I"
merge;F@E[I"proper_subset?;F@E[I"proper_superset?;F@E[I"reject!;F@E[I"replace;F@E[I"select!;F@E[I"	size;F@E[I"subset?;F@E[I"
subtract;F@E[I"superset?;F@E[I"	to_a;F@E[I"
union;F@E[I"|;T@E[;[�[;[�[�[U:RDoc::Context::Section[i�0o;;[�;0;0[@6@6cRDoc::TopLevel