Copyright	(C) 2012-2016 Edward Kmett
License	BSD-style (see the file LICENSE)
Maintainer	Edward Kmett <ekmett@gmail.com>
Stability	provisional
Portability	non-portable
Safe Haskell	Safe-Inferred
Language	Haskell2010

Control.Lens.Internal.Getter

Description

Synopsis

noEffect :: ( Contravariant f, Applicative f) => f a
newtype AlongsideLeft f b a = AlongsideLeft {
- getAlongsideLeft :: f (a, b)
}
newtype AlongsideRight f a b = AlongsideRight {
- getAlongsideRight :: f (a, b)
}

Documentation

noEffect :: ( Contravariant f, Applicative f) => f a Source #

The mempty equivalent for a Contravariant Applicative Functor .

newtype AlongsideLeft f b a Source #

Constructors

AlongsideLeft
Fields getAlongsideLeft :: f (a, b)

Instances

Instances details

Functor f => Bifunctor ( AlongsideLeft f) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods bimap :: (a -> b) -> (c -> d) -> AlongsideLeft f a c -> AlongsideLeft f b d Source # first :: (a -> b) -> AlongsideLeft f a c -> AlongsideLeft f b c Source # second :: (b -> c) -> AlongsideLeft f a b -> AlongsideLeft f a c Source #
Traversable f => Bitraversable ( AlongsideLeft f) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods bitraverse :: Applicative f0 => (a -> f0 c) -> (b -> f0 d) -> AlongsideLeft f a b -> f0 ( AlongsideLeft f c d) Source #
Foldable f => Bifoldable ( AlongsideLeft f) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods bifold :: Monoid m => AlongsideLeft f m m -> m Source # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> AlongsideLeft f a b -> m Source # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> AlongsideLeft f a b -> c Source # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> AlongsideLeft f a b -> c Source #
Functor f => Functor ( AlongsideLeft f b) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods fmap :: (a -> b0) -> AlongsideLeft f b a -> AlongsideLeft f b b0 Source # (<$) :: a -> AlongsideLeft f b b0 -> AlongsideLeft f b a Source #
Foldable f => Foldable ( AlongsideLeft f b) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods fold :: Monoid m => AlongsideLeft f b m -> m Source # foldMap :: Monoid m => (a -> m) -> AlongsideLeft f b a -> m Source # foldMap' :: Monoid m => (a -> m) -> AlongsideLeft f b a -> m Source # foldr :: (a -> b0 -> b0) -> b0 -> AlongsideLeft f b a -> b0 Source # foldr' :: (a -> b0 -> b0) -> b0 -> AlongsideLeft f b a -> b0 Source # foldl :: (b0 -> a -> b0) -> b0 -> AlongsideLeft f b a -> b0 Source # foldl' :: (b0 -> a -> b0) -> b0 -> AlongsideLeft f b a -> b0 Source # foldr1 :: (a -> a -> a) -> AlongsideLeft f b a -> a Source # foldl1 :: (a -> a -> a) -> AlongsideLeft f b a -> a Source # toList :: AlongsideLeft f b a -> [a] Source # null :: AlongsideLeft f b a -> Bool Source # length :: AlongsideLeft f b a -> Int Source # elem :: Eq a => a -> AlongsideLeft f b a -> Bool Source # maximum :: Ord a => AlongsideLeft f b a -> a Source # minimum :: Ord a => AlongsideLeft f b a -> a Source # sum :: Num a => AlongsideLeft f b a -> a Source # product :: Num a => AlongsideLeft f b a -> a Source #
Traversable f => Traversable ( AlongsideLeft f b) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods traverse :: Applicative f0 => (a -> f0 b0) -> AlongsideLeft f b a -> f0 ( AlongsideLeft f b b0) Source # sequenceA :: Applicative f0 => AlongsideLeft f b (f0 a) -> f0 ( AlongsideLeft f b a) Source # mapM :: Monad m => (a -> m b0) -> AlongsideLeft f b a -> m ( AlongsideLeft f b b0) Source # sequence :: Monad m => AlongsideLeft f b (m a) -> m ( AlongsideLeft f b a) Source #
Contravariant f => Contravariant ( AlongsideLeft f b) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods contramap :: (a -> b0) -> AlongsideLeft f b b0 -> AlongsideLeft f b a Source # (>$) :: b0 -> AlongsideLeft f b b0 -> AlongsideLeft f b a Source #
Traversable1 f => Traversable1 ( AlongsideLeft f b) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods traverse1 :: Apply f0 => (a -> f0 b0) -> AlongsideLeft f b a -> f0 ( AlongsideLeft f b b0) Source # sequence1 :: Apply f0 => AlongsideLeft f b (f0 b0) -> f0 ( AlongsideLeft f b b0) Source #
Foldable1 f => Foldable1 ( AlongsideLeft f b) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods fold1 :: Semigroup m => AlongsideLeft f b m -> m Source # foldMap1 :: Semigroup m => (a -> m) -> AlongsideLeft f b a -> m Source # toNonEmpty :: AlongsideLeft f b a -> NonEmpty a Source #
Read (f (a, b)) => Read ( AlongsideLeft f b a) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods readsPrec :: Int -> ReadS ( AlongsideLeft f b a) Source # readList :: ReadS [ AlongsideLeft f b a] Source # readPrec :: ReadPrec ( AlongsideLeft f b a) Source # readListPrec :: ReadPrec [ AlongsideLeft f b a] Source #
Show (f (a, b)) => Show ( AlongsideLeft f b a) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods showsPrec :: Int -> AlongsideLeft f b a -> ShowS Source # show :: AlongsideLeft f b a -> String Source # showList :: [ AlongsideLeft f b a] -> ShowS Source #

