Language.Hasmtlib.Type.ArrayMap

Documentation

class ArrayMap f k v where

Class that allows access to a map-like array where any value is either the default value or an overwritten values. Every index has a value by default. Values at indices can be overwritten manually.

Based on McCarthy`s basic array theory.

Therefore the following axioms must hold:

1. forall A i x: arrSelect (store A i x) == x
2. forall A i j x: i /= j ==> (arrSelect (arrStore A i x) j === arrSelect A j)

Methods

asConst' :: Proxy f -> Proxy k -> v -> f k v

viewConst :: f k v -> v

arrSelect :: f k v -> k -> v

arrStore :: f k v -> k -> v -> f k v

Instances

Ord k => ArrayMap ConstArray k v

Defined in Language.Hasmtlib.Type.ArrayMap

Methods

asConst' :: Proxy ConstArray -> Proxy k -> v -> ConstArray k v

viewConst :: ConstArray k v -> v

arrSelect :: ConstArray k v -> k -> v

arrStore :: ConstArray k v -> k -> v -> ConstArray k v

asConst :: forall f k v. ArrayMap f k v => v -> f k v

Wrapper for asConst' which hides the Proxy

data ConstArray k v

A map-like array with a default constant value and partially overwritten values.

Constructors

ConstArray

Fields

• _arrConst :: v
• _stored :: Map k v

Instances

Ord k => ArrayMap ConstArray k v

Defined in Language.Hasmtlib.Type.ArrayMap

Methods

asConst' :: Proxy ConstArray -> Proxy k -> v -> ConstArray k v

viewConst :: ConstArray k v -> v

arrSelect :: ConstArray k v -> k -> v

arrStore :: ConstArray k v -> k -> v -> ConstArray k v

Foldable (ConstArray k)

Defined in Language.Hasmtlib.Type.ArrayMap

Methods

fold :: Monoid m => ConstArray k m -> m

foldMap :: Monoid m => (a -> m) -> ConstArray k a -> m

foldMap' :: Monoid m => (a -> m) -> ConstArray k a -> m

foldr :: (a -> b -> b) -> b -> ConstArray k a -> b

foldr' :: (a -> b -> b) -> b -> ConstArray k a -> b

foldl :: (b -> a -> b) -> b -> ConstArray k a -> b

foldl' :: (b -> a -> b) -> b -> ConstArray k a -> b

foldr1 :: (a -> a -> a) -> ConstArray k a -> a

foldl1 :: (a -> a -> a) -> ConstArray k a -> a

toList :: ConstArray k a -> [a]

null :: ConstArray k a -> Bool

length :: ConstArray k a -> Int

elem :: Eq a => a -> ConstArray k a -> Bool

maximum :: Ord a => ConstArray k a -> a

minimum :: Ord a => ConstArray k a -> a

sum :: Num a => ConstArray k a -> a

product :: Num a => ConstArray k a -> a

Traversable (ConstArray k)

Defined in Language.Hasmtlib.Type.ArrayMap

Methods

traverse :: Applicative f => (a -> f b) -> ConstArray k a -> f (ConstArray k b)

sequenceA :: Applicative f => ConstArray k (f a) -> f (ConstArray k a)

mapM :: Monad m => (a -> m b) -> ConstArray k a -> m (ConstArray k b)

sequence :: Monad m => ConstArray k (m a) -> m (ConstArray k a)

Functor (ConstArray k)

Defined in Language.Hasmtlib.Type.ArrayMap

Methods

fmap :: (a -> b) -> ConstArray k a -> ConstArray k b

(<$) :: a -> ConstArray k b -> ConstArray k a

(Show v, Show k) => Show (ConstArray k v)

Defined in Language.Hasmtlib.Type.ArrayMap

Methods

showsPrec :: Int -> ConstArray k v -> ShowS

show :: ConstArray k v -> String

showList :: [ConstArray k v] -> ShowS

(Eq v, Eq k) => Eq (ConstArray k v)

Defined in Language.Hasmtlib.Type.ArrayMap

Methods

(==) :: ConstArray k v -> ConstArray k v -> Bool

(/=) :: ConstArray k v -> ConstArray k v -> Bool

(Ord v, Ord k) => Ord (ConstArray k v)

Defined in Language.Hasmtlib.Type.ArrayMap

Methods

compare :: ConstArray k v -> ConstArray k v -> Ordering

(<) :: ConstArray k v -> ConstArray k v -> Bool

(<=) :: ConstArray k v -> ConstArray k v -> Bool

(>) :: ConstArray k v -> ConstArray k v -> Bool

(>=) :: ConstArray k v -> ConstArray k v -> Bool

max :: ConstArray k v -> ConstArray k v -> ConstArray k v

min :: ConstArray k v -> ConstArray k v -> ConstArray k v

stored :: forall k v k. Lens (ConstArray k v) (ConstArray k v) (Map k v) (Map k v)

arrConst :: forall k v. Lens' (ConstArray k v) v