Hoogle Search
Within LTS Haskell 24.64 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
divideM :: Monad m => (a -> m (b, c)) -> LogAction m b -> LogAction m c -> LogAction m aco-log-core Colog.Core.Action Monadic version of divide.
-
crypto-api Crypto.Classes.Exceptions When using genInteger g (l,h) and logBase 2 (h - l) > (maxBound :: Int).
-
crypto-api Crypto.Random When using genInteger g (l,h) and logBase 2 (h - l) > (maxBound :: Int).
-
diagrams-core Diagrams.Core For base < 4.11, the Monoid' constraint is a synonym for things which are instances of both Semigroup and Monoid. For base version 4.11 and onwards, Monoid has Semigroup as a superclass already, so for backwards compatibility Monoid' is provided as a synonym for Monoid.
collectCoincident :: Eq time => T time body -> T time [body]event-list Data.EventList.Absolute.TimeBody We will also sometimes need a function which groups events by equal start times. This implementation is not so obvious since we work with time differences. The criterion is: Two neighbouring events start at the same time if the second one has zero time difference.
collectCoincidentFoldr :: Eq time => T time body -> T time [body]event-list Data.EventList.Absolute.TimeBody No documentation available.
collectCoincidentNonLazy :: Eq time => T time body -> T time [body]event-list Data.EventList.Absolute.TimeBody Will fail on infinite lists.
concatMapMonoid :: Monoid m => (time -> m) -> (body -> m) -> T time body -> mevent-list Data.EventList.Absolute.TimeBody No documentation available.
mapCoincident :: Ord time => ([a] -> [b]) -> T time a -> T time bevent-list Data.EventList.Absolute.TimeBody Apply a function to the lists of coincident events.
collectCoincident :: Eq time => T time body -> T time [body]event-list Data.EventList.Absolute.TimeTime No documentation available.