Hoogle Search
Within LTS Haskell 24.10 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
vectorOf :: Int -> Gen a -> Gen [a]QuickCheck Test.QuickCheck.Gen Generates a list of the given length.
vectorOf :: Int -> Gen a -> Gen [a]tasty-quickcheck Test.Tasty.QuickCheck Generates a list of the given length.
vector2 :: (Vector v a, Vector v b, ToJSON a, ToJSON b) => Text -> Text -> v a -> v b -> Valuecriterion Criterion.Report Render the elements of two vectors.
vectorIx :: forall (v :: Type -> Type) a . Vector v a => Int -> Traversal' (v a) alens Data.Vector.Generic.Lens Like ix but polymorphic in the vector type.
-
lens Data.Vector.Generic.Lens Indexed vector traversal for a generic vector.
-
conduit Conduit Generally speaking, yielding values from inside a Conduit requires some allocation for constructors. This can introduce an overhead, similar to the overhead needed to represent a list of values instead of a vector. This overhead is even more severe when talking about unboxed values. This combinator allows you to overcome this overhead, and efficiently fill up vectors. It takes two parameters. The first is the size of each mutable vector to be allocated. The second is a function. The function takes an argument which will yield the next value into a mutable vector. Under the surface, this function uses a number of tricks to get high performance. For more information on both usage and implementation, please see: https://www.fpcomplete.com/user/snoyberg/library-documentation/vectorbuilder
-
conduit Data.Conduit.Combinators Generally speaking, yielding values from inside a Conduit requires some allocation for constructors. This can introduce an overhead, similar to the overhead needed to represent a list of values instead of a vector. This overhead is even more severe when talking about unboxed values. This combinator allows you to overcome this overhead, and efficiently fill up vectors. It takes two parameters. The first is the size of each mutable vector to be allocated. The second is a function. The function takes an argument which will yield the next value into a mutable vector. Under the surface, this function uses a number of tricks to get high performance. For more information on both usage and implementation, please see: https://www.schoolofhaskell.com/user/snoyberg/library-documentation/vectorbuilder
vectorM :: forall (m :: Type -> Type) v a . (PrimMonad m, Vector v a) => FoldM m a (v a)foldl Control.Foldl Fold all values into a vector This is more efficient than vector but is impure
-
Efficient algorithms for vector arrays Efficient algorithms for sorting vector arrays. At some stage other vector algorithms may be added.
vectorOutputStream :: Vector v c => IO (OutputStream c, IO (v c))io-streams System.IO.Streams.Vector vectorOutputStream returns an OutputStream which stores values fed into it and an action which flushes all stored values to a vector. The flush action resets the store. Note that this function will buffer any input sent to it on the heap. Please don't use this unless you're sure that the amount of input provided is bounded and will fit in memory without issues.
ghci> (os, flush) <- Streams.vectorOutputStream :: IO (OutputStream Int, IO (V.Vector Int)) ghci> Streams.write (Just 1) os ghci> Streams.write (Just 2) os ghci> flush fromList [1,2] ghci> Streams.write (Just 3) os ghci> Streams.write Nothing os ghci> Streams.write (Just 4) os ghci> flush fromList [3]