| definition: |
splitFM :: Eq a => FM a b -> a -> Maybe (FM a b,(a,b)) splitFM g v = maybe Nothing (\x->Just (delFromFM g v,(v,x))) (lookupFM g v) |
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- Combines delFrom and lookup. |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_) |-> _}
|
| name: |
splitFM |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Eq a => FM a b -> a -> Prelude.Maybe (FM a b, (a, b)) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |