Hoogle Search
Within LTS Haskell 24.46 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
numeric :: BeamSqlBackend be => Maybe (Word, Maybe Word) -> DataType be Scientificbeam-core Database.Beam.Query.DataTypes SQL92 NUMERIC data type
numStacks :: LegendOptions -> Intchart-svg Chart.Hud No documentation available.
numTicks' :: Lens' Tick (Maybe Int)chart-svg Chart.Hud Lens between number of ticks and a Tick. Only for TickRound and TickExact
numBuffered :: ConcurrencyState -> IORefId -> Intdejafu Test.DejaFu.Types Check how many buffered writes an IORef has.
number :: Scientific -> Greskell Scientificgreskell-core Data.Greskell.Greskell Arbitrary precision number literal, like "123e8".
number :: ColourPrefs -> [Highlight]hscolour Language.Haskell.HsColour No documentation available.
number :: ColourPrefs -> [Highlight]hscolour Language.Haskell.HsColour.Colourise No documentation available.
numLoop :: (Num a, Ord a, Monad m) => a -> a -> (a -> m ()) -> m ()loop Control.Loop numLoop start end f: Loops over a contiguous numerical range, including end. Does nothing when not start <= end. It uses (+ 1) so for most integer types it has no bounds (overflow) check.
numLoopFold :: (Num a, Eq a) => a -> a -> acc -> (acc -> a -> acc) -> accloop Control.Loop numLoopFold start end acc0 f: A pure fold over a contiguous numerical range, including end. It uses (+ 1) so for most integer types it has no bounds (overflow) check. Care is taken that acc0 not be strictly evaluated if unless done so by f.
numLoopState :: (Num a, Eq a, Monad m) => a -> a -> b -> (b -> a -> m b) -> m bloop Control.Loop numLoopState start end f initialState: Loops over a contiguous numerical range, including end threading a state through the computation. It uses (+ 1) so for most integer types it has no bounds (overflow) check.