| definition: |
deqHead :: Queue a -> a deqHead (S lenf f _ r) = head (if lenf == 0 then r else f) |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- The first element of the queue. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({S}) |-> _}
|
| name: |
deqHead |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Queue a -> a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
possibly non-reducible on same data term |