Data.Equality.Graph.Nodes

Module defining e-nodes (ENode), the e-node function symbol (Operator), and mappings from e-nodes (NodeMap).

E-node

newtype ENode (l :: Type -> Type)

An e-node is a function symbol paired with a list of children e-classes.

We define an e-node to be the base functor of some recursive data type parametrized over ClassId, i.e. all recursive fields are rather e-class ids.

Constructors

Node

Fields

• unNode :: l ClassId

Instances

Show (l ClassId) => Show (ENode l)

Defined in Data.Equality.Graph.Nodes

Methods

showsPrec :: Int -> ENode l -> ShowS

show :: ENode l -> String

showList :: [ENode l] -> ShowS

Eq (l ClassId) => Eq (ENode l)

Defined in Data.Equality.Graph.Nodes

Methods

(==) :: ENode l -> ENode l -> Bool

(/=) :: ENode l -> ENode l -> Bool

Ord (l ClassId) => Ord (ENode l)

Defined in Data.Equality.Graph.Nodes

Methods

compare :: ENode l -> ENode l -> Ordering

(<) :: ENode l -> ENode l -> Bool

(<=) :: ENode l -> ENode l -> Bool

(>) :: ENode l -> ENode l -> Bool

(>=) :: ENode l -> ENode l -> Bool

max :: ENode l -> ENode l -> ENode l

min :: ENode l -> ENode l -> ENode l

children :: forall (l :: Type -> Type). Traversable l => ENode l -> [ClassId]

Get the children e-class ids of an e-node

Operator

newtype Operator (l :: Type -> Type)

An operator is solely the function symbol part of the e-node. Basically, this means children e-classes are ignored.

Constructors

Operator

Fields

• unOperator :: l ()

Instances

Show (l ()) => Show (Operator l)

Defined in Data.Equality.Graph.Nodes

Methods

showsPrec :: Int -> Operator l -> ShowS

show :: Operator l -> String

showList :: [Operator l] -> ShowS

Eq (l ()) => Eq (Operator l)

Defined in Data.Equality.Graph.Nodes

Methods

(==) :: Operator l -> Operator l -> Bool

(/=) :: Operator l -> Operator l -> Bool

Ord (l ()) => Ord (Operator l)

Defined in Data.Equality.Graph.Nodes

Methods

compare :: Operator l -> Operator l -> Ordering

(<) :: Operator l -> Operator l -> Bool

(<=) :: Operator l -> Operator l -> Bool

(>) :: Operator l -> Operator l -> Bool

(>=) :: Operator l -> Operator l -> Bool

max :: Operator l -> Operator l -> Operator l

min :: Operator l -> Operator l -> Operator l

operator :: forall (l :: Type -> Type). Traversable l => ENode l -> Operator l

Get the operator (function symbol) of an e-node

Node Map

newtype NodeMap (l :: Type -> Type) a

A mapping from e-nodes of l to a

Constructors

NodeMap

Fields

• unNodeMap :: Map (ENode l) a

Instances

Foldable (NodeMap l)

Defined in Data.Equality.Graph.Nodes

Methods

fold :: Monoid m => NodeMap l m -> m

foldMap :: Monoid m => (a -> m) -> NodeMap l a -> m

foldMap' :: Monoid m => (a -> m) -> NodeMap l a -> m

foldr :: (a -> b -> b) -> b -> NodeMap l a -> b

foldr' :: (a -> b -> b) -> b -> NodeMap l a -> b

foldl :: (b -> a -> b) -> b -> NodeMap l a -> b

foldl' :: (b -> a -> b) -> b -> NodeMap l a -> b

foldr1 :: (a -> a -> a) -> NodeMap l a -> a

foldl1 :: (a -> a -> a) -> NodeMap l a -> a

toList :: NodeMap l a -> [a]

null :: NodeMap l a -> Bool

length :: NodeMap l a -> Int

elem :: Eq a => a -> NodeMap l a -> Bool

maximum :: Ord a => NodeMap l a -> a

minimum :: Ord a => NodeMap l a -> a

sum :: Num a => NodeMap l a -> a

product :: Num a => NodeMap l a -> a

Traversable (NodeMap l)

Defined in Data.Equality.Graph.Nodes

Methods

traverse :: Applicative f => (a -> f b) -> NodeMap l a -> f (NodeMap l b)

sequenceA :: Applicative f => NodeMap l (f a) -> f (NodeMap l a)

mapM :: Monad m => (a -> m b) -> NodeMap l a -> m (NodeMap l b)

sequence :: Monad m => NodeMap l (m a) -> m (NodeMap l a)

Functor (NodeMap l)

Defined in Data.Equality.Graph.Nodes

Methods

fmap :: (a -> b) -> NodeMap l a -> NodeMap l b

(<$) :: a -> NodeMap l b -> NodeMap l a

Ord (l ClassId) => Monoid (NodeMap l a)

Defined in Data.Equality.Graph.Nodes

Methods

mempty :: NodeMap l a

mappend :: NodeMap l a -> NodeMap l a -> NodeMap l a

mconcat :: [NodeMap l a] -> NodeMap l a

Ord (l ClassId) => Semigroup (NodeMap l a)

Defined in Data.Equality.Graph.Nodes

Methods

(<>) :: NodeMap l a -> NodeMap l a -> NodeMap l a

sconcat :: NonEmpty (NodeMap l a) -> NodeMap l a

stimes :: Integral b => b -> NodeMap l a -> NodeMap l a

(Show a, Show (l ClassId)) => Show (NodeMap l a)

Defined in Data.Equality.Graph.Nodes

Methods

showsPrec :: Int -> NodeMap l a -> ShowS

show :: NodeMap l a -> String

showList :: [NodeMap l a] -> ShowS

insertNM :: forall (l :: Type -> Type) a. Ord (l ClassId) => ENode l -> a -> NodeMap l a -> NodeMap l a

Insert a value given an e-node in a NodeMap

lookupNM :: forall (l :: Type -> Type) a. Ord (l ClassId) => ENode l -> NodeMap l a -> Maybe a

Lookup an e-node in a NodeMap

deleteNM :: forall (l :: Type -> Type) a. Ord (l ClassId) => ENode l -> NodeMap l a -> NodeMap l a

Delete an e-node in a NodeMap

insertLookupNM :: forall (l :: Type -> Type) a. Ord (l ClassId) => ENode l -> a -> NodeMap l a -> (Maybe a, NodeMap l a)

Insert a value and lookup by e-node in a NodeMap

foldlWithKeyNM' :: forall (l :: Type -> Type) b a. Ord (l ClassId) => (b -> ENode l -> a -> b) -> b -> NodeMap l a -> b

As foldlWithKeyNM' but in a NodeMap

foldrWithKeyNM' :: forall (l :: Type -> Type) a b. Ord (l ClassId) => (ENode l -> a -> b -> b) -> b -> NodeMap l a -> b

As foldrWithKeyNM' but in a NodeMap

sizeNM :: forall (l :: Type -> Type) a. NodeMap l a -> Int

Get the number of entries in a NodeMap.

This operation takes constant time (O(1))

traverseWithKeyNM :: forall t (l :: Type -> Type) a b. Applicative t => (ENode l -> a -> t b) -> NodeMap l a -> t (NodeMap l b)

As traverseWithKeyNM but in a NodeMap