Safe Haskell	None
Language	GHC2021

NumHask.Space.Point

Description

A 2-dimensional point.

Synopsis

data Point a = Point {
- _x :: a
- _y :: a
}
rotateP :: TrigField a => a -> Point a -> Point a
gridP :: FieldSpace (Range a) => (a -> a) -> Range a -> Grid (Range a) -> [Point a]
dotP :: (Multiplicative a, Additive a) => Point a -> Point a -> a
(<.>) :: (Multiplicative a, Additive a) => Point a -> Point a -> a
crossP :: (Multiplicative a, Subtractive a) => Point a -> Point a -> a
flipY :: Subtractive a => Point a -> Point a
data Line a = Line {
- lineStart :: Point a
- lineEnd :: Point a
}
lineSolve :: (ExpField a, Eq a) => Line a -> (a, a, a)
lineDistance :: ExpField a => Line a -> Point a -> a
closestPoint :: Field a => Line a -> Point a -> Point a
lineIntersect :: (Ord a, Epsilon a, Absolute a, Field a) => Line a -> Line a -> Maybe (Point a)
translate :: TrigField a => Point a -> Transform a
scaleT :: TrigField a => Point a -> Transform a
skew :: TrigField a => Point a -> Transform a

Documentation

data Point a Source #

A 2-dimensional Point of a's

In contrast with a tuple, a Point is functorial over both arguments.

>>> let p = Point 1 1
>>> p + p
Point 2 2
>>> (2*) <$> p
Point 2 2

A major reason for this bespoke treatment (compared to just using linear, say) is that Points do not have maximums and minimums but they do form a lattice, and this is useful for folding sets of points to find out the (rectangular) Space they occupy.

>>> Point 0 1 /\ Point 1 0
Point 0 0
>>> Point 0 1 \/ Point 1 0
Point 1 1

This is used extensively in chart-svg to ergonomically obtain chart areas.

unsafeSpace1 [Point 1 0, Point 0 1] :: Rect Double

Rect 0.0 1.0 0.0 1.0

Constructors

Point
Fields _x :: a _y :: a

Instances

Instances details

Representable Point Source #

Instance details

Foldable Line Source #
Instance details Defined in NumHask.Space.Point Methods fold :: Monoid m => Line m -> m # foldMap :: Monoid m => (a -> m) -> Line a -> m # foldMap' :: Monoid m => (a -> m) -> Line a -> m # foldr :: (a -> b -> b) -> b -> Line a -> b # foldr' :: (a -> b -> b) -> b -> Line a -> b # foldl :: (b -> a -> b) -> b -> Line a -> b # foldl' :: (b -> a -> b) -> b -> Line a -> b # foldr1 :: (a -> a -> a) -> Line a -> a # foldl1 :: (a -> a -> a) -> Line a -> a # toList :: Line a -> [a] # null :: Line a -> Bool # length :: Line a -> Int # elem :: Eq a => a -> Line a -> Bool # maximum :: Ord a => Line a -> a # minimum :: Ord a => Line a -> a # sum :: Num a => Line a -> a # product :: Num a => Line a -> a #
Traversable Line Source #
Instance details Defined in NumHask.Space.Point Methods traverse :: Applicative f => (a -> f b) -> Line a -> f (Line b) # sequenceA :: Applicative f => Line (f a) -> f (Line a) # mapM :: Monad m => (a -> m b) -> Line a -> m (Line b) # sequence :: Monad m => Line (m a) -> m (Line a) #
Functor Line Source #
Instance details Defined in NumHask.Space.Point Methods fmap :: (a -> b) -> Line a -> Line b # (<$) :: a -> Line b -> Line a #
(Ord a, Additive a, Show a) => Show (Line a) Source #
Instance details Defined in NumHask.Space.Point Methods showsPrec :: Int -> Line a -> ShowS # show :: Line a -> String # showList :: [Line a] -> ShowS #
Eq a => Eq (Line a) Source #
Instance details Defined in NumHask.Space.Point Methods (==) :: Line a -> Line a -> Bool # (/=) :: Line a -> Line a -> Bool #
(Multiplicative a, Additive a) => Affinity (Line a) a Source #
Instance details Defined in NumHask.Space.Point Methods transform :: Transform a -> Line a -> Line a Source #