Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

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

   massiv	Data.Massiv.Core.Index

   Iterate over a target array with a stride without an accumulator

2. oneStride :: Index ix => Stride ix

   massiv	Data.Massiv.Core.Index

   A default stride of 1, where all elements are kept

3. strideSize :: Index ix => Stride ix -> Sz ix -> Sz ix

   massiv	Data.Massiv.Core.Index

   Adjust size according to the stride.

4. strideStart :: Index ix => Stride ix -> ix -> ix

   massiv	Data.Massiv.Core.Index

   Adjust starting index according to the stride

5. toLinearIndexStride :: Index ix => Stride ix -> Sz ix -> ix -> Int

   massiv	Data.Massiv.Core.Index

   Compute linear index with stride using the original size and index

6. unStride :: Stride ix -> ix

   massiv	Data.Massiv.Core.Index

   Just a helper function for unwrapping Stride.

7. divideScalar :: (NumericFloat r e, Index ix) => Array r ix e -> e -> Array r ix e

   massiv	Data.Massiv.Core.Operations

   No documentation available.

8. scalarDivide :: (NumericFloat r e, Index ix) => e -> Array r ix e -> Array r ix e

   massiv	Data.Massiv.Core.Operations

   No documentation available.

9. computeWithStride :: forall r ix e r' . (Manifest r e, StrideLoad r' ix e) => Stride ix -> Array r' ix e -> Array r ix e

   massiv	Data.Massiv.Vector

   Same as compute, but with Stride. O(n div k) - Where n is number of elements in the source array and k is number of elements in the stride.

10. computeWithStrideAs :: (Manifest r e, StrideLoad r' ix e) => r -> Stride ix -> Array r' ix e -> Array r ix e

    massiv	Data.Massiv.Vector

    Same as computeWithStride, but with ability to specify resulting array representation.

Page 870 of many | Previous | Next