Copyright	(c) Eduard Sergeev 2013
License	BSD-style (see the file LICENSE)
Maintainer	eduard.sergeev@gmail.com
Stability	experimental
Portability	non-portable
Safe Haskell	Safe
Language	Haskell98

Control.Monad.Trans.Memo.ReaderCache

Description

Generic StateCache - similar to ReaderT but optimised for carrying cache container

Synopsis

Documentation

newtype ReaderCache c m a #

Generic memoization cache which uses provided container This is pretty much identical to ReaderT, but is tuned to speed up implementations which use unboxed mutable containers

Constructors

ReaderCache
Fields evalReaderCache :: c -> m a

Instances

(PrimMonad m, (~) * (PrimState m) s, MaybeLike e v, MVector c e) => MonadMemo Int v (Cache c s e m) #
Methods memo :: (Int -> Cache c s e m v) -> Int -> Cache c s e m v #
(PrimMonad m, (~) * (PrimState m) s, MaybeLike e v, MVector c e) => MonadMemo Int v (Cache c s e m) #
Methods memo :: (Int -> Cache c s e m v) -> Int -> Cache c s e m v #
(Monad m, Ix k, MaybeLike e v, MArray c e m) => MonadMemo k v (Cache c k e m) #
Methods memo :: (k -> Cache c k e m v) -> k -> Cache c k e m v #
(PrimMonad m, (~) * (PrimState m) s, MaybeLike e v, MVector c e) => MonadCache Int v (Cache c s e m) #
Methods lookup :: Int -> Cache c s e m (Maybe v) # add :: Int -> v -> Cache c s e m () #
(PrimMonad m, (~) * (PrimState m) s, MaybeLike e v, MVector c e) => MonadCache Int v (Cache c s e m) #
Methods lookup :: Int -> Cache c s e m (Maybe v) # add :: Int -> v -> Cache c s e m () #
(Monad m, Ix k, MaybeLike e v, MArray c e m) => MonadCache k v (Cache c k e m) #
Methods lookup :: k -> Cache c k e m (Maybe v) # add :: k -> v -> Cache c k e m () #
MonadTrans (ReaderCache c) #
Methods lift :: Monad m => m a -> ReaderCache c m a #
Monad m => Monad (ReaderCache c m) #
Methods (>>=) :: ReaderCache c m a -> (a -> ReaderCache c m b) -> ReaderCache c m b # (>>) :: ReaderCache c m a -> ReaderCache c m b -> ReaderCache c m b # return :: a -> ReaderCache c m a # fail :: String -> ReaderCache c m a #
Functor m => Functor (ReaderCache c m) #
Methods fmap :: (a -> b) -> ReaderCache c m a -> ReaderCache c m b # (<$) :: a -> ReaderCache c m b -> ReaderCache c m a #
MonadFix m => MonadFix (ReaderCache c m) #
Methods mfix :: (a -> ReaderCache c m a) -> ReaderCache c m a #
Applicative m => Applicative (ReaderCache arr m) #
Methods pure :: a -> ReaderCache arr m a # (<>) :: ReaderCache arr m (a -> b) -> ReaderCache arr m a -> ReaderCache arr m b # liftA2 :: (a -> b -> c) -> ReaderCache arr m a -> ReaderCache arr m b -> ReaderCache arr m c # (>) :: ReaderCache arr m a -> ReaderCache arr m b -> ReaderCache arr m b # (<*) :: ReaderCache arr m a -> ReaderCache arr m b -> ReaderCache arr m a #
MonadIO m => MonadIO (ReaderCache c m) #
Methods liftIO :: IO a -> ReaderCache c m a #
Alternative m => Alternative (ReaderCache c m) #
Methods empty :: ReaderCache c m a # (<\|>) :: ReaderCache c m a -> ReaderCache c m a -> ReaderCache c m a # some :: ReaderCache c m a -> ReaderCache c m [a] # many :: ReaderCache c m a -> ReaderCache c m [a] #
MonadPlus m => MonadPlus (ReaderCache c m) #
Methods mzero :: ReaderCache c m a # mplus :: ReaderCache c m a -> ReaderCache c m a -> ReaderCache c m a #

container :: Monad m => ReaderCache c m c #

Returns internal container