Copyright | (c) 2013 diagrams-lib team (see LICENSE) |
---|---|
License | BSD-style (see LICENSE) |
Maintainer | diagrams-discuss@googlegroups.com |
Safe Haskell | None |
Language | Haskell2010 |
Diagrams.Query
Description
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.
Documentation
newtype Query v n m :: (* -> *) -> * -> * -> *
Instances
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) => Transformable (Query v n m) | |
(Additive v, Num n) => HasOrigin (Query v n m) | |
Rewrapped (Query v a m) (Query v' a' m') | |
type Unwrapped (Query v n m) = Point v n -> m | |
type V (Query v n m) = v | |
type N (Query v n m) = n |
resetValue :: (Eq m, Monoid m) => QDiagram b v n m -> QDiagram b v n Any
clearValue :: QDiagram b v n m -> QDiagram b v n Any