Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. newtype ConstModule r a

   boltzmann-samplers	Boltzmann.Species

   No documentation available.

2. ConstModule :: r -> ConstModule r a

   boltzmann-samplers	Boltzmann.Species

   No documentation available.

3. unConstModule :: ConstModule r a -> r

   boltzmann-samplers	Boltzmann.Species

   No documentation available.

4. copyCacheSTM :: Cache k v -> STM (Cache k v)

   cache	Data.Cache

   No documentation available.

5. deleteSTM :: (Eq k, Hashable k) => k -> Cache k v -> STM ()

   cache	Data.Cache

   STM variant of delete.

6. insertSTM :: (Eq k, Hashable k) => k -> v -> Cache k v -> Maybe TimeSpec -> STM ()

   cache	Data.Cache

   Insert an item in the cache, with an explicit expiration value, in the STM monad. If the expiration value is Nothing, the item will never expire. The default expiration value of the cache is ignored. The expiration value is the absolute Monotonic time the item expires. You should manually construct the absolute Monotonic time, as opposed to the behaviour of insert'. E.g.

   action :: Cache -> IO ()
   action c = do
   t <- getTime Monotonic
   let t' = t + (defaultExpiration c)
   atomically $ insertSTM 0 0 c (Just t')
   

7. keysSTM :: Cache k v -> STM [k]

   cache	Data.Cache

   STM variant of keys.

8. lookupSTM :: (Eq k, Hashable k) => Bool -> k -> Cache k v -> TimeSpec -> STM (Maybe v)

   cache	Data.Cache

   Lookup an item with a given key in the STM monad, given the current Monotonic time. STM variant of lookup and lookup'

9. newCacheSTM :: Maybe TimeSpec -> STM (Cache k v)

   cache	Data.Cache

   STM variant of newCache

10. purgeExpiredSTM :: (Eq k, Hashable k) => Cache k v -> TimeSpec -> STM ()

    cache	Data.Cache

    STM variant of purgeExpired. The TimeSpec argument should be the current Monotonic time, i.e. getTime Monotonic.

Page 98 of many | Previous | Next