Copyright | (c) 2011 diagrams-lib team (see LICENSE) |
---|---|

License | BSD-style (see LICENSE) |

Maintainer | diagrams-discuss@googlegroups.com |

Safe Haskell | None |

Language | Haskell2010 |

Points in space. For more tools for working with points and vectors, see Linear.Affine.

## Synopsis

- newtype Point (f :: Type -> Type) a = P (f a)
- origin :: (Additive f, Num a) => Point f a
- (*.) :: (Functor v, Num n) => n -> Point v n -> Point v n
- centroid :: (Additive v, Fractional n) => [Point v n] -> Point v n
- pointDiagram :: (Metric v, Fractional n) => Point v n -> QDiagram b v n m
- _Point :: Iso' (Point f a) (f a)
- lensP :: Lens' (Point g a) (g a)

# Points

newtype Point (f :: Type -> Type) a #

A handy wrapper to help distinguish points from vectors at the type level

P (f a) |

## Instances

Unbox (f a) => Vector Vector (Point f a) | |

Defined in Linear.Affine basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Point f a) -> m (Vector (Point f a)) # basicUnsafeThaw :: PrimMonad m => Vector (Point f a) -> m (Mutable Vector (PrimState m) (Point f a)) # basicLength :: Vector (Point f a) -> Int # basicUnsafeSlice :: Int -> Int -> Vector (Point f a) -> Vector (Point f a) # basicUnsafeIndexM :: Monad m => Vector (Point f a) -> Int -> m (Point f a) # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Point f a) -> Vector (Point f a) -> m () # | |

Unbox (f a) => MVector MVector (Point f a) | |

Defined in Linear.Affine basicLength :: MVector s (Point f a) -> Int # basicUnsafeSlice :: Int -> Int -> MVector s (Point f a) -> MVector s (Point f a) # basicOverlaps :: MVector s (Point f a) -> MVector s (Point f a) -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Point f a)) # basicInitialize :: PrimMonad m => MVector (PrimState m) (Point f a) -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Point f a -> m (MVector (PrimState m) (Point f a)) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Point f a) -> Int -> m (Point f a) # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Point f a) -> Int -> Point f a -> m () # basicClear :: PrimMonad m => MVector (PrimState m) (Point f a) -> m () # basicSet :: PrimMonad m => MVector (PrimState m) (Point f a) -> Point f a -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Point f a) -> MVector (PrimState m) (Point f a) -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Point f a) -> MVector (PrimState m) (Point f a) -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Point f a) -> Int -> m (MVector (PrimState m) (Point f a)) # | |

Monad f => Monad (Point f) | |

Functor f => Functor (Point f) | |

Applicative f => Applicative (Point f) | |

Foldable f => Foldable (Point f) | |

Defined in Linear.Affine fold :: Monoid m => Point f m -> m # foldMap :: Monoid m => (a -> m) -> Point f a -> m # foldr :: (a -> b -> b) -> b -> Point f a -> b # foldr' :: (a -> b -> b) -> b -> Point f a -> b # foldl :: (b -> a -> b) -> b -> Point f a -> b # foldl' :: (b -> a -> b) -> b -> Point f a -> b # foldr1 :: (a -> a -> a) -> Point f a -> a # foldl1 :: (a -> a -> a) -> Point f a -> a # elem :: Eq a => a -> Point f a -> Bool # maximum :: Ord a => Point f a -> a # minimum :: Ord a => Point f a -> a # | |

Traversable f => Traversable (Point f) | |

Apply f => Apply (Point f) | |

Distributive f => Distributive (Point f) | |

Representable f => Representable (Point f) | |

Eq1 f => Eq1 (Point f) | |

Ord1 f => Ord1 (Point f) | |

Defined in Linear.Affine | |

Read1 f => Read1 (Point f) | |

Defined in Linear.Affine | |

Show1 f => Show1 (Point f) | |

Serial1 f => Serial1 (Point f) | |

Defined in Linear.Affine serializeWith :: MonadPut m => (a -> m ()) -> Point f a -> m () # deserializeWith :: MonadGet m => m a -> m (Point f a) # | |

Additive f => Additive (Point f) | |

Defined in Linear.Affine | |

Hashable1 f => Hashable1 (Point f) | |

Defined in Linear.Affine | |

Additive f => Affine (Point f) | |

R4 f => R4 (Point f) | |

R3 f => R3 (Point f) | |

R2 f => R2 (Point f) | |

R1 f => R1 (Point f) | |

Defined in Linear.Affine | |

Finite f => Finite (Point f) | |

Metric f => Metric (Point f) | |

Bind f => Bind (Point f) | |

HasPhi v => HasPhi (Point v) Source # | |

HasTheta v => HasTheta (Point v) Source # | |

HasR v => HasR (Point v) Source # | |

(Metric v, OrderedField n) => TrailLike [Point v n] Source # | A list of points is trail-like; this instance simply
computes the vertices of the trail, using |

Generic1 (Point f :: Type -> Type) | |

Functor v => Cosieve (Query v) (Point v) | |

Defined in Diagrams.Core.Query | |

Eq (f a) => Eq (Point f a) | |

Fractional (f a) => Fractional (Point f a) | |

