Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. mapCons :: (Listable a, Listable b) => ([(a, b)] -> c) -> [[c]]

   extrapolate	Test.Extrapolate.Core

   Given a constructor that takes a map of elements (encoded as a list), lists tiers of applications of this constructor So long as the underlying Listable enumerations have no repetitions, this will generate no repetitions. This allows defining an efficient implementation of tiers that does not repeat maps given by:

   tiers  =  mapCons fromList
   

2. mapT :: (a -> b) -> [[a]] -> [[b]]

   extrapolate	Test.Extrapolate.Core

   map over tiers

   mapT f [[x], [y,z], [w,...], ...]  =  [[f x], [f y, f z], [f w, ...], ...]
   

   mapT f [xs, ys, zs, ...]  =  [map f xs, map f ys, map f zs]
   

3. mappend :: Monoid a => a -> a -> a

   faktory	Faktory.Prelude

   An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

4. mapM_ :: (HVector v, ArityC c (Elems v), Applicative f) => Proxy c -> (forall a . c a => a -> f ()) -> v -> f ()

   fixed-vector-hetero	Data.Vector.HFixed

   Apply monadic action to every element in the vector

5. mapNat :: HVectorF v => (forall a . () => f a -> g a) -> v f -> v g

   fixed-vector-hetero	Data.Vector.HFixed

   Apply natural transformation to every element of the tuple.

   >>> mapNat (Just . runIdentity) (mk2F (pure 'c') (pure 1) :: HVecF '[Char, Int] Identity)
   [Just 'c',Just 1]
   

6. mapOf :: Ord a => Reader a -> Reader b -> Reader (Map a b)

   flags-applicative	Flags.Applicative

   Transforms a single-valued unary flag into one which accepts a comma-separated list of colon-delimited key-value pairs. The syntax is key:value[,key:value...]. Note that escapes are not supported, so neither keys not values should contain colons or commas.

7. mapAccumulator :: (m -> n) -> FunctionBuilder m a b -> FunctionBuilder n a b

   function-builder	Data.FunctionBuilder

   Convert the accumulated (usually monoidal-) value, this allows to change the underlying accumlator type.

8. mapNext :: (s -> r) -> FunctionBuilder m r a -> FunctionBuilder m s a

   function-builder	Data.FunctionBuilder

   Convert the output of a FunctionBuilder value; since most FunctionBuilders are parameteric in r they also have r in a in a, such that a always either is r or is a function returning r eventually. In order to get from a FunctionBuilder that can accept a continuation returning it an r to a FunctionBuilder that accepts continuations returning an s instead, we need to apply a function s -> r to the return value of the continuation. Note that a mapNext will not only change the r to an s but probably also the the a, when it is parametric, as in this contrived example:

   example :: Int -> x -> Sum Int
   example = toFunction (ign add)
   
   add :: FunctionBuilder (Sum Int) next (Int -> next)
   add = FB (\k x -> k $ Sum x)
   
   ign :: FunctionBuilder m (x -> r) a -> FunctionBuilder m r a
   ign = mapNext const
   

   Here the extra parameter x is pushed down into the a of the add FunctionBuilder.

9. mapListModelGetModel :: (HasCallStack, MonadIO m, IsMapListModel a) => a -> m (Maybe ListModel)

   gi-gtk4	GI.Gtk.Objects.MapListModel

   Gets the model that is currently being mapped or Nothing if none.

10. mapListModelHasMap :: (HasCallStack, MonadIO m, IsMapListModel a) => a -> m Bool

    gi-gtk4	GI.Gtk.Objects.MapListModel

    Checks if a map function is currently set on self.

Page 292 of many | Previous | Next