Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

  1. amap :: Annotated ast => (l -> l) -> ast l -> ast l

    haskell-src-exts Language.Haskell.Exts.Syntax

    Change the annotation of an AST node. Note that only the annotation of the node itself is affected, and not the annotations of any child nodes. if all nodes in the AST tree are to be affected, use fmap.

  2. cmap :: (Element b, Container c e) => (e -> b) -> c e -> c b

    hmatrix Numeric.LinearAlgebra.Data

    like fmap (cannot implement instance Functor because of Element class constraint)

  3. remap :: Element t => Matrix I -> Matrix I -> Matrix t -> Matrix t

    hmatrix Numeric.LinearAlgebra.Data

    Extract elements from positions given in matrices of rows and columns.

    >>> r
    (3><3)
    [ 1, 1, 1
    , 1, 2, 2
    , 1, 2, 3 ]
    
    >>> c
    (3><3)
    [ 0, 1, 5
    , 2, 2, 1
    , 4, 4, 1 ]
    
    >>> m
    (4><6)
    [  0,  1,  2,  3,  4,  5
    ,  6,  7,  8,  9, 10, 11
    , 12, 13, 14, 15, 16, 17
    , 18, 19, 20, 21, 22, 23 ]
    
    >>> remap r c m
    (3><3)
    [  6,  7, 11
    ,  8, 14, 13
    , 10, 16, 19 ]
    
    The indexes are autoconformable.
    >>> c'
    (3><1)
    [ 1
    , 2
    , 4 ]
    
    >>> remap r c' m
    (3><3)
    [  7,  7,  7
    ,  8, 14, 14
    , 10, 16, 22 ]
    

  4. dmmap :: forall (n :: Nat) (m :: Nat) . (Domain field vec mat, KnownNat m, KnownNat n) => (field -> field) -> mat n m -> mat n m

    hmatrix Numeric.LinearAlgebra.Static

    No documentation available.

  5. dvmap :: forall (n :: Nat) . (Domain field vec mat, KnownNat n) => (field -> field) -> vec n -> vec n

    hmatrix Numeric.LinearAlgebra.Static

    No documentation available.

  6. 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
    

  7. 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
    

  8. 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.

  9. 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

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

    mono-traversable Data.Containers

    A Map type polymorphic in both its key and value.

Page 485 of many | Previous | Next