| Maintainer | diagrams-discuss@googlegroups.com |
|---|---|
| Safe Haskell | None |
Diagrams.Core.Query
Description
The Query module defines a type for "queries" on diagrams, which
are functions from points in a vector space to some monoid.
Documentation
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.
Instances
| Action Name (Query v m) | |
| Functor (Query v) | |
| Applicative (Query v) | |
| Monoid m => Monoid (Query v m) | |
| Semigroup m => Semigroup (Query v m) | |
| VectorSpace v => HasOrigin (Query v m) | |
| HasLinearMap v => Transformable (Query v m) | |
| Wrapped (Point v -> m) (Point v' -> m') (Query v m) (Query v' m') | |
| Wrapped (DUALTree (DownAnnots v) (UpAnnots b v m) () (QDiaLeaf b v m)) (DUALTree (DownAnnots v') (UpAnnots b' v' m') () (QDiaLeaf b' v' m')) (QDiagram b v m) (QDiagram b' v' m') |