Documentation

Methods

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

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

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

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

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

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

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

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

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

toList :: Triangle a -> [a] #

null :: Triangle a -> Bool #

length :: Triangle a -> Int #

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

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

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

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

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

Methods

fold1 :: Semigroup m => Triangle m -> m #

foldMap1 :: Semigroup m => (a -> m) -> Triangle a -> m #

foldMap1' :: Semigroup m => (a -> m) -> Triangle a -> m #

toNonEmpty :: Triangle a -> NonEmpty a #

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

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

head :: Triangle a -> a #

last :: Triangle a -> a #

foldrMap1 :: (a -> b) -> (a -> b -> b) -> Triangle a -> b #

foldlMap1' :: (a -> b) -> (b -> a -> b) -> Triangle a -> b #

foldlMap1 :: (a -> b) -> (b -> a -> b) -> Triangle a -> b #

foldrMap1' :: (a -> b) -> (a -> b -> b) -> Triangle a -> b #

Methods

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

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

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

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

Methods

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

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

Methods

traverse1 :: Apply f => (a -> f b) -> Triangle a -> f (Triangle b) Source #

sequence1 :: Apply f => Triangle (f b) -> f (Triangle b) Source #

Methods

from :: Triangle point -> Rep (Triangle point) x #

to :: Rep (Triangle point) x -> Triangle point #

Methods

readsPrec :: Int -> ReadS (Triangle point) #

readList :: ReadS [Triangle point] #

readPrec :: ReadPrec (Triangle point) #

readListPrec :: ReadPrec [Triangle point] #

Methods

showsPrec :: Int -> Triangle point -> ShowS #

show :: Triangle point -> String #

showList :: [Triangle point] -> ShowS #

Methods

(==) :: Triangle point -> Triangle point -> Bool #

(/=) :: Triangle point -> Triangle point -> Bool #

Methods

compare :: Triangle point -> Triangle point -> Ordering #

(<) :: Triangle point -> Triangle point -> Bool #

(<=) :: Triangle point -> Triangle point -> Bool #

(>) :: Triangle point -> Triangle point -> Bool #

(>=) :: Triangle point -> Triangle point -> Bool #

max :: Triangle point -> Triangle point -> Triangle point #

min :: Triangle point -> Triangle point -> Triangle point #

Methods

boundingBox :: forall (d :: Nat) r. (d ~ Dimension (Triangle point), r ~ NumType (Triangle point), Ord r) => Triangle point -> Box (Point d r) Source #

Methods

transformBy :: Transformation (Dimension (Triangle point)) (NumType (Triangle point)) -> Triangle point -> Triangle point Source #

Methods

vertexAt :: VertexIx (Triangle point) -> IndexedTraversal' (VertexIx (Triangle point)) (Triangle point) (Vertex (Triangle point)) Source #

numVertices :: Triangle point -> Int Source #

Methods

mkTriangle :: point -> point -> point -> Triangle point Source #

corners :: Lens' (Triangle point) (Vector 3 point) Source #

Methods

vertices :: IndexedTraversal1 (VertexIx (Triangle point)) (Triangle point) (Triangle point') (Vertex (Triangle point)) (Vertex (Triangle point')) Source #

Methods

allPoints :: forall (d :: Nat) r r'. (Point_ point d r, Point_ point' d r', NumType (Triangle point) ~ r, NumType (Triangle point') ~ r', Dimension (Triangle point) ~ d, Dimension (Triangle point') ~ d) => Traversal1 (Triangle point) (Triangle point') point point'

Methods

intersects :: Point 2 r -> Triangle point -> Bool Source #