| definition: |
adjust :: Ord k => (a -> a) -> k -> Map k a -> Map k a
adjust _ _ Tip = Tip
adjust f i (Bin k x h l r)
| i == k = Bin k (f x) h l r
| i < k = Bin k x h (adjust f i l) r
| otherwise = Bin k x h l (adjust f i r)
|
| demand: |
argument 4 |
| deterministic: |
deterministic operation |
| documentation: |
--- Applies a function to element bound to given key. |
| failfree: |
(_, _, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_,{Tip}) |-> {Tip} || (_,_,_,{Bin}) |-> {Bin}}
|
| name: |
adjust |
| precedence: |
no precedence defined |
| result-values: |
{Bin,Tip}
|
| signature: |
Prelude.Ord b => (a -> a) -> b -> Map b a -> Map b a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
possibly non-reducible on same data term |