swisstable-0.1.0.1: Google's SwissTable hash map
Safe HaskellNone
LanguageHaskell2010

Data.HashTable.IO.Swiss

Documentation

insert :: (Hashable k, Eq k) => Table RealWorld k v -> k -> v -> IO () Source #

insert' :: (Hashable k, Eq k) => (k -> Int) -> Table RealWorld k v -> k -> v -> IO () Source #

lookup :: (Hashable k, Show k, Eq k) => Table RealWorld k a -> k -> IO (Maybe a) Source #

lookup' :: (Hashable k, Show k, Eq k) => (k -> Int) -> Table RealWorld k a -> k -> IO (Maybe a) Source #

delete :: (Hashable k, Show k, Eq k) => Table RealWorld k v -> k -> IO () Source #

mutateST :: (Eq k, Hashable k) => Table RealWorld k v -> k -> (Maybe v -> ST RealWorld (Maybe v, a)) -> IO a Source #

mutate :: (Eq k, Hashable k) => Table RealWorld k v -> k -> (Maybe v -> (Maybe v, a)) -> IO a Source #

mapM_ :: ((k, v) -> ST RealWorld a) -> Table RealWorld k v -> IO () Source #

foldM :: (a -> (k, v) -> ST RealWorld a) -> a -> Table RealWorld k v -> IO a Source #