| definition: |
insNode :: Show a => LNode a -> Graph a b -> Graph a b insNode (v,l) = (([],v,l,[]):&) |
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- Insert a 'LNode' into the 'Graph'. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{(,)}) |-> {:&}}
|
| name: |
insNode |
| precedence: |
no precedence defined |
| result-values: |
{:&}
|
| signature: |
Prelude.Show a => (Prelude.Int, a) -> Graph a b -> Graph a b |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |