ADPfusion-0.5.2.2: Efficient, high-level dynamic programming.
ADP.Fusion.Term.Edge.Type
Synopsis
newtype From Source #
Constructors
Fields
Instances
Methods
(==) :: From -> From -> Bool #
(/=) :: From -> From -> Bool #
compare :: From -> From -> Ordering #
(<) :: From -> From -> Bool #
(<=) :: From -> From -> Bool #
(>) :: From -> From -> Bool #
(>=) :: From -> From -> Bool #
max :: From -> From -> From #
min :: From -> From -> From #
showsPrec :: Int -> From -> ShowS #
show :: From -> String #
showList :: [From] -> ShowS #
newtype To Source #
(==) :: To -> To -> Bool #
(/=) :: To -> To -> Bool #
compare :: To -> To -> Ordering #
(<) :: To -> To -> Bool #
(<=) :: To -> To -> Bool #
(>) :: To -> To -> Bool #
(>=) :: To -> To -> Bool #
max :: To -> To -> To #
min :: To -> To -> To #
showsPrec :: Int -> To -> ShowS #
show :: To -> String #
showList :: [To] -> ShowS #
data Edge Source #
An edge in a graph. As a parsing symbol, it will provide (From:.To) pairs.
Associated Types
type Stack Edge :: * Source #
build :: Edge -> Stack Edge Source #
showsPrec :: Int -> Elm (ls :!: Edge) i -> ShowS #
show :: Elm (ls :!: Edge) i -> String #
showList :: [Elm (ls :!: Edge) i] -> ShowS #
data Elm ((:!:) ls Edge) i :: * Source #
type RecElm ((:!:) ls Edge) i :: * Source #
type Arg ((:!:) ls Edge) :: * Source #
getArg :: Elm (ls :!: Edge) i -> Arg (ls :!: Edge) Source #
getIdx :: Elm (ls :!: Edge) i -> RunningIndex i Source #
getElm :: Elm (ls :!: Edge) i -> RecElm (ls :!: Edge) i Source #