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. ifoldMap :: (FoldableWithIndex i f, Monoid m) => (i -> a -> m) -> f a -> m

    optics-core Optics.IxFold

    Fold a container by mapping value to an arbitrary Monoid with access to the index i. When you don't need access to the index then foldMap is more flexible in what it accepts. 

    foldMap ≡ ifoldMap . const

  2. ifoldMap' :: (FoldableWithIndex i f, Monoid m) => (i -> a -> m) -> f a -> m

    optics-core Optics.IxFold

    A variant of ifoldMap that is strict in the accumulator. When you don't need access to the index then foldMap' is more flexible in what it accepts. 

    foldMap' ≡ ifoldMap' . const

  3. ifoldMapOf :: forall k m (is :: IxList) i s a . (Is k A_Fold, Monoid m, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> m) -> s -> m

    optics-core Optics.IxFold

    Fold with index via embedding into a monoid.

  4. imap :: FunctorWithIndex i f => (i -> a -> b) -> f a -> f b

    optics-core Optics.IxSetter

    Map with access to the index.

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

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

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

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

  9. reifiedMappend :: ReifiedMonoid a -> a -> a -> a

    reflection Data.Reflection

    No documentation available.

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

    tagsoup Text.StringLike 

    strMap = map

Page 484 of many | Previous | Next