Gecko [ beriskala.com ]

Name	Size	Permission	Date
%26-i.ri	380 B	-rw-r--r--	2023-07-26 18:09
%2b-i.ri	223 B	-rw-r--r--	2023-07-26 18:09
%2d-i.ri	405 B	-rw-r--r--	2023-07-26 18:09
%3c%3c-i.ri	224 B	-rw-r--r--	2023-07-26 18:09
%3c%3d-i.ri	230 B	-rw-r--r--	2023-07-26 18:09
%3c-i.ri	235 B	-rw-r--r--	2023-07-26 18:09
%3d%3d-i.ri	372 B	-rw-r--r--	2023-07-26 18:09
%3e%3d-i.ri	232 B	-rw-r--r--	2023-07-26 18:09
%3e-i.ri	237 B	-rw-r--r--	2023-07-26 18:09
%5b%5d-c.ri	299 B	-rw-r--r--	2023-07-26 18:09
%5e-i.ri	421 B	-rw-r--r--	2023-07-26 18:09
%7c-i.ri	401 B	-rw-r--r--	2023-07-26 18:09
add%3f-i.ri	360 B	-rw-r--r--	2023-07-26 18:09
add-i.ri	376 B	-rw-r--r--	2023-07-26 18:09
cdesc-Set.ri	3.3 KB	-rw-r--r--	2023-07-26 18:09
classify-i.ri	860 B	-rw-r--r--	2023-07-26 18:09
clear-i.ri	291 B	-rw-r--r--	2023-07-26 18:09
collect%21-i.ri	348 B	-rw-r--r--	2023-07-26 18:09
delete%3f-i.ri	367 B	-rw-r--r--	2023-07-26 18:09
delete-i.ri	364 B	-rw-r--r--	2023-07-26 18:09
delete_if-i.ri	360 B	-rw-r--r--	2023-07-26 18:09
difference-i.ri	241 B	-rw-r--r--	2023-07-26 18:09
disjoint%3f-i.ri	595 B	-rw-r--r--	2023-07-26 18:09
divide-i.ri	961 B	-rw-r--r--	2023-07-26 18:09
each-i.ri	405 B	-rw-r--r--	2023-07-26 18:09
empty%3f-i.ri	300 B	-rw-r--r--	2023-07-26 18:09
flatten%21-i.ri	388 B	-rw-r--r--	2023-07-26 18:09
flatten-i.ri	352 B	-rw-r--r--	2023-07-26 18:09
include%3f-i.ri	566 B	-rw-r--r--	2023-07-26 18:09
initialize_clone-i.ri	299 B	-rw-r--r--	2023-07-26 18:09
initialize_dup-i.ri	293 B	-rw-r--r--	2023-07-26 18:09
inspect-i.ri	373 B	-rw-r--r--	2023-07-26 18:09
intersect%3f-i.ri	563 B	-rw-r--r--	2023-07-26 18:09
intersection-i.ri	245 B	-rw-r--r--	2023-07-26 18:09
keep_if-i.ri	357 B	-rw-r--r--	2023-07-26 18:09
length-i.ri	232 B	-rw-r--r--	2023-07-26 18:09
map%21-i.ri	232 B	-rw-r--r--	2023-07-26 18:09
member%3f-i.ri	239 B	-rw-r--r--	2023-07-26 18:09
merge-i.ri	343 B	-rw-r--r--	2023-07-26 18:09
new-c.ri	474 B	-rw-r--r--	2023-07-26 18:09
proper_subset%3f-i.ri	359 B	-rw-r--r--	2023-07-26 18:09
proper_superset%3f-i.ri	365 B	-rw-r--r--	2023-07-26 18:09
reject%21-i.ri	339 B	-rw-r--r--	2023-07-26 18:09
replace-i.ri	367 B	-rw-r--r--	2023-07-26 18:09
select%21-i.ri	337 B	-rw-r--r--	2023-07-26 18:09
size-i.ri	312 B	-rw-r--r--	2023-07-26 18:09
subset%3f-i.ri	339 B	-rw-r--r--	2023-07-26 18:09
subtract-i.ri	353 B	-rw-r--r--	2023-07-26 18:09
superset%3f-i.ri	345 B	-rw-r--r--	2023-07-26 18:09
to_a-i.ri	317 B	-rw-r--r--	2023-07-26 18:09
to_set-i.ri	525 B	-rw-r--r--	2023-07-26 18:09
union-i.ri	231 B	-rw-r--r--	2023-07-26 18:09

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"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@o;	;[I"ESet uses Hash as storage, so you must note the following points:;T@o:RDoc::Markup::List:
@type:BULLET:@items[o:RDoc::Markup::ListItem:@label0;[o;	;[I"EEquality of elements is determined according to Object#eql? and ;TI"Object#hash.;To;;0;[o;	;[I"CSet assumes that the identity of each element does not change ;TI"Hwhile it is stored.  Modifying an element of a set will render the ;TI" set to an unreliable state.;To;;0;[o;	;[I"CWhen a string is to be stored, a frozen copy of the string is ;TI"Astored instead unless the original string is already frozen.;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: {1, 2, "foo", 6}>
;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[�[�[[I"Enumerable;To;;[�;@J;0I"lib/set.rb;T[[I"
class;T[[:public[[I"[];F@R[I"new;T@R[:protected[�[:private[�[I"
instance;T[[;[6[I"&;T@R[I"+;T@R[I"-;T@R[I"<;T@R[I"<<;T@R[I"<=;T@R[I"==;T@R[I">;T@R[I">=;T@R[I"^;F@R[I"add;F@R[I"	add?;F@R[I"
classify;F@R[I"
clear;F@R[I"
collect!;F@R[I"delete;F@R[I"delete?;F@R[I"delete_if;F@R[I"difference;F@R[I"disjoint?;F@R[I"divide;F@R[I"	each;F@R[I"empty?;F@R[I"flatten;F@R[I"
flatten!;F@R[I"
include?;F@R[I"initialize_clone;F@R[I"initialize_dup;F@R[I"inspect;F@R[I"intersect?;F@R[I"intersection;F@R[I"keep_if;F@R[I"length;F@R[I"	map!;F@R[I"member?;F@R[I"
merge;F@R[I"proper_subset?;F@R[I"proper_superset?;F@R[I"reject!;F@R[I"replace;F@R[I"select!;F@R[I"	size;F@R[I"subset?;F@R[I"
subtract;F@R[I"superset?;F@R[I"	to_a;F@R[I"to_set;F@R[I"
union;F@R[I"|;T@R[;[�[;[�[�[U:RDoc::Context::Section[i�0o;;[�;0;0[@J@JcRDoc::TopLevel