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.

Exact lookup

1. sets :: (Profunctor p, Profunctor q, Settable f) => (p a b -> q s t) -> Optical p q f s t a b

   lens	Control.Lens.Combinators

   Build a Setter, IndexedSetter or IndexPreservingSetter depending on your choice of Profunctor.

   sets :: ((a -> b) -> s -> t) -> Setter s t a b
   

2. setting :: ((a -> b) -> s -> t) -> IndexPreservingSetter s t a b

   lens	Control.Lens.Combinators

   Build an index-preserving Setter from a map-like function. Your supplied function f is required to satisfy:

   f id ≡ id
   f g . f h ≡ f (g . h)
   

   Equational reasoning:

   setting . over ≡ id
   over . setting ≡ id
   

   Another way to view sets is that it takes a "semantic editor combinator" and transforms it into a Setter.

   setting :: ((a -> b) -> s -> t) -> Setter s t a b
   

3. set' :: ASetter' s a -> a -> s -> s

   lens	Control.Lens.Setter

   Replace the target of a Lens or all of the targets of a Setter' or Traversal with a constant value, without changing its type. This is a type restricted version of set, which retains the type of the original.

   >>> set' mapped x [a,b,c,d]
   [x,x,x,x]
   

   >>> set' _2 "hello" (1,"world")
   (1,"hello")
   

   >>> set' mapped 0 [1,2,3,4]
   [0,0,0,0]
   

   Note: Attempting to adjust set' a Fold or Getter will fail at compile time with an relatively nice error message.

   set' :: Setter' s a    -> a -> s -> s
   set' :: Iso' s a       -> a -> s -> s
   set' :: Lens' s a      -> a -> s -> s
   set' :: Traversal' s a -> a -> s -> s
   

4. sets :: (Profunctor p, Profunctor q, Settable f) => (p a b -> q s t) -> Optical p q f s t a b

   lens	Control.Lens.Setter

   Build a Setter, IndexedSetter or IndexPreservingSetter depending on your choice of Profunctor.

   sets :: ((a -> b) -> s -> t) -> Setter s t a b
   

5. setting :: ((a -> b) -> s -> t) -> IndexPreservingSetter s t a b

   lens	Control.Lens.Setter

   Build an index-preserving Setter from a map-like function. Your supplied function f is required to satisfy:

   f id ≡ id
   f g . f h ≡ f (g . h)
   

   Equational reasoning:

   setting . over ≡ id
   over . setting ≡ id
   

   Another way to view sets is that it takes a "semantic editor combinator" and transforms it into a Setter.

   setting :: ((a -> b) -> s -> t) -> Setter s t a b
   

6. setOf :: Hashable a => Getting (HashSet a) s a -> s -> HashSet a

   lens	Data.HashSet.Lens

   Construct a set from a Getter, Fold, Traversal, Lens or Iso.

   setOf :: Hashable a         => Getter s a     -> s -> HashSet a
   setOf :: (Eq a, Hashable a) => Fold s a       -> s -> HashSet a
   setOf :: Hashable a         => Iso' s a       -> s -> HashSet a
   setOf :: Hashable a         => Lens' s a      -> s -> HashSet a
   setOf :: (Eq a, Hashable a) => Traversal' s a -> s -> HashSet a
   

7. setmapped :: (Eq j, Hashable j) => IndexPreservingSetter (HashSet i) (HashSet j) i j

   lens	Data.HashSet.Lens

   This Setter can be used to change the type of a HashSet 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.

8. setOf :: Getting IntSet s Int -> s -> IntSet

   lens	Data.IntSet.Lens

   Construct an IntSet from a Getter, Fold, Traversal, Lens or Iso.

   >>> setOf folded [1,2,3,4]
   fromList [1,2,3,4]
   

   >>> setOf (folded._2) [("hello",1),("world",2),("!!!",3)]
   fromList [1,2,3]
   

   setOf :: Getter s Int     -> s -> IntSet
   setOf :: Fold s Int       -> s -> IntSet
   setOf :: Iso' s Int       -> s -> IntSet
   setOf :: Lens' s Int      -> s -> IntSet
   setOf :: Traversal' s Int -> s -> IntSet
   

9. setmapped :: IndexPreservingSetter' IntSet Int

   lens	Data.IntSet.Lens

   This Setter can be used to change the contents of an IntSet by mapping the elements to new values. Sadly, you can't create a valid Traversal for an IntSet, because the number of elements might change 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. setOf :: Getting (Set a) s a -> s -> Set a

    lens	Data.Set.Lens

    Construct a set from a Getter, Fold, Traversal, Lens or Iso.

    >>> setOf folded ["hello","world"]
    fromList ["hello","world"]
    

    >>> setOf (folded._2) [("hello",1),("world",2),("!!!",3)]
    fromList [1,2,3]
    

    setOf ::          Getter s a     -> s -> Set a
    setOf :: Ord a => Fold s a       -> s -> Set a
    setOf ::          Iso' s a       -> s -> Set a
    setOf ::          Lens' s a      -> s -> Set a
    setOf :: Ord a => Traversal' s a -> s -> Set a
    

Page 150 of many | Previous | Next