| definition: |
minFM :: FM a b -> Maybe (a,b)
minFM = min . tree
where
min EmptyFM = Nothing
min (BranchFM k x _ l _) | isBranchFM l = min l
| otherwise = Just (k,x)
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Retrieves the smallest key/element pair in the finite map --- according to the basic key ordering. |
| failfree: |
() |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{() |-> {.._#lambda508}}
|
| name: |
minFM |
| precedence: |
no precedence defined |
| result-values: |
{.._#lambda508}
|
| signature: |
FM a b -> Prelude.Maybe (a, b) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
possibly non-reducible on same data term |