| Safe Haskell | None |
|---|
Data.DiscreteSpaceMap
Documentation
class Eq p => Pos p whereSource
To be a key in the map, a position needs to be convertible to and from a stream of bits.
Map is a zipper on an infinite perfect binary tree.
It contains the position and value of the focus.
The other values are stored in the derivative of a perfect binary tree.
Functions that combine 2 maps like zipWith, zipWithKey and <@> preserve the focus position of the second argument.
Constructors
| Map !p !a (MapD a) |
Instances
| Pos p => ComonadStore p (Map p) |
|
| Functor (Map p) | |
| Foldable (Map p) | |
| Traversable (Map p) | |
| Comonad (Map p) |
|
| Pos p => ComonadApply (Map p) | ( |
| Pos p => Keyed (Map p) | |
| Pos p => Zip (Map p) | |
| Pos p => ZipWithKey (Map p) | |
| Pos p => Indexable (Map p) | |
| Pos p => Lookup (Map p) | |
| Pos p => Adjustable (Map p) | |
| Pos p => FoldableWithKey (Map p) | |
| Pos p => FoldableWithKey1 (Map p) | |
| Pos p => TraversableWithKey (Map p) | |
| Pos p => TraversableWithKey1 (Map p) | |
| Pos p => Representable (Map p) | |
| Traversable1 (Map p) | |
| Foldable1 (Map p) | |
| (Show p, Show a) => Show (Map p a) |