Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
Instances
Instances
Bitraversable (Either4 a b) Source # | |
Defined in Data.Avro.EitherN bitraverse :: Applicative f => (a0 -> f c) -> (b0 -> f d) -> Either4 a b a0 b0 -> f (Either4 a b c d) # | |
Bifoldable (Either4 a b) Source # | |
Defined in Data.Avro.EitherN | |
Bifunctor (Either4 a b) Source # | |
Monad (Either4 a b c) Source # | |
Functor (Either4 a b c) Source # | |
Applicative (Either4 a b c) Source # | |
Defined in Data.Avro.EitherN pure :: a0 -> Either4 a b c a0 # (<*>) :: Either4 a b c (a0 -> b0) -> Either4 a b c a0 -> Either4 a b c b0 # liftA2 :: (a0 -> b0 -> c0) -> Either4 a b c a0 -> Either4 a b c b0 -> Either4 a b c c0 # (*>) :: Either4 a b c a0 -> Either4 a b c b0 -> Either4 a b c b0 # (<*) :: Either4 a b c a0 -> Either4 a b c b0 -> Either4 a b c a0 # | |
Foldable (Either4 a b c) Source # | |
Defined in Data.Avro.EitherN fold :: Monoid m => Either4 a b c m -> m # foldMap :: Monoid m => (a0 -> m) -> Either4 a b c a0 -> m # foldr :: (a0 -> b0 -> b0) -> b0 -> Either4 a b c a0 -> b0 # foldr' :: (a0 -> b0 -> b0) -> b0 -> Either4 a b c a0 -> b0 # foldl :: (b0 -> a0 -> b0) -> b0 -> Either4 a b c a0 -> b0 # foldl' :: (b0 -> a0 -> b0) -> b0 -> Either4 a b c a0 -> b0 # foldr1 :: (a0 -> a0 -> a0) -> Either4 a b c a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either4 a b c a0 -> a0 # toList :: Either4 a b c a0 -> [a0] # null :: Either4 a b c a0 -> Bool # length :: Either4 a b c a0 -> Int # elem :: Eq a0 => a0 -> Either4 a b c a0 -> Bool # maximum :: Ord a0 => Either4 a b c a0 -> a0 # minimum :: Ord a0 => Either4 a b c a0 -> a0 # | |
Traversable (Either4 a b c) Source # | |
Defined in Data.Avro.EitherN traverse :: Applicative f => (a0 -> f b0) -> Either4 a b c a0 -> f (Either4 a b c b0) # sequenceA :: Applicative f => Either4 a b c (f a0) -> f (Either4 a b c a0) # mapM :: Monad m => (a0 -> m b0) -> Either4 a b c a0 -> m (Either4 a b c b0) # sequence :: Monad m => Either4 a b c (m a0) -> m (Either4 a b c a0) # | |
(Eq a, Eq b, Eq c, Eq d) => Eq (Either4 a b c d) Source # | |
(Ord a, Ord b, Ord c, Ord d) => Ord (Either4 a b c d) Source # | |
Defined in Data.Avro.EitherN compare :: Either4 a b c d -> Either4 a b c d -> Ordering # (<) :: Either4 a b c d -> Either4 a b c d -> Bool # (<=) :: Either4 a b c d -> Either4 a b c d -> Bool # (>) :: Either4 a b c d -> Either4 a b c d -> Bool # (>=) :: Either4 a b c d -> Either4 a b c d -> Bool # max :: Either4 a b c d -> Either4 a b c d -> Either4 a b c d # min :: Either4 a b c d -> Either4 a b c d -> Either4 a b c d # | |
(Show a, Show b, Show c, Show d) => Show (Either4 a b c d) Source # | |
Generic (Either4 a b c d) Source # | |
(HasAvroSchema a, HasAvroSchema b, HasAvroSchema c, HasAvroSchema d) => HasAvroSchema (Either4 a b c d) Source # | |
(ToAvro a, ToAvro b, ToAvro c, ToAvro d) => ToAvro (Either4 a b c d) Source # | |
(FromAvro a, FromAvro b, FromAvro c, FromAvro d) => FromAvro (Either4 a b c d) Source # | |
(FromLazyAvro a, FromLazyAvro b, FromLazyAvro c, FromLazyAvro d) => FromLazyAvro (Either4 a b c d) Source # | |
Defined in Data.Avro.EitherN | |
type Rep (Either4 a b c d) Source # | |
Defined in Data.Avro.EitherN type Rep (Either4 a b c d) = D1 (MetaData "Either4" "Data.Avro.EitherN" "avro-0.4.2.0-2wy5Cv5VfjI32zPmYmhxio" False) ((C1 (MetaCons "E4_1" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) :+: C1 (MetaCons "E4_2" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 b))) :+: (C1 (MetaCons "E4_3" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 c)) :+: C1 (MetaCons "E4_4" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 d)))) |
data Either5 a b c d e Source #
Instances
Bitraversable (Either5 a b c) Source # | |
Defined in Data.Avro.EitherN bitraverse :: Applicative f => (a0 -> f c0) -> (b0 -> f d) -> Either5 a b c a0 b0 -> f (Either5 a b c c0 d) # | |
Bifoldable (Either5 a b c) Source # | |
Defined in Data.Avro.EitherN | |
Bifunctor (Either5 a b c) Source # | |
Monad (Either5 a b c d) Source # | |
Functor (Either5 a b c d) Source # | |
Applicative (Either5 a b c d) Source # | |
Defined in Data.Avro.EitherN pure :: a0 -> Either5 a b c d a0 # (<*>) :: Either5 a b c d (a0 -> b0) -> Either5 a b c d a0 -> Either5 a b c d b0 # liftA2 :: (a0 -> b0 -> c0) -> Either5 a b c d a0 -> Either5 a b c d b0 -> Either5 a b c d c0 # (*>) :: Either5 a b c d a0 -> Either5 a b c d b0 -> Either5 a b c d b0 # (<*) :: Either5 a b c d a0 -> Either5 a b c d b0 -> Either5 a b c d a0 # | |
Foldable (Either5 a b c d) Source # | |
Defined in Data.Avro.EitherN fold :: Monoid m => Either5 a b c d m -> m # foldMap :: Monoid m => (a0 -> m) -> Either5 a b c d a0 -> m # foldr :: (a0 -> b0 -> b0) -> b0 -> Either5 a b c d a0 -> b0 # foldr' :: (a0 -> b0 -> b0) -> b0 -> Either5 a b c d a0 -> b0 # foldl :: (b0 -> a0 -> b0) -> b0 -> Either5 a b c d a0 -> b0 # foldl' :: (b0 -> a0 -> b0) -> b0 -> Either5 a b c d a0 -> b0 # foldr1 :: (a0 -> a0 -> a0) -> Either5 a b c d a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either5 a b c d a0 -> a0 # toList :: Either5 a b c d a0 -> [a0] # null :: Either5 a b c d a0 -> Bool # length :: Either5 a b c d a0 -> Int # elem :: Eq a0 => a0 -> Either5 a b c d a0 -> Bool # maximum :: Ord a0 => Either5 a b c d a0 -> a0 # minimum :: Ord a0 => Either5 a b c d a0 -> a0 # | |
Traversable (Either5 a b c d) Source # | |
Defined in Data.Avro.EitherN traverse :: Applicative f => (a0 -> f b0) -> Either5 a b c d a0 -> f (Either5 a b c d b0) # sequenceA :: Applicative f => Either5 a b c d (f a0) -> f (Either5 a b c d a0) # mapM :: Monad m => (a0 -> m b0) -> Either5 a b c d a0 -> m (Either5 a b c d b0) # sequence :: Monad m => Either5 a b c d (m a0) -> m (Either5 a b c d a0) # | |
(Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (Either5 a b c d e) Source # | |
(Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (Either5 a b c d e) Source # | |
Defined in Data.Avro.EitherN compare :: Either5 a b c d e -> Either5 a b c d e -> Ordering # (<) :: Either5 a b c d e -> Either5 a b c d e -> Bool # (<=) :: Either5 a b c d e -> Either5 a b c d e -> Bool # (>) :: Either5 a b c d e -> Either5 a b c d e -> Bool # (>=) :: Either5 a b c d e -> Either5 a b c d e -> Bool # max :: Either5 a b c d e -> Either5 a b c d e -> Either5 a b c d e # min :: Either5 a b c d e -> Either5 a b c d e -> Either5 a b c d e # | |
(Show a, Show b, Show c, Show d, Show e) => Show (Either5 a b c d e) Source # | |
Generic (Either5 a b c d e) Source # | |
(HasAvroSchema a, HasAvroSchema b, HasAvroSchema c, HasAvroSchema d, HasAvroSchema e) => HasAvroSchema (Either5 a b c d e) Source # | |
(ToAvro a, ToAvro b, ToAvro c, ToAvro d, ToAvro e) => ToAvro (Either5 a b c d e) Source # | |
(FromAvro a, FromAvro b, FromAvro c, FromAvro d, FromAvro e) => FromAvro (Either5 a b c d e) Source # | |
(FromLazyAvro a, FromLazyAvro b, FromLazyAvro c, FromLazyAvro d, FromLazyAvro e) => FromLazyAvro (Either5 a b c d e) Source # | |
Defined in Data.Avro.EitherN | |
type Rep (Either5 a b c d e) Source # | |
Defined in Data.Avro.EitherN type Rep (Either5 a b c d e) = D1 (MetaData "Either5" "Data.Avro.EitherN" "avro-0.4.2.0-2wy5Cv5VfjI32zPmYmhxio" False) ((C1 (MetaCons "E5_1" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) :+: C1 (MetaCons "E5_2" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 b))) :+: (C1 (MetaCons "E5_3" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 c)) :+: (C1 (MetaCons "E5_4" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 d)) :+: C1 (MetaCons "E5_5" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 e))))) |