Data.DiscreteSpaceMap.Internal

Documentation

class Eq p => Pos p where

To be a key in the map, a position needs to be convertible to and from a stream of bits.

Minimal complete definition

uncons, cons, zero

Methods

uncons :: p -> (p, Bool)

cons :: (p, Bool) -> p

cons . uncons == id 

zero :: p

uncons zero == (zero, False)

Instances

Pos Integer

1D discrete space

Methods

uncons :: Integer -> (Integer, Bool)

cons :: (Integer, Bool) -> Integer

zero :: Integer

Pos [Bool]

[Bool] is the free instance of Pos.

Methods

uncons :: [Bool] -> ([Bool], Bool)

cons :: ([Bool], Bool) -> [Bool]

zero :: [Bool]

Pos p => Pos (p, p)

2D discrete space

Methods

uncons :: (p, p) -> ((p, p), Bool)

cons :: ((p, p), Bool) -> (p, p)

zero :: (p, p)

Pos p => Pos (p, p, p)

3D discrete space

Methods

uncons :: (p, p, p) -> ((p, p, p), Bool)

cons :: ((p, p, p), Bool) -> (p, p, p)

zero :: (p, p, p)

data MapD a

Constructors

MapD a (MapD (a, a))

Instances

Functor MapD

Methods

fmap :: (a -> b) -> MapD a -> MapD b

(<$) :: a -> MapD b -> MapD a

Foldable MapD

Methods

fold :: Monoid m => MapD m -> m

foldMap :: Monoid m => (a -> m) -> MapD a -> m

foldr :: (a -> b -> b) -> b -> MapD a -> b

foldr' :: (a -> b -> b) -> b -> MapD a -> b

foldl :: (b -> a -> b) -> b -> MapD a -> b

foldl' :: (b -> a -> b) -> b -> MapD a -> b

foldr1 :: (a -> a -> a) -> MapD a -> a

foldl1 :: (a -> a -> a) -> MapD a -> a

toList :: MapD a -> [a]

null :: MapD a -> Bool

length :: MapD a -> Int

elem :: Eq a => a -> MapD a -> Bool

maximum :: Ord a => MapD a -> a

minimum :: Ord a => MapD a -> a

sum :: Num a => MapD a -> a

product :: Num a => MapD a -> a

Traversable MapD

Methods

traverse :: Applicative f => (a -> f b) -> MapD a -> f (MapD b)

sequenceA :: Applicative f => MapD (f a) -> f (MapD a)

mapM :: Monad m => (a -> m b) -> MapD a -> m (MapD b)

sequence :: Monad m => MapD (m a) -> m (MapD a)

Traversable1 MapD

Methods

traverse1 :: Apply f => (a -> f b) -> MapD a -> f (MapD b)

sequence1 :: Apply f => MapD (f b) -> f (MapD b)

Foldable1 MapD

Methods

fold1 :: Semigroup m => MapD m -> m

foldMap1 :: Semigroup m => (a -> m) -> MapD a -> m

Show a => Show (MapD a)

Methods

showsPrec :: Int -> MapD a -> ShowS

show :: MapD a -> String

showList :: [MapD a] -> ShowS

gotoD :: Pos p => p -> p -> (a, MapD a) -> (a, MapD a)

tabulateD :: Pos p => (p -> a) -> MapD a

cotraverseD :: Functor f => (f a -> b) -> f (MapD a) -> MapD b

zipWithKeyD :: Pos p => (p -> a -> b -> c) -> p -> MapD a -> MapD b -> MapD c

traverseWithKey1D :: (Pos p, Apply f) => (p -> a -> f b) -> p -> MapD a -> f (MapD b)