| definition: |
match :: Node -> Graph a b -> Decomp a b
match v (Gr g) =
maybe
(Nothing,Gr g)
(\ (g',(_,(p,l,s))) ->
let s' = filter ((/=v) . snd) s
p' = filter ((/=v) . snd) p
g1 = updAdj g' s' (clearPred v)
g2 = updAdj g1 p' (clearSucc v)
in (Just (p',v,l,s),Gr g2))
(maybe Nothing (\x -> Just (delete v g, (v,x))) (Data.Map.lookup v g))
|
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- match is the complement side of (:&), decomposing a 'Graph' into the --- 'MContext' found for the given node and the remaining 'Graph'. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{Gr}) |-> _}
|
| name: |
match |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Int -> Graph a b -> (Prelude.Maybe ([(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 |