| definition: |
deqTail :: Queue a -> Queue a deqTail (S _ [] _ _) = empty deqTail (S lenf (_:fs) lenr r) = deqReverse (check lenr r (lenf - 1) fs) |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- Removes an element at the front of the queue. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({S}) |-> {S}}
|
| name: |
deqTail |
| precedence: |
no precedence defined |
| result-values: |
{S}
|
| signature: |
Queue a -> Queue a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |