trace -package:matrix -package:ghc package:diagrams-lib

trace :: forall (v :: Type -> Type) n m b . (Metric v, OrderedField n, Semigroup m) => Lens' (QDiagram b v n m) (Trace v n)
diagrams-lib Diagrams.Trace
Lens onto the Trace of a QDiagram.
module Diagrams.Trace
diagrams-lib
"Traces", aka embedded raytracers, for finding points on the edge of a diagram. See Diagrams.Core.Trace for internal implementation details.
data Trace (v :: Type -> Type) n
diagrams-lib Diagrams.Trace
Every diagram comes equipped with a trace. Intuitively, the trace for a diagram is like a raytracer: given a line (represented as a base point and a direction vector), the trace computes a sorted list of signed distances from the base point to all intersections of the line with the boundary of the diagram. Note that the outputs are not absolute distances, but multipliers relative to the input vector. That is, if the base point is p and direction vector is v, and one of the output scalars is s, then there is an intersection at the point p .+^ (s *^ v).
traceBoundary :: (V a ~ v, N a ~ n, Num n, Traced a) => v n -> a -> Point v n
diagrams-lib Diagrams.Align
traceP :: (n ~ N a, Traced a, Num n) => Point (V a) n -> V a n -> a -> Maybe (Point (V a) n)
diagrams-lib Diagrams.Trace
Compute the "smallest" boundary point along the line determined by the given point p and vector v. The "smallest" boundary point is defined as the one given by p .+^ (s *^ v) for the smallest (most negative) value of s. Return Nothing if there is no such boundary point. See also traceV. See also rayTraceP which uses the smallest positive intersection, which is often more intuitive behavior.
traceV :: (n ~ N a, Num n, Traced a) => Point (V a) n -> V a n -> a -> Maybe (V a n)
diagrams-lib Diagrams.Trace
Compute the vector from the given point p to the "smallest" boundary intersection along the given vector v. The "smallest" boundary intersection is defined as the one given by p .+^ (s *^ v) for the smallest (most negative) value of s. Return Nothing if there is no intersection. See also traceP. See also rayTraceV which uses the smallest positive intersection, which is often more intuitive behavior.
class (Additive V a, Ord N a) => Traced a
diagrams-lib Diagrams.Trace
Traced abstracts over things which have a trace.
data TraceOpts n
diagrams-lib Diagrams.TwoD Diagrams.TwoD.Model
TraceOpts :: Colour Double -> n -> n -> Int -> TraceOpts n
diagrams-lib Diagrams.TwoD Diagrams.TwoD.Model
withTrace :: (InSpace v n a, Metric v, OrderedField n, Monoid' m, Traced a) => a -> QDiagram b v n m -> QDiagram b v n m
diagrams-lib Diagrams.Combinators Diagrams.Trace
Use the trace from some object as the trace for a diagram, in place of the diagram's default trace.
maxTraceP :: (n ~ N a, Num n, Traced a) => Point (V a) n -> V a n -> a -> Maybe (Point (V a) n)
diagrams-lib Diagrams.Trace
Like traceP, but computes the "largest" boundary point instead of the smallest. (Note, however, the "largest" boundary point may still be in the opposite direction from the given vector, if all the boundary points are.)
maxTraceV :: (n ~ N a, Num n, Traced a) => Point (V a) n -> V a n -> a -> Maybe (V a n)
diagrams-lib Diagrams.Trace
Like traceV, but computes a vector to the "largest" boundary point instead of the smallest. (Note, however, the "largest" boundary point may still be in the opposite direction from the given vector, if all the boundary points are, as in the third example shown below.)
setTrace :: forall b (v :: Type -> Type) n m . (OrderedField n, Metric v, Semigroup m) => Trace v n -> QDiagram b v n m -> QDiagram b v n m
diagrams-lib Diagrams.Trace
Replace the trace of a diagram.
showTrace :: (Enum n, TypeableFloat n, Renderable (Path V2 n) b) => QDiagram b V2 n Any -> QDiagram b V2 n Any
diagrams-lib Diagrams.TwoD Diagrams.TwoD.Model
Mark the trace of a diagram by placing 64 red dots 1/100th its size along the trace.
showTrace' :: (Enum n, TypeableFloat n, Renderable (Path V2 n) b) => TraceOpts n -> QDiagram b V2 n Any -> QDiagram b V2 n Any
diagrams-lib Diagrams.TwoD Diagrams.TwoD.Model
Mark the trace of a diagram, with control over colour and scale of marker dot and the number of points on the trace.