| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.HashMap.Mutable.Basic
- data HashTable s k v
- new :: PrimMonad m => m (HashTable (PrimState m) k v)
- newSized :: PrimMonad m => Int -> m (HashTable (PrimState m) k v)
- delete :: (PrimMonad m, Hashable k, Eq k) => HashTable (PrimState m) k v -> k -> m ()
- lookup :: (PrimMonad m, Eq k, Hashable k) => HashTable (PrimState m) k v -> k -> m (Maybe v)
- insert :: (PrimMonad m, Eq k, Hashable k) => HashTable (PrimState m) k v -> k -> v -> m ()
- mapM_ :: PrimMonad m => ((k, v) -> m b) -> HashTable (PrimState m) k v -> m ()
- foldM :: PrimMonad m => (a -> (k, v) -> m a) -> a -> HashTable (PrimState m) k v -> m a
- computeOverhead :: PrimMonad m => HashTable (PrimState m) k v -> m Double
Documentation
An open addressing hash table using linear probing.
new :: PrimMonad m => m (HashTable (PrimState m) k v) Source
See the documentation for this function in Data.HashTable.Class.
newSized :: PrimMonad m => Int -> m (HashTable (PrimState m) k v) Source
See the documentation for this function in Data.HashTable.Class.
delete :: (PrimMonad m, Hashable k, Eq k) => HashTable (PrimState m) k v -> k -> m () Source
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) Source
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 () Source
See the documentation for this function in Data.HashTable.Class.
mapM_ :: PrimMonad m => ((k, v) -> m b) -> HashTable (PrimState m) k v -> m () Source
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 Source
See the documentation for this function in Data.HashTable.Class.
computeOverhead :: PrimMonad m => HashTable (PrimState m) k v -> m Double Source
See the documentation for this function in Data.HashTable.Class.