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. class MaybeLike e v => UVectorMemo v e | v -> e

   monad-memo	Control.Monad.Memo.Vector.Unsafe

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

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

   monad-memo	Control.Monad.Memo.Vector.Unsafe

   No documentation available.

3. genericUnsafeRunVectorMemo :: (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.Unsafe

   No documentation available.

4. toVector :: Container vec -> vec

   monad-memo	Control.Monad.Memo.Vector.Unsafe

   No documentation available.

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

   monad-memo	Control.Monad.Memo.Vector.Unsafe

   Evaluate computation using mutable unboxed vector and unsafe operations Vector length must covers all possible keys used in computation otherwise the behaviour is undefined (i.e. segfault)

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

   monad-memo	Control.Monad.Memo.Vector.Unsafe

   Evaluate computation using mutable boxed vector and unsafe operations Vector length must covers all possible keys used in computation otherwise the behaviour is undefined (i.e. segfault)

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

   monad-memo	Control.Monad.Memo.Vector.Unsafe

   Evaluate computation using mutable boxed vector and unsafe operations. It also returns the final content of the vector cache Vector length must covers all possible keys used in computation otherwise the behaviour is undefined (i.e. segfault)

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

   monad-memo	Control.Monad.Memo.Vector.Unsafe

   Evaluate computation using mutable boxed vector and unsafe operations. It also returns the final content of the vector cache Vector length must covers all possible keys used in computation otherwise the behaviour is undefined (i.e. segfault)

9. diffVectors :: Vector Char -> Vector Char -> Seq Edit

   myers-diff	Data.Diff.Myers

   Diff Vectors to produce an edit script.

10. fastTextToVector :: Text -> Vector Char

    myers-diff	Data.Diff.Myers

    This is currently the only way to convert a Text to a Vector without extraneous allocations. Taken from https://stackoverflow.com/a/77388392/2659595 Once the text library contains a foldM function, we can switch to that and avoid importing internal functions. See https://github.com/haskell/text/pull/543

Page 112 of many | Previous | Next