module Geometry.Edge where import RIO data Edge a = Edge { forall a. Edge a -> a edgeFrom :: a , forall a. Edge a -> a edgeTo :: a } deriving (Edge a -> Edge a -> Bool forall a. Eq a => Edge a -> Edge a -> Bool forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a /= :: Edge a -> Edge a -> Bool $c/= :: forall a. Eq a => Edge a -> Edge a -> Bool == :: Edge a -> Edge a -> Bool $c== :: forall a. Eq a => Edge a -> Edge a -> Bool Eq, Edge a -> Edge a -> Bool Edge a -> Edge a -> Ordering 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 {a}. Ord a => Eq (Edge a) forall a. Ord a => Edge a -> Edge a -> Bool forall a. Ord a => Edge a -> Edge a -> Ordering forall a. Ord a => Edge a -> Edge a -> Edge a min :: Edge a -> Edge a -> Edge a $cmin :: forall a. Ord a => Edge a -> Edge a -> Edge a max :: Edge a -> Edge a -> Edge a $cmax :: forall a. Ord a => Edge a -> Edge a -> Edge a >= :: Edge a -> Edge a -> Bool $c>= :: forall a. Ord a => Edge a -> Edge a -> Bool > :: Edge a -> Edge a -> Bool $c> :: forall a. Ord a => Edge a -> Edge a -> Bool <= :: Edge a -> Edge a -> Bool $c<= :: forall a. Ord a => Edge a -> Edge a -> Bool < :: Edge a -> Edge a -> Bool $c< :: forall a. Ord a => Edge a -> Edge a -> Bool compare :: Edge a -> Edge a -> Ordering $ccompare :: forall a. Ord a => Edge a -> Edge a -> Ordering Ord, Int -> Edge a -> ShowS forall a. Show a => Int -> Edge a -> ShowS forall a. Show a => [Edge a] -> ShowS forall a. Show a => Edge a -> String forall a. (Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a showList :: [Edge a] -> ShowS $cshowList :: forall a. Show a => [Edge a] -> ShowS show :: Edge a -> String $cshow :: forall a. Show a => Edge a -> String showsPrec :: Int -> Edge a -> ShowS $cshowsPrec :: forall a. Show a => Int -> Edge a -> ShowS Show, forall a b. a -> Edge b -> Edge a forall a b. (a -> b) -> Edge a -> Edge b forall (f :: * -> *). (forall a b. (a -> b) -> f a -> f b) -> (forall a b. a -> f b -> f a) -> Functor f <$ :: forall a b. a -> Edge b -> Edge a $c<$ :: forall a b. a -> Edge b -> Edge a fmap :: forall a b. (a -> b) -> Edge a -> Edge b $cfmap :: forall a b. (a -> b) -> Edge a -> Edge b Functor, forall a. Eq a => a -> Edge a -> Bool forall a. Num a => Edge a -> a forall a. Ord a => Edge a -> a forall m. Monoid m => Edge m -> m forall a. Edge a -> Bool forall a. Edge a -> Int forall a. Edge a -> [a] forall a. (a -> a -> a) -> Edge a -> a forall m a. Monoid m => (a -> m) -> Edge a -> m forall b a. (b -> a -> b) -> b -> Edge a -> b forall a b. (a -> b -> b) -> b -> Edge 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 product :: forall a. Num a => Edge a -> a $cproduct :: forall a. Num a => Edge a -> a sum :: forall a. Num a => Edge a -> a $csum :: forall a. Num a => Edge a -> a minimum :: forall a. Ord a => Edge a -> a $cminimum :: forall a. Ord a => Edge a -> a maximum :: forall a. Ord a => Edge a -> a $cmaximum :: forall a. Ord a => Edge a -> a elem :: forall a. Eq a => a -> Edge a -> Bool $celem :: forall a. Eq a => a -> Edge a -> Bool length :: forall a. Edge a -> Int $clength :: forall a. Edge a -> Int null :: forall a. Edge a -> Bool $cnull :: forall a. Edge a -> Bool toList :: forall a. Edge a -> [a] $ctoList :: forall a. Edge a -> [a] foldl1 :: forall a. (a -> a -> a) -> Edge a -> a $cfoldl1 :: forall a. (a -> a -> a) -> Edge a -> a foldr1 :: forall a. (a -> a -> a) -> Edge a -> a $cfoldr1 :: forall a. (a -> a -> a) -> Edge a -> a foldl' :: forall b a. (b -> a -> b) -> b -> Edge a -> b $cfoldl' :: forall b a. (b -> a -> b) -> b -> Edge a -> b foldl :: forall b a. (b -> a -> b) -> b -> Edge a -> b $cfoldl :: forall b a. (b -> a -> b) -> b -> Edge a -> b foldr' :: forall a b. (a -> b -> b) -> b -> Edge a -> b $cfoldr' :: forall a b. (a -> b -> b) -> b -> Edge a -> b foldr :: forall a b. (a -> b -> b) -> b -> Edge a -> b $cfoldr :: forall a b. (a -> b -> b) -> b -> Edge a -> b foldMap' :: forall m a. Monoid m => (a -> m) -> Edge a -> m $cfoldMap' :: forall m a. Monoid m => (a -> m) -> Edge a -> m foldMap :: forall m a. Monoid m => (a -> m) -> Edge a -> m $cfoldMap :: forall m a. Monoid m => (a -> m) -> Edge a -> m fold :: forall m. Monoid m => Edge m -> m $cfold :: forall m. Monoid m => Edge m -> m Foldable, Functor Edge Foldable Edge 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 => Edge (m a) -> m (Edge a) forall (f :: * -> *) a. Applicative f => Edge (f a) -> f (Edge a) forall (m :: * -> *) a b. Monad m => (a -> m b) -> Edge a -> m (Edge b) forall (f :: * -> *) a b. Applicative f => (a -> f b) -> Edge a -> f (Edge b) sequence :: forall (m :: * -> *) a. Monad m => Edge (m a) -> m (Edge a) $csequence :: forall (m :: * -> *) a. Monad m => Edge (m a) -> m (Edge a) mapM :: forall (m :: * -> *) a b. Monad m => (a -> m b) -> Edge a -> m (Edge b) $cmapM :: forall (m :: * -> *) a b. Monad m => (a -> m b) -> Edge a -> m (Edge b) sequenceA :: forall (f :: * -> *) a. Applicative f => Edge (f a) -> f (Edge a) $csequenceA :: forall (f :: * -> *) a. Applicative f => Edge (f a) -> f (Edge a) traverse :: forall (f :: * -> *) a b. Applicative f => (a -> f b) -> Edge a -> f (Edge b) $ctraverse :: forall (f :: * -> *) a b. Applicative f => (a -> f b) -> Edge a -> f (Edge b) Traversable) {-# INLINEABLE edgesR #-} edgesR :: [a] -> Maybe [Edge a] edgesR :: forall a. [a] -> Maybe [Edge a] edgesR [a] xs = forall {a}. Maybe [Edge a] -> [a] -> Maybe [Edge a] go (forall a. a -> Maybe a Just []) [a] xs where go :: Maybe [Edge a] -> [a] -> Maybe [Edge a] go Maybe [Edge a] acc = \case [] -> Maybe [Edge a] acc [a _one] -> forall a. Maybe a Nothing a edgeFrom : a edgeTo : [a] next -> case Maybe [Edge a] acc of Maybe [Edge a] Nothing -> Maybe [Edge a] -> [a] -> Maybe [Edge a] go (forall a. a -> Maybe a Just [Edge{a edgeTo :: a edgeFrom :: a $sel:edgeTo:Edge :: a $sel:edgeFrom:Edge :: a ..}]) [a] next Just [Edge a] old -> Maybe [Edge a] -> [a] -> Maybe [Edge a] go (forall a. a -> Maybe a Just (Edge{a edgeTo :: a edgeFrom :: a $sel:edgeTo:Edge :: a $sel:edgeFrom:Edge :: a ..} forall a. a -> [a] -> [a] : [Edge a] old)) [a] next