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.

  1. putInt8VectorField :: Maybe I8 -> BitPut

    rattletrap Rattletrap.Type.Int8Vector

    No documentation available.

  2. CompressedWordVector :: CompressedWordVector -> Rotation

    rattletrap Rattletrap.Type.Rotation

    No documentation available.

  3. allVectorRg :: Rg rg => rg -> [rg]

    rg Data.Rg

    list given items in the enumeration as a Vector

  4. newStartOfRangeFromVector :: Vector a -> Range a

    rg Data.Rg

    generating a Range from a Vector

  5. data DVector a

    rp-tree Data.RPTree

    Dense vectors with unboxed components

  6. data SVector a

    rp-tree Data.RPTree

    Sparse vectors with unboxed components

  7. bcVectorDim :: BenchConfig -> Int

    rp-tree Data.RPTree

    No documentation available.

  8. fromVectorDv :: Vector a -> DVector a

    rp-tree Data.RPTree

    No documentation available.

  9. fromVectorSv :: Int -> Vector (Int, a) -> SVector a

    rp-tree Data.RPTree

    (Unsafe) Pack a SVector from its vector dimension and components Note : the relevant invariants are not checked :

    • vector components are _assumed_ to be in increasing order
    • vector dimension is larger than any component index

  10. package rrb-vector

    Efficient RRB-Vectors An RRB-Vector is an efficient sequence data structure. It supports fast indexing, iteration, concatenation and splitting.

    Comparison with Data.Sequence

    Seq a is a container with a very similar API. RRB-Vectors are generally faster for indexing and iteration, while sequences are faster for access to the front/back (amortized <math>).

Page 117 of many | Previous | Next