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. mapThese :: (a -> c) -> (b -> d) -> These a b -> These c d

   these-skinny	Data.These

   Bifunctor map.

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

   these-skinny	Data.These

   mapThis = over here
   

3. 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.

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

   threepenny-gui	Reactive.Threepenny

   Efficient combination of accumE and accumB.

5. 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)

6. 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.

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

   tools-yj	Data.Tuple.ToolsYj

   No documentation available.

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

   tools-yj	Data.Tuple.ToolsYj

   No documentation available.

9. mapTup3M_ :: Applicative m => (a -> m b) -> (a, a, a) -> m ()

   tools-yj	Data.Tuple.ToolsYj

   No documentation available.

10. mapWithKey :: ([c] -> a -> b) -> TMap c a -> TMap c b

    trie-simple	Data.Trie.Map

    Same semantics to following defintion, but have more efficient implementation.

    mapWithKey f = fromAscList .
    map (\(cs,a) -> (cs,  f cs a)) .
    toAscList
    

Page 364 of many | Previous | Next