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

Data.HashTable.ST.Swiss

Documentation

newtype Table s k v Source #

Constructors

T (STRef s (Table_ s k v)) 

Instances

Instances details
Generic (Table s k v) Source # 
Instance details

Defined in Data.HashTable.ST.Swiss

Associated Types

type Rep (Table s k v) :: Type -> Type #

Methods

from :: Table s k v -> Rep (Table s k v) x #

to :: Rep (Table s k v) x -> Table s k v #

type Rep (Table s k v) Source # 
Instance details

Defined in Data.HashTable.ST.Swiss

type Rep (Table s k v)

new :: ST s (Table s k v) Source #

newSized :: Int -> ST s (Table s k v) Source #

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

insert :: (Hashable k, Eq k) => Table s k v -> k -> v -> ST s () Source #

lookup' :: forall k s a. (Hashable k, Eq k) => (k -> Int) -> Table s k a -> k -> ST s (Maybe a) Source #

lookup :: (Hashable k, Eq k) => Table s k a -> k -> ST s (Maybe a) Source #

delete' :: (Hashable k, Eq k) => (k -> Int) -> Table s k v -> k -> ST s () Source #

delete :: (Hashable k, Eq k) => Table s k v -> k -> ST s () Source #

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

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

getSize :: Table s k v -> ST s Int Source #

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

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