| Safe Haskell | None |
|---|---|
| Language | Haskell98 |
Diagrams.Puzzles.Grid
- (.--.) :: AffineSpace p => p -> p -> Diff p
- class ToPoint a where
- dot :: Backend' b => Diagram b
- grid :: Backend' b => GridStyle -> Grid C a -> Diagram b
- outLine :: Backend' b => Double -> Path V2 Double -> Diagram b
- bgdashingG :: (Semigroup a, HasStyle a, InSpace V2 Double a) => [Double] -> Double -> AlphaColour Double -> a -> a
- dashes :: [Double]
- dashoffset :: Double
- gridDashing :: (Semigroup a, HasStyle a, InSpace V2 Double a) => a -> a
- irregularGridPaths :: Grid C a -> (Path V2 Double, Path V2 Double)
- irregPathToVertices :: (Path V2 Double, Path V2 Double) -> (Set (P2 Double), Set (P2 Double), Set (P2 Double))
- onGrid :: (Transformable a, Monoid a, InSpace V2 Double a) => Double -> Double -> (t -> a) -> [(Coord, t)] -> a
- placeGrid :: (ToPoint k, HasOrigin a, Monoid a, InSpace V2 Double a) => Grid k a -> a
- placeGrid' :: (HasOrigin a, Monoid a, InSpace V2 Double a) => Grid (P2 Double) a -> a
- edge :: ToPoint k => Edge k -> Path V2 Double
- midPoint :: (AffineSpace k, Diff k ~ (Int, Int), ToPoint k) => Edge k -> P2 Double
- edgeStyle :: (HasStyle a, InSpace V2 Double a) => a -> a
- thinEdgeStyle :: (HasStyle a, InSpace V2 Double a) => a -> a
- drawEdges :: (ToPoint k, Backend' b) => [Edge k] -> Diagram b
- drawThinEdges :: (ToPoint k, Backend' b) => [Edge k] -> Diagram b
- drawAreas :: (Backend' b, Eq a) => Grid C a -> Diagram b
- fillBG :: Backend' b => Colour Double -> Diagram b
- shadeGrid :: Backend' b => Grid C (Maybe (Colour Double)) -> Diagram b
- drawShade :: Backend' b => Grid C Bool -> Diagram b
- drawAreasGray :: Backend' b => Grid C Char -> Diagram b
- distrib :: (Transformable c, Monoid c, InSpace V2 Double c) => V2 Double -> (Int, Int) -> Double -> [c] -> c
Documentation
(.--.) :: AffineSpace p => p -> p -> Diff p Source #
bgdashingG :: (Semigroup a, HasStyle a, InSpace V2 Double a) => [Double] -> Double -> AlphaColour Double -> a -> a Source #
dashoffset :: Double Source #
irregularGridPaths :: Grid C a -> (Path V2 Double, Path V2 Double) Source #
`irregularGridPaths g` is a pair `(outer, inner)` of paths.
outer consists of the loops that make up the border of the
grid (assuming the grid is connected orthogonally). They are
reoriented to be compatible with outLine; for some reason,
reversePath on the immediate result does not work.
inner consists of the individual inner segments.
irregPathToVertices :: (Path V2 Double, Path V2 Double) -> (Set (P2 Double), Set (P2 Double), Set (P2 Double)) Source #