Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
type SwissHashTable k v = IOHashTable Table k v Source #
Orphan instances
HashTable Table Source # | |
newSized :: Int -> ST s (Table s k v) # mutate :: (Eq k, Hashable k) => Table s k v -> k -> (Maybe v -> (Maybe v, a)) -> ST s a # mutateST :: (Eq k, Hashable k) => Table s k v -> k -> (Maybe v -> ST s (Maybe v, a)) -> ST s a # insert :: (Eq k, Hashable k) => Table s k v -> k -> v -> ST s () # delete :: (Eq k, Hashable k) => Table s k v -> k -> ST s () # lookup :: (Eq k, Hashable k) => Table s k v -> k -> ST s (Maybe v) # foldM :: (a -> (k, v) -> ST s a) -> a -> Table s k v -> ST s a # mapM_ :: ((k, v) -> ST s b) -> Table s k v -> ST s () # lookupIndex :: (Eq k, Hashable k) => Table s k v -> k -> ST s (Maybe Word) # nextByIndex :: Table s k v -> Word -> ST s (Maybe (Word, k, v)) # computeOverhead :: Table s k v -> ST s Double # |