Struct Entry
struct Entry <K, V>{
hash: uint,
key: K,
value: V,
mut next: Option<@Entry<K, V>>,
}
Struct HashMap_
struct HashMap_ <K: Eq IterBytes Hash, V>{
mut count: uint,
mut chains: ~[mut Option<@Entry<K, V>>],
}
Implementation for T<K, V>
Method search_rem
fn search_rem(k: & K, h: uint, idx: uint, e_root: @Entry<K, V>) ->
SearchResult<K, V>
Method search_tbl
fn search_tbl(k: & K, h: uint) -> SearchResult<K, V>
Method rehash
fn rehash()
Method each_entry
fn each_entry(blk: fn&(@Entry<K, V>) -> bool)
Implementation of Map<K, V>
for T<K, V>
Method size
fn size() -> uint
Method contains_key
fn contains_key(k: K) -> bool
Method contains_key_ref
fn contains_key_ref(k: & K) -> bool
Method insert
fn insert(k: K, v: V) -> bool
Method find
fn find(k: K) -> Option<V>
Method get
fn get(k: K) -> V
Method remove
fn remove(k: K) -> bool
Method each
fn each(blk: fn&(key: K, value: V) -> bool)
Method each_key
fn each_key(blk: fn&(key: K) -> bool)
Method each_value
fn each_value(blk: fn&(value: V) -> bool)
Method each_ref
fn each_ref(blk: fn&(key: & K, value: & V) -> bool)
Method each_key_ref
fn each_key_ref(blk: fn&(key: & K) -> bool)
Method each_value_ref
fn each_value_ref(blk: fn&(value: & V) -> bool)