Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

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

  1. mapListModelSetModel :: (HasCallStack, MonadIO m, IsMapListModel a, IsListModel b) => a -> Maybe b -> m ()

    gi-gtk4 GI.Gtk.Objects.MapListModel

    Sets the model to be mapped. GTK makes no effort to ensure that model conforms to the item type expected by the map function. It assumes that the caller knows what they are doing and have set up an appropriate map function.

  2. mapCells :: (a -> b) -> ArrayTable a -> ArrayTable b

    gridtables Text.GridTable.ArrayTable

    Apply a function to all cell contents in a grid table.

  3. mapEvent :: WidgetClass self => Signal self (EventM EAny Bool)

    gtk Graphics.UI.Gtk.Abstract.Widget

    The window is put onto the screen.

  4. mapSignal :: WidgetClass self => Signal self (IO ())

    gtk Graphics.UI.Gtk.Abstract.Widget

    The widget appears on screen.

  5. mapPoints :: Ord v => (Point u -> Point v) -> Bitmap u p -> Bitmap v p

    haha Graphics.Ascii.Haha.Bitmap

    No documentation available.

  6. mapSubject :: (b -> a) -> SpecWith a -> SpecWith b

    hspec-meta Test.Hspec.Meta

    Modify the subject under test. Note that this resembles a contravariant functor on the first type parameter of SpecM. This is because the subject is passed inwards, as an argument to the spec item.

  7. mapFB :: (elt -> lst -> lst) -> (a -> elt) -> a -> lst -> lst

    ihaskell IHaskellPrelude

    No documentation available.

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

    ihaskell IHaskellPrelude

    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.

  9. mapAccumL :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)

    incipit-base Incipit.Base

    The mapAccumL function behaves like a combination of fmap and foldl; it applies a function to each element of a structure, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new structure.

    Examples

    Basic usage: 
    >>> mapAccumL (\a b -> (a + b, a)) 0 [1..10]
(55,[0,1,3,6,10,15,21,28,36,45])

    >>> mapAccumL (\a b -> (a <> show b, a)) "0" [1..5]
("012345",["0","01","012","0123","01234"])

  10. mapAccumR :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)

    incipit-base Incipit.Base

    The mapAccumR function behaves like a combination of fmap and foldr; it applies a function to each element of a structure, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new structure.

    Examples

    Basic usage: 
    >>> mapAccumR (\a b -> (a + b, a)) 0 [1..10]
(55,[54,52,49,45,40,34,27,19,10,0])

    >>> mapAccumR (\a b -> (a <> show b, a)) "0" [1..5]
("054321",["05432","0543","054","05","0"])

Page 284 of many | Previous | Next