Gecko [ beriskala.com ]

Name	Size	Permission	Date
%26-i.ri	550 B	-rw-r--r--	2024-06-26 17:25
%2b-i.ri	224 B	-rw-r--r--	2024-06-26 17:25
%2d-i.ri	572 B	-rw-r--r--	2024-06-26 17:25
%3c%3c-i.ri	225 B	-rw-r--r--	2024-06-26 17:25
%3c%3d%3e-i.ri	394 B	-rw-r--r--	2024-06-26 17:25
%3c%3d-i.ri	231 B	-rw-r--r--	2024-06-26 17:25
%3c-i.ri	236 B	-rw-r--r--	2024-06-26 17:25
%3d%3d%3d-i.ri	724 B	-rw-r--r--	2024-06-26 17:25
%3d%3d-i.ri	651 B	-rw-r--r--	2024-06-26 17:25
%3e%3d-i.ri	233 B	-rw-r--r--	2024-06-26 17:25
%3e-i.ri	238 B	-rw-r--r--	2024-06-26 17:25
%5b%5d-c.ri	511 B	-rw-r--r--	2024-06-26 17:25
%5e-i.ri	613 B	-rw-r--r--	2024-06-26 17:25
%7c-i.ri	585 B	-rw-r--r--	2024-06-26 17:25
add%3f-i.ri	582 B	-rw-r--r--	2024-06-26 17:25
add-i.ri	617 B	-rw-r--r--	2024-06-26 17:25
as_json-i.ri	387 B	-rw-r--r--	2024-06-26 17:25
cdesc-Set.ri	3.99 KB	-rw-r--r--	2024-06-26 17:25
classify-i.ri	850 B	-rw-r--r--	2024-06-26 17:25
clear-i.ri	510 B	-rw-r--r--	2024-06-26 17:25
collect%21-i.ri	406 B	-rw-r--r--	2024-06-26 17:25
compare_by_identity%3f-i.ri	386 B	-rw-r--r--	2024-06-26 17:25
compare_by_identity-i.ri	412 B	-rw-r--r--	2024-06-26 17:25
delete%3f-i.ri	360 B	-rw-r--r--	2024-06-26 17:25
delete-i.ri	368 B	-rw-r--r--	2024-06-26 17:25
delete_if-i.ri	399 B	-rw-r--r--	2024-06-26 17:25
difference-i.ri	242 B	-rw-r--r--	2024-06-26 17:25
disjoint%3f-i.ri	533 B	-rw-r--r--	2024-06-26 17:25
divide-i.ri	949 B	-rw-r--r--	2024-06-26 17:25
each-i.ri	392 B	-rw-r--r--	2024-06-26 17:25
empty%3f-i.ri	301 B	-rw-r--r--	2024-06-26 17:25
filter%21-i.ri	307 B	-rw-r--r--	2024-06-26 17:25
flatten%21-i.ri	381 B	-rw-r--r--	2024-06-26 17:25
flatten-i.ri	346 B	-rw-r--r--	2024-06-26 17:25
include%3f-i.ri	1 KB	-rw-r--r--	2024-06-26 17:25
initialize_clone-i.ri	311 B	-rw-r--r--	2024-06-26 17:25
initialize_dup-i.ri	294 B	-rw-r--r--	2024-06-26 17:25
inspect-i.ri	395 B	-rw-r--r--	2024-06-26 17:25
intersect%3f-i.ri	490 B	-rw-r--r--	2024-06-26 17:25
intersection-i.ri	246 B	-rw-r--r--	2024-06-26 17:25
join-i.ri	360 B	-rw-r--r--	2024-06-26 17:25
json_create-c.ri	406 B	-rw-r--r--	2024-06-26 17:25
keep_if-i.ri	396 B	-rw-r--r--	2024-06-26 17:25
length-i.ri	233 B	-rw-r--r--	2024-06-26 17:25
map%21-i.ri	233 B	-rw-r--r--	2024-06-26 17:25
member%3f-i.ri	240 B	-rw-r--r--	2024-06-26 17:25
merge-i.ri	337 B	-rw-r--r--	2024-06-26 17:25
new-c.ri	812 B	-rw-r--r--	2024-06-26 17:25
proper_subset%3f-i.ri	360 B	-rw-r--r--	2024-06-26 17:25
proper_superset%3f-i.ri	366 B	-rw-r--r--	2024-06-26 17:25
reject%21-i.ri	377 B	-rw-r--r--	2024-06-26 17:25
replace-i.ri	587 B	-rw-r--r--	2024-06-26 17:25
reset-i.ri	396 B	-rw-r--r--	2024-06-26 17:25
select%21-i.ri	446 B	-rw-r--r--	2024-06-26 17:25
size-i.ri	313 B	-rw-r--r--	2024-06-26 17:25
subset%3f-i.ri	340 B	-rw-r--r--	2024-06-26 17:25
subtract-i.ri	347 B	-rw-r--r--	2024-06-26 17:25
superset%3f-i.ri	346 B	-rw-r--r--	2024-06-26 17:25
to_a-i.ri	467 B	-rw-r--r--	2024-06-26 17:25
to_json-i.ri	302 B	-rw-r--r--	2024-06-26 17:25
to_s-i.ri	232 B	-rw-r--r--	2024-06-26 17:25
to_set-i.ri	511 B	-rw-r--r--	2024-06-26 17:25
union-i.ri	232 B	-rw-r--r--	2024-06-26 17:25

