Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. hToVector :: HStructure (s :: Type -> Type) -> s Double -> Positions

   mcmc	Mcmc.Proposal.Hamiltonian.Common

   Extract a a subset of values to be manipulated by the Hamiltonian proposal from the complete state.

2. simplexFromVector :: Vector Double -> Either String Simplex

   mcmc	Mcmc.Proposal.Simplex

   Ensure that the value vector is an element of a simplex. Return Left if: - The value vector is empty. - The value vector contains negative elements. - The value vector is not normalized.

3. type UVectorCache s e = Cache UVector s e

   monad-memo	Control.Monad.Memo

   MonadCache based on unboxed vector

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

   monad-memo	Control.Monad.Memo

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

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

   monad-memo	Control.Monad.Memo

   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

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

   monad-memo	Control.Monad.Memo

   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

7. 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

   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

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

   monad-memo	Control.Monad.Memo

   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

9. type UVector = MVector

   monad-memo	Control.Monad.Memo.Vector

   Unboxed vector

10. type UVectorCache s e = Cache UVector s e

    monad-memo	Control.Monad.Memo.Vector

    MonadCache based on unboxed vector

Page 109 of many | Previous | Next