--------------------------------------------------------------------------------
-- |
-- Module      :  HGeometry.LineSegment.PossiblyDegenerate
-- Copyright   :  (C) Frank Staals
-- License     :  see the LICENSE file
-- Maintainer  :  Frank Staals
--
-- A Type representing degenerate linesegments
--
--------------------------------------------------------------------------------
module HGeometry.LineSegment.PossiblyDegenerate
  ( PossiblyDegenerateSegment(..)
  ) where

-- import HGeometry.LineSegment.Internal
-- import HGeometry.LineSegment.Class
-- import HGeometry.Point

--------------------------------------------------------------------------------

-- | A line segment that may degenerate into a single point of type 'vertex'
data PossiblyDegenerateSegment point segment = SinglePoint point
                                             | ActualSegment segment
  deriving stock (Int -> PossiblyDegenerateSegment point segment -> ShowS
[PossiblyDegenerateSegment point segment] -> ShowS
PossiblyDegenerateSegment point segment -> String
(Int -> PossiblyDegenerateSegment point segment -> ShowS)
-> (PossiblyDegenerateSegment point segment -> String)
-> ([PossiblyDegenerateSegment point segment] -> ShowS)
-> Show (PossiblyDegenerateSegment point segment)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall point segment.
(Show point, Show segment) =>
Int -> PossiblyDegenerateSegment point segment -> ShowS
forall point segment.
(Show point, Show segment) =>
[PossiblyDegenerateSegment point segment] -> ShowS
forall point segment.
(Show point, Show segment) =>
PossiblyDegenerateSegment point segment -> String
$cshowsPrec :: forall point segment.
(Show point, Show segment) =>
Int -> PossiblyDegenerateSegment point segment -> ShowS
showsPrec :: Int -> PossiblyDegenerateSegment point segment -> ShowS
$cshow :: forall point segment.
(Show point, Show segment) =>
PossiblyDegenerateSegment point segment -> String
show :: PossiblyDegenerateSegment point segment -> String
$cshowList :: forall point segment.
(Show point, Show segment) =>
[PossiblyDegenerateSegment point segment] -> ShowS
showList :: [PossiblyDegenerateSegment point segment] -> ShowS
Show,PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
(PossiblyDegenerateSegment point segment
 -> PossiblyDegenerateSegment point segment -> Bool)
-> (PossiblyDegenerateSegment point segment
    -> PossiblyDegenerateSegment point segment -> Bool)
-> Eq (PossiblyDegenerateSegment point segment)
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
forall point segment.
(Eq point, Eq segment) =>
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
$c== :: forall point segment.
(Eq point, Eq segment) =>
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
== :: PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
$c/= :: forall point segment.
(Eq point, Eq segment) =>
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
/= :: PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
Eq,Eq (PossiblyDegenerateSegment point segment)
Eq (PossiblyDegenerateSegment point segment) =>
(PossiblyDegenerateSegment point segment
 -> PossiblyDegenerateSegment point segment -> Ordering)
-> (PossiblyDegenerateSegment point segment
    -> PossiblyDegenerateSegment point segment -> Bool)
-> (PossiblyDegenerateSegment point segment
    -> PossiblyDegenerateSegment point segment -> Bool)
-> (PossiblyDegenerateSegment point segment
    -> PossiblyDegenerateSegment point segment -> Bool)
-> (PossiblyDegenerateSegment point segment
    -> PossiblyDegenerateSegment point segment -> Bool)
-> (PossiblyDegenerateSegment point segment
    -> PossiblyDegenerateSegment point segment
    -> PossiblyDegenerateSegment point segment)
-> (PossiblyDegenerateSegment point segment
    -> PossiblyDegenerateSegment point segment
    -> PossiblyDegenerateSegment point segment)
-> Ord (PossiblyDegenerateSegment point segment)
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Ordering
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment
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
forall point segment.
(Ord point, Ord segment) =>
Eq (PossiblyDegenerateSegment point segment)
forall point segment.
(Ord point, Ord segment) =>
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
forall point segment.
(Ord point, Ord segment) =>
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Ordering
forall point segment.
(Ord point, Ord segment) =>
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment
$ccompare :: forall point segment.
(Ord point, Ord segment) =>
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Ordering
compare :: PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Ordering
$c< :: forall point segment.
(Ord point, Ord segment) =>
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
< :: PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
$c<= :: forall point segment.
(Ord point, Ord segment) =>
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
<= :: PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
$c> :: forall point segment.
(Ord point, Ord segment) =>
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
> :: PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
$c>= :: forall point segment.
(Ord point, Ord segment) =>
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
>= :: PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment -> Bool
$cmax :: forall point segment.
(Ord point, Ord segment) =>
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment
max :: PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment
$cmin :: forall point segment.
(Ord point, Ord segment) =>
PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment
min :: PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment
-> PossiblyDegenerateSegment point segment
Ord,(forall a b.
 (a -> b)
 -> PossiblyDegenerateSegment point a
 -> PossiblyDegenerateSegment point b)
-> (forall a b.
    a
    -> PossiblyDegenerateSegment point b
    -> PossiblyDegenerateSegment point a)
-> Functor (PossiblyDegenerateSegment point)
forall a b.
a
-> PossiblyDegenerateSegment point b
-> PossiblyDegenerateSegment point a
forall a b.
(a -> b)
-> PossiblyDegenerateSegment point a
-> PossiblyDegenerateSegment point b
forall point a b.
a
-> PossiblyDegenerateSegment point b
-> PossiblyDegenerateSegment point a
forall point a b.
(a -> b)
-> PossiblyDegenerateSegment point a
-> PossiblyDegenerateSegment point b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
$cfmap :: forall point a b.
(a -> b)
-> PossiblyDegenerateSegment point a
-> PossiblyDegenerateSegment point b
fmap :: forall a b.
(a -> b)
-> PossiblyDegenerateSegment point a
-> PossiblyDegenerateSegment point b
$c<$ :: forall point a b.
a
-> PossiblyDegenerateSegment point b
-> PossiblyDegenerateSegment point a
<$ :: forall a b.
a
-> PossiblyDegenerateSegment point b
-> PossiblyDegenerateSegment point a
Functor,(forall m. Monoid m => PossiblyDegenerateSegment point m -> m)
-> (forall m a.
    Monoid m =>
    (a -> m) -> PossiblyDegenerateSegment point a -> m)
-> (forall m a.
    Monoid m =>
    (a -> m) -> PossiblyDegenerateSegment point a -> m)
-> (forall a b.
    (a -> b -> b) -> b -> PossiblyDegenerateSegment point a -> b)
-> (forall a b.
    (a -> b -> b) -> b -> PossiblyDegenerateSegment point a -> b)
-> (forall b a.
    (b -> a -> b) -> b -> PossiblyDegenerateSegment point a -> b)
-> (forall b a.
    (b -> a -> b) -> b -> PossiblyDegenerateSegment point a -> b)
-> (forall a.
    (a -> a -> a) -> PossiblyDegenerateSegment point a -> a)
-> (forall a.
    (a -> a -> a) -> PossiblyDegenerateSegment point a -> a)
-> (forall a. PossiblyDegenerateSegment point a -> [a])
-> (forall a. PossiblyDegenerateSegment point a -> Bool)
-> (forall a. PossiblyDegenerateSegment point a -> Int)
-> (forall a.
    Eq a =>
    a -> PossiblyDegenerateSegment point a -> Bool)
-> (forall a. Ord a => PossiblyDegenerateSegment point a -> a)
-> (forall a. Ord a => PossiblyDegenerateSegment point a -> a)
-> (forall a. Num a => PossiblyDegenerateSegment point a -> a)
-> (forall a. Num a => PossiblyDegenerateSegment point a -> a)
-> Foldable (PossiblyDegenerateSegment point)
forall a. Eq a => a -> PossiblyDegenerateSegment point a -> Bool
forall a. Num a => PossiblyDegenerateSegment point a -> a
forall a. Ord a => PossiblyDegenerateSegment point a -> a
forall m. Monoid m => PossiblyDegenerateSegment point m -> m
forall a. PossiblyDegenerateSegment point a -> Bool
forall a. PossiblyDegenerateSegment point a -> Int
forall a. PossiblyDegenerateSegment point a -> [a]
forall a. (a -> a -> a) -> PossiblyDegenerateSegment point a -> a
forall point a.
Eq a =>
a -> PossiblyDegenerateSegment point a -> Bool
forall point a. Num a => PossiblyDegenerateSegment point a -> a
forall point a. Ord a => PossiblyDegenerateSegment point a -> a
forall m a.
Monoid m =>
(a -> m) -> PossiblyDegenerateSegment point a -> m
forall point m. Monoid m => PossiblyDegenerateSegment point m -> m
forall m a.
Monoid m =>
(a -> m) -> PossiblyDegenerateSegment point a -> m
forall point a. PossiblyDegenerateSegment point a -> Bool
forall point a. PossiblyDegenerateSegment point a -> Int
forall point a. PossiblyDegenerateSegment point a -> [a]
forall b a.
(b -> a -> b) -> b -> PossiblyDegenerateSegment point a -> b
forall a b.
(a -> b -> b) -> b -> PossiblyDegenerateSegment point a -> b
forall point a.
(a -> a -> a) -> PossiblyDegenerateSegment point a -> a
forall point m a.
Monoid m =>
(a -> m) -> PossiblyDegenerateSegment point a -> m
forall point b a.
(b -> a -> b) -> b -> PossiblyDegenerateSegment point a -> b
forall point a b.
(a -> b -> b) -> b -> PossiblyDegenerateSegment point 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 point m. Monoid m => PossiblyDegenerateSegment point m -> m
fold :: forall m. Monoid m => PossiblyDegenerateSegment point m -> m
$cfoldMap :: forall point m a.
Monoid m =>
(a -> m) -> PossiblyDegenerateSegment point a -> m
foldMap :: forall m a.
Monoid m =>
(a -> m) -> PossiblyDegenerateSegment point a -> m
$cfoldMap' :: forall point m a.
Monoid m =>
(a -> m) -> PossiblyDegenerateSegment point a -> m
foldMap' :: forall m a.
Monoid m =>
(a -> m) -> PossiblyDegenerateSegment point a -> m
$cfoldr :: forall point a b.
(a -> b -> b) -> b -> PossiblyDegenerateSegment point a -> b
foldr :: forall a b.
(a -> b -> b) -> b -> PossiblyDegenerateSegment point a -> b
$cfoldr' :: forall point a b.
(a -> b -> b) -> b -> PossiblyDegenerateSegment point a -> b
foldr' :: forall a b.
(a -> b -> b) -> b -> PossiblyDegenerateSegment point a -> b
$cfoldl :: forall point b a.
(b -> a -> b) -> b -> PossiblyDegenerateSegment point a -> b
foldl :: forall b a.
(b -> a -> b) -> b -> PossiblyDegenerateSegment point a -> b
$cfoldl' :: forall point b a.
(b -> a -> b) -> b -> PossiblyDegenerateSegment point a -> b
foldl' :: forall b a.
(b -> a -> b) -> b -> PossiblyDegenerateSegment point a -> b
$cfoldr1 :: forall point a.
(a -> a -> a) -> PossiblyDegenerateSegment point a -> a
foldr1 :: forall a. (a -> a -> a) -> PossiblyDegenerateSegment point a -> a
$cfoldl1 :: forall point a.
(a -> a -> a) -> PossiblyDegenerateSegment point a -> a
foldl1 :: forall a. (a -> a -> a) -> PossiblyDegenerateSegment point a -> a
$ctoList :: forall point a. PossiblyDegenerateSegment point a -> [a]
toList :: forall a. PossiblyDegenerateSegment point a -> [a]
$cnull :: forall point a. PossiblyDegenerateSegment point a -> Bool
null :: forall a. PossiblyDegenerateSegment point a -> Bool
$clength :: forall point a. PossiblyDegenerateSegment point a -> Int
length :: forall a. PossiblyDegenerateSegment point a -> Int
$celem :: forall point a.
Eq a =>
a -> PossiblyDegenerateSegment point a -> Bool
elem :: forall a. Eq a => a -> PossiblyDegenerateSegment point a -> Bool
$cmaximum :: forall point a. Ord a => PossiblyDegenerateSegment point a -> a
maximum :: forall a. Ord a => PossiblyDegenerateSegment point a -> a
$cminimum :: forall point a. Ord a => PossiblyDegenerateSegment point a -> a
minimum :: forall a. Ord a => PossiblyDegenerateSegment point a -> a
$csum :: forall point a. Num a => PossiblyDegenerateSegment point a -> a
sum :: forall a. Num a => PossiblyDegenerateSegment point a -> a
$cproduct :: forall point a. Num a => PossiblyDegenerateSegment point a -> a
product :: forall a. Num a => PossiblyDegenerateSegment point a -> a
Foldable,Functor (PossiblyDegenerateSegment point)
Foldable (PossiblyDegenerateSegment point)
(Functor (PossiblyDegenerateSegment point),
 Foldable (PossiblyDegenerateSegment point)) =>
(forall (f :: * -> *) a b.
 Applicative f =>
 (a -> f b)
 -> PossiblyDegenerateSegment point a
 -> f (PossiblyDegenerateSegment point b))
-> (forall (f :: * -> *) a.
    Applicative f =>
    PossiblyDegenerateSegment point (f a)
    -> f (PossiblyDegenerateSegment point a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b)
    -> PossiblyDegenerateSegment point a
    -> m (PossiblyDegenerateSegment point b))
-> (forall (m :: * -> *) a.
    Monad m =>
    PossiblyDegenerateSegment point (m a)
    -> m (PossiblyDegenerateSegment point a))
-> Traversable (PossiblyDegenerateSegment point)
forall point. Functor (PossiblyDegenerateSegment point)
forall point. Foldable (PossiblyDegenerateSegment point)
forall point (m :: * -> *) a.
Monad m =>
PossiblyDegenerateSegment point (m a)
-> m (PossiblyDegenerateSegment point a)
forall point (f :: * -> *) a.
Applicative f =>
PossiblyDegenerateSegment point (f a)
-> f (PossiblyDegenerateSegment point a)
forall point (m :: * -> *) a b.
Monad m =>
(a -> m b)
-> PossiblyDegenerateSegment point a
-> m (PossiblyDegenerateSegment point b)
forall point (f :: * -> *) a b.
Applicative f =>
(a -> f b)
-> PossiblyDegenerateSegment point a
-> f (PossiblyDegenerateSegment point 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 =>
PossiblyDegenerateSegment point (m a)
-> m (PossiblyDegenerateSegment point a)
forall (f :: * -> *) a.
Applicative f =>
PossiblyDegenerateSegment point (f a)
-> f (PossiblyDegenerateSegment point a)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b)
-> PossiblyDegenerateSegment point a
-> m (PossiblyDegenerateSegment point b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b)
-> PossiblyDegenerateSegment point a
-> f (PossiblyDegenerateSegment point b)
$ctraverse :: forall point (f :: * -> *) a b.
Applicative f =>
(a -> f b)
-> PossiblyDegenerateSegment point a
-> f (PossiblyDegenerateSegment point b)
traverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b)
-> PossiblyDegenerateSegment point a
-> f (PossiblyDegenerateSegment point b)
$csequenceA :: forall point (f :: * -> *) a.
Applicative f =>
PossiblyDegenerateSegment point (f a)
-> f (PossiblyDegenerateSegment point a)
sequenceA :: forall (f :: * -> *) a.
Applicative f =>
PossiblyDegenerateSegment point (f a)
-> f (PossiblyDegenerateSegment point a)
$cmapM :: forall point (m :: * -> *) a b.
Monad m =>
(a -> m b)
-> PossiblyDegenerateSegment point a
-> m (PossiblyDegenerateSegment point b)
mapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b)
-> PossiblyDegenerateSegment point a
-> m (PossiblyDegenerateSegment point b)
$csequence :: forall point (m :: * -> *) a.
Monad m =>
PossiblyDegenerateSegment point (m a)
-> m (PossiblyDegenerateSegment point a)
sequence :: forall (m :: * -> *) a.
Monad m =>
PossiblyDegenerateSegment point (m a)
-> m (PossiblyDegenerateSegment point a)
Traversable)