Rename

U:RDoc::NormalClass[iI"Set:ET@I"Object;To:RDoc::Markup::Document:@parts[o;;[�:
@fileI"!ext/json/lib/json/add/set.rb;T:0@omit_headings_from_table_of_contents_below0o;;[o:RDoc::Markup::Paragraph;[I"�This library provides the Set class, which deals with a collection
of unordered values with no duplicates. It is a hybrid of Array's
intuitive inter-operation facilities and Hash's fast lookup.;To;;[I"KThe method <code>to_set</code> is added to Enumerable for convenience.;To;;[I"�Set implements a collection of unordered values with no duplicates.
This is a hybrid of Array's intuitive inter-operation facilities and
Hash's fast lookup.;To;;[I"Set is easy to use with Enumerable objects (implementing <code>each</code>).
Most of the initializer methods and binary operators accept generic
Enumerable objects besides sets and arrays. An Enumerable object
can be converted to Set using the <code>to_set</code> method.;To;;[I"ESet uses Hash as storage, so you must note the following points:;To:RDoc::Markup::List:
@type:BULLET:@items[o:RDoc::Markup::ListItem:@label0;[o;;[I"�Equality of elements is determined according to Object#eql? and
 Object#hash. Use Set#compare_by_identity to make a set compare
 its elements by their identity.;To;;0;[o;;[I"�Set assumes that the identity of each element does not change
 while it is stored. Modifying an element of a set will render the
 set to an unreliable state.;To;;0;[o;;[I"{When a string is to be stored, a frozen copy of the string is
 stored instead unless the original string is already frozen.;TS:RDoc::Markup::Heading:
leveli:	textI"Comparison;To;;[I"\The comparison operators <code><</code>, <code>></code>, <code><=</code>, and <code>>=</code> are implemented as
shorthand for the {proper_,}{subset?,superset?} methods. The <code><=></code>
operator reflects this order, or return <code>nil</code> for sets that both
have distinct elements (<code>{x, y}</code> vs. <code>{x, z}</code> for example).;TS;;i;I"Example;To:RDoc::Markup::Verbatim;[I"�require 'set'
s1 = Set[1, 2]                        #=> #<Set: {1, 2}>
s2 = [1, 2].to_set                    #=> #<Set: {1, 2}>
s1 == s2                              #=> true
s1.add("foo")                         #=> #<Set: {1, 2, "foo"}>
s1.merge([2, 6])                      #=> #<Set: {1, 2, "foo", 6}>
s1.subset?(s2)                        #=> false
s2.subset?(s1)                        #=> true
;T:@format:	rubyS;;i;I"Contact;To;;
;;[o;;0;[o;;[I"AAkinori MUSHA <mailto:knu@iDaemons.org> (current maintainer);T;	I"lib/set.rb;T;
0;	0;
0[�[�[[I"Enumerable;To;;[�;	@C;
0I"lib/set.rb;T[[I"
class;T[[:public[�[:protected[�[:private[[I"[];T@K[I"json_create;TI"!ext/json/lib/json/add/set.rb;T[I"new;T@K[I"
instance;T[[;[�[;[�[;[@[I"&;T@K[I"+;T@K[I"-;T@K[I"<;T@K[I"<<;T@K[I"<=;T@K[I"<=>;T@K[I"==;T@K[I"===;T@K[I">;T@K[I">=;T@K[I"^;T@K[I"add;T@K[I"	add?;T@K[I"as_json;T@Z[I"
classify;T@K[I"
clear;T@K[I"
collect!;T@K[I"compare_by_identity;T@K[I"compare_by_identity?;T@K[I"delete;T@K[I"delete?;T@K[I"delete_if;T@K[I"difference;T@K[I"disjoint?;T@K[I"divide;T@K[I"	each;T@K[I"empty?;T@K[I"filter!;T@K[I"flatten;T@K[I"
flatten!;T@K[I"
include?;T@K[I"initialize_clone;T@K[I"initialize_dup;T@K[I"inspect;T@K[I"intersect?;T@K[I"intersection;T@K[I"	join;T@K[I"keep_if;T@K[I"length;T@K[I"	map!;T@K[I"member?;T@K[I"
merge;T@K[I"proper_subset?;T@K[I"proper_superset?;T@K[I"reject!;T@K[I"replace;T@K[I"
reset;T@K[I"select!;T@K[I"	size;T@K[I"subset?;T@K[I"
subtract;T@K[I"superset?;T@K[I"	to_a;T@K[I"to_json;T@Z[I"	to_s;T@K[I"to_set;T@K[I"
union;T@K[I"|;T@K[�[U:RDoc::Context::Section[i�0o;;[�;	0;
0[I"!ext/json/lib/json/add/set.rb;TI"lib/set.rb;T@CcRDoc::TopLevel