hgeometry-0.8.0.0: Geometric Algorithms, Data structures, and Data types.

Safe HaskellNone
LanguageHaskell2010

Algorithms.Geometry.LineSegmentIntersection.Types

Synopsis

Documentation

data Associated p r Source #

Constructors

Associated 

Fields

Instances
(Eq p, Eq r) => Eq (Associated p r) Source # 
Instance details

Defined in Algorithms.Geometry.LineSegmentIntersection.Types

Methods

(==) :: Associated p r -> Associated p r -> Bool #

(/=) :: Associated p r -> Associated p r -> Bool #

(Show r, Show p) => Show (Associated p r) Source # 
Instance details

Defined in Algorithms.Geometry.LineSegmentIntersection.Types

Methods

showsPrec :: Int -> Associated p r -> ShowS #

show :: Associated p r -> String #

showList :: [Associated p r] -> ShowS #

Ord r => Semigroup (Associated p r) Source # 
Instance details

Defined in Algorithms.Geometry.LineSegmentIntersection.Types

Methods

(<>) :: Associated p r -> Associated p r -> Associated p r #

sconcat :: NonEmpty (Associated p r) -> Associated p r #

stimes :: Integral b => b -> Associated p r -> Associated p r #

Ord r => Monoid (Associated p r) Source # 
Instance details

Defined in Algorithms.Geometry.LineSegmentIntersection.Types

Methods

mempty :: Associated p r #

mappend :: Associated p r -> Associated p r -> Associated p r #

mconcat :: [Associated p r] -> Associated p r #

associated :: Ord r => [LineSegment 2 p r] -> [LineSegment 2 p r] -> Associated p r Source #

type Intersections p r = Map (Point 2 r) (Associated p r) Source #

isEndPointIntersection :: Associated p r -> Bool Source #

reports true if there is at least one segment for which this intersection point is interior.

\(O(1)\)