| definition: |
matchAny :: Graph a b -> GDecomp a b
matchAny (Gr g)
| Data.Map.null g = error "Match Exception, Empty Graph"
| otherwise = case head (toPreOrderList g) of
(v,_) -> case match v (Gr g) of
(Just c,g') -> (c,g')
|
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Gr}) |-> {(,)}}
|
| name: |
matchAny |
| precedence: |
no precedence defined |
| result-values: |
{(,)}
|
| signature: |
Graph a b -> (([(b, Prelude.Int)], Prelude.Int, a, [(b, Prelude.Int)]), Graph a b) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |