Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. contramap :: (a -> b) -> OutputStream b -> IO (OutputStream a)

   io-streams	System.IO.Streams.Combinators

   Contravariant counterpart to map. contramap f s passes all input to s through the function f. Satisfies the following laws:

   Streams.contramap (g . f) === Streams.contramap g >=> Streams.contramap f
   Streams.contramap id === return
   

2. contramapM :: (a -> IO b) -> OutputStream b -> IO (OutputStream a)

   io-streams	System.IO.Streams.Combinators

   Contravariant counterpart to mapM. contramapM f s passes all input to s through the IO action f Satisfies the following laws:

   Streams.contramapM (f >=> g) = Streams.contramapM g >=> Streams.contramapM f
   Streams.contramapM return = return
   

3. contramapM_ :: (a -> IO b) -> OutputStream a -> IO (OutputStream a)

   io-streams	System.IO.Streams.Combinators

   Equivalent to mapM_ for output. contramapM f s passes all input to s through the side-effecting IO action f.

4. contramapMaybe :: (a -> Maybe b) -> OutputStream b -> IO (OutputStream a)

   io-streams	System.IO.Streams.Combinators

   Contravariant counterpart to contramapMaybe. contramap f s passes all input to s through the function f. Discards all the elements for which f returns Nothing. Since: 1.2.1.0

5. class BiPolyMap (map :: Type -> Type -> Type)

   mono-traversable	Data.Containers

   A Map type polymorphic in both its key and value.

6. class (MonoTraversable map, SetContainer map) => IsMap map

   mono-traversable	Data.Containers

   Polymorphic typeclass for interacting with different map types

7. class PolyMap (map :: Type -> Type)

   mono-traversable	Data.Containers

   A guaranteed-polymorphic Map, which allows for more polymorphic versions of functions.

8. adjustMap :: IsMap map => (MapValue map -> MapValue map) -> ContainerKey map -> map -> map

   mono-traversable	Data.Containers

   Apply a function to the value of a given key. Returns the input map when the key-value pair does not exist.

9. alterMap :: IsMap map => (Maybe (MapValue map) -> Maybe (MapValue map)) -> ContainerKey map -> map -> map

   mono-traversable	Data.Containers

   Update/Delete the value of a given key. Applies a function to previous value of a given key, if it results in Nothing delete the key-value pair from the map, otherwise replace the previous value with the new value.

10. deleteMap :: IsMap map => ContainerKey map -> map -> map

    mono-traversable	Data.Containers

    Delete a key-value pair of a map using a specified key.

Page 485 of many | Previous | Next