Safe Haskell | Safe-Infered |
---|
- mergeL :: Functor f => RefFamily f a a' c c' -> RefFamily f b b' c c' -> RefFamily f (Either a b) (Either a' b') c c'
- (***) :: Functor f => ClonerFamily a1 a1' b1 b1' -> ClonerFamily a2 a2' b2 b2' -> RefFamily f (a1, a2) (a1', a2') (b1, b2) (b1', b2')
- fstL :: Functor f => RefFamily f (a, b) (a', b) a a'
- sndL :: Functor f => RefFamily f (a, b) (a, b') b b'
- funL :: (Eq k, Functor f) => k -> Ref f (k -> v) v
- mapL :: (Ord k, Functor f) => k -> Ref f (Map k v) (Maybe v)
- intMapL :: Functor f => Int -> Ref f (IntMap v) (Maybe v)
- setL :: (Ord k, Functor f) => k -> Ref f (Set k) Bool
- intSetL :: Functor f => Int -> Ref f IntSet Bool
- type RefFamily f a a' b b' = (b -> f b') -> a -> f a'
- type Ref f a b = RefFamily f a a b b
Lens Combinators
mergeL :: Functor f => RefFamily f a a' c c' -> RefFamily f b b' c c' -> RefFamily f (Either a b) (Either a' b') c c'Source
Given two lens/getter/setter families with the same substructure, make a new lens/getter/setter on Either
.
(***) :: Functor f => ClonerFamily a1 a1' b1 b1' -> ClonerFamily a2 a2' b2 b2' -> RefFamily f (a1, a2) (a1', a2') (b1, b2) (b1', b2')Source
Given two lens families, make a new lens on their product.