diagrams-lib-1.4.2.3: Embedded domain-specific language for declarative graphics

Copyright | (c) 2011 diagrams-lib team (see LICENSE)
License | BSD-style (see LICENSE)
Maintainer | diagrams-discuss@googlegroups.com
Safe Haskell | None
Language | Haskell2010

Diagrams.Points

Contents

- Points
- Point-related utilities

Description

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 Source #

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

Constructors

P (f a) |

Instances

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

Instance details

Defined in Linear.Affine

Methods

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 ()

elemseq :: Vector (Point f a) -> Point f a -> b -> b

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

Instance details

Defined in Linear.Affine

Methods

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) |
Instance details Defined in Linear.Affine Methods (>>=) :: Point f a -> (a -> Point f b) -> Point f b Source # (>>) :: Point f a -> Point f b -> Point f b Source # return :: a -> Point f a Source # fail :: String -> Point f a Source #
Functor f => Functor (Point f) |
Instance details Defined in Linear.Affine Methods fmap :: (a -> b) -> Point f a -> Point f b Source # (<$) :: a -> Point f b -> Point f a Source #
Applicative f => Applicative (Point f) |
Instance details Defined in Linear.Affine Methods pure :: a -> Point f a Source # (<*>) :: Point f (a -> b) -> Point f a -> Point f b Source # liftA2 :: (a -> b -> c) -> Point f a -> Point f b -> Point f c Source # (*>) :: Point f a -> Point f b -> Point f b Source # (<*) :: Point f a -> Point f b -> Point f a Source #
Foldable f => Foldable (Point f) |

Instance details

Defined in Linear.Affine

Methods

fold :: Monoid m => Point f m -> m Source #

foldMap :: Monoid m => (a -> m) -> Point f a -> m Source #

foldr :: (a -> b -> b) -> b -> Point f a -> b Source #

foldr' :: (a -> b -> b) -> b -> Point f a -> b Source #

foldl :: (b -> a -> b) -> b -> Point f a -> b Source #

foldl' :: (b -> a -> b) -> b -> Point f a -> b Source #

foldr1 :: (a -> a -> a) -> Point f a -> a Source #

foldl1 :: (a -> a -> a) -> Point f a -> a Source #

toList :: Point f a -> [a] Source #

null :: Point f a -> Bool Source #

length :: Point f a -> Int Source #

elem :: Eq a => a -> Point f a -> Bool Source #

maximum :: Ord a => Point f a -> a Source #

minimum :: Ord a => Point f a -> a Source #

sum :: Num a => Point f a -> a Source #

product :: Num a => Point f a -> a Source #

Traversable f => Traversable (Point f) |
Instance details Defined in Linear.Affine Methods traverse :: Applicative f0 => (a -> f0 b) -> Point f a -> f0 (Point f b) Source # sequenceA :: Applicative f0 => Point f (f0 a) -> f0 (Point f a) Source # mapM :: Monad m => (a -> m b) -> Point f a -> m (Point f b) Source # sequence :: Monad m => Point f (m a) -> m (Point f a) Source #
Apply f => Apply (Point f) |
Instance details Defined in Linear.Affine Methods (<.>) :: Point f (a -> b) -> Point f a -> Point f b (.>) :: Point f a -> Point f b -> Point f b (<.) :: Point f a -> Point f b -> Point f a liftF2 :: (a -> b -> c) -> Point f a -> Point f b -> Point f c
Distributive f => Distributive (Point f) |
Instance details Defined in Linear.Affine Methods distribute :: Functor f0 => f0 (Point f a) -> Point f (f0 a) Source # collect :: Functor f0 => (a -> Point f b) -> f0 a -> Point f (f0 b) Source # distributeM :: Monad m => m (Point f a) -> Point f (m a) Source # collectM :: Monad m => (a -> Point f b) -> m a -> Point f (m b) Source #
Representable f => Representable (Point f) |
Instance details Defined in Linear.Affine Associated Types type Rep (Point f) :: Type Source # Methods tabulate :: (Rep (Point f) -> a) -> Point f a Source # index :: Point f a -> Rep (Point f) -> a Source #
Eq1 f => Eq1 (Point f) |
Instance details Defined in Linear.Affine Methods liftEq :: (a -> b -> Bool) -> Point f a -> Point f b -> Bool Source #
Ord1 f => Ord1 (Point f) |
Instance details Defined in Linear.Affine Methods liftCompare :: (a -> b -> Ordering) -> Point f a -> Point f b -> Ordering Source #
Read1 f => Read1 (Point f) |
Instance details Defined in Linear.Affine Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Point f a) Source # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Point f a] Source # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Point f a) Source # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Point f a] Source #
Show1 f => Show1 (Point f) |
Instance details Defined in Linear.Affine Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Point f a -> ShowS Source # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Point f a] -> ShowS Source #
Additive f => Additive (Point f) |

