Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

  1. mapDynamicSpider :: HasSpiderTimeline x => (a -> b) -> Dynamic (SpiderTimeline x) a -> Dynamic (SpiderTimeline x) b

    reflex Reflex.Spider.Internal

    No documentation available.

  2. mapWorkflow :: forall t (m :: Type -> Type) a b . (Reflex t, Functor m) => (a -> b) -> Workflow t m a -> Workflow t m b

    reflex Reflex.Workflow

    Map a function over a Workflow, possibly changing the return type.

  3. mapWorkflowCheap :: forall t (m :: Type -> Type) a b . (Reflex t, Functor m) => (a -> b) -> Workflow t m a -> Workflow t m b

    reflex Reflex.Workflow

    Map a "cheap" function over a Workflow. Refer to the documentation for pushCheap for more information and performance considerations.

  4. mapCArrayInPlace :: (Ix i, Storable e) => (e -> e) -> CArray i e -> CArray i e

    carray Data.Array.CArray.Base

    In-place map on CArray. Note that this is IN PLACE so you should not retain any reference to the original. It flagrantly breaks referential transparency!

  5. mapExceptionT :: (m (Either SomeException a) -> n (Either SomeException b)) -> ExceptionT m a -> ExceptionT n b

    exception-transformers Control.Monad.Exception

    No documentation available.

  6. mapException :: (Exception e1, Exception e2) => (e1 -> e2) -> a -> a

    graphviz Data.GraphViz.Exception

    This function maps one exception into another as proposed in the paper "A semantics for imprecise exceptions".

  7. mapDotGraph :: (DotRepr dg n, DotRepr dg n') => (n -> n') -> dg n -> dg n'

    graphviz Data.GraphViz.Types

    Change the node values. This function is assumed to be injective, otherwise the resulting graph will not be identical to the original (modulo labels).

  8. mapAccounts :: (Account -> Account) -> Account -> Account

    hledger-lib Hledger.Data.Account

    Map a (non-tree-structure-modifying) function over this and sub accounts.

  9. maPlus :: MixedAmount -> MixedAmount -> MixedAmount

    hledger-lib Hledger.Data.Amount

    Sum two MixedAmount, keeping the cost of the first if any. Amounts with different costs are kept separate (since 2021).

  10. mapMixedAmount :: (Amount -> Amount) -> MixedAmount -> MixedAmount

    hledger-lib Hledger.Data.Amount

    Apply a transform to a mixed amount's component Amounts.

Page 164 of many | Previous | Next