ADP.Fusion.Core.Term.Edge

Documentation

newtype From

Constructors

From

Fields

• getFrom :: Int

Instances

Eq From

Defined in ADP.Fusion.Core.Term.Edge

Methods

(==) :: From -> From -> Bool

(/=) :: From -> From -> Bool

Ord From

Defined in ADP.Fusion.Core.Term.Edge

Methods

compare :: From -> From -> Ordering

(<) :: From -> From -> Bool

(<=) :: From -> From -> Bool

(>) :: From -> From -> Bool

(>=) :: From -> From -> Bool

max :: From -> From -> From

min :: From -> From -> From

Show From

Defined in ADP.Fusion.Core.Term.Edge

Methods

showsPrec :: Int -> From -> ShowS

show :: From -> String

showList :: [From] -> ShowS

newtype To

Constructors

To

Fields

• getTo :: Int

Instances

Eq To

Defined in ADP.Fusion.Core.Term.Edge

Methods

(==) :: To -> To -> Bool

(/=) :: To -> To -> Bool

Ord To

Defined in ADP.Fusion.Core.Term.Edge

Methods

compare :: To -> To -> Ordering

(<) :: To -> To -> Bool

(<=) :: To -> To -> Bool

(>) :: To -> To -> Bool

(>=) :: To -> To -> Bool

max :: To -> To -> To

min :: To -> To -> To

Show To

Defined in ADP.Fusion.Core.Term.Edge

Methods

showsPrec :: Int -> To -> ShowS

show :: To -> String

showList :: [To] -> ShowS

data Edge

An edge in a graph. As a parsing symbol, it will provide (From:.To) pairs.

Constructors

Edge

Instances

Build Edge

Defined in ADP.Fusion.Core.Term.Edge

Associated Types

type Stack Edge :: Type

Methods

build :: Edge -> Stack Edge

(Show i, Show (RunningIndex i), Show (Elm ls i)) => Show (Elm (ls :!: Edge) i)

Defined in ADP.Fusion.Core.Term.Edge

Methods

showsPrec :: Int -> Elm (ls :!: Edge) i -> ShowS

show :: Elm (ls :!: Edge) i -> String

showList :: [Elm (ls :!: Edge) i] -> ShowS

Element ls i => Element (ls :!: Edge) i

Defined in ADP.Fusion.Core.Term.Edge

Associated Types

data Elm (ls :!: Edge) i :: Type

type RecElm (ls :!: Edge) i :: Type

type Arg (ls :!: Edge) :: Type

Methods

getArg :: Elm (ls :!: Edge) i -> Arg (ls :!: Edge)

getIdx :: Elm (ls :!: Edge) i -> RunningIndex i

getElm :: Elm (ls :!: Edge) i -> RecElm (ls :!: Edge) i

type Stack Edge

Defined in ADP.Fusion.Core.Term.Edge

type Stack Edge = S :!: Edge

type TermArg Edge

Defined in ADP.Fusion.Core.Term.Edge

type TermArg Edge = From :. To

data Elm (ls :!: Edge) i

Defined in ADP.Fusion.Core.Term.Edge

data Elm (ls :!: Edge) i = ElmEdge !(From :. To) !(RunningIndex i) !(Elm ls i)

type Arg (ls :!: Edge)

Defined in ADP.Fusion.Core.Term.Edge

type Arg (ls :!: Edge) = Arg ls :. (From :. To)

class EdgeFromTo k where

edgeFromTo creates a (From:.To) structure for edges. How this is filled depends on the Proxy. Possible are Proxy First and Proxy Last. First denotes that To is the first node to be visited. I.e. First(From) → Set(To). Last on the other hand is Set(From) → Last(To).

Methods

edgeFromTo :: Proxy k -> SetBoundary -> NewBoundary -> From :. To

Instances

EdgeFromTo First

In case our sets have a First boundary, then we always point from the boundary "into" the set. Hence SetNode == To and NewNode == From.

{1,2,(3)} <- (4) yields From 4 :. To 3. Note the arrow direction INTO the set.

Defined in ADP.Fusion.Core.Term.Edge

Methods

edgeFromTo :: Proxy First -> SetBoundary -> NewBoundary -> From :. To

EdgeFromTo Last

And if the set has a Last boundary, then we point from somewhere in the set To the NewNode, which is Last.

{1,2,(3)} -> (4) yields From 3 :. To 4. Note the arrow direction OUT OF the set.

Defined in ADP.Fusion.Core.Term.Edge

Methods

edgeFromTo :: Proxy Last -> SetBoundary -> NewBoundary -> From :. To

newtype SetBoundary

Constructors

SetBoundary Int

newtype NewBoundary

Constructors

NewBoundary Int