Data.Graph.Dynamic.Internal.HashTable

This is a very simple wrapper around the hashtables library that uses PrimMonad rather than ST.

Documentation

type HashTable s k v = HashTable s k v

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

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

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

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

toList :: PrimMonad m => HashTable (PrimState m) k v -> m [(k, v)]

Slow, only for debugging and testing.