| definition: |
matchLast :: Queue a -> Maybe (a,Queue a) matchLast (S _ [] _ [] ) = Nothing matchLast (S _ [x] _ [] ) = Just (x, empty) matchLast (S _ (_:_:_) _ [] ) = error $ "Data.Queue.matchLast: illegal queue" matchLast (S lenf f lenr (x:xs)) = Just (x, check lenf f (lenr - 1) xs) |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- Matches the end of a queue. --- `matchLast q` is equivalent to --- `if isEmpty q then Nothing else Just (deqLast q,deqInit q)` --- but more efficient. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({S}) |-> _}
|
| name: |
matchLast |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Queue a -> Prelude.Maybe (a, Queue a) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |