Gecko [ beriskala.com ]

Name	Size	Permission	Date
%3c%3d-i.ri	584 B	-rw-r--r--	2023-06-06 18:25
%3c-i.ri	556 B	-rw-r--r--	2023-06-06 18:25
%3d%3d-i.ri	978 B	-rw-r--r--	2023-06-06 18:25
%3e%3d-i.ri	583 B	-rw-r--r--	2023-06-06 18:25
%3e-i.ri	556 B	-rw-r--r--	2023-06-06 18:25
%5b%5d%3d-i.ri	1012 B	-rw-r--r--	2023-06-06 18:25
%5b%5d-c.ri	1.03 KB	-rw-r--r--	2023-06-06 18:25
%5b%5d-i.ri	604 B	-rw-r--r--	2023-06-06 18:25
any%3f-i.ri	395 B	-rw-r--r--	2023-06-06 18:25
assoc-i.ri	743 B	-rw-r--r--	2023-06-06 18:25
cdesc-Hash.ri	5.54 KB	-rw-r--r--	2023-06-06 18:25
clear-i.ri	497 B	-rw-r--r--	2023-06-06 18:25
compact%21-i.ri	549 B	-rw-r--r--	2023-06-06 18:25
compact-i.ri	542 B	-rw-r--r--	2023-06-06 18:25
compare_by_identity%3f-i.ri	453 B	-rw-r--r--	2023-06-06 18:25
compare_by_identity-i.ri	759 B	-rw-r--r--	2023-06-06 18:25
deconstruct_keys-i.ri	238 B	-rw-r--r--	2023-06-06 18:25
default%3d-i.ri	894 B	-rw-r--r--	2023-06-06 18:25
default-i.ri	1.03 KB	-rw-r--r--	2023-06-06 18:25
default_proc%3d-i.ri	581 B	-rw-r--r--	2023-06-06 18:25
default_proc-i.ri	713 B	-rw-r--r--	2023-06-06 18:25
delete-i.ri	929 B	-rw-r--r--	2023-06-06 18:25
delete_if-i.ri	726 B	-rw-r--r--	2023-06-06 18:25
dig-i.ri	928 B	-rw-r--r--	2023-06-06 18:25
each-i.ri	867 B	-rw-r--r--	2023-06-06 18:25
each_key-i.ri	715 B	-rw-r--r--	2023-06-06 18:25
each_pair-i.ri	776 B	-rw-r--r--	2023-06-06 18:25
each_value-i.ri	739 B	-rw-r--r--	2023-06-06 18:25
empty%3f-i.ri	453 B	-rw-r--r--	2023-06-06 18:25
eql%3f-i.ri	447 B	-rw-r--r--	2023-06-06 18:25
fetch-i.ri	1.27 KB	-rw-r--r--	2023-06-06 18:25
fetch_values-i.ri	935 B	-rw-r--r--	2023-06-06 18:25
filter%21-i.ri	527 B	-rw-r--r--	2023-06-06 18:25
filter-i.ri	785 B	-rw-r--r--	2023-06-06 18:25
flatten-i.ri	915 B	-rw-r--r--	2023-06-06 18:25
has_key%3f-i.ri	719 B	-rw-r--r--	2023-06-06 18:25
has_value%3f-i.ri	570 B	-rw-r--r--	2023-06-06 18:25
hash-i.ri	488 B	-rw-r--r--	2023-06-06 18:25
include%3f-i.ri	719 B	-rw-r--r--	2023-06-06 18:25
initialize_copy-i.ri	569 B	-rw-r--r--	2023-06-06 18:25
inspect-i.ri	569 B	-rw-r--r--	2023-06-06 18:25
invert-i.ri	1.23 KB	-rw-r--r--	2023-06-06 18:25
keep_if-i.ri	593 B	-rw-r--r--	2023-06-06 18:25
key%3f-i.ri	711 B	-rw-r--r--	2023-06-06 18:25
key-i.ri	603 B	-rw-r--r--	2023-06-06 18:25
keys-i.ri	534 B	-rw-r--r--	2023-06-06 18:25
length-i.ri	635 B	-rw-r--r--	2023-06-06 18:25
member%3f-i.ri	717 B	-rw-r--r--	2023-06-06 18:25
merge%21-i.ri	1.8 KB	-rw-r--r--	2023-06-06 18:25
merge-i.ri	1.54 KB	-rw-r--r--	2023-06-06 18:25
new-c.ri	1.63 KB	-rw-r--r--	2023-06-06 18:25
rassoc-i.ri	686 B	-rw-r--r--	2023-06-06 18:25
rehash-i.ri	886 B	-rw-r--r--	2023-06-06 18:25
reject%21-i.ri	457 B	-rw-r--r--	2023-06-06 18:25
reject-i.ri	731 B	-rw-r--r--	2023-06-06 18:25
replace-i.ri	552 B	-rw-r--r--	2023-06-06 18:25
ruby2_keywords_hash%3f-c.ri	785 B	-rw-r--r--	2023-06-06 18:25
ruby2_keywords_hash-c.ri	747 B	-rw-r--r--	2023-06-06 18:25
select%21-i.ri	527 B	-rw-r--r--	2023-06-06 18:25
select-i.ri	785 B	-rw-r--r--	2023-06-06 18:25
shift-i.ri	654 B	-rw-r--r--	2023-06-06 18:25
size-i.ri	631 B	-rw-r--r--	2023-06-06 18:25
slice-i.ri	552 B	-rw-r--r--	2023-06-06 18:25
store-i.ri	1016 B	-rw-r--r--	2023-06-06 18:25
to_a-i.ri	563 B	-rw-r--r--	2023-06-06 18:25
to_h-i.ri	594 B	-rw-r--r--	2023-06-06 18:25
to_hash-i.ri	298 B	-rw-r--r--	2023-06-06 18:25
to_proc-i.ri	582 B	-rw-r--r--	2023-06-06 18:25
to_s-i.ri	230 B	-rw-r--r--	2023-06-06 18:25
transform_keys%21-i.ri	1017 B	-rw-r--r--	2023-06-06 18:25
transform_keys-i.ri	964 B	-rw-r--r--	2023-06-06 18:25
transform_values%21-i.ri	1.01 KB	-rw-r--r--	2023-06-06 18:25
transform_values-i.ri	970 B	-rw-r--r--	2023-06-06 18:25
try_convert-c.ri	619 B	-rw-r--r--	2023-06-06 18:25
update-i.ri	1.8 KB	-rw-r--r--	2023-06-06 18:25
value%3f-i.ri	562 B	-rw-r--r--	2023-06-06 18:25
values-i.ri	526 B	-rw-r--r--	2023-06-06 18:25
values_at-i.ri	600 B	-rw-r--r--	2023-06-06 18:25

