module Lens.Family2.Stock (
Stock.choosing
, Stock.alongside
, Stock.beside
, _1, _2
, chosen
, ix
, at, intAt
, at', intAt'
, contains, intContains
, both
, _Left, _Right
, _Just, _Nothing
, ignored
, mapped
, Stock.AlongsideLeft, Stock.AlongsideRight
, Lens, Lens'
, Traversal, Traversal'
, Setter
, Stock.LensLike, Stock.LensLike'
, Stock.Applicative, Stock.Identical
) where
import qualified Lens.Family.Stock as Stock
import Lens.Family2 ( Lens, Lens'
, Traversal, Traversal'
, Setter
)
import qualified Data.Map as Map
import qualified Data.IntMap as IntMap
import qualified Data.Set as Set
import qualified Data.IntSet as IntSet
_1 :: Lens (a, b) (a', b) a a'
_1 = Stock._1
_2 :: Lens (a, b) (a, b') b b'
_2 = Stock._2
chosen :: Lens (Either a a) (Either b b) a b
chosen = Stock.chosen
ix :: Eq k => k -> Lens' (k -> v) v
ix = Stock.ix
at :: Ord k => k -> Lens' (Map.Map k v) (Maybe v)
at = Stock.at
intAt :: Int -> Lens' (IntMap.IntMap v) (Maybe v)
intAt = Stock.intAt
at' :: Ord k => k -> Lens' (Map.Map k v) (Maybe v)
at' = Stock.at'
intAt' :: Int -> Lens' (IntMap.IntMap v) (Maybe v)
intAt' = Stock.intAt'
contains :: Ord k => k -> Lens' (Set.Set k) Bool
contains = Stock.contains
intContains :: Int -> Lens' IntSet.IntSet Bool
intContains = Stock.intContains
_Left :: Traversal (Either a b) (Either a' b) a a'
_Left = Stock._Left
_Right :: Traversal (Either a b) (Either a b') b b'
_Right = Stock._Right
_Just :: Traversal (Maybe a) (Maybe a') a a'
_Just = Stock._Just
_Nothing :: Traversal' (Maybe a) ()
_Nothing = Stock._Nothing
both :: Traversal (a,a) (b,b) a b
both = Stock.both
ignored :: Traversal a a b b'
ignored = Stock.ignored
mapped :: Functor f => Setter (f a) (f a') a a'
mapped = Stock.mapped