| definition: |
nodeRange :: Graph _ _ -> (Node,Node) nodeRange (Gr g) | Data.Map.null g = (0,0) | otherwise = (ix (lookupMin g),ix (lookupMax g)) where ix = fst . fromJust |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- The minimum and maximum 'Node' in a 'Graph'. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Gr}) |-> {(,)}}
|
| name: |
nodeRange |
| precedence: |
no precedence defined |
| result-values: |
{(,)}
|
| signature: |
Graph a b -> (Prelude.Int, Prelude.Int) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
possibly non-reducible on same data term |