Data.HashMap.Internal

Reexports

Definitions

data HAMT : (key : Type) -> (key -> Type) -> Type

  A non-empty dependently-typed hash-array mapped trie

Totality: total
Visibility: export
Constructors:

Leaf : Bits64 -> (k : key) -> val k -> HAMT key val

Node : SparseArray (HAMT key val) -> HAMT key val

Collision : Bits64 -> Array (k : key ** val k) -> HAMT key val

getIndex : Bits64 -> Bits64 -> Bits32

Totality: total
Visibility: export

singletonWithHash : Bits64 -> (k : key) -> val k -> HAMT key val

Totality: total
Visibility: export

singleton : Hashable key => (k : key) -> val k -> HAMT key val

Totality: total
Visibility: export

lookupWithHash : (key -> key -> Bool) -> key -> Bits64 -> Bits64 -> HAMT key val -> Maybe (k : key ** val k)

Totality: total
Visibility: export

lookup : (key -> key -> Bool) -> Hashable key => key -> HAMT key val -> Maybe (k : key ** val k)

Totality: total
Visibility: export

node2 : (key -> key -> Bool) -> HAMT key val -> Bits64 -> HAMT key val -> Bits64 -> Bits64 -> HAMT key val

Totality: total
Visibility: export

insertWithHash : (key -> key -> Bool) -> (k : key) -> val k -> Bits64 -> Bits64 -> HAMT key val -> HAMT key val

Totality: total
Visibility: export

insert : (key -> key -> Bool) -> Hashable key => (k : key) -> val k -> HAMT key val -> HAMT key val

Totality: total
Visibility: export

deleteWithHash : (key -> key -> Bool) -> Hashable key => key -> Bits64 -> Bits64 -> HAMT key val -> Maybe (HAMT key val)

Totality: total
Visibility: export

delete : (key -> key -> Bool) -> Hashable key => key -> HAMT key val -> Maybe (HAMT key val)

Totality: total
Visibility: export

trieMap : (val0 k -> val1 k) -> HAMT key val0 -> HAMT key val1

Totality: total
Visibility: export

foldWithKey : ((k : key) -> val k -> acc -> acc) -> acc -> HAMT key val -> acc

Totality: total
Visibility: export