| definition: |
deqLength :: Queue _ -> Int deqLength (S lenf _ lenr _) = lenf + lenr |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- Returns the number of elements in the queue. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({S}) |-> _}
|
| name: |
deqLength |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Queue a -> Prelude.Int |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |