Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
StepField' :: StepField -> CronFieldcron System.Cron.Types Matches a stepped expression, e.g. (*/2).
-
direct-sqlite Database.SQLite3 No documentation available.
-
direct-sqlite Database.SQLite3.Direct No documentation available.
newtype
Steps (f :: k -> Type) (a :: k)functor-combinators Control.Applicative.Step A non-empty map of Natural to f a. Basically, contains multiple f as, each at a given Natural index.
Steps f a ~ Map Natural (f a) Steps f ~ Map Natural :.: f -- functor composition
It is the fixed point of applications of TheseT. You can think of this as an infinite sparse array of f as. Intuitively, in an infinite f `TheseT` f `TheseT` f `TheseT` f ..., each of those infinite positions may have an f in them. However, because of the at-least-one nature of TheseT, we know we have at least one f at one position somewhere. A Steps f a has potentially many fs, each stored at a different Natural position, with the guaruntee that at least one f exists. Can be useful for using with the Monoidal instance of TheseT. interpreting it requires at least an Alt instance in the target context, since we have to handle potentially more than one f. This type is essentailly the same as NEMapF (Sum Natural) (except with a different Semigroup instance).Steps :: NEMap Natural (f a) -> Steps (f :: k -> Type) (a :: k)functor-combinators Control.Applicative.Step No documentation available.
newtype
Steps (f :: k -> Type) (a :: k)functor-combinators Data.Functor.Combinator A non-empty map of Natural to f a. Basically, contains multiple f as, each at a given Natural index.
Steps f a ~ Map Natural (f a) Steps f ~ Map Natural :.: f -- functor composition
It is the fixed point of applications of TheseT. You can think of this as an infinite sparse array of f as. Intuitively, in an infinite f `TheseT` f `TheseT` f `TheseT` f ..., each of those infinite positions may have an f in them. However, because of the at-least-one nature of TheseT, we know we have at least one f at one position somewhere. A Steps f a has potentially many fs, each stored at a different Natural position, with the guaruntee that at least one f exists. Can be useful for using with the Monoidal instance of TheseT. interpreting it requires at least an Alt instance in the target context, since we have to handle potentially more than one f. This type is essentailly the same as NEMapF (Sum Natural) (except with a different Semigroup instance).Steps :: NEMap Natural (f a) -> Steps (f :: k -> Type) (a :: k)functor-combinators Data.Functor.Combinator No documentation available.
-
No documentation available.
StepA :: Attribute "step" 'False 'Falsetype-of-html Html.Type No documentation available.
StepDown :: [(Int, Rate)] -> PrepayPenaltyTypeHastructure AssetClass.AssetBase first tuple (n,r) ,first n periods use penalty rate r , then next n periods use pentaly rate in next tuple | NMonthInterest Int