{-# LANGUAGE Rank2Types #-}
module Lens.Family2.Stock (
_1, _2
, chosen
, ix
, at, intAt
, at', intAt'
, contains, intContains
, left, right
, just, nothing
, both
, bend, lend
, cod
, both'
, bend', lend'
, both_
, bend_, lend_
, left_, right_
, just_, nothing_
, ignored
, mapped
, Stock.alongside
, Stock.backwards
, Stock.beside, Stock.beside', Stock.beside_
, Stock.choosing
, Stock.from
, Stock.AlongsideLeft, Stock.AlongsideRight
, Stock.FromF, Stock.FromG
, Lens, Lens'
, Grate, Grate'
, Traversal, Traversal'
, Setter
, Stock.AdapterLike, Stock.AdapterLike'
, Stock.LensLike, Stock.LensLike'
, Stock.Identical, Stock.Backwards
, Stock.FiniteBits
, lft, rgt
, some, none
, lft_, rgt_
, some_, none_
) where
import qualified Data.Map as Map
import qualified Data.Set as Set
import qualified Data.IntMap as IntMap
import qualified Data.IntSet as IntSet
import qualified Lens.Family.Stock as Stock
import Lens.Family2
_1 :: Lens (a, r) (b, r) a b
_1 = Stock._1
_2 :: Lens (r, a) (r, b) a 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
cod :: Grate (r -> a) (r -> b) a b
cod = Stock.cod
left :: Prism (Either a r) (Either b r) a b
left = Stock.left
left_ :: Traversal (Either a r) (Either b r) a b
left_ = Stock.left_
right :: Prism (Either r a) (Either r b) a b
right = Stock.right
right_ :: Traversal (Either r a) (Either r b) a b
right_ = Stock.right_
just :: Prism (Maybe a) (Maybe b) a b
just = Stock.just
just_ :: Traversal (Maybe a) (Maybe b) a b
just_ = Stock.just_
nothing :: Prism' (Maybe a) ()
nothing = Stock.nothing
nothing_ :: Traversal' (Maybe a) ()
nothing_ = Stock.nothing_
both :: Grid (a,a) (b,b) a b
both = Stock.both
both' :: Grate (a,a) (b,b) a b
both' = Stock.both'
both_ :: Traversal (a,a) (b,b) a b
both_ = Stock.both_
lend :: Stock.FiniteBits b => Grid' b Bool
lend = Stock.lend
lend' :: Stock.FiniteBits b => Grate' b Bool
lend' = Stock.lend'
lend_ :: Stock.FiniteBits b => Traversal' b Bool
lend_ = Stock.lend_
bend :: Stock.FiniteBits b => Grid' b Bool
bend = Stock.bend
bend' :: Stock.FiniteBits b => Grate' b Bool
bend' = Stock.bend'
bend_ :: Stock.FiniteBits b => Traversal' b Bool
bend_ = Stock.bend_
ignored :: Traversal a a b b'
ignored = Stock.ignored
mapped :: Functor f => Setter (f a) (f a') a a'
mapped = Stock.mapped
{-# DEPRECATED lft "Renamed as 'left'." #-}
lft :: Prism (Either a r) (Either b r) a b
lft = left
{-# DEPRECATED lft_ "Renamed as 'left_'." #-}
lft_ :: Traversal (Either a r) (Either b r) a b
lft_ = left_
{-# DEPRECATED rgt "Renamed as 'right'." #-}
rgt :: Prism (Either r a) (Either r b) a b
rgt = right
{-# DEPRECATED rgt_ "Renamed as 'right_'." #-}
rgt_ :: Traversal (Either r a) (Either r b) a b
rgt_ = right_
{-# DEPRECATED some "Renamed as 'just'." #-}
some :: Prism (Maybe a) (Maybe b) a b
some = just
{-# DEPRECATED some_ "Renamed as 'just_'." #-}
some_ :: Traversal (Maybe a) (Maybe b) a b
some_ = just_
{-# DEPRECATED none "Renamed as 'nothing'." #-}
none :: Prism' (Maybe a) ()
none = nothing
{-# DEPRECATED none_ "Renamed as 'nothing_'." #-}
none_ :: Traversal' (Maybe a) ()
none_ = nothing_