    {-# LANGUAGE DeriveDataTypeable #-}
    module Numeric.Interval.Exception
      ( EmptyInterval(..)
      , AmbiguousComparison(..)
      ) where

    import Control.Exception
    import Data.Data

    data EmptyInterval = EmptyInterval
      deriving (EmptyInterval -> EmptyInterval -> Bool
    (EmptyInterval -> EmptyInterval -> Bool)
    -> (EmptyInterval -> EmptyInterval -> Bool) -> Eq EmptyInterval
    forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
    $c== :: EmptyInterval -> EmptyInterval -> Bool
    == :: EmptyInterval -> EmptyInterval -> Bool
    $c/= :: EmptyInterval -> EmptyInterval -> Bool
    /= :: EmptyInterval -> EmptyInterval -> Bool
    Eq,Eq EmptyInterval
    Eq EmptyInterval =>
    (EmptyInterval -> EmptyInterval -> Ordering)
    -> (EmptyInterval -> EmptyInterval -> Bool)
    -> (EmptyInterval -> EmptyInterval -> Bool)
    -> (EmptyInterval -> EmptyInterval -> Bool)
    -> (EmptyInterval -> EmptyInterval -> Bool)
    -> (EmptyInterval -> EmptyInterval -> EmptyInterval)
    -> (EmptyInterval -> EmptyInterval -> EmptyInterval)
    -> Ord EmptyInterval
    EmptyInterval -> EmptyInterval -> Bool
    EmptyInterval -> EmptyInterval -> Ordering
    EmptyInterval -> EmptyInterval -> EmptyInterval
    forall a.
    Eq a =>
    (a -> a -> Ordering)
    -> (a -> a -> Bool)
    -> (a -> a -> Bool)
    -> (a -> a -> Bool)
    -> (a -> a -> Bool)
    -> (a -> a -> a)
    -> (a -> a -> a)
    -> Ord a
    $ccompare :: EmptyInterval -> EmptyInterval -> Ordering
    compare :: EmptyInterval -> EmptyInterval -> Ordering
    $c< :: EmptyInterval -> EmptyInterval -> Bool
    < :: EmptyInterval -> EmptyInterval -> Bool
    $c<= :: EmptyInterval -> EmptyInterval -> Bool
    <= :: EmptyInterval -> EmptyInterval -> Bool
    $c> :: EmptyInterval -> EmptyInterval -> Bool
    > :: EmptyInterval -> EmptyInterval -> Bool
    $c>= :: EmptyInterval -> EmptyInterval -> Bool
    >= :: EmptyInterval -> EmptyInterval -> Bool
    $cmax :: EmptyInterval -> EmptyInterval -> EmptyInterval
    max :: EmptyInterval -> EmptyInterval -> EmptyInterval
    $cmin :: EmptyInterval -> EmptyInterval -> EmptyInterval
    min :: EmptyInterval -> EmptyInterval -> EmptyInterval
    Ord,Typeable EmptyInterval
    Typeable EmptyInterval =>
    (forall (c :: * -> *).
     (forall d b. Data d => c (d -> b) -> d -> c b)
     -> (forall g. g -> c g) -> EmptyInterval -> c EmptyInterval)
    -> (forall (c :: * -> *).
        (forall b r. Data b => c (b -> r) -> c r)
        -> (forall r. r -> c r) -> Constr -> c EmptyInterval)
    -> (EmptyInterval -> Constr)
    -> (EmptyInterval -> DataType)
    -> (forall (t :: * -> *) (c :: * -> *).
        Typeable t =>
        (forall d. Data d => c (t d)) -> Maybe (c EmptyInterval))
    -> (forall (t :: * -> * -> *) (c :: * -> *).
        Typeable t =>
        (forall d e. (Data d, Data e) => c (t d e))
        -> Maybe (c EmptyInterval))
    -> ((forall b. Data b => b -> b) -> EmptyInterval -> EmptyInterval)
    -> (forall r r'.
        (r -> r' -> r)
        -> r -> (forall d. Data d => d -> r') -> EmptyInterval -> r)
    -> (forall r r'.
        (r' -> r -> r)
        -> r -> (forall d. Data d => d -> r') -> EmptyInterval -> r)
    -> (forall u. (forall d. Data d => d -> u) -> EmptyInterval -> [u])
    -> (forall u.
        Int -> (forall d. Data d => d -> u) -> EmptyInterval -> u)
    -> (forall (m :: * -> *).
        Monad m =>
        (forall d. Data d => d -> m d) -> EmptyInterval -> m EmptyInterval)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> EmptyInterval -> m EmptyInterval)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> EmptyInterval -> m EmptyInterval)
    -> Data EmptyInterval
    EmptyInterval -> Constr
    EmptyInterval -> DataType
    (forall b. Data b => b -> b) -> EmptyInterval -> EmptyInterval
    forall a.
    Typeable a =>
    (forall (c :: * -> *).
     (forall d b. Data d => c (d -> b) -> d -> c b)
     -> (forall g. g -> c g) -> a -> c a)
    -> (forall (c :: * -> *).
        (forall b r. Data b => c (b -> r) -> c r)
        -> (forall r. r -> c r) -> Constr -> c a)
    -> (a -> Constr)
    -> (a -> DataType)
    -> (forall (t :: * -> *) (c :: * -> *).
        Typeable t =>
        (forall d. Data d => c (t d)) -> Maybe (c a))
    -> (forall (t :: * -> * -> *) (c :: * -> *).
        Typeable t =>
        (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
    -> ((forall b. Data b => b -> b) -> a -> a)
    -> (forall r r'.
        (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
    -> (forall r r'.
        (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
    -> (forall u. (forall d. Data d => d -> u) -> a -> [u])
    -> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
    -> (forall (m :: * -> *).
        Monad m =>
        (forall d. Data d => d -> m d) -> a -> m a)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> a -> m a)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> a -> m a)
    -> Data a
    forall u. Int -> (forall d. Data d => d -> u) -> EmptyInterval -> u
    forall u. (forall d. Data d => d -> u) -> EmptyInterval -> [u]
    forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> EmptyInterval -> r
    forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> EmptyInterval -> r
    forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> EmptyInterval -> m EmptyInterval
    forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> EmptyInterval -> m EmptyInterval
    forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c EmptyInterval
    forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> EmptyInterval -> c EmptyInterval
    forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c EmptyInterval)
    forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e))
    -> Maybe (c EmptyInterval)
    $cgfoldl :: forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> EmptyInterval -> c EmptyInterval
    gfoldl :: forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> EmptyInterval -> c EmptyInterval
    $cgunfold :: forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c EmptyInterval
    gunfold :: forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c EmptyInterval
    $ctoConstr :: EmptyInterval -> Constr
    toConstr :: EmptyInterval -> Constr
    $cdataTypeOf :: EmptyInterval -> DataType
    dataTypeOf :: EmptyInterval -> DataType
    $cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c EmptyInterval)
    dataCast1 :: forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c EmptyInterval)
    $cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e))
    -> Maybe (c EmptyInterval)
    dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e))
    -> Maybe (c EmptyInterval)
    $cgmapT :: (forall b. Data b => b -> b) -> EmptyInterval -> EmptyInterval
    gmapT :: (forall b. Data b => b -> b) -> EmptyInterval -> EmptyInterval
    $cgmapQl :: forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> EmptyInterval -> r
    gmapQl :: forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> EmptyInterval -> r
    $cgmapQr :: forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> EmptyInterval -> r
    gmapQr :: forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> EmptyInterval -> r
    $cgmapQ :: forall u. (forall d. Data d => d -> u) -> EmptyInterval -> [u]
    gmapQ :: forall u. (forall d. Data d => d -> u) -> EmptyInterval -> [u]
    $cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> EmptyInterval -> u
    gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> EmptyInterval -> u
    $cgmapM :: forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> EmptyInterval -> m EmptyInterval
    gmapM :: forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> EmptyInterval -> m EmptyInterval
    $cgmapMp :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> EmptyInterval -> m EmptyInterval
    gmapMp :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> EmptyInterval -> m EmptyInterval
    $cgmapMo :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> EmptyInterval -> m EmptyInterval
    gmapMo :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> EmptyInterval -> m EmptyInterval
    Data)

    instance Show EmptyInterval where
      show :: EmptyInterval -> String
    show EmptyInterval
    EmptyInterval = String
    "empty interval"

    instance Exception EmptyInterval

    data AmbiguousComparison = AmbiguousComparison
      deriving (AmbiguousComparison -> AmbiguousComparison -> Bool
    (AmbiguousComparison -> AmbiguousComparison -> Bool)
    -> (AmbiguousComparison -> AmbiguousComparison -> Bool)
    -> Eq AmbiguousComparison
    forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
    $c== :: AmbiguousComparison -> AmbiguousComparison -> Bool
    == :: AmbiguousComparison -> AmbiguousComparison -> Bool
    $c/= :: AmbiguousComparison -> AmbiguousComparison -> Bool
    /= :: AmbiguousComparison -> AmbiguousComparison -> Bool
    Eq,Eq AmbiguousComparison
    Eq AmbiguousComparison =>
    (AmbiguousComparison -> AmbiguousComparison -> Ordering)
    -> (AmbiguousComparison -> AmbiguousComparison -> Bool)
    -> (AmbiguousComparison -> AmbiguousComparison -> Bool)
    -> (AmbiguousComparison -> AmbiguousComparison -> Bool)
    -> (AmbiguousComparison -> AmbiguousComparison -> Bool)
    -> (AmbiguousComparison
        -> AmbiguousComparison -> AmbiguousComparison)
    -> (AmbiguousComparison
        -> AmbiguousComparison -> AmbiguousComparison)
    -> Ord AmbiguousComparison
    AmbiguousComparison -> AmbiguousComparison -> Bool
    AmbiguousComparison -> AmbiguousComparison -> Ordering
    AmbiguousComparison -> AmbiguousComparison -> AmbiguousComparison
    forall a.
    Eq a =>
    (a -> a -> Ordering)
    -> (a -> a -> Bool)
    -> (a -> a -> Bool)
    -> (a -> a -> Bool)
    -> (a -> a -> Bool)
    -> (a -> a -> a)
    -> (a -> a -> a)
    -> Ord a
    $ccompare :: AmbiguousComparison -> AmbiguousComparison -> Ordering
    compare :: AmbiguousComparison -> AmbiguousComparison -> Ordering
    $c< :: AmbiguousComparison -> AmbiguousComparison -> Bool
    < :: AmbiguousComparison -> AmbiguousComparison -> Bool
    $c<= :: AmbiguousComparison -> AmbiguousComparison -> Bool
    <= :: AmbiguousComparison -> AmbiguousComparison -> Bool
    $c> :: AmbiguousComparison -> AmbiguousComparison -> Bool
    > :: AmbiguousComparison -> AmbiguousComparison -> Bool
    $c>= :: AmbiguousComparison -> AmbiguousComparison -> Bool
    >= :: AmbiguousComparison -> AmbiguousComparison -> Bool
    $cmax :: AmbiguousComparison -> AmbiguousComparison -> AmbiguousComparison
    max :: AmbiguousComparison -> AmbiguousComparison -> AmbiguousComparison
    $cmin :: AmbiguousComparison -> AmbiguousComparison -> AmbiguousComparison
    min :: AmbiguousComparison -> AmbiguousComparison -> AmbiguousComparison
    Ord,Typeable AmbiguousComparison
    Typeable AmbiguousComparison =>
    (forall (c :: * -> *).
     (forall d b. Data d => c (d -> b) -> d -> c b)
     -> (forall g. g -> c g)
     -> AmbiguousComparison
     -> c AmbiguousComparison)
    -> (forall (c :: * -> *).
        (forall b r. Data b => c (b -> r) -> c r)
        -> (forall r. r -> c r) -> Constr -> c AmbiguousComparison)
    -> (AmbiguousComparison -> Constr)
    -> (AmbiguousComparison -> DataType)
    -> (forall (t :: * -> *) (c :: * -> *).
        Typeable t =>
        (forall d. Data d => c (t d)) -> Maybe (c AmbiguousComparison))
    -> (forall (t :: * -> * -> *) (c :: * -> *).
        Typeable t =>
        (forall d e. (Data d, Data e) => c (t d e))
        -> Maybe (c AmbiguousComparison))
    -> ((forall b. Data b => b -> b)
        -> AmbiguousComparison -> AmbiguousComparison)
    -> (forall r r'.
        (r -> r' -> r)
        -> r -> (forall d. Data d => d -> r') -> AmbiguousComparison -> r)
    -> (forall r r'.
        (r' -> r -> r)
        -> r -> (forall d. Data d => d -> r') -> AmbiguousComparison -> r)
    -> (forall u.
        (forall d. Data d => d -> u) -> AmbiguousComparison -> [u])
    -> (forall u.
        Int -> (forall d. Data d => d -> u) -> AmbiguousComparison -> u)
    -> (forall (m :: * -> *).
        Monad m =>
        (forall d. Data d => d -> m d)
        -> AmbiguousComparison -> m AmbiguousComparison)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d)
        -> AmbiguousComparison -> m AmbiguousComparison)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d)
        -> AmbiguousComparison -> m AmbiguousComparison)
    -> Data AmbiguousComparison
    AmbiguousComparison -> Constr
    AmbiguousComparison -> DataType
    (forall b. Data b => b -> b)
    -> AmbiguousComparison -> AmbiguousComparison
    forall a.
    Typeable a =>
    (forall (c :: * -> *).
     (forall d b. Data d => c (d -> b) -> d -> c b)
     -> (forall g. g -> c g) -> a -> c a)
    -> (forall (c :: * -> *).
        (forall b r. Data b => c (b -> r) -> c r)
        -> (forall r. r -> c r) -> Constr -> c a)
    -> (a -> Constr)
    -> (a -> DataType)
    -> (forall (t :: * -> *) (c :: * -> *).
        Typeable t =>
        (forall d. Data d => c (t d)) -> Maybe (c a))
    -> (forall (t :: * -> * -> *) (c :: * -> *).
        Typeable t =>
        (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
    -> ((forall b. Data b => b -> b) -> a -> a)
    -> (forall r r'.
        (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
    -> (forall r r'.
        (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
    -> (forall u. (forall d. Data d => d -> u) -> a -> [u])
    -> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
    -> (forall (m :: * -> *).
        Monad m =>
        (forall d. Data d => d -> m d) -> a -> m a)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> a -> m a)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> a -> m a)
    -> Data a
    forall u.
    Int -> (forall d. Data d => d -> u) -> AmbiguousComparison -> u
    forall u.
    (forall d. Data d => d -> u) -> AmbiguousComparison -> [u]
    forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> AmbiguousComparison -> r
    forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> AmbiguousComparison -> r
    forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d)
    -> AmbiguousComparison -> m AmbiguousComparison
    forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d)
    -> AmbiguousComparison -> m AmbiguousComparison
    forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c AmbiguousComparison
    forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g)
    -> AmbiguousComparison
    -> c AmbiguousComparison
    forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c AmbiguousComparison)
    forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e))
    -> Maybe (c AmbiguousComparison)
    $cgfoldl :: forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g)
    -> AmbiguousComparison
    -> c AmbiguousComparison
    gfoldl :: forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g)
    -> AmbiguousComparison
    -> c AmbiguousComparison
    $cgunfold :: forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c AmbiguousComparison
    gunfold :: forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c AmbiguousComparison
    $ctoConstr :: AmbiguousComparison -> Constr
    toConstr :: AmbiguousComparison -> Constr
    $cdataTypeOf :: AmbiguousComparison -> DataType
    dataTypeOf :: AmbiguousComparison -> DataType
    $cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c AmbiguousComparison)
    dataCast1 :: forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c AmbiguousComparison)
    $cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e))
    -> Maybe (c AmbiguousComparison)
    dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e))
    -> Maybe (c AmbiguousComparison)
    $cgmapT :: (forall b. Data b => b -> b)
    -> AmbiguousComparison -> AmbiguousComparison
    gmapT :: (forall b. Data b => b -> b)
    -> AmbiguousComparison -> AmbiguousComparison
    $cgmapQl :: forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> AmbiguousComparison -> r
    gmapQl :: forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> AmbiguousComparison -> r
    $cgmapQr :: forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> AmbiguousComparison -> r
    gmapQr :: forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> AmbiguousComparison -> r
    $cgmapQ :: forall u.
    (forall d. Data d => d -> u) -> AmbiguousComparison -> [u]
    gmapQ :: forall u.
    (forall d. Data d => d -> u) -> AmbiguousComparison -> [u]
    $cgmapQi :: forall u.
    Int -> (forall d. Data d => d -> u) -> AmbiguousComparison -> u
    gmapQi :: forall u.
    Int -> (forall d. Data d => d -> u) -> AmbiguousComparison -> u
    $cgmapM :: forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d)
    -> AmbiguousComparison -> m AmbiguousComparison
    gmapM :: forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d)
    -> AmbiguousComparison -> m AmbiguousComparison
    $cgmapMp :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d)
    -> AmbiguousComparison -> m AmbiguousComparison
    gmapMp :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d)
    -> AmbiguousComparison -> m AmbiguousComparison
    $cgmapMo :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d)
    -> AmbiguousComparison -> m AmbiguousComparison
    gmapMo :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d)
    -> AmbiguousComparison -> m AmbiguousComparison
    Data)

    instance Show AmbiguousComparison where
      show :: AmbiguousComparison -> String
    show AmbiguousComparison
    AmbiguousComparison = String
    "ambiguous comparison"

    instance Exception AmbiguousComparison