keid-geometry-0.1.1.2: Geometry primitives for Keid engine.
Safe HaskellSafe-Inferred
LanguageHaskell2010

Geometry.Edge

Documentation

data Edge a Source #

Constructors

Edge 

Fields

Instances

Instances details
Foldable Edge Source # 
Instance details

Defined in Geometry.Edge

Methods

fold :: Monoid m => Edge m -> m #

foldMap :: Monoid m => (a -> m) -> Edge a -> m #

foldMap' :: Monoid m => (a -> m) -> Edge a -> m #

foldr :: (a -> b -> b) -> b -> Edge a -> b #

foldr' :: (a -> b -> b) -> b -> Edge a -> b #

foldl :: (b -> a -> b) -> b -> Edge a -> b #

foldl' :: (b -> a -> b) -> b -> Edge a -> b #

foldr1 :: (a -> a -> a) -> Edge a -> a #

foldl1 :: (a -> a -> a) -> Edge a -> a #

toList :: Edge a -> [a] #

null :: Edge a -> Bool #

length :: Edge a -> Int #

elem :: Eq a => a -> Edge a -> Bool #

maximum :: Ord a => Edge a -> a #

minimum :: Ord a => Edge a -> a #

sum :: Num a => Edge a -> a #

product :: Num a => Edge a -> a #

Traversable Edge Source # 
Instance details

Defined in Geometry.Edge

Methods

traverse :: Applicative f => (a -> f b) -> Edge a -> f (Edge b) #

sequenceA :: Applicative f => Edge (f a) -> f (Edge a) #

mapM :: Monad m => (a -> m b) -> Edge a -> m (Edge b) #

sequence :: Monad m => Edge (m a) -> m (Edge a) #

Functor Edge Source # 
Instance details

Defined in Geometry.Edge

Methods

fmap :: (a -> b) -> Edge a -> Edge b #

(<$) :: a -> Edge b -> Edge a #

Show a => Show (Edge a) Source # 
Instance details

Defined in Geometry.Edge

Methods

showsPrec :: Int -> Edge a -> ShowS #

show :: Edge a -> String #

showList :: [Edge a] -> ShowS #

Eq a => Eq (Edge a) Source # 
Instance details

Defined in Geometry.Edge

Methods

(==) :: Edge a -> Edge a -> Bool #

(/=) :: Edge a -> Edge a -> Bool #

Ord a => Ord (Edge a) Source # 
Instance details

Defined in Geometry.Edge

Methods

compare :: Edge a -> Edge a -> Ordering #

(<) :: Edge a -> Edge a -> Bool #

(<=) :: Edge a -> Edge a -> Bool #

(>) :: Edge a -> Edge a -> Bool #

(>=) :: Edge a -> Edge a -> Bool #

max :: Edge a -> Edge a -> Edge a #

min :: Edge a -> Edge a -> Edge a #

edgesR :: [a] -> Maybe [Edge a] Source #