Hash#each

() { ([ K, V ] arg0) -> untyped } -> self

() -> ::Enumerator[[ K, V ], self]

hash.each {|key, value| ... } → self

hash.each → new_enumerator

static VALUE
rb_hash_each_pair(VALUE hash)
{
    RETURN_SIZED_ENUMERATOR(hash, 0, 0, hash_enum_size);
    if (rb_block_pair_yield_optimizable())
        rb_hash_foreach(hash, each_pair_i_fast, 0);
    else
        rb_hash_foreach(hash, each_pair_i, 0);
    return hash;
}

Alias of #each_pair

Calls the given block with each key-value pair; returns self:

Example

h = {foo: 0, bar: 1, baz: 2}
h.each_pair {|key, value| puts "#{key}: #{value}"} # => {:foo=>0, :bar=>1, :baz=>2}

Output:

foo: 0
bar: 1
baz: 2

Returns a new Enumerator if no block given:

Example

h = {foo: 0, bar: 1, baz: 2}
e = h.each_pair # => #<Enumerator: {:foo=>0, :bar=>1, :baz=>2}:each_pair>
h1 = e.each {|key, value| puts "#{key}: #{value}"}
h1 # => {:foo=>0, :bar=>1, :baz=>2}

Output:

foo: 0
bar: 1
baz: 2

See also #each_pair #dig #each_key #delete_if also in 4.1 · 4.0 · 3.3 · 3.2 · 3.1 · 3.0

‹ prev#dig next ›#each_key