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. gmap :: GFunctor f => (a -> b) -> f a -> f b

   generic-deriving	Generics.Deriving.Functor

   No documentation available.

2. gmap' :: GFunctor' f => (a -> b) -> f a -> f b

   generic-deriving	Generics.Deriving.Functor

   No documentation available.

3. gmapdefault :: (Generic1 f, GFunctor' (Rep1 f)) => (a -> b) -> f a -> f b

   generic-deriving	Generics.Deriving.Functor

   No documentation available.

4. gmappend :: GMonoid a => a -> a -> a

   generic-deriving	Generics.Deriving.Monoid

   Generic mappend

5. gmappend' :: forall (x :: k) . GMonoid' f => f x -> f x -> f x

   generic-deriving	Generics.Deriving.Monoid

   No documentation available.

6. gmappenddefault :: (Generic a, GMonoid' (Rep a)) => a -> a -> a

   generic-deriving	Generics.Deriving.Monoid

   No documentation available.

7. gmapM :: (GTraversable t, Monad m) => (a -> m b) -> t a -> m (t b)

   generic-deriving	Generics.Deriving.Traversable

   No documentation available.

8. toMapOf :: forall k (is :: IxList) s a . (Is k A_Fold, HasSingleIndex is Int) => Optic' k is s a -> s -> IntMap a

   optics-core	Data.IntMap.Optics

   Construct a map from an IxFold. The construction is left-biased (see union), i.e. the first occurrences of keys in the fold or traversal order are preferred.

   >>> toMapOf ifolded ["hello", "world"]
   fromList [(0,"hello"),(1,"world")]
   

   >>> toMapOf (folded % ifolded) [(1,"alpha"),(2, "beta")]
   fromList [(1,"alpha"),(2,"beta")]
   

   >>> toMapOf (icompose (\a b -> 10*a+b) $ ifolded % ifolded) ["foo", "bar"]
   fromList [(0,'f'),(1,'o'),(2,'o'),(10,'b'),(11,'a'),(12,'r')]
   

   >>> toMapOf (folded % ifolded) [(1, "hello"), (2, "world"), (1, "dummy")]
   fromList [(1,"hello"),(2,"world")]
   

9. setmapped :: Setter' IntSet Int

   optics-core	Data.IntSet.Optics

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

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

10. toMapOf :: forall k (is :: IxList) i s a . (Is k A_Fold, HasSingleIndex is i, Ord i) => Optic' k is s a -> s -> Map i a

    optics-core	Data.Map.Optics

    Construct a map from an IxFold. The construction is left-biased (see union), i.e. the first occurrences of keys in the fold or traversal order are preferred.

    >>> toMapOf ifolded ["hello", "world"]
    fromList [(0,"hello"),(1,"world")]
    

    >>> toMapOf (folded % ifolded) [('a',"alpha"),('b', "beta")]
    fromList [('a',"alpha"),('b',"beta")]
    

    >>> toMapOf (ifolded <%> ifolded) ["foo", "bar"]
    fromList [((0,0),'f'),((0,1),'o'),((0,2),'o'),((1,0),'b'),((1,1),'a'),((1,2),'r')]
    

    >>> toMapOf (folded % ifolded) [('a', "hello"), ('b', "world"), ('a', "dummy")]
    fromList [('a',"hello"),('b',"world")]
    

Page 483 of many | Previous | Next