Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. type UVector = MVector

   monad-memo	Control.Monad.Memo.Vector

   Unboxed vector

2. type UVectorCache s e = Cache UVector s e

   monad-memo	Control.Monad.Memo.Vector

   MonadCache based on unboxed vector

3. class MaybeLike e v => UVectorMemo v e | v -> e

   monad-memo	Control.Monad.Memo.Vector

   This is just to be able to infer the type of the UVectorCache element.

4. evalUVectorMemo :: (PrimMonad m, MVector UVector e, UVectorMemo v e) => UVectorCache (PrimState m) e m a -> Int -> m a

   monad-memo	Control.Monad.Memo.Vector

   Evaluate computation using mutable unboxed vector Vector length must covers all possible keys used in computation otherwise index out of bound error is generated by vector code

5. evalVectorMemo :: (PrimMonad m, VectorMemo v e) => VectorCache (PrimState m) e m a -> Int -> m a

   monad-memo	Control.Monad.Memo.Vector

   Evaluate computation using mutable boxed vector Vector length must covers all possible keys used in computation otherwise index out of bound error is generated by vector code

6. genericEvalVectorMemo :: (MaybeLike e v, PrimMonad m, MVector c e) => Cache c (PrimState m) e m a -> Int -> m a

   monad-memo	Control.Monad.Memo.Vector

   No documentation available.

7. genericRunVectorMemo :: (MaybeLike e v, PrimMonad m, MVector c e) => Cache c (PrimState m) e m a -> Int -> m (a, c (PrimState m) e)

   monad-memo	Control.Monad.Memo.Vector

   No documentation available.

8. runUVectorMemo :: (PrimMonad m, MVector UVector e, UVectorMemo v e) => UVectorCache (PrimState m) e m a -> Int -> m (a, UVector (PrimState m) e)

   monad-memo	Control.Monad.Memo.Vector

   Evaluate computation using mutable unboxed vector. It also returns the final content of the vector cache Vector length must covers all possible keys used in computation otherwise index out of bound error is generated by vector code

9. runVectorMemo :: (PrimMonad m, VectorMemo v e) => VectorCache (PrimState m) e m a -> Int -> m (a, Vector (PrimState m) e)

   monad-memo	Control.Monad.Memo.Vector

   Evaluate computation using mutable boxed vector. It also returns the final content of the vector cache Vector length must covers all possible keys used in computation otherwise index out of bound error is generated by vector code

10. toVector :: Container vec -> vec

    monad-memo	Control.Monad.Memo.Vector

    No documentation available.

Page 110 of many | Previous | Next