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.

Exact lookup

1. mapTardisT :: (m (a, (bw, fw)) -> n (b, (bw, fw))) -> TardisT bw fw m a -> TardisT bw fw n b

   tardis	Control.Monad.Trans.Tardis

   A function that operates on the internal representation of a Tardis can also be used on a Tardis.

2. mapThat :: (b -> d) -> These a b -> These a d

   these-skinny	Data.These

   mapThat = over there
   

3. mapThese :: (a -> c) -> (b -> d) -> These a b -> These c d

   these-skinny	Data.These

   Bifunctor map.

4. mapThis :: (a -> c) -> These a b -> These c b

   these-skinny	Data.These

   mapThis = over here
   

5. mapAccum :: MonadIO m => acc -> Event (acc -> (x, acc)) -> m (Event x, Behavior acc)

   threepenny-gui	Graphics.UI.Threepenny.Core

   Efficient combination of accumE and accumB.

6. mapAccum :: MonadIO m => acc -> Event (acc -> (x, acc)) -> m (Event x, Behavior acc)

   threepenny-gui	Reactive.Threepenny

   Efficient combination of accumE and accumB.

7. mapCycle :: (Time -> Time) -> Arc -> Arc

   tidal	Sound.Tidal.Boot

   Similar to fmap but time is relative to the cycle (i.e. the sam of the start of the arc)

8. mapTableErrors :: Key -> [TomlDecodeError] -> [TomlDecodeError]

   tomland	Toml.Codec.Combinator.Table

   Prepends given key to all errors that contain key. This function is used to give better error messages. So when error happens we know all pieces of table key, not only the last one.

9. mapTup3 :: (a -> b) -> (a, a, a) -> (b, b, b)

   tools-yj	Data.Tuple.ToolsYj

   No documentation available.

10. mapTup3M :: Applicative m => (a -> m b) -> (a, a, a) -> m (b, b, b)

    tools-yj	Data.Tuple.ToolsYj

    No documentation available.

Page 324 of many | Previous | Next