Instance details

Defined in Linear.Affine

Methods

zero :: Num a => Point f a Source #

(^+^) :: Num a => Point f a -> Point f a -> Point f a Source #

(^-^) :: Num a => Point f a -> Point f a -> Point f a Source #

lerp :: Num a => a -> Point f a -> Point f a -> Point f a Source #

liftU2 :: (a -> a -> a) -> Point f a -> Point f a -> Point f a Source #

liftI2 :: (a -> b -> c) -> Point f a -> Point f b -> Point f c Source #

Hashable1 f => Hashable1 (Point f) |
Instance details Defined in Linear.Affine Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Point f a -> Int Source #
Additive f => Affine (Point f) |
Instance details Defined in Linear.Affine Associated Types type Diff (Point f) :: Type -> Type Source # Methods (.-.) :: Num a => Point f a -> Point f a -> Diff (Point f) a Source # (.+^) :: Num a => Point f a -> Diff (Point f) a -> Point f a Source # (.-^) :: Num a => Point f a -> Diff (Point f) a -> Point f a Source #
R4 f => R4 (Point f) |
Instance details Defined in Linear.Affine Methods _w :: Lens' (Point f a) a Source # _xyzw :: Lens' (Point f a) (V4 a) Source #
R3 f => R3 (Point f) |
Instance details Defined in Linear.Affine Methods _z :: Lens' (Point f a) a Source # _xyz :: Lens' (Point f a) (V3 a) Source #
R2 f => R2 (Point f) |
Instance details Defined in Linear.Affine Methods _y :: Lens' (Point f a) a Source # _xy :: Lens' (Point f a) (V2 a) Source #
R1 f => R1 (Point f) |
Instance details Defined in Linear.Affine Methods _x :: Lens' (Point f a) a Source #
Finite f => Finite (Point f) |
Instance details Defined in Linear.Affine Associated Types type Size (Point f) :: Nat Source # Methods toV :: Point f a -> V (Size (Point f)) a Source # fromV :: V (Size (Point f)) a -> Point f a Source #
Metric f => Metric (Point f) |
Instance details Defined in Linear.Affine Methods dot :: Num a => Point f a -> Point f a -> a Source # quadrance :: Num a => Point f a -> a Source # qd :: Num a => Point f a -> Point f a -> a Source # distance :: Floating a => Point f a -> Point f a -> a Source # norm :: Floating a => Point f a -> a Source # signorm :: Floating a => Point f a -> Point f a Source #
Bind f => Bind (Point f) |
Instance details Defined in Linear.Affine Methods (>>-) :: Point f a -> (a -> Point f b) -> Point f b join :: Point f (Point f a) -> Point f a
Serial1 f => Serial1 (Point f) |
Instance details Defined in Linear.Affine Methods serializeWith :: MonadPut m => (a -> m ()) -> Point f a -> m () deserializeWith :: MonadGet m => m a -> m (Point f a)
HasPhi v => HasPhi (Point v) Source # |
Instance details Defined in Diagrams.Angle Methods _phi :: RealFloat n => Lens' (Point v n) (Angle n) Source #
HasTheta v => HasTheta (Point v) Source # |
Instance details Defined in Diagrams.Angle Methods _theta :: RealFloat n => Lens' (Point v n) (Angle n) Source #
HasR v => HasR (Point v) Source # |
Instance details Defined in Diagrams.TwoD.Types Methods _r :: RealFloat n => Lens' (Point v n) n 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 `trailPoints`.
Instance details Defined in Diagrams.TrailLike Methods trailLike :: Located (Trail (V [Point v n]) (N [Point v n])) -> [Point v n] Source #
Generic1 (Point f :: Type -> Type) |
Instance details Defined in Linear.Affine Associated Types type Rep1 (Point f) :: k -> Type Source # Methods from1 :: Point f a -> Rep1 (Point f) a Source # to1 :: Rep1 (Point f) a -> Point f a Source #
Functor v => Cosieve (Query v) (Point v) |
Instance details Defined in Diagrams.Core.Query Methods cosieve :: Query v a b -> Point v a -> b Source #
Eq (f a) => Eq (Point f a) |
Instance details Defined in Linear.Affine Methods (==) :: Point f a -> Point f a -> Bool Source # (/=) :: Point f a -> Point f a -> Bool Source #
Fractional (f a) => Fractional (Point f a) |
Instance details Defined in Linear.Affine Methods (/) :: Point f a -> Point f a -> Point f a Source # recip :: Point f a -> Point f a Source # fromRational :: Rational -> Point f a Source #
(Typeable f, Typeable a, Data (f a)) => Data (Point f a) |

