Hoogle Search
Within LTS Haskell 24.50 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
class (Size r, Num e) =>
FoldNumeric r emassiv Data.Massiv.Core.Operations No documentation available.
enumFromN :: Num e => Comp -> e -> Sz1 -> Vector D emassiv Data.Massiv.Vector Same as enumFromStepN with step dx = 1. Related: senumFromN, senumFromStepN, enumFromStepN, rangeSize, rangeStepSize, range
Examples
>>> import Data.Massiv.Array >>> enumFromN Seq (5 :: Double) 3 Array D Seq (Sz1 3) [ 5.0, 6.0, 7.0 ]
Similar:- Prelude.enumFromTo Very similar to [i .. i + n - 1], except that enumFromN is faster, but it only works for Num and not for Enum elements
- Data.Vector.Generic.enumFromN
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.
senumFromN :: Num e => e -> Sz1 -> Vector DS emassiv Data.Massiv.Vector O(n) - Enumerate from a starting number x exactly n times with a step 1. Related: senumFromStepN, enumFromN, enumFromStepN, rangeSize, rangeStepSize, range, rangeStep'
Examples
>>> senumFromN (10 :: Int) 9 Array DS Seq (Sz1 9) [ 10, 11, 12, 13, 14, 15, 16, 17, 18 ]
Similar:- Prelude.enumFromTo Very similar to [x .. x + n - 1], except that senumFromN is faster and it only works for Num and not for Enum elements
- Data.Vector.Generic.enumFromN Uses exactly the same implementation underneath.
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.
-
openapi3 Data.OpenApi No documentation available.
_schemaEnum :: Schema -> Maybe [Value]openapi3 Data.OpenApi No documentation available.
_serverVariableEnum :: ServerVariable -> Maybe (InsOrdHashSet Text)openapi3 Data.OpenApi An enumeration of string values to be used if the substitution options are from a limited set. The array SHOULD NOT be empty.
-
openapi3 Data.OpenApi.Internal No documentation available.
_schemaEnum :: Schema -> Maybe [Value]openapi3 Data.OpenApi.Internal No documentation available.