| definition: |
outdeg :: Graph _ _ -> Node -> Int outdeg = length .: context4 |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- The outward-bound degree of the 'Node'. |
| failfree: |
() |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{() |-> _}
|
| name: |
outdeg |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Graph a b -> Prelude.Int -> Prelude.Int |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |