Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
rangeStepM :: (Index ix, MonadThrow m) => Comp -> ix -> ix -> ix -> m (Array D ix ix)massiv Data.Massiv.Array Same as range, but with a custom step. Throws Exceptions: IndexZeroException
Examples
>>> import Data.Massiv.Array >>> rangeStepM Seq (Ix1 1) 2 8 Array D Seq (Sz1 4) [ 1, 3, 5, 7 ] >>> rangeStepM Seq (Ix1 1) 0 8 *** Exception: IndexZeroException: 0
rangeStepSize :: Index ix => Comp -> ix -> ix -> Sz ix -> Array D ix ixmassiv Data.Massiv.Array Same as rangeSize, but with ability to specify the step.
fromSteps :: Steps Id e -> Vector DS emassiv Data.Massiv.Array.Delayed O(1) - Convert Steps into delayed stream array
toSteps :: Vector DS e -> Steps Id emassiv Data.Massiv.Array.Delayed O(1) - Convert delayed stream array into Steps.
enumFromStepN :: Num e => Comp -> e -> e -> Sz1 -> Vector D emassiv Data.Massiv.Vector Enumerate from a starting number x exactly n times with a custom step value dx. Unlike senumFromStepN, there is no dependency on neigboring elements therefore enumFromStepN is parallelizable. Related: senumFromN, senumFromStepN, enumFromN, rangeSize, rangeStepSize, range, rangeStepM
Examples
>>> import Data.Massiv.Array >>> enumFromStepN Seq 1 (0.1 :: Double) 5 Array D Seq (Sz1 5) [ 1.0, 1.1, 1.2, 1.3, 1.4 ] >>> enumFromStepN Seq (-pi :: Float) (pi/4) 9 Array D Seq (Sz1 9) [ -3.1415927, -2.3561945, -1.5707964, -0.78539824, 0.0, 0.78539824, 1.5707963, 2.3561947, 3.1415927 ]
Similar:- Prelude.enumFrom Similar to take n [x, x + dx ..], except that enumFromStepN is parallelizable and it only works for Num and not for Enum elements. Floating point value will be slightly different as well.
- Data.Vector.Generic.enumFromStepN Similar in the outcome, but very different in the way it works.
senumFromStepN :: Num e => e -> e -> Sz1 -> Vector DS emassiv Data.Massiv.Vector O(n) - Enumerate from a starting number x exactly n times with a custom step value dx
Examples
>>> senumFromStepN (5 :: Int) 2 10 Array DS Seq (Sz1 10) [ 5, 7, 9, 11, 13, 15, 17, 19, 21, 23 ]
Similar:- Prelude.enumFrom Just like take n [x, x + dx ..], except that senumFromN is faster and it only works for Num and not for Enum elements
- Data.Vector.Generic.enumFromStepN Uses exactly the same implementation underneath.
viewStateScaleStep :: ViewState -> !Floatgloss Graphics.Gloss.Data.ViewState How much to scale the world by for each step of the mouse wheel.
fSteps :: (C x, C y) => T x y (x, y)gnuplot Graphics.Gnuplot.Graph.TwoDimensional No documentation available.
hiSteps :: (C x, C y) => T x y (x, y)gnuplot Graphics.Gnuplot.Graph.TwoDimensional No documentation available.
-
gnuplot Graphics.Gnuplot.Simple No documentation available.