| definition: |
gelem :: Node -> Graph _ _ -> Bool gelem v g = isJust (fst (match v g)) |
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- 'True' if the 'Node' is present in the 'Graph'. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> {False,True}}
|
| name: |
gelem |
| precedence: |
no precedence defined |
| result-values: |
{False,True}
|
| signature: |
Prelude.Int -> Graph a b -> Prelude.Bool |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |