Data.HashMap.Mutable.Basic

Documentation

data HashTable s k v

An open addressing hash table using linear probing.

Instances

Show (HashTable s k v)

Methods

showsPrec :: Int -> HashTable s k v -> ShowS

show :: HashTable s k v -> String

showList :: [HashTable s k v] -> ShowS

new :: PrimMonad m => m (HashTable (PrimState m) k v)

See the documentation for this function in Data.HashTable.Class.

newSized :: PrimMonad m => Int -> m (HashTable (PrimState m) k v)

See the documentation for this function in Data.HashTable.Class.

delete :: (PrimMonad m, Hashable k, Eq k) => HashTable (PrimState m) k v -> k -> m ()

See the documentation for this function in Data.HashTable.Class.

lookup :: (PrimMonad m, Eq k, Hashable k) => HashTable (PrimState m) k v -> k -> m (Maybe v)

See the documentation for this function in Data.HashTable.Class.

insert :: (PrimMonad m, Eq k, Hashable k) => HashTable (PrimState m) k v -> k -> v -> m ()

See the documentation for this function in Data.HashTable.Class.

mapM_ :: PrimMonad m => (k -> v -> m b) -> HashTable (PrimState m) k v -> m ()

See the documentation for this function in Data.HashTable.Class.

foldM :: PrimMonad m => (a -> (k, v) -> m a) -> a -> HashTable (PrimState m) k v -> m a

See the documentation for this function in Data.HashTable.Class.

computeOverhead :: PrimMonad m => HashTable (PrimState m) k v -> m Double

See the documentation for this function in Data.HashTable.Class.