Hoogle Search

Within Stackage Nightly 2025-10-01 (ghc-9.12.2)

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

Exact lookup

1. sort2ByOffset :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> Int -> m ()

   vector-algorithms	Data.Vector.Algorithms.Optimal

   Sorts the elements at the positions off and 'off + 1' in the given array using the comparison.

2. sort3ByOffset :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> Int -> m ()

   vector-algorithms	Data.Vector.Algorithms.Optimal

   Sorts the three elements starting at the given offset in the array.

3. sort4ByOffset :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> Int -> m ()

   vector-algorithms	Data.Vector.Algorithms.Optimal

   Sorts the four elements beginning at the offset.

4. fromSet :: (Indexed sh, Index sh ~ ix, Ord ix) => sh -> Set ix -> Array sh

   comfort-array	Data.Array.Comfort.Bool

   No documentation available.

5. toSet :: (InvIndexed sh, Index sh ~ ix, Ord ix) => Array sh -> Set ix

   comfort-array	Data.Array.Comfort.Bool

   No documentation available.

6. unifiedSizeOffset :: (Indexed f, Checking check) => Shape f -> (Int, Index f -> Result check Int)

   comfort-array	Data.Array.Comfort.Container

   No documentation available.

7. assertIndexFromOffset :: Checking check => String -> Int -> Bool -> Result check ()

   comfort-array	Data.Array.Comfort.Shape

   No documentation available.

8. indexFromOffset :: InvIndexed sh => sh -> Int -> Index sh

   comfort-array	Data.Array.Comfort.Shape

   It should hold indexFromOffset sh k == indices sh !! k, but indexFromOffset should generally be faster.

9. messageIndexFromOffset :: String -> Int -> String

   comfort-array	Data.Array.Comfort.Shape

   No documentation available.

10. offset :: Indexed sh => sh -> Index sh -> Int

    comfort-array	Data.Array.Comfort.Shape

    No documentation available.

Page 93 of many | Previous | Next