Type:
Class

ruby 1.8.x –> use Hash#index

A Hash is a dictionary-like collection of unique keys and their values. Also called associative arrays, they are similar to Arrays, but where an Array uses integers as its index, a Hash allows you to use any object type.

Hashes enumerate their values in the order that the corresponding keys were inserted.

A Hash can be easily created by using its implicit form:

grades = { "Jane Doe" => 10, "Jim Doe" => 6 }

Hashes allow an alternate syntax form when your keys are always symbols. Instead of

options = { :font_size => 10, :font_family => "Arial" }

You could write it as:

options = { font_size: 10, font_family: "Arial" }

Each named key is a symbol you can access in hash:

options[:font_size]  # => 10

A Hash can also be created through its ::new method:

grades = Hash.new
grades["Dorothy Doe"] = 9

Hashes have a default value that is returned when accessing keys that do not exist in the hash. If no default is set nil is used. You can set the default value by sending it as an argument to ::new:

grades = Hash.new(0)

Or by using the default= method:

grades = {"Timmy Doe" => 8}
grades.default = 0

Accessing a value in a Hash requires using its key:

puts grades["Jane Doe"] # => 10

Common Uses

Hashes are an easy way to represent data structures, such as

books         = {}
books[:matz]  = "The Ruby Language"
books[:black] = "The Well-Grounded Rubyist"

Hashes are also commonly used as a way to have named parameters in functions. Note that no brackets are used below. If a hash is the last argument on a method call, no braces are needed, thus creating a really clean interface:

Person.create(name: "John Doe", age: 27)

def self.create(params)
  @name = params[:name]
  @age  = params[:age]
end

Hash Keys

Two objects refer to the same hash key when their hash value is identical and the two objects are eql? to each other.

A user-defined class may be used as a hash key if the hash and eql? methods are overridden to provide meaningful behavior. By default, separate instances refer to separate hash keys.

A typical implementation of hash is based on the object's data while eql? is usually aliased to the overridden == method:

class Book
  attr_reader :author, :title

  def initialize(author, title)
    @author = author
    @title = title
  end

  def ==(other)
    self.class === other and
      other.author == @author and
      other.title == @title
  end

  alias eql? ==

  def hash
    @author.hash ^ @title.hash # XOR
  end
end

book1 = Book.new 'matz', 'Ruby in a Nutshell'
book2 = Book.new 'matz', 'Ruby in a Nutshell'

reviews = {}

reviews[book1] = 'Great reference!'
reviews[book2] = 'Nice and compact!'

reviews.length #=> 1

See also Object#hash and Object#eql?

each

hsh.each {| key, value | block } â hshhsh.each_pair {| key, value | block } â hshhsh.each â an_enumeratorhsh

2015-04-11 22:31:49
rehash

hsh.rehash â hsh Instance Public methods Rebuilds the hash based on the current

2015-04-12 00:28:54
has_value?

hsh.has_value?(value) â true or false Instance Public methods Returns true

2015-04-11 23:14:02
has_key?

hsh.has_key?(key) â true or false Instance Public methods Returns true

2015-04-11 23:09:10
inspect

hsh.to_s â stringhsh.inspect â string Instance Public methods Return

2015-04-11 23:23:19
values_at

hsh.values_at(key, ...) â array Instance Public methods Return an array containing

2015-04-12 01:18:41
each_pair

hsh.each_pair {| key, value | block } â hshhsh.each_pair â an_enumerator Instance Public

2015-04-11 22:44:06
new

Hash.new â new_hashHash.new(obj) â new_hashHash.new {|hash, key| block } â new_hash

2015-04-11 21:30:49
pretty_print_cycle

pretty_print_cycle(q) Instance Public methods

2015-04-12 00:20:05