Data.Type.Map

Documentation

data Mapping k v

A key-value pair

Constructors

k :-> v infixr 4

Instances

Submap s t => Submap s ((:) (Mapping Symbol *) x t)

Split s t st => Split s ((:) (Mapping Symbol *) x t) ((:) (Mapping Symbol *) x st)

(KnownSymbol k, Show v, Show' (Map s)) => Show (Map ((:) (Mapping Symbol *) ((:->) Symbol * k v) s))

Show (Map ([] (Mapping Symbol *)))

Nubable ([] (Mapping Symbol *))

Submap ([] (Mapping Symbol *)) ([] (Mapping Symbol *))

Split ([] (Mapping Symbol *)) ([] (Mapping Symbol *)) ([] (Mapping Symbol *))

((~) [Mapping Symbol *] (Nub Symbol * ((:) (Mapping Symbol *) e ((:) (Mapping Symbol *) f s))) ((:) (Mapping Symbol *) e (Nub Symbol * ((:) (Mapping Symbol *) f s))), Nubable ((:) (Mapping Symbol *) f s)) => Nubable ((:) (Mapping Symbol *) e ((:) (Mapping Symbol *) f s))

Nubable ((:) (Mapping Symbol *) e ([] (Mapping Symbol *)))

(Combinable v v', Nubable ((:) (Mapping Symbol *) ((:->) Symbol * k (Combine * v v')) s)) => Nubable ((:) (Mapping Symbol *) ((:->) Symbol * k v) ((:) (Mapping Symbol *) ((:->) Symbol * k v') s))

Split s t st => Split ((:) (Mapping Symbol *) x s) t ((:) (Mapping Symbol *) x st)

Submap s t => Submap ((:) (Mapping Symbol *) x s) ((:) (Mapping Symbol *) x t)

Split s t st => Split ((:) (Mapping Symbol *) x s) ((:) (Mapping Symbol *) x t) ((:) (Mapping Symbol *) x st)

type Cmp (Mapping Symbol k) ((:->) Symbol k k1 v) ((:->) Symbol k k' v') = CmpSymbol k1 k'

type Union m n = Nub (Sort (m :++ n))

Union of two finite maps

type Unionable s t = (Nubable (Sort (s :++ t)), Sortable (s :++ t))

union :: Unionable s t => Map s -> Map t -> Map (Union s t)

Union of two finite maps

data Var k

Pair a symbol (representing a variable) with a type

Constructors

Var

Instances

KnownSymbol k => Show (Var k)

data Map n where

A value-level heterogenously-typed Map (with type-level representation in terms of lists)

Constructors

Empty :: Map `[]`

Ext :: Var k -> v -> Map m -> Map ((k :-> v) : m)

Instances

(KnownSymbol k, Show v, Show' (Map s)) => Show (Map ((:) (Mapping Symbol *) ((:->) Symbol * k v) s))

Show (Map ([] (Mapping Symbol *)))

type family Combine a b :: v

Open type family for combining values in a map (that have the same key)

class Combinable t t' where

Methods

combine :: t -> t' -> Combine t t'

type family Cmp a b :: Ordering

Open-family for the ordering operation in the sort

Instances

type Cmp Symbol k k' = CmpSymbol k k'

type Cmp (Mapping Symbol k) ((:->) Symbol k k1 v) ((:->) Symbol k k' v') = CmpSymbol k1 k'

class Nubable t where

Methods

nub :: Map t -> Map (Nub t)

Instances

Nubable ([] (Mapping Symbol *))

((~) [Mapping Symbol *] (Nub Symbol * ((:) (Mapping Symbol *) e ((:) (Mapping Symbol *) f s))) ((:) (Mapping Symbol *) e (Nub Symbol * ((:) (Mapping Symbol *) f s))), Nubable ((:) (Mapping Symbol *) f s)) => Nubable ((:) (Mapping Symbol *) e ((:) (Mapping Symbol *) f s))

Nubable ((:) (Mapping Symbol *) e ([] (Mapping Symbol *)))

(Combinable v v', Nubable ((:) (Mapping Symbol *) ((:->) Symbol * k (Combine * v v')) s)) => Nubable ((:) (Mapping Symbol *) ((:->) Symbol * k v) ((:) (Mapping Symbol *) ((:->) Symbol * k v') s))

type family Lookup m c :: Maybe v

Lookup elements from a map

Equations

Lookup `[]` k = Nothing

Lookup ((k :-> v) : m) k = Just v

Lookup (kvp : m) k = Lookup m k

type family Member c m :: Bool

Membership test

Equations

Member k `[]` = False

Member k ((k :-> v) : m) = True

Member k (kvp : m) = Member k m

type family m :\ c :: [Mapping k v]

Delete elements from a map by key

Equations

`[]` :\ k = `[]`

((k :-> v) : m) :\ k = m :\ k

(kvp : m) :\ k = kvp : (m :\ k)

class Split s t st where

Splitting a union of maps, given the maps we want to split it into

Methods

split :: Map st -> (Map s, Map t)

Instances

Split s t st => Split s ((:) (Mapping Symbol *) x t) ((:) (Mapping Symbol *) x st)

Split ([] (Mapping Symbol *)) ([] (Mapping Symbol *)) ([] (Mapping Symbol *))

Split s t st => Split ((:) (Mapping Symbol *) x s) t ((:) (Mapping Symbol *) x st)

Split s t st => Split ((:) (Mapping Symbol *) x s) ((:) (Mapping Symbol *) x t) ((:) (Mapping Symbol *) x st)

type IsMap s = s ~ Nub (Sort s)

Predicate to check if in normalised map form

type AsMap s = Nub (Sort s)

At the type level, normalise the list form to the map form

asMap :: (Sortable s, Nubable (Sort s)) => Map s -> Map (AsMap s)

At the value level, noramlise the list form to the map form

class Submap s t where

Construct a submap s from a supermap t

Methods

submap :: Map t -> Map s

Instances

Submap s t => Submap s ((:) (Mapping Symbol *) x t)

Submap ([] (Mapping Symbol *)) ([] (Mapping Symbol *))

Submap s t => Submap ((:) (Mapping Symbol *) x s) ((:) (Mapping Symbol *) x t)