| Copyright | (c) 2011-2015 diagrams-core team (see LICENSE) |
|---|---|
| License | BSD-style (see LICENSE) |
| Maintainer | diagrams-discuss@googlegroups.com |
| Safe Haskell | None |
| Language | Haskell2010 |
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 n m) | |
| Functor (Query v n) | |
| Applicative (Query v n) | |
| Monoid m => Monoid (Query v n m) | |
| Semigroup m => Semigroup (Query v n m) | |
| Wrapped (Query v n m) | |
| (Additive v, Num n) => HasOrigin (Query v n m) | |
| (Additive v, Num n) => Transformable (Query v n m) | |
| Rewrapped (Query v a m) (Query v' a' m') | |
| type Unwrapped (Query v n m) = Point v n -> m | |
| type N (Query v n m) = n | |
| type V (Query v n m) = v |