vibe.d beta banner
get vibe.d
0.9.0

Asynchronous I/O that doesn’t get in your way, written in D

Struct HashMap

struct HashMap(TKey, TValue, Traits, Allocator) ;

Constructors

NameDescription
this (allocator)

Fields

NameTypeDescription
m_allocator HashMap.AllocatorInstanceType
m_length size_t
m_resizing bool
m_table HashMap.TableEntry[]

Properties

NameTypeDescription
allocator[get] HashMap.AllocatorInstanceType
length[get] size_t

Methods

NameDescription
AW (a)
byKey ()
byKey ()
byKeyValue ()
byKeyValue ()
bySlot ()
bySlot ()
byValue ()
byValue ()
clear ()
findIndex (key)
findInsertIndex (key)
get (key, default_value)
get (key, default_value)
getNothrow (key, default_value) Workaround #12647
grow (amount)
opApply (del)
opBinaryRight (key)
opIndex (key)
opIndexAssign (value, key)
remove (key)
resize (new_size)

Inner structs

NameDescription
TableEntry

Aliases

NameDescription
AllocatorInstanceType
AllocatorType
Key
Value
Authors

Sönke Ludwig

Copyright

© 2013 Sönke Ludwig

License

Subject to the terms of the MIT license, as written in the included LICENSE.txt file.