| definition: |
lab :: Graph a _ -> Node -> Maybe a lab g v = fst (match v g) >>= Just . lab' |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- Find the label for a 'Node'. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
lab |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Graph a b -> Prelude.Int -> Prelude.Maybe a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |