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