structs/HashMap

stringKeyEquals(k1, k2: K)Bool
genericKeyEquals(k1, k2: K)Bool
murmurHash(keyTagazok: K)UInt
ac_X31_hash(key: K)UInt
class HashEntry<K,V>
extends:Object
static method new~keyVal(key: K, value: V)HashEntry<K,V>
method init~keyVal(key: K, value: V)
VClass
KClass
key → K
value → V
class HashMap<K,V>
extends:Iterable<T>
static method newHashMap<K,V>
method init
Returns a hash table with 100 buckets @return HashTable
static method new~withCapacity(capacity: UInt)HashMap<K,V>
method init~withCapacity(capacity: UInt)
Returns a hash table of a specified bucket capacity. @param UInt capacity The number of buckets to use @return HashTable
method getEntry(key: K)HashEntry<K,V>
Returns the HashEntry associated with a key. @access private @param key The key associated with the HashEntry @return HashEntry
method put(key: K, value: V)Bool
Puts a key/value pair in the hash table. If the pair already exists, it is overwritten. @param key The key to be hashed @param value The value associated with the key @return Bool
method add(key: K, value: V)Bool
Alias of put
method get(key: K) → V
Returns the value associated with the key. Returns null if the key does not exist. @param key The key associated with the value @return Object
method isEmptyBool
@return true if this map is empty, false if not
method contains(key: K)Bool
Returns whether or not the key exists in the hash table. @param key The key to check @return Bool
method remove(key: K)Bool
Removes the entry associated with the key @param key The key to remove @return Bool
method resize(_capacity: UInt)Bool
Resizes the hash table to a new capacity @param UInt _capacity The new table capacity @return Bool
method iteratorIterator<T>
method clear
method sizeUInt
method getKeysArrayList<T>
VClass
KClass
sizeUInt
capacityUInt
keyEquals → Func
hashKey → Func
bucketsArrayList<T> *
keysArrayList<T>
class HashMapValueIterator<K,T>
extends:Iterator<T>
static method new~withMap(map: HashMap<K,V>)HashMapValueIterator<K,T>
method init~withMap(map: HashMap<K,V>)
method hasNextBool
method next → T
method hasPrevBool
method prev → T
method removeBool
KClass
mapHashMap<K,V>
indexInt

This Page