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.

  1. mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()

    copilot-language Copilot.Language.Prelude

    Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.

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

    copilot-language Copilot.Language.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.

  3. mapCursorWidget :: ([(k, v)] -> KeyValueCursor kc vc k v -> [(k, v)] -> Widget n) -> MapCursor kc vc k v -> Widget n

    cursor-brick Cursor.Brick.Map

    No documentation available.

  4. mapCursorWidgetM :: ([(k, v)] -> KeyValueCursor kc vc k v -> [(k, v)] -> m (Widget n)) -> MapCursor kc vc k v -> m (Widget n)

    cursor-brick Cursor.Brick.Map

    No documentation available.

  5. mapDiff :: Shift r => ADiff r -> Block r -> Maybe (Block r)

    diff-loc DiffLoc.Diff

    Translate a span in the source of a diff to a span in its target. Nothing if the span overlaps with a replacement. For exaple, given the following ADiff (or Replace) from "aAacCc" to "aAabbbcCc": 

    source aAa   cCc
- 
+    bbb
target aAabbbcCc

    >>> r0 = Replace 3 (offset 0) (offset 3) :: Replace N

>>> d0 = addDiff r0 emptyDiff
    The span of "A" remains unchanged. 
    >>> mapDiff d0 (1 :.. offset 1)
Just (1 :.. offset 1)

>>> shiftBlock r0 (1 :.. offset 1)
Just (1 :.. offset 1)

>>> comapDiff d0 (1 :.. offset 1)
Just (1 :.. offset 1)

>>> coshiftBlock r0 (1 :.. offset 1)
Just (1 :.. offset 1)
    The span of "C" is shifted by 3 characters. 
    >>> mapDiff d0 (4 :.. offset 1)
Just (7 :.. offset 1)

>>> shiftBlock r0 (4 :.. offset 1)
Just (7 :.. offset 1)

>>> comapDiff d0 (7 :.. offset 1)
Just (4 :.. offset 1)

>>> coshiftBlock r0 (7 :.. offset 1)
Just (4 :.. offset 1)
    The span of "ac" overlaps with the replacement, so the mapping is undefined. 
    >>> mapDiff d0 (2 :.. offset 2)
Nothing

>>> shiftBlock r0 (2 :.. offset 2)
Nothing

>>> comapDiff d0 (2 :.. offset 5)
Nothing

>>> coshiftBlock r0 (2 :.. offset 5)
Nothing

    Properties

    \(FSN d s) -> not (isZeroLength s) ==> partialSemiInverse (mapDiff d) (comapDiff d) s

    \(FSN d s) -> not (isZeroLength s) ==> partialSemiInverse (comapDiff d) (mapDiff d) s
    where partialSemiInverse f g x is the property 
    if   f x == Just y   -- for some y
then g y == Just x

  6. mapMG :: (ModSummary -> ModSummary) -> ModuleGraph -> ModuleGraph

    ghc-lib GHC

    Map a function f over all the ModSummaries. To preserve invariants f can't change the isBoot status.

  7. mapBlockTop :: (LiveBasicBlock instr -> LiveBasicBlock instr) -> LiveCmmDecl statics instr -> LiveCmmDecl statics instr

    ghc-lib GHC.CmmToAsm.Reg.Liveness

    map a function across all the basic blocks in this code

  8. mapBlockTopM :: Monad m => (LiveBasicBlock instr -> m (LiveBasicBlock instr)) -> LiveCmmDecl statics instr -> m (LiveCmmDecl statics instr)

    ghc-lib GHC.CmmToAsm.Reg.Liveness

    map a function across all the basic blocks in this code (monadic version)

  9. mapGenBlockTop :: (GenBasicBlock i -> GenBasicBlock i) -> GenCmmDecl d h (ListGraph i) -> GenCmmDecl d h (ListGraph i)

    ghc-lib GHC.CmmToAsm.Reg.Liveness

    No documentation available.

  10. mapGenBlockTopM :: Monad m => (GenBasicBlock i -> m (GenBasicBlock i)) -> GenCmmDecl d h (ListGraph i) -> m (GenCmmDecl d h (ListGraph i))

    ghc-lib GHC.CmmToAsm.Reg.Liveness

    map a function across all the basic blocks in this code (monadic version)

Page 340 of many | Previous | Next