Safe Haskell	None
Language	Haskell2010

Generic.Data.Orphans

Contents

Orphan instances

Documentation

Orphan instances

Eq1 Par1 Source #
Methods liftEq :: (a -> b -> Bool) -> Par1 a -> Par1 b -> Bool #
Ord1 Par1 Source #
Methods liftCompare :: (a -> b -> Ordering) -> Par1 a -> Par1 b -> Ordering #
Semigroup p => Semigroup (Par1 p) Source #
Methods (<>) :: Par1 p -> Par1 p -> Par1 p # sconcat :: NonEmpty (Par1 p) -> Par1 p # stimes :: Integral b => b -> Par1 p -> Par1 p #
Monoid p => Monoid (Par1 p) Source #
Methods mempty :: Par1 p # mappend :: Par1 p -> Par1 p -> Par1 p # mconcat :: [Par1 p] -> Par1 p #
Eq1 (V1 *) Source #
Methods liftEq :: (a -> b -> Bool) -> V1 * a -> V1 * b -> Bool #
Eq1 (U1 *) Source #
Methods liftEq :: (a -> b -> Bool) -> U1 * a -> U1 * b -> Bool #
Ord1 (V1 *) Source #
Methods liftCompare :: (a -> b -> Ordering) -> V1 * a -> V1 * b -> Ordering #
Ord1 (U1 *) Source #
Methods liftCompare :: (a -> b -> Ordering) -> U1 * a -> U1 * b -> Ordering #
Semigroup (V1 * p) Source #
Methods (<>) :: V1 * p -> V1 * p -> V1 * p # sconcat :: NonEmpty (V1 * p) -> V1 * p # stimes :: Integral b => b -> V1 * p -> V1 * p #
Semigroup (U1 * p) Source #
Methods (<>) :: U1 * p -> U1 * p -> U1 * p # sconcat :: NonEmpty (U1 * p) -> U1 * p # stimes :: Integral b => b -> U1 * p -> U1 * p #
Monoid (U1 * p) Source #
Methods mempty :: U1 * p # mappend :: U1 * p -> U1 * p -> U1 * p # mconcat :: [U1 * p] -> U1 * p #
Eq1 f => Eq1 (Rec1 * f) Source #
Methods liftEq :: (a -> b -> Bool) -> Rec1 * f a -> Rec1 * f b -> Bool #
Ord1 f => Ord1 (Rec1 * f) Source #
Methods liftCompare :: (a -> b -> Ordering) -> Rec1 * f a -> Rec1 * f b -> Ordering #
Monoid c => Applicative (K1 * i c) Source #
Methods pure :: a -> K1 * i c a # (<>) :: K1 i c (a -> b) -> K1 * i c a -> K1 * i c b # liftA2 :: (a -> b -> c) -> K1 * i c a -> K1 * i c b -> K1 * i c c # (>) :: K1 i c a -> K1 * i c b -> K1 * i c b # (<) :: K1 i c a -> K1 * i c b -> K1 * i c a #
Semigroup (f p) => Semigroup (Rec1 * f p) Source #
Methods (<>) :: Rec1 * f p -> Rec1 * f p -> Rec1 * f p # sconcat :: NonEmpty (Rec1 * f p) -> Rec1 * f p # stimes :: Integral b => b -> Rec1 * f p -> Rec1 * f p #
Monoid (f p) => Monoid (Rec1 * f p) Source #
Methods mempty :: Rec1 * f p # mappend :: Rec1 * f p -> Rec1 * f p -> Rec1 * f p # mconcat :: [Rec1 * f p] -> Rec1 * f p #
Eq c => Eq1 (K1 * i c) Source #
Methods liftEq :: (a -> b -> Bool) -> K1 * i c a -> K1 * i c b -> Bool #
(Eq1 f, Eq1 g) => Eq1 ((:+:) * f g) Source #
Methods liftEq :: (a -> b -> Bool) -> (* :+: f) g a -> (* :+: f) g b -> Bool #
(Eq1 f, Eq1 g) => Eq1 ((::) f g) Source #
Methods liftEq :: (a -> b -> Bool) -> (* :: f) g a -> ( :*: f) g b -> Bool #
Ord c => Ord1 (K1 * i c) Source #
Methods liftCompare :: (a -> b -> Ordering) -> K1 * i c a -> K1 * i c b -> Ordering #
(Ord1 f, Ord1 g) => Ord1 ((:+:) * f g) Source #
Methods liftCompare :: (a -> b -> Ordering) -> (* :+: f) g a -> (* :+: f) g b -> Ordering #
(Ord1 f, Ord1 g) => Ord1 ((::) f g) Source #
Methods liftCompare :: (a -> b -> Ordering) -> (* :: f) g a -> ( :*: f) g b -> Ordering #
Semigroup c => Semigroup (K1 * i c p) Source #
Methods (<>) :: K1 * i c p -> K1 * i c p -> K1 * i c p # sconcat :: NonEmpty (K1 * i c p) -> K1 * i c p # stimes :: Integral b => b -> K1 * i c p -> K1 * i c p #
(Semigroup (f p), Semigroup (g p)) => Semigroup ((::) f g p) Source #
Methods (<>) :: (* :: f) g p -> ( :: f) g p -> ( :: f) g p # sconcat :: NonEmpty (( :: f) g p) -> ( :: f) g p # stimes :: Integral b => b -> ( :: f) g p -> ( :*: f) g p #
Monoid c => Monoid (K1 * i c p) Source #
Methods mempty :: K1 * i c p # mappend :: K1 * i c p -> K1 * i c p -> K1 * i c p # mconcat :: [K1 * i c p] -> K1 * i c p #
(Monoid (f p), Monoid (g p)) => Monoid ((::) f g p) Source #
Methods mempty :: (* :: f) g p # mappend :: ( :: f) g p -> ( :: f) g p -> ( :: f) g p # mconcat :: [( :: f) g p] -> ( :*: f) g p #
Eq1 f => Eq1 (M1 * i c f) Source #
Methods liftEq :: (a -> b -> Bool) -> M1 * i c f a -> M1 * i c f b -> Bool #
(Eq1 f, Eq1 g) => Eq1 ((:.:) * * f g) Source #
Methods liftEq :: (a -> b -> Bool) -> (* :.: ) f g a -> ( :.: *) f g b -> Bool #
Ord1 f => Ord1 (M1 * i c f) Source #
Methods liftCompare :: (a -> b -> Ordering) -> M1 * i c f a -> M1 * i c f b -> Ordering #
(Ord1 f, Ord1 g) => Ord1 ((:.:) * * f g) Source #
Methods liftCompare :: (a -> b -> Ordering) -> (* :.: ) f g a -> ( :.: *) f g b -> Ordering #
Semigroup (f p) => Semigroup (M1 * i c f p) Source #
Methods (<>) :: M1 * i c f p -> M1 * i c f p -> M1 * i c f p # sconcat :: NonEmpty (M1 * i c f p) -> M1 * i c f p # stimes :: Integral b => b -> M1 * i c f p -> M1 * i c f p #
Semigroup (f (g p)) => Semigroup ((:.:) * * f g p) Source #
Methods (<>) :: (* :.: ) f g p -> ( :.: ) f g p -> ( :.: ) f g p # sconcat :: NonEmpty (( :.: ) f g p) -> ( :.: ) f g p # stimes :: Integral b => b -> ( :.: ) f g p -> ( :.: *) f g p #
Monoid (f p) => Monoid (M1 * i c f p) Source #
Methods mempty :: M1 * i c f p # mappend :: M1 * i c f p -> M1 * i c f p -> M1 * i c f p # mconcat :: [M1 * i c f p] -> M1 * i c f p #
Monoid (f (g p)) => Monoid ((:.:) * * f g p) Source #
Methods mempty :: (* :.: ) f g p # mappend :: ( :.: ) f g p -> ( :.: ) f g p -> ( :.: ) f g p # mconcat :: [( :.: ) f g p] -> ( :.: *) f g p #