Hoogle Search

Within LTS Haskell 24.65 (ghc-9.10.3)

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

  1. class Load r ix e => StrideLoad r ix e

    massiv Data.Massiv.Core

    No documentation available.

  2. iterArrayLinearWithStrideST_ :: StrideLoad r ix e => Scheduler s () -> Stride ix -> Sz ix -> Array r ix e -> (Int -> e -> ST s ()) -> ST s ()

    massiv Data.Massiv.Core

    Load an array into memory with stride. Default implementation requires an instance of Source.

  3. type family IsDimValid ix (n :: Nat) :: Bool

    massiv Data.Massiv.Core.Index

    No documentation available.

  4. type family ReportInvalidDim (dims :: Nat) (n :: Nat) (isNotZero :: Bool) (isLess :: Bool) :: Bool

    massiv Data.Massiv.Core.Index

    No documentation available.

  5. data Stride ix

    massiv Data.Massiv.Core.Index

    Stride provides a way to ignore elements of an array if an index is divisible by a corresponding value in a stride. So, for a Stride (i :. j) only elements with indices will be kept around: 

    ( 0 :. 0) ( 0 :. j) ( 0 :. 2j) ( 0 :. 3j) ...
( i :. 0) ( i :. j) ( i :. 2j) ( i :. 3j) ...
(2i :. 0) (2i :. j) (2i :. 2j) (2i :. 3j) ...
...
    Only positive strides make sense, so Stride pattern synonym constructor will prevent a user from creating a stride with negative or zero values, thus promoting safety of the library.

    Examples:

    • Default and minimal stride of Stride (pureIndex 1) will have no affect and all elements will kept.
    • If stride is Stride 2, then every 2nd element (i.e. with index 1, 3, 5, ..) will be skipped and only elemnts with indices divisible by 2 will be kept around.
    • In case of two dimensions, if what you want is to keep all rows divisible by 5, but keep every column intact then you'd use Stride (5 :. 1).

  6. pattern Stride :: Index ix => ix -> Stride ix

    massiv Data.Massiv.Core.Index

    A safe bidirectional pattern synonym for Stride construction that will make sure stride elements are always positive.

  7. iterTargetFullWithStrideAccST :: (Iterator it, Index ix) => it -> Scheduler s a -> Ix1 -> Sz ix -> Stride ix -> a -> (a -> ST s (a, a)) -> (Ix1 -> ix -> a -> ST s a) -> ST s a

    massiv Data.Massiv.Core.Index

    No documentation available.

  8. iterTargetFullWithStrideAccST_ :: (Iterator it, Index ix) => it -> Scheduler s () -> Ix1 -> Sz ix -> Stride ix -> a -> (a -> ST s (a, a)) -> (Ix1 -> ix -> a -> ST s a) -> ST s ()

    massiv Data.Massiv.Core.Index

    No documentation available.

  9. iterTargetFullWithStrideST_ :: (Iterator it, Index ix) => it -> Scheduler s () -> Ix1 -> Sz ix -> Stride ix -> (Ix1 -> ix -> ST s ()) -> ST s ()

    massiv Data.Massiv.Core.Index

    No documentation available.

  10. iterTargetWithStrideAccST :: (Iterator it, Index ix) => it -> Scheduler s a -> Ix1 -> Sz ix -> ix -> Stride ix -> a -> (a -> ST s (a, a)) -> (Ix1 -> ix -> a -> ST s a) -> ST s a

    massiv Data.Massiv.Core.Index

    No documentation available.

Page 869 of many | Previous | Next