| definition: |
newNodes :: Int -> Graph _ _ -> [Node] newNodes i g = [n+1..n+i] where (_,n) = nodeRange g |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- List N available 'Node's, ie 'Node's that are not used in the 'Graph'. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> {:,[]}}
|
| name: |
newNodes |
| precedence: |
no precedence defined |
| result-values: |
{:,[]}
|
| signature: |
Prelude.Int -> Graph a b -> [Prelude.Int] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |