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. vector3Y :: RealFloat a => Vector3 a -> a

   simple-affine-space	Data.Vector3

   Y cartesian coordinate.

2. vector3Z :: RealFloat a => Vector3 a -> a

   simple-affine-space	Data.Vector3

   Z cartesian coordinate.

3. vectorSamples :: (C y yv, Transform sig yv) => (amp -> y) -> T rate (Numeric amp) (sig yv) -> sig yv

   synthesizer-dimensional	Synthesizer.Dimensional.Signal.Private

   No documentation available.

4. package vector-hashtables

   Efficient vector-based mutable hashtables implementation. This package provides efficient vector-based hashtable implementation similar to .NET Generic Dictionary implementation (at the time of 2015). See Data.Vector.Hashtables for documentation.

5. vectorToFrom :: Point -> Point -> Vector

   LambdaHack	Game.LambdaHack.Common.Vector

   The vector between the second point and the first. We have

   shift pos1 (pos2 `vectorToFrom` pos1) == pos2
   

   The arguments are in the same order as in the underlying scalar subtraction.

6. vectorUnboxedUnsafeIndex :: Unbox a => Vector a -> Int -> a

   LambdaHack	Game.LambdaHack.Core.Prelude

   No documentation available.

7. vectorOf :: Int -> Gen a -> Gen [a]

   bcp47	Data.BCP47.Internal.Arbitrary

   Generates a list of the given length.

8. vectorToByteString :: Storable a => Vector a -> ByteString

   bytestring-to-vector	Data.Vector.Storable.ByteString

   Convert a Vector to a ByteString.

9. vectorBuilderC :: forall (m :: Type -> Type) v e n i r . (PrimMonad m, Vector v e, PrimMonad n, PrimState m ~ PrimState n) => Int -> ((e -> n ()) -> ConduitT i Void m r) -> ConduitT i (v e) m r

   classy-prelude-conduit	ClassyPrelude.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

10. vectorSortOn :: Ord b => (a -> b) -> Vector a -> Vector a

    hspec-expectations-json	Test.Hspec.Expectations.Json.Internal

    No documentation available.

Page 34 of many | Previous | Next