| definition: |
cons :: a -> Queue a -> Queue a cons x (S lenf f lenr r) = check (lenf + 1) (x : f) lenr r |
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- Inserts an element at the front of the queue. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{S}) |-> {S}}
|
| name: |
cons |
| precedence: |
no precedence defined |
| result-values: |
{S}
|
| signature: |
a -> 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 |