|
definition:
|
edge :: Data t => Edge t -> Grappa t ()
edge e g | g =:= (g1 ++ e:g2) = ((), g1 ++ g2)
where g1, g2 free
|
|
demand:
|
argument 3
|
|
deterministic:
|
possibly non-deterministic operation
|
|
documentation:
|
--- The parser `edge e` succeeds only if the given edge `e` is part of the
--- given input graph `g`.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_) |-> {(,)}}
|
|
name:
|
edge
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{(,)}
|
|
signature:
|
Prelude.Data a => (a, [Prelude.Int]) -> [(a, [Prelude.Int])]
-> ((), [(a, [Prelude.Int])])
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|