generic-data-0.1.0.0: Utilities for GHC.Generics
Generic.Data.Orphans
Contents
Methods
liftEq :: (a -> b -> Bool) -> Par1 a -> Par1 b -> Bool #
liftCompare :: (a -> b -> Ordering) -> Par1 a -> Par1 b -> Ordering #
(<>) :: Par1 p -> Par1 p -> Par1 p #
sconcat :: NonEmpty (Par1 p) -> Par1 p #
stimes :: Integral b => b -> Par1 p -> Par1 p #
mempty :: Par1 p #
mappend :: Par1 p -> Par1 p -> Par1 p #
mconcat :: [Par1 p] -> Par1 p #
liftEq :: (a -> b -> Bool) -> V1 * a -> V1 * b -> Bool #
liftEq :: (a -> b -> Bool) -> U1 * a -> U1 * b -> Bool #
liftCompare :: (a -> b -> Ordering) -> V1 * a -> V1 * b -> Ordering #
liftCompare :: (a -> b -> Ordering) -> U1 * a -> U1 * b -> Ordering #
(<>) :: V1 * p -> V1 * p -> V1 * p #
sconcat :: NonEmpty (V1 * p) -> V1 * p #
stimes :: Integral b => b -> V1 * p -> V1 * p #
(<>) :: U1 * p -> U1 * p -> U1 * p #
sconcat :: NonEmpty (U1 * p) -> U1 * p #
stimes :: Integral b => b -> U1 * p -> U1 * p #
mempty :: U1 * p #
mappend :: U1 * p -> U1 * p -> U1 * p #
mconcat :: [U1 * p] -> U1 * p #
liftEq :: (a -> b -> Bool) -> Rec1 * f a -> Rec1 * f b -> Bool #
liftCompare :: (a -> b -> Ordering) -> Rec1 * f a -> Rec1 * f b -> Ordering #
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 #
(<>) :: 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 #
mempty :: Rec1 * f p #
mappend :: Rec1 * f p -> Rec1 * f p -> Rec1 * f p #
mconcat :: [Rec1 * f p] -> Rec1 * f p #
liftEq :: (a -> b -> Bool) -> K1 * i c a -> K1 * i c b -> Bool #
liftEq :: (a -> b -> Bool) -> (* :+: f) g a -> (* :+: f) g b -> Bool #
liftEq :: (a -> b -> Bool) -> (* :*: f) g a -> (* :*: f) g b -> Bool #
liftCompare :: (a -> b -> Ordering) -> K1 * i c a -> K1 * i c b -> Ordering #
liftCompare :: (a -> b -> Ordering) -> (* :+: f) g a -> (* :+: f) g b -> Ordering #
liftCompare :: (a -> b -> Ordering) -> (* :*: f) g a -> (* :*: f) g b -> Ordering #
(<>) :: 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 #
(<>) :: (* :*: 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 #
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 #
mempty :: (* :*: f) g p #
mappend :: (* :*: f) g p -> (* :*: f) g p -> (* :*: f) g p #
mconcat :: [(* :*: f) g p] -> (* :*: f) g p #
liftEq :: (a -> b -> Bool) -> M1 * i c f a -> M1 * i c f b -> Bool #
liftEq :: (a -> b -> Bool) -> (* :.: *) f g a -> (* :.: *) f g b -> Bool #
liftCompare :: (a -> b -> Ordering) -> M1 * i c f a -> M1 * i c f b -> Ordering #
liftCompare :: (a -> b -> Ordering) -> (* :.: *) f g a -> (* :.: *) f g b -> Ordering #
(<>) :: 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 #
(<>) :: (* :.: *) 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 #
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 #
mempty :: (* :.: *) f g p #
mappend :: (* :.: *) f g p -> (* :.: *) f g p -> (* :.: *) f g p #
mconcat :: [(* :.: *) f g p] -> (* :.: *) f g p #