Hash class of PicoRuby

Singleton methods

new

Hash.new() -> instance
Hash.new(untyped default) -> instance

Instance methods

<

instance.<[A, B] (::Hash[A, B]) -> bool

<=

instance.<=[A, B] (::Hash[A, B]) -> bool

==

instance.==(untyped other) -> bool

>

instance.>[A, B] (::Hash[A, B]) -> bool

>=

instance.>=[A, B] (::Hash[A, B]) -> bool

[]

instance.[](K arg0) -> V

[]=

instance.[]=(K arg0, V arg1) -> V

clear

instance.clear() -> self

delete

instance.delete(K arg0) -> V?

each

instance.each() { (K key, V val) -> untyped } -> self

empty?

instance.empty?() -> bool

has_key?

instance.has_key?(K arg0) -> bool

has_value?

instance.has_value?(V arg0) -> bool

inspect

instance.inspect() -> String

key

instance.key(V) -> K?

keys

instance.keys() -> ::Array[K]

length

instance.length() -> Integer

merge

instance.merge[A, B] (*::Hash[A, B] other_hashes) -> ::Hash[A | K, B | V]
instance.merge[A, B, C] (*::Hash[A, B] other_hashes) { (K key, V oldval, B newval) -> C } -> ::Hash[A | K, B | V | C]

merge!

instance.merge!(*::Hash[K, V] other_hashes) -> self
instance.merge!(*::Hash[K, V] other_hashes) { (K key, V oldval, V newval) -> V } -> self

shift

instance.shift() -> [ K, V ]?

to_h

instance.to_h() -> Hash[K, V]
instance.to_h[A, B] () { (K, V) -> [ A, B ] } -> Hash[A, B]

values

instance.values() -> ::Array[V]
Tags: