Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. setmapped :: Ord b => Setter (Set a) (Set b) a b

   optics-core	Data.Set.Optics

   This Setter can be used to change the type of a Set by mapping the elements to new values. Sadly, you can't create a valid Traversal for a Set, but you can manipulate it by reading using folded and reindexing it via setmapped.

   >>> over setmapped (+1) (Set.fromList [1,2,3,4])
   fromList [2,3,4,5]
   

2. foldMapOf :: forall k m (is :: IxList) s a . (Is k A_Fold, Monoid m) => Optic' k is s a -> (a -> m) -> s -> m

   optics-core	Optics.Fold

   Fold via embedding into a monoid.

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

   optics-core	Optics.Indexed.Core

   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
   

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

   optics-core	Optics.Indexed.Core

   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
   

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

   optics-core	Optics.Indexed.Core

   Map with access to the index.

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

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

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

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

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

Page 484 of many | Previous | Next