(Typeable f, Typeable a, Data (f a)) => Data (Point f a) | |

Defined in Linear.Affine gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Point f a -> c (Point f a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Point f a) # toConstr :: Point f a -> Constr # dataTypeOf :: Point f a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Point f a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Point f a)) # gmapT :: (forall b. Data b => b -> b) -> Point f a -> Point f a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Point f a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Point f a -> r # gmapQ :: (forall d. Data d => d -> u) -> Point f a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Point f a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Point f a -> m (Point f a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Point f a -> m (Point f a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Point f a -> m (Point f a) # | |

Num (f a) => Num (Point f a) | |

Ord (f a) => Ord (Point f a) | |

Defined in Linear.Affine | |

Read (f a) => Read (Point f a) | |

Show (f a) => Show (Point f a) | |

Ix (f a) => Ix (Point f a) | |

Defined in Linear.Affine range :: (Point f a, Point f a) -> [Point f a] # index :: (Point f a, Point f a) -> Point f a -> Int # unsafeIndex :: (Point f a, Point f a) -> Point f a -> Int inRange :: (Point f a, Point f a) -> Point f a -> Bool # rangeSize :: (Point f a, Point f a) -> Int # unsafeRangeSize :: (Point f a, Point f a) -> Int | |

Generic (Point f a) | |

Storable (f a) => Storable (Point f a) | |

Defined in Linear.Affine | |

Binary (f a) => Binary (Point f a) | |

Serial (f a) => Serial (Point f a) | |

Defined in Linear.Affine | |

Serialize (f a) => Serialize (Point f a) | |

NFData (f a) => NFData (Point f a) | |

Defined in Linear.Affine | |

(OrderedField n, Metric v) => Enveloped (Point v n) | |

Defined in Diagrams.Core.Envelope | |

(Additive v, Ord n) => Traced (Point v n) | The trace of a single point is the empty trace, |

(Additive v, Num n) => Transformable (Point v n) | |

Defined in Diagrams.Core.Transform | |

(Additive v, Num n) => HasOrigin (Point v n) | |

Defined in Diagrams.Core.HasOrigin | |

Hashable (f a) => Hashable (Point f a) | |

Defined in Linear.Affine | |

Unbox (f a) => Unbox (Point f a) | |

Defined in Linear.Affine | |

Ixed (f a) => Ixed (Point f a) | |

Defined in Linear.Affine | |

Wrapped (Point f a) | |

Epsilon (f a) => Epsilon (Point f a) | |

Defined in Linear.Affine | |

Coordinates (v n) => Coordinates (Point v n) Source # | |

t ~ Point g b => Rewrapped (Point f a) t | |

Defined in Linear.Affine | |

(Additive v, Num n, r ~ Point u n) => AffineMappable (Point v n) r Source # | |

r ~ Point u n => Deformable (Point v n) r Source # | |

LinearMappable (Point v n) (Point u m) Source # | |

Traversable f => Each (Point f a) (Point f b) a b | |

Each (FixedSegment v n) (FixedSegment v' n') (Point v n) (Point v' n') Source # | |

Defined in Diagrams.Segment each :: Traversal (FixedSegment v n) (FixedSegment v' n') (Point v n) (Point v' n') # | |

(Additive v', Foldable v', Ord n') => Each (BoundingBox v n) (BoundingBox v' n') (Point v n) (Point v' n') Source # | Only valid if the second point is not smaller than the first. |

Defined in Diagrams.BoundingBox each :: Traversal (BoundingBox v n) (BoundingBox v' n') (Point v n) (Point v' n') # | |

newtype MVector s (Point f a) | |

Defined in Linear.Affine | |

type Rep (Point f) | |

Defined in Linear.Affine | |

type Diff (Point f) | |

Defined in Linear.Affine | |

type Size (Point f) | |

Defined in Linear.Affine | |

type Rep1 (Point f :: Type -> Type) | |

type Rep (Point f a) | |

Defined in Linear.Affine | |

type V (Point v n) | |

Defined in Diagrams.Core.Points | |

type N (Point v n) | |

Defined in Diagrams.Core.Points | |

newtype Vector (Point f a) | |

Defined in Linear.Affine | |

type Index (Point f a) | |

Defined in Linear.Affine | |

type IxValue (Point f a) | |

Defined in Linear.Affine | |

type Unwrapped (Point f a) | |

Defined in Linear.Affine | |

type FinalCoord (Point v n) Source # | |

Defined in Diagrams.Coordinates | |

type PrevDim (Point v n) Source # | |

Defined in Diagrams.Coordinates | |

type Decomposition (Point v n) Source # | |

Defined in Diagrams.Coordinates |

(*.) :: (Functor v, Num n) => n -> Point v n -> Point v n #

Scale a point by a scalar. Specialized version of '(*^)'.

# Point-related utilities

centroid :: (Additive v, Fractional n) => [Point v n] -> Point v n Source #

The centroid of a set of *n* points is their sum divided by *n*.
Returns the origin for an empty list of points.

pointDiagram :: (Metric v, Fractional n) => Point v n -> QDiagram b v n m #

Create a "point diagram", which has no content, no trace, an empty query, and a point envelope.