Rename

U:RDoc::NormalClass[iI"	Hash:ET@I"Object;To:RDoc::Markup::Document:@parts[o;;[3o:RDoc::Markup::Paragraph;[	I"MA Hash is a dictionary-like collection of unique keys and their values. ;TI"NAlso called associative arrays, they are similar to Arrays, but where an ;TI"KArray uses integers as its index, a Hash allows you to use any object ;TI"
type.;To:RDoc::Markup::BlankLine�o;	;[I"LHashes enumerate their values in the order that the corresponding keys ;TI"were inserted.;T@o;	;[I"=A Hash can be easily created by using its implicit form:;T@o:RDoc::Markup::Verbatim;[I"3grades = { "Jane Doe" => 10, "Jim Doe" => 6 }
;T:@format0o;	;[I"AHashes allow an alternate syntax for keys that are symbols. ;TI"Instead of;T@o;;[I"=options = { :font_size => 10, :font_family => "Arial" }
;T;0o;	;[I"You could write it as:;T@o;;[I"7options = { font_size: 10, font_family: "Arial" }
;T;0o;	;[I"7Each named key is a symbol you can access in hash:;T@o;;[I""options[:font_size]  # => 10
;T;0o;	;[I"9A Hash can also be created through its ::new method:;T@o;;[I"grades = Hash.new
;TI"grades["Dorothy Doe"] = 9
;T;0o;	;[I"JHashes have a <em>default value</em> that is returned when accessing ;TI"Mkeys that do not exist in the hash. If no default is set +nil+ is used. ;TI"LYou can set the default value by sending it as an argument to Hash.new:;T@o;;[I"grades = Hash.new(0)
;T;0o;	;[I"&Or by using the #default= method:;T@o;;[I"!grades = {"Timmy Doe" => 8}
;TI"grades.default = 0
;T;0o;	;[I"8Accessing a value in a Hash requires using its key:;T@o;;[I"$puts grades["Jane Doe"] # => 0
;T;0S:RDoc::Markup::Heading:
leveli:	textI"Common Uses;T@o;	;[I"AHashes are an easy way to represent data structures, such as;T@o;;[I"books         = {}
;TI"5books[:matz]  = "The Ruby Programming Language"
;TI"1books[:black] = "The Well-Grounded Rubyist"
;T;0o;	;[	I"HHashes are also commonly used as a way to have named parameters in ;TI"Lfunctions. Note that no brackets are used below. If a hash is the last ;TI"Margument on a method call, no braces are needed, thus creating a really ;TI"clean interface:;T@o;;[I".Person.create(name: "John Doe", age: 27)
;TI"
;TI"def self.create(params)
;TI"  @name = params[:name]
;TI"  @age  = params[:age]
;TI"	end
;T;0S;
;i;I"Hash Keys;T@o;	;[I"OTwo objects refer to the same hash key when their <code>hash</code> value ;TI"Jis identical and the two objects are <code>eql?</code> to each other.;T@o;	;[I"MA user-defined class may be used as a hash key if the <code>hash</code> ;TI"Hand <code>eql?</code> methods are overridden to provide meaningful ;TI"Kbehavior.  By default, separate instances refer to separate hash keys.;T@o;	;[I"CA typical implementation of <code>hash</code> is based on the ;TI"Pobject's data while <code>eql?</code> is usually aliased to the overridden ;TI"<code>==</code> method:;T@o;;[#I"class Book
;TI"#  attr_reader :author, :title
;TI"
;TI"%  def initialize(author, title)
;TI"    @author = author
;TI"    @title = title
;TI"  end
;TI"
;TI"  def ==(other)
;TI""    self.class === other and
;TI"'      other.author == @author and
;TI"!      other.title == @title
;TI"  end
;TI"
;TI"  alias eql? ==
;TI"
;TI"  def hash
;TI"*    @author.hash ^ @title.hash # XOR
;TI"  end
;TI"	end
;TI"
;TI"3book1 = Book.new 'matz', 'Ruby in a Nutshell'
;TI"3book2 = Book.new 'matz', 'Ruby in a Nutshell'
;TI"
;TI"reviews = {}
;TI"
;TI")reviews[book1] = 'Great reference!'
;TI"*reviews[book2] = 'Nice and compact!'
;TI"
;TI"reviews.length #=> 1
;T;0o;	;[I")See also Object#hash and Object#eql?;T:
@fileI"hash.c;T:0@omit_headings_from_table_of_contents_below0;0;0[�[�[[I"Enumerable;To;;[�;@�;0I"hash.c;T[[I"
class;T[[:public[�[:protected[�[:private[
[I"[];T@�[I"new;T@�[I"ruby2_keywords_hash;T@�[I"ruby2_keywords_hash?;T@�[I"try_convert;T@�[I"
instance;T[[;[�[;[�[;[M[I"<;T@�[I"<=;T@�[I"==;T@�[I">;T@�[I">=;T@�[I"[];T@�[I"[]=;T@�[I"	any?;T@�[I"
assoc;T@�[I"
clear;T@�[I"compact;T@�[I"
compact!;T@�[I"compare_by_identity;T@�[I"compare_by_identity?;T@�[I"deconstruct_keys;T@�[I"default;T@�[I"
default=;T@�[I"default_proc;T@�[I"default_proc=;T@�[I"delete;T@�[I"delete_if;T@�[I"dig;T@�[I"	each;T@�[I"
each_key;T@�[I"each_pair;T@�[I"each_value;T@�[I"empty?;T@�[I"	eql?;T@�[I"
fetch;T@�[I"fetch_values;T@�[I"filter;T@�[I"filter!;T@�[I"flatten;T@�[I"
has_key?;T@�[I"has_value?;T@�[I"	hash;T@�[I"
include?;T@�[I"initialize_copy;T@�[I"inspect;T@�[I"invert;T@�[I"keep_if;T@�[I"key;T@�[I"	key?;T@�[I"	keys;T@�[I"length;T@�[I"member?;T@�[I"
merge;T@�[I"merge!;T@�[I"rassoc;T@�[I"rehash;T@�[I"reject;T@�[I"reject!;T@�[I"replace;T@�[I"select;T@�[I"select!;T@�[I"
shift;T@�[I"	size;T@�[I"
slice;T@�[I"
store;T@�[I"	to_a;T@�[I"	to_h;T@�[I"to_hash;T@�[I"to_proc;T@�[I"	to_s;T@�[I"transform_keys;T@�[I"transform_keys!;T@�[I"transform_values;T@�[I"transform_values!;T@�[I"update;T@�[I"value?;T@�[I"values;T@�[I"values_at;T@�[�[U:RDoc::Context::Section[i�0o;;[�;0;0[I"hash.c;TI"lib/pp.rb;TI"lib/pp.rb;TcRDoc::TopLevel