ADP.Fusion.Term.Edge.Type

Documentation

newtype From

Constructors

From

Fields

• getFrom :: Int

Instances

Eq From

Methods

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

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

Ord From

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

Methods

showsPrec :: Int -> From -> ShowS

show :: From -> String

showList :: [From] -> ShowS

newtype To

Constructors

To

Fields

• getTo :: Int

Instances

Eq To

Methods

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

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

Ord To

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

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

Associated Types

type Stack Edge :: *

Methods

build :: Edge -> Stack Edge

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

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

Associated Types

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

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

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

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

type Stack Edge = (:!:) S Edge

type TermArg Edge

type TermArg Edge = (:.) From To

data Elm ((:!:) ls Edge)

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

type Arg ((:!:) ls Edge)

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