newtype AlongsideRight f a b Source #

Constructors

AlongsideRight
Fields getAlongsideRight :: f (a, b)

Instances

Instances details

Functor f => Bifunctor ( AlongsideRight f) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods bimap :: (a -> b) -> (c -> d) -> AlongsideRight f a c -> AlongsideRight f b d Source # first :: (a -> b) -> AlongsideRight f a c -> AlongsideRight f b c Source # second :: (b -> c) -> AlongsideRight f a b -> AlongsideRight f a c Source #
Traversable f => Bitraversable ( AlongsideRight f) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods bitraverse :: Applicative f0 => (a -> f0 c) -> (b -> f0 d) -> AlongsideRight f a b -> f0 ( AlongsideRight f c d) Source #
Foldable f => Bifoldable ( AlongsideRight f) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods bifold :: Monoid m => AlongsideRight f m m -> m Source # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> AlongsideRight f a b -> m Source # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> AlongsideRight f a b -> c Source # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> AlongsideRight f a b -> c Source #
Functor f => Functor ( AlongsideRight f a) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods fmap :: (a0 -> b) -> AlongsideRight f a a0 -> AlongsideRight f a b Source # (<$) :: a0 -> AlongsideRight f a b -> AlongsideRight f a a0 Source #
Foldable f => Foldable ( AlongsideRight f a) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods fold :: Monoid m => AlongsideRight f a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> AlongsideRight f a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> AlongsideRight f a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> AlongsideRight f a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> AlongsideRight f a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> AlongsideRight f a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> AlongsideRight f a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> AlongsideRight f a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> AlongsideRight f a a0 -> a0 Source # toList :: AlongsideRight f a a0 -> [a0] Source # null :: AlongsideRight f a a0 -> Bool Source # length :: AlongsideRight f a a0 -> Int Source # elem :: Eq a0 => a0 -> AlongsideRight f a a0 -> Bool Source # maximum :: Ord a0 => AlongsideRight f a a0 -> a0 Source # minimum :: Ord a0 => AlongsideRight f a a0 -> a0 Source # sum :: Num a0 => AlongsideRight f a a0 -> a0 Source # product :: Num a0 => AlongsideRight f a a0 -> a0 Source #
Traversable f => Traversable ( AlongsideRight f a) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods traverse :: Applicative f0 => (a0 -> f0 b) -> AlongsideRight f a a0 -> f0 ( AlongsideRight f a b) Source # sequenceA :: Applicative f0 => AlongsideRight f a (f0 a0) -> f0 ( AlongsideRight f a a0) Source # mapM :: Monad m => (a0 -> m b) -> AlongsideRight f a a0 -> m ( AlongsideRight f a b) Source # sequence :: Monad m => AlongsideRight f a (m a0) -> m ( AlongsideRight f a a0) Source #
Contravariant f => Contravariant ( AlongsideRight f a) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods contramap :: (a0 -> b) -> AlongsideRight f a b -> AlongsideRight f a a0 Source # (>$) :: b -> AlongsideRight f a b -> AlongsideRight f a a0 Source #
Traversable1 f => Traversable1 ( AlongsideRight f a) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods traverse1 :: Apply f0 => (a0 -> f0 b) -> AlongsideRight f a a0 -> f0 ( AlongsideRight f a b) Source # sequence1 :: Apply f0 => AlongsideRight f a (f0 b) -> f0 ( AlongsideRight f a b) Source #
Foldable1 f => Foldable1 ( AlongsideRight f a) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods fold1 :: Semigroup m => AlongsideRight f a m -> m Source # foldMap1 :: Semigroup m => (a0 -> m) -> AlongsideRight f a a0 -> m Source # toNonEmpty :: AlongsideRight f a a0 -> NonEmpty a0 Source #
Read (f (a, b)) => Read ( AlongsideRight f a b) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods readsPrec :: Int -> ReadS ( AlongsideRight f a b) Source # readList :: ReadS [ AlongsideRight f a b] Source # readPrec :: ReadPrec ( AlongsideRight f a b) Source # readListPrec :: ReadPrec [ AlongsideRight f a b] Source #
Show (f (a, b)) => Show ( AlongsideRight f a b) Source #
Instance details Defined in Control.Lens.Internal.Getter Methods showsPrec :: Int -> AlongsideRight f a b -> ShowS Source # show :: AlongsideRight f a b -> String Source # showList :: [ AlongsideRight f a b] -> ShowS Source #