Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

  1. imapped :: FunctorWithIndex i f => IxSetter i (f a) (f b) a b

    optics-core Optics.IxSetter

    Indexed setter via the FunctorWithIndex class. 

    iover imapped ≡ imap

  2. imapAccumLOf :: forall k (is :: IxList) i s t a b acc . (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a b -> (i -> acc -> a -> (b, acc)) -> acc -> s -> (t, acc)

    optics-core Optics.IxTraversal

    Generalizes mapAccumL to an arbitrary IxTraversal. imapAccumLOf accumulates state from left to right. 

    mapAccumLOf o ≡ imapAccumLOf o . const

  3. imapAccumROf :: forall k (is :: IxList) i s t a b acc . (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a b -> (i -> acc -> a -> (b, acc)) -> acc -> s -> (t, acc)

    optics-core Optics.IxTraversal

    Generalizes mapAccumR to an arbitrary IxTraversal. imapAccumROf accumulates state from right to left. 

    mapAccumROf o ≡ imapAccumROf o . const

  4. foldMapBy :: Foldable t => (r -> r -> r) -> r -> (a -> r) -> t a -> r

    reflection Data.Reflection

    Fold a value using its Foldable instance using explicitly provided Monoid operations. This is like foldMap where the Monoid instance can be manually specified. 

    foldMapBy mappend mempty ≡ foldMap

    >>> foldMapBy (+) 0 length ["hello","world"]
10

  5. reifiedMappend :: ReifiedMonoid a -> a -> a -> a

    reflection Data.Reflection

    No documentation available.

  6. strMap :: StringLike a => (Char -> Char) -> a -> a

    tagsoup Text.StringLike 

    strMap = map

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

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

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

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

    hmatrix Numeric.LinearAlgebra.Static

    No documentation available.

Page 484 of many | Previous | Next