    {-# LANGUAGE DeriveFunctor #-}
    {-# LANGUAGE DeriveFoldable #-}
    {-# LANGUAGE DeriveTraversable #-}
    {-# LANGUAGE GeneralizedNewtypeDeriving #-}
    module Data.Aeson.Config.Types where

    import           Imports

    import           Data.Bitraversable
    import           Data.Bifoldable

    import           Data.Aeson.Config.FromValue

    newtype List a = List {forall a. List a -> [a]
    fromList :: [a]}
      deriving (List a -> List a -> Bool
    (List a -> List a -> Bool)
    -> (List a -> List a -> Bool) -> Eq (List a)
    forall a. Eq a => List a -> List a -> Bool
    forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
    $c== :: forall a. Eq a => List a -> List a -> Bool
    == :: List a -> List a -> Bool
    $c/= :: forall a. Eq a => List a -> List a -> Bool
    /= :: List a -> List a -> Bool
    Eq, Int -> List a -> ShowS
    [List a] -> ShowS
    List a -> String
    (Int -> List a -> ShowS)
    -> (List a -> String) -> ([List a] -> ShowS) -> Show (List a)
    forall a. Show a => Int -> List a -> ShowS
    forall a. Show a => [List a] -> ShowS
    forall a. Show a => List a -> String
    forall a.
    (Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
    $cshowsPrec :: forall a. Show a => Int -> List a -> ShowS
    showsPrec :: Int -> List a -> ShowS
    $cshow :: forall a. Show a => List a -> String
    show :: List a -> String
    $cshowList :: forall a. Show a => [List a] -> ShowS
    showList :: [List a] -> ShowS
    Show, (forall a b. (a -> b) -> List a -> List b)
    -> (forall a b. a -> List b -> List a) -> Functor List
    forall a b. a -> List b -> List a
    forall a b. (a -> b) -> List a -> List b
    forall (f :: * -> *).
    (forall a b. (a -> b) -> f a -> f b)
    -> (forall a b. a -> f b -> f a) -> Functor f
    $cfmap :: forall a b. (a -> b) -> List a -> List b
    fmap :: forall a b. (a -> b) -> List a -> List b
    $c<$ :: forall a b. a -> List b -> List a
    <$ :: forall a b. a -> List b -> List a
    Functor, (forall m. Monoid m => List m -> m)
    -> (forall m a. Monoid m => (a -> m) -> List a -> m)
    -> (forall m a. Monoid m => (a -> m) -> List a -> m)
    -> (forall a b. (a -> b -> b) -> b -> List a -> b)
    -> (forall a b. (a -> b -> b) -> b -> List a -> b)
    -> (forall b a. (b -> a -> b) -> b -> List a -> b)
    -> (forall b a. (b -> a -> b) -> b -> List a -> b)
    -> (forall a. (a -> a -> a) -> List a -> a)
    -> (forall a. (a -> a -> a) -> List a -> a)
    -> (forall a. List a -> [a])
    -> (forall a. List a -> Bool)
    -> (forall a. List a -> Int)
    -> (forall a. Eq a => a -> List a -> Bool)
    -> (forall a. Ord a => List a -> a)
    -> (forall a. Ord a => List a -> a)
    -> (forall a. Num a => List a -> a)
    -> (forall a. Num a => List a -> a)
    -> Foldable List
    forall a. Eq a => a -> List a -> Bool
    forall a. Num a => List a -> a
    forall a. Ord a => List a -> a
    forall m. Monoid m => List m -> m
    forall a. List a -> Bool
    forall a. List a -> Int
    forall a. List a -> [a]
    forall a. (a -> a -> a) -> List a -> a
    forall m a. Monoid m => (a -> m) -> List a -> m
    forall b a. (b -> a -> b) -> b -> List a -> b
    forall a b. (a -> b -> b) -> b -> List a -> b
    forall (t :: * -> *).
    (forall m. Monoid m => t m -> m)
    -> (forall m a. Monoid m => (a -> m) -> t a -> m)
    -> (forall m a. Monoid m => (a -> m) -> t a -> m)
    -> (forall a b. (a -> b -> b) -> b -> t a -> b)
    -> (forall a b. (a -> b -> b) -> b -> t a -> b)
    -> (forall b a. (b -> a -> b) -> b -> t a -> b)
    -> (forall b a. (b -> a -> b) -> b -> t a -> b)
    -> (forall a. (a -> a -> a) -> t a -> a)
    -> (forall a. (a -> a -> a) -> t a -> a)
    -> (forall a. t a -> [a])
    -> (forall a. t a -> Bool)
    -> (forall a. t a -> Int)
    -> (forall a. Eq a => a -> t a -> Bool)
    -> (forall a. Ord a => t a -> a)
    -> (forall a. Ord a => t a -> a)
    -> (forall a. Num a => t a -> a)
    -> (forall a. Num a => t a -> a)
    -> Foldable t
    $cfold :: forall m. Monoid m => List m -> m
    fold :: forall m. Monoid m => List m -> m
    $cfoldMap :: forall m a. Monoid m => (a -> m) -> List a -> m
    foldMap :: forall m a. Monoid m => (a -> m) -> List a -> m
    $cfoldMap' :: forall m a. Monoid m => (a -> m) -> List a -> m
    foldMap' :: forall m a. Monoid m => (a -> m) -> List a -> m
    $cfoldr :: forall a b. (a -> b -> b) -> b -> List a -> b
    foldr :: forall a b. (a -> b -> b) -> b -> List a -> b
    $cfoldr' :: forall a b. (a -> b -> b) -> b -> List a -> b
    foldr' :: forall a b. (a -> b -> b) -> b -> List a -> b
    $cfoldl :: forall b a. (b -> a -> b) -> b -> List a -> b
    foldl :: forall b a. (b -> a -> b) -> b -> List a -> b
    $cfoldl' :: forall b a. (b -> a -> b) -> b -> List a -> b
    foldl' :: forall b a. (b -> a -> b) -> b -> List a -> b
    $cfoldr1 :: forall a. (a -> a -> a) -> List a -> a
    foldr1 :: forall a. (a -> a -> a) -> List a -> a
    $cfoldl1 :: forall a. (a -> a -> a) -> List a -> a
    foldl1 :: forall a. (a -> a -> a) -> List a -> a
    $ctoList :: forall a. List a -> [a]
    toList :: forall a. List a -> [a]
    $cnull :: forall a. List a -> Bool
    null :: forall a. List a -> Bool
    $clength :: forall a. List a -> Int
    length :: forall a. List a -> Int
    $celem :: forall a. Eq a => a -> List a -> Bool
    elem :: forall a. Eq a => a -> List a -> Bool
    $cmaximum :: forall a. Ord a => List a -> a
    maximum :: forall a. Ord a => List a -> a
    $cminimum :: forall a. Ord a => List a -> a
    minimum :: forall a. Ord a => List a -> a
    $csum :: forall a. Num a => List a -> a
    sum :: forall a. Num a => List a -> a
    $cproduct :: forall a. Num a => List a -> a
    product :: forall a. Num a => List a -> a
    Foldable, Functor List
    Foldable List
    Functor List
    -> Foldable List
    -> (forall (f :: * -> *) a b.
        Applicative f =>
        (a -> f b) -> List a -> f (List b))
    -> (forall (f :: * -> *) a.
        Applicative f =>
        List (f a) -> f (List a))
    -> (forall (m :: * -> *) a b.
        Monad m =>
        (a -> m b) -> List a -> m (List b))
    -> (forall (m :: * -> *) a. Monad m => List (m a) -> m (List a))
    -> Traversable List
    forall (t :: * -> *).
    Functor t
    -> Foldable t
    -> (forall (f :: * -> *) a b.
        Applicative f =>
        (a -> f b) -> t a -> f (t b))
    -> (forall (f :: * -> *) a. Applicative f => t (f a) -> f (t a))
    -> (forall (m :: * -> *) a b.
        Monad m =>
        (a -> m b) -> t a -> m (t b))
    -> (forall (m :: * -> *) a. Monad m => t (m a) -> m (t a))
    -> Traversable t
    forall (m :: * -> *) a. Monad m => List (m a) -> m (List a)
    forall (f :: * -> *) a. Applicative f => List (f a) -> f (List a)
    forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> List a -> m (List b)
    forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> List a -> f (List b)
    $ctraverse :: forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> List a -> f (List b)
    traverse :: forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> List a -> f (List b)
    $csequenceA :: forall (f :: * -> *) a. Applicative f => List (f a) -> f (List a)
    sequenceA :: forall (f :: * -> *) a. Applicative f => List (f a) -> f (List a)
    $cmapM :: forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> List a -> m (List b)
    mapM :: forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> List a -> m (List b)
    $csequence :: forall (m :: * -> *) a. Monad m => List (m a) -> m (List a)
    sequence :: forall (m :: * -> *) a. Monad m => List (m a) -> m (List a)
    Traversable, NonEmpty (List a) -> List a
    List a -> List a -> List a
    (List a -> List a -> List a)
    -> (NonEmpty (List a) -> List a)
    -> (forall b. Integral b => b -> List a -> List a)
    -> Semigroup (List a)
    forall b. Integral b => b -> List a -> List a
    forall a. NonEmpty (List a) -> List a
    forall a. List a -> List a -> List a
    forall a.
    (a -> a -> a)
    -> (NonEmpty a -> a)
    -> (forall b. Integral b => b -> a -> a)
    -> Semigroup a
    forall a b. Integral b => b -> List a -> List a
    $c<> :: forall a. List a -> List a -> List a
    <> :: List a -> List a -> List a
    $csconcat :: forall a. NonEmpty (List a) -> List a
    sconcat :: NonEmpty (List a) -> List a
    $cstimes :: forall a b. Integral b => b -> List a -> List a
    stimes :: forall b. Integral b => b -> List a -> List a
    Semigroup, Semigroup (List a)
    List a
    Semigroup (List a)
    -> List a
    -> (List a -> List a -> List a)
    -> ([List a] -> List a)
    -> Monoid (List a)
    [List a] -> List a
    List a -> List a -> List a
    forall a. Semigroup (List a)
    forall a. List a
    forall a.
    Semigroup a -> a -> (a -> a -> a) -> ([a] -> a) -> Monoid a
    forall a. [List a] -> List a
    forall a. List a -> List a -> List a
    $cmempty :: forall a. List a
    mempty :: List a
    $cmappend :: forall a. List a -> List a -> List a
    mappend :: List a -> List a -> List a
    $cmconcat :: forall a. [List a] -> List a
    mconcat :: [List a] -> List a
    Monoid)

    instance FromValue a => FromValue (List a) where
      fromValue :: Value -> Parser (List a)
    fromValue Value
    v = [a] -> List a
    forall a. [a] -> List a
    List ([a] -> List a) -> Parser [a] -> Parser (List a)
    forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
    <$> case Value
    v of
        Array Array
    _ -> Value -> Parser [a]
    forall a. FromValue a => Value -> Parser a
    fromValue Value
    v
        Value
    _ -> a -> [a]
    forall a. a -> [a]
    forall (m :: * -> *) a. Monad m => a -> m a
    return (a -> [a]) -> Parser a -> Parser [a]
    forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
    <$> Value -> Parser a
    forall a. FromValue a => Value -> Parser a
    fromValue Value
    v

    fromMaybeList :: Maybe (List a) -> [a]
    fromMaybeList :: forall a. Maybe (List a) -> [a]
    fromMaybeList = [a] -> (List a -> [a]) -> Maybe (List a) -> [a]
    forall b a. b -> (a -> b) -> Maybe a -> b
    maybe [] List a -> [a]
    forall a. List a -> [a]
    fromList

    data Product a b = Product a b
      deriving (Product a b -> Product a b -> Bool
    (Product a b -> Product a b -> Bool)
    -> (Product a b -> Product a b -> Bool) -> Eq (Product a b)
    forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
    forall a b. (Eq a, Eq b) => Product a b -> Product a b -> Bool
    $c== :: forall a b. (Eq a, Eq b) => Product a b -> Product a b -> Bool
    == :: Product a b -> Product a b -> Bool
    $c/= :: forall a b. (Eq a, Eq b) => Product a b -> Product a b -> Bool
    /= :: Product a b -> Product a b -> Bool
    Eq, Int -> Product a b -> ShowS
    [Product a b] -> ShowS
    Product a b -> String
    (Int -> Product a b -> ShowS)
    -> (Product a b -> String)
    -> ([Product a b] -> ShowS)
    -> Show (Product a b)
    forall a.
    (Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
    forall a b. (Show a, Show b) => Int -> Product a b -> ShowS
    forall a b. (Show a, Show b) => [Product a b] -> ShowS
    forall a b. (Show a, Show b) => Product a b -> String
    $cshowsPrec :: forall a b. (Show a, Show b) => Int -> Product a b -> ShowS
    showsPrec :: Int -> Product a b -> ShowS
    $cshow :: forall a b. (Show a, Show b) => Product a b -> String
    show :: Product a b -> String
    $cshowList :: forall a b. (Show a, Show b) => [Product a b] -> ShowS
    showList :: [Product a b] -> ShowS
    Show, (forall a b. (a -> b) -> Product a a -> Product a b)
    -> (forall a b. a -> Product a b -> Product a a)
    -> Functor (Product a)
    forall a b. a -> Product a b -> Product a a
    forall a b. (a -> b) -> Product a a -> Product a b
    forall a a b. a -> Product a b -> Product a a
    forall a a b. (a -> b) -> Product a a -> Product a b
    forall (f :: * -> *).
    (forall a b. (a -> b) -> f a -> f b)
    -> (forall a b. a -> f b -> f a) -> Functor f
    $cfmap :: forall a a b. (a -> b) -> Product a a -> Product a b
    fmap :: forall a b. (a -> b) -> Product a a -> Product a b
    $c<$ :: forall a a b. a -> Product a b -> Product a a
    <$ :: forall a b. a -> Product a b -> Product a a
    Functor, (forall m. Monoid m => Product a m -> m)
    -> (forall m a. Monoid m => (a -> m) -> Product a a -> m)
    -> (forall m a. Monoid m => (a -> m) -> Product a a -> m)
    -> (forall a b. (a -> b -> b) -> b -> Product a a -> b)
    -> (forall a b. (a -> b -> b) -> b -> Product a a -> b)
    -> (forall b a. (b -> a -> b) -> b -> Product a a -> b)
    -> (forall b a. (b -> a -> b) -> b -> Product a a -> b)
    -> (forall a. (a -> a -> a) -> Product a a -> a)
    -> (forall a. (a -> a -> a) -> Product a a -> a)
    -> (forall a. Product a a -> [a])
    -> (forall a. Product a a -> Bool)
    -> (forall a. Product a a -> Int)
    -> (forall a. Eq a => a -> Product a a -> Bool)
    -> (forall a. Ord a => Product a a -> a)
    -> (forall a. Ord a => Product a a -> a)
    -> (forall a. Num a => Product a a -> a)
    -> (forall a. Num a => Product a a -> a)
    -> Foldable (Product a)
    forall a. Eq a => a -> Product a a -> Bool
    forall a. Num a => Product a a -> a
    forall a. Ord a => Product a a -> a
    forall m. Monoid m => Product a m -> m
    forall a. Product a a -> Bool
    forall a. Product a a -> Int
    forall a. Product a a -> [a]
    forall a. (a -> a -> a) -> Product a a -> a
    forall a a. Eq a => a -> Product a a -> Bool
    forall a a. Num a => Product a a -> a
    forall a a. Ord a => Product a a -> a
    forall m a. Monoid m => (a -> m) -> Product a a -> m
    forall a m. Monoid m => Product a m -> m
    forall a a. Product a a -> Bool
    forall a a. Product a a -> Int
    forall a a. Product a a -> [a]
    forall b a. (b -> a -> b) -> b -> Product a a -> b
    forall a b. (a -> b -> b) -> b -> Product a a -> b
    forall a a. (a -> a -> a) -> Product a a -> a
    forall a m a. Monoid m => (a -> m) -> Product a a -> m
    forall a b a. (b -> a -> b) -> b -> Product a a -> b
    forall a a b. (a -> b -> b) -> b -> Product a a -> b
    forall (t :: * -> *).
    (forall m. Monoid m => t m -> m)
    -> (forall m a. Monoid m => (a -> m) -> t a -> m)
    -> (forall m a. Monoid m => (a -> m) -> t a -> m)
    -> (forall a b. (a -> b -> b) -> b -> t a -> b)
    -> (forall a b. (a -> b -> b) -> b -> t a -> b)
    -> (forall b a. (b -> a -> b) -> b -> t a -> b)
    -> (forall b a. (b -> a -> b) -> b -> t a -> b)
    -> (forall a. (a -> a -> a) -> t a -> a)
    -> (forall a. (a -> a -> a) -> t a -> a)
    -> (forall a. t a -> [a])
    -> (forall a. t a -> Bool)
    -> (forall a. t a -> Int)
    -> (forall a. Eq a => a -> t a -> Bool)
    -> (forall a. Ord a => t a -> a)
    -> (forall a. Ord a => t a -> a)
    -> (forall a. Num a => t a -> a)
    -> (forall a. Num a => t a -> a)
    -> Foldable t
    $cfold :: forall a m. Monoid m => Product a m -> m
    fold :: forall m. Monoid m => Product a m -> m
    $cfoldMap :: forall a m a. Monoid m => (a -> m) -> Product a a -> m
    foldMap :: forall m a. Monoid m => (a -> m) -> Product a a -> m
    $cfoldMap' :: forall a m a. Monoid m => (a -> m) -> Product a a -> m
    foldMap' :: forall m a. Monoid m => (a -> m) -> Product a a -> m
    $cfoldr :: forall a a b. (a -> b -> b) -> b -> Product a a -> b
    foldr :: forall a b. (a -> b -> b) -> b -> Product a a -> b
    $cfoldr' :: forall a a b. (a -> b -> b) -> b -> Product a a -> b
    foldr' :: forall a b. (a -> b -> b) -> b -> Product a a -> b
    $cfoldl :: forall a b a. (b -> a -> b) -> b -> Product a a -> b
    foldl :: forall b a. (b -> a -> b) -> b -> Product a a -> b
    $cfoldl' :: forall a b a. (b -> a -> b) -> b -> Product a a -> b
    foldl' :: forall b a. (b -> a -> b) -> b -> Product a a -> b
    $cfoldr1 :: forall a a. (a -> a -> a) -> Product a a -> a
    foldr1 :: forall a. (a -> a -> a) -> Product a a -> a
    $cfoldl1 :: forall a a. (a -> a -> a) -> Product a a -> a
    foldl1 :: forall a. (a -> a -> a) -> Product a a -> a
    $ctoList :: forall a a. Product a a -> [a]
    toList :: forall a. Product a a -> [a]
    $cnull :: forall a a. Product a a -> Bool
    null :: forall a. Product a a -> Bool
    $clength :: forall a a. Product a a -> Int
    length :: forall a. Product a a -> Int
    $celem :: forall a a. Eq a => a -> Product a a -> Bool
    elem :: forall a. Eq a => a -> Product a a -> Bool
    $cmaximum :: forall a a. Ord a => Product a a -> a
    maximum :: forall a. Ord a => Product a a -> a
    $cminimum :: forall a a. Ord a => Product a a -> a
    minimum :: forall a. Ord a => Product a a -> a
    $csum :: forall a a. Num a => Product a a -> a
    sum :: forall a. Num a => Product a a -> a
    $cproduct :: forall a a. Num a => Product a a -> a
    product :: forall a. Num a => Product a a -> a
    Foldable, Functor (Product a)
    Foldable (Product a)
    Functor (Product a)
    -> Foldable (Product a)
    -> (forall (f :: * -> *) a b.
        Applicative f =>
        (a -> f b) -> Product a a -> f (Product a b))
    -> (forall (f :: * -> *) a.
        Applicative f =>
        Product a (f a) -> f (Product a a))
    -> (forall (m :: * -> *) a b.
        Monad m =>
        (a -> m b) -> Product a a -> m (Product a b))
    -> (forall (m :: * -> *) a.
        Monad m =>
        Product a (m a) -> m (Product a a))
    -> Traversable (Product a)
    forall a. Functor (Product a)
    forall a. Foldable (Product a)
    forall a (m :: * -> *) a.
    Monad m =>
    Product a (m a) -> m (Product a a)
    forall a (f :: * -> *) a.
    Applicative f =>
    Product a (f a) -> f (Product a a)
    forall a (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> Product a a -> m (Product a b)
    forall a (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> Product a a -> f (Product a b)
    forall (t :: * -> *).
    Functor t
    -> Foldable t
    -> (forall (f :: * -> *) a b.
        Applicative f =>
        (a -> f b) -> t a -> f (t b))
    -> (forall (f :: * -> *) a. Applicative f => t (f a) -> f (t a))
    -> (forall (m :: * -> *) a b.
        Monad m =>
        (a -> m b) -> t a -> m (t b))
    -> (forall (m :: * -> *) a. Monad m => t (m a) -> m (t a))
    -> Traversable t
    forall (m :: * -> *) a.
    Monad m =>
    Product a (m a) -> m (Product a a)
    forall (f :: * -> *) a.
    Applicative f =>
    Product a (f a) -> f (Product a a)
    forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> Product a a -> m (Product a b)
    forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> Product a a -> f (Product a b)
    $ctraverse :: forall a (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> Product a a -> f (Product a b)
    traverse :: forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> Product a a -> f (Product a b)
    $csequenceA :: forall a (f :: * -> *) a.
    Applicative f =>
    Product a (f a) -> f (Product a a)
    sequenceA :: forall (f :: * -> *) a.
    Applicative f =>
    Product a (f a) -> f (Product a a)
    $cmapM :: forall a (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> Product a a -> m (Product a b)
    mapM :: forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> Product a a -> m (Product a b)
    $csequence :: forall a (m :: * -> *) a.
    Monad m =>
    Product a (m a) -> m (Product a a)
    sequence :: forall (m :: * -> *) a.
    Monad m =>
    Product a (m a) -> m (Product a a)
    Traversable)

    instance (Semigroup a, Semigroup b, Monoid a, Monoid b) => Monoid (Product a b) where
      mempty :: Product a b
    mempty = a -> b -> Product a b
    forall a b. a -> b -> Product a b
    Product a
    forall a. Monoid a => a
    mempty b
    forall a. Monoid a => a
    mempty
      mappend :: Product a b -> Product a b -> Product a b
    mappend = Product a b -> Product a b -> Product a b
    forall a. Semigroup a => a -> a -> a
    (<>)

    instance (Semigroup a, Semigroup b) => Semigroup (Product a b) where
      Product a
    a1 b
    b1 <> :: Product a b -> Product a b -> Product a b
    <> Product a
    a2 b
    b2 = a -> b -> Product a b
    forall a b. a -> b -> Product a b
    Product (a
    a1 a -> a -> a
    forall a. Semigroup a => a -> a -> a
    <> a
    a2) (b
    b1 b -> b -> b
    forall a. Semigroup a => a -> a -> a
    <> b
    b2)

    instance Bifunctor Product where
      bimap :: forall a b c d. (a -> b) -> (c -> d) -> Product a c -> Product b d
    bimap a -> b
    fa c -> d
    fb (Product a
    a c
    b) = b -> d -> Product b d
    forall a b. a -> b -> Product a b
    Product (a -> b
    fa a
    a) (c -> d
    fb c
    b)

    instance Bifoldable Product where
      bifoldMap :: forall m a b. Monoid m => (a -> m) -> (b -> m) -> Product a b -> m
    bifoldMap = (a -> m) -> (b -> m) -> Product a b -> m
    forall (t :: * -> * -> *) m a b.
    (Bitraversable t, Monoid m) =>
    (a -> m) -> (b -> m) -> t a b -> m
    bifoldMapDefault

    instance Bitraversable Product where
      bitraverse :: forall (f :: * -> *) a c b d.
    Applicative f =>
    (a -> f c) -> (b -> f d) -> Product a b -> f (Product c d)
    bitraverse a -> f c
    fa b -> f d
    fb (Product a
    a b
    b) = c -> d -> Product c d
    forall a b. a -> b -> Product a b
    Product (c -> d -> Product c d) -> f c -> f (d -> Product c d)
    forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
    <$> a -> f c
    fa a
    a f (d -> Product c d) -> f d -> f (Product c d)
    forall a b. f (a -> b) -> f a -> f b
    forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
    <*> b -> f d
    fb b
    b

    instance (FromValue a, FromValue b) => FromValue (Product a b) where
      fromValue :: Value -> Parser (Product a b)
    fromValue Value
    v = a -> b -> Product a b
    forall a b. a -> b -> Product a b
    Product (a -> b -> Product a b) -> Parser a -> Parser (b -> Product a b)
    forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
    <$> Value -> Parser a
    forall a. FromValue a => Value -> Parser a
    fromValue Value
    v Parser (b -> Product a b) -> Parser b -> Parser (Product a b)
    forall a b. Parser (a -> b) -> Parser a -> Parser b
    forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
    <*> Value -> Parser b
    forall a. FromValue a => Value -> Parser a
    fromValue Value
    v