query package:diagrams-lib

query :: forall m b (v :: Type -> Type) n . Monoid m => QDiagram b v n m -> Query v n m

Get the query function associated with a diagram.

A query is a function that maps points in a vector space to values in some monoid. Queries naturally form a monoid, with two queries being combined pointwise.

newtype () => Query (v :: Type -> Type) n m

diagrams-lib Diagrams.Query

A query is a function that maps points in a vector space to values in some monoid. Queries naturally form a monoid, with two queries being combined pointwise. The idea for annotating diagrams with monoidal queries came from the graphics-drawingcombinators package, http://hackage.haskell.org/package/graphics-drawingcombinators.

Query :: (Point v n -> m) -> Query (v :: Type -> Type) n m

diagrams-lib Diagrams.Query

queryFillRule :: Lens' (StrokeOpts a) FillRule

diagrams-lib Diagrams.TwoD Diagrams.TwoD.Path

The fill rule used for determining which points are inside the path. The default is Winding. NOTE: for now, this only affects the resulting diagram's Query, not how it will be drawn! To set the fill rule determining how it is to be drawn, use the fillRule function.

class HasQuery t m | t -> m

diagrams-lib Diagrams.Query

Types which can answer a Query about points inside the geometric object. If t and m are both a Semigroups, getQuery should satisfy

getQuery (t1 <> t2) = getQuery t1 <> getQuery t2

getQuery :: HasQuery t m => t -> Query (V t) (N t) m

diagrams-lib Diagrams.Query

Extract the query of an object.

runQuery :: Query (v :: Type -> Type) n m -> Point v n -> m

diagrams-lib Diagrams.Query

_queryFillRule :: StrokeOpts a -> FillRule

diagrams-lib Diagrams.TwoD Diagrams.TwoD.Path