Instance details

Defined in Linear.Affine

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Point f a -> c (Point f a) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Point f a) Source #

toConstr :: Point f a -> Constr Source #

dataTypeOf :: Point f a -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Point f a)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Point f a)) Source #

gmapT :: (forall b. Data b => b -> b) -> Point f a -> Point f a Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Point f a -> r Source #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Point f a -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Point f a -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Point f a -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Point f a -> m (Point f a) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Point f a -> m (Point f a) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Point f a -> m (Point f a) Source #

Num (f a) => Num (Point f a) |
Instance details Defined in Linear.Affine Methods (+) :: Point f a -> Point f a -> Point f a Source # (-) :: Point f a -> Point f a -> Point f a Source # (*) :: Point f a -> Point f a -> Point f a Source # negate :: Point f a -> Point f a Source # abs :: Point f a -> Point f a Source # signum :: Point f a -> Point f a Source # fromInteger :: Integer -> Point f a Source #
Ord (f a) => Ord (Point f a) |
Instance details Defined in Linear.Affine Methods compare :: Point f a -> Point f a -> Ordering Source # (<) :: Point f a -> Point f a -> Bool Source # (<=) :: Point f a -> Point f a -> Bool Source # (>) :: Point f a -> Point f a -> Bool Source # (>=) :: Point f a -> Point f a -> Bool Source # max :: Point f a -> Point f a -> Point f a Source # min :: Point f a -> Point f a -> Point f a Source #
Read (f a) => Read (Point f a) |
Instance details Defined in Linear.Affine Methods readsPrec :: Int -> ReadS (Point f a) Source # readList :: ReadS [Point f a] Source # readPrec :: ReadPrec (Point f a) Source # readListPrec :: ReadPrec [Point f a] Source #
Show (f a) => Show (Point f a) |
Instance details Defined in Linear.Affine Methods showsPrec :: Int -> Point f a -> ShowS Source # show :: Point f a -> String Source # showList :: [Point f a] -> ShowS Source #
Ix (f a) => Ix (Point f a) |
Instance details Defined in Linear.Affine Methods range :: (Point f a, Point f a) -> [Point f a] Source # index :: (Point f a, Point f a) -> Point f a -> Int Source # unsafeIndex :: (Point f a, Point f a) -> Point f a -> Int inRange :: (Point f a, Point f a) -> Point f a -> Bool Source # rangeSize :: (Point f a, Point f a) -> Int Source # unsafeRangeSize :: (Point f a, Point f a) -> Int
Generic (Point f a) |
Instance details Defined in Linear.Affine Associated Types type Rep (Point f a) :: Type -> Type Source # Methods from :: Point f a -> Rep (Point f a) x Source # to :: Rep (Point f a) x -> Point f a Source #
Storable (f a) => Storable (Point f a) |

Instance details

Defined in Linear.Affine

Methods

sizeOf :: Point f a -> Int Source #

alignment :: Point f a -> Int Source #

peekElemOff :: Ptr (Point f a) -> Int -> IO (Point f a) Source #

pokeElemOff :: Ptr (Point f a) -> Int -> Point f a -> IO () Source #

peekByteOff :: Ptr b -> Int -> IO (Point f a) Source #

pokeByteOff :: Ptr b -> Int -> Point f a -> IO () Source #

peek :: Ptr (Point f a) -> IO (Point f a) Source #

poke :: Ptr (Point f a) -> Point f a -> IO () Source #

Binary (f a) => Binary (Point f a) |
Instance details Defined in Linear.Affine Methods put :: Point f a -> Put Source # get :: Get (Point f a) Source # putList :: [Point f a] -> Put Source #
Serialize (f a) => Serialize (Point f a) |
Instance details Defined in Linear.Affine Methods put :: Putter (Point f a) Source # get :: Get (Point f a) Source #
NFData (f a) => NFData (Point f a) |
Instance details Defined in Linear.Affine Methods rnf :: Point f a -> () Source #
(OrderedField n, Metric v) => Enveloped (Point v n) |
Instance details Defined in Diagrams.Core.Envelope Methods getEnvelope :: Point v n -> Envelope (V (Point v n)) (N (Point v n)) Source #

(Additive v, Ord n) => Traced (Point v n)

The trace of a single point is the empty trace, i.e. the one which returns no intersection points for every query. Arguably it should return a single finite distance for vectors aimed directly at the given point, but due to floating-point inaccuracy this is problematic. Note that the envelope for a single point is not the empty envelope (see Diagrams.Core.Envelope).

Instance details Defined in Diagrams.Core.Trace Methods getTrace :: Point v n -> Trace (V (Point v n)) (N (Point v n)) Source #
(Additive v, Num n) => Transformable (Point v n) |
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V (Point v n)) (N (Point v n)) -> Point v n -> Point v n Source #
(Additive v, Num n) => HasOrigin (Point v n) |
Instance details Defined in Diagrams.Core.HasOrigin Methods moveOriginTo :: Point (V (Point v n)) (N (Point v n)) -> Point v n -> Point v n Source #
Hashable (f a) => Hashable (Point f a) |
Instance details Defined in Linear.Affine Methods hashWithSalt :: Int -> Point f a -> Int Source # hash :: Point f a -> Int Source #
Unbox (f a) => Unbox (Point f a) |
Instance details Defined in Linear.Affine
Ixed (f a) => Ixed (Point f a) |
Instance details Defined in Linear.Affine Methods ix :: Index (Point f a) -> Traversal' (Point f a) (IxValue (Point f a)) Source #
Wrapped (Point f a) |
Instance details Defined in Linear.Affine Associated Types type Unwrapped (Point f a) :: Type Source # Methods _Wrapped' :: Iso' (Point f a) (Unwrapped (Point f a)) Source #
Epsilon (f a) => Epsilon (Point f a) |
Instance details Defined in Linear.Affine Methods nearZero :: Point f a -> Bool Source #
Serial (f a) => Serial (Point f a) |
Instance details Defined in Linear.Affine Methods serialize :: MonadPut m => Point f a -> m () deserialize :: MonadGet m => m (Point f a)
Coordinates (v n) => Coordinates (Point v n) Source # |

Instance details

Defined in Diagrams.Coordinates

Associated Types

type FinalCoord (Point v n) :: Type Source #

type PrevDim (Point v n) :: Type Source #

type Decomposition (Point v n) :: Type Source #

Methods

(^&) :: PrevDim (Point v n) -> FinalCoord (Point v n) -> Point v n Source #

pr :: PrevDim (Point v n) -> FinalCoord (Point v n) -> Point v n Source #

coords :: Point v n -> Decomposition (Point v n) Source #

t ~ Point g b => Rewrapped (Point f a) t |
Instance details Defined in Linear.Affine
(Additive v, Num n, r ~ Point u n) => AffineMappable (Point v n) r Source # |
Instance details Defined in Diagrams.LinearMap Methods amap :: AffineMap (V (Point v n)) (V r) (N r) -> Point v n -> r Source #
r ~ Point u n => Deformable (Point v n) r Source # |
Instance details Defined in Diagrams.Deform Methods deform' :: N (Point v n) -> Deformation (V (Point v n)) (V r) (N (Point v n)) -> Point v n -> r Source # deform :: Deformation (V (Point v n)) (V r) (N (Point v n)) -> Point v n -> r Source #
LinearMappable (Point v n) (Point u m) Source # |
Instance details Defined in Diagrams.LinearMap Methods vmap :: (Vn (Point v n) -> Vn (Point u m)) -> Point v n -> Point u m Source #
Traversable f => Each (Point f a) (Point f b) a b |
Instance details Defined in Linear.Affine Methods each :: Traversal (Point f a) (Point f b) a b Source #
Each (FixedSegment v n) (FixedSegment v' n') (Point v n) (Point v' n') Source # |
Instance details Defined in Diagrams.Segment Methods each :: Traversal (FixedSegment v n) (FixedSegment v' n') (Point v n) (Point v' n') Source #
(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.
Instance details Defined in Diagrams.BoundingBox Methods each :: Traversal (BoundingBox v n) (BoundingBox v' n') (Point v n) (Point v' n') Source #
newtype MVector s (Point f a) |
Instance details Defined in Linear.Affine newtype MVector s (Point f a) = MV_P (MVector s (f a))
type Rep (Point f) |
Instance details Defined in Linear.Affine type Rep (Point f) = Rep f
type Diff (Point f) |
Instance details Defined in Linear.Affine type Diff (Point f) = f
type Size (Point f) |
Instance details Defined in Linear.Affine type Size (Point f) = Size f
type Rep1 (Point f :: Type -> Type) |
Instance details Defined in Linear.Affine type Rep1 (Point f :: Type -> Type) = D1 (MetaData "Point" "Linear.Affine" "linear-1.20.9-AXvcltmUzhAPqVQGbnzsL" True) (C1 (MetaCons "P" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 f)))
type Rep (Point f a) |
Instance details Defined in Linear.Affine type Rep (Point f a) = D1 (MetaData "Point" "Linear.Affine" "linear-1.20.9-AXvcltmUzhAPqVQGbnzsL" True) (C1 (MetaCons "P" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (f a))))
type V (Point v n) |
Instance details Defined in Diagrams.Core.Points type V (Point v n) = v
type N (Point v n) |
Instance details Defined in Diagrams.Core.Points type N (Point v n) = n
newtype Vector (Point f a) |
Instance details Defined in Linear.Affine newtype Vector (Point f a) = V_P (Vector (f a))
type Index (Point f a) |
Instance details Defined in Linear.Affine type Index (Point f a) = Index (f a)
type IxValue (Point f a) |
Instance details Defined in Linear.Affine type IxValue (Point f a) = IxValue (f a)
type Unwrapped (Point f a) |
Instance details Defined in Linear.Affine type Unwrapped (Point f a) = f a
type FinalCoord (Point v n) Source # |
Instance details Defined in Diagrams.Coordinates type FinalCoord (Point v n) = FinalCoord (v n)
type PrevDim (Point v n) Source # |
Instance details Defined in Diagrams.Coordinates type PrevDim (Point v n) = PrevDim (v n)
type Decomposition (Point v n) Source # |
Instance details Defined in Diagrams.Coordinates type Decomposition (Point v n) = Decomposition (v n)

origin :: (Additive f, Num a) => Point f a Source #

Vector spaces have origins.

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

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 Source #

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

_Point :: Iso' (Point f a) (f a) Source #

lensP :: Lens' (Point g a) (g a) Source #