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. bimap :: forall a b c d (i :: k) . Bifunctor p => (a -> b) -> (c -> d) -> p i a c -> p i b d

    optics-core Optics.Internal.Bi

    No documentation available.

  2. contrabimap :: forall b a d c (i :: k) . Bicontravariant p => (b -> a) -> (d -> c) -> p i a c -> p i b d

    optics-core Optics.Internal.Bi

    No documentation available.

  3. imapped__ :: (Mapping p, FunctorWithIndex i f) => Optic__ p j (i -> j) (f a) (f b) a b

    optics-core Optics.Internal.IxSetter

    Internal implementation of imapped.

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

    foldMapifoldMap . const
    

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

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

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

    optics-core Optics.IxSetter

    Map with access to the index.

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

    optics-core Optics.IxSetter

    Indexed setter via the FunctorWithIndex class.

    iover imappedimap
    

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

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

Page 483 of many | Previous | Next