| definition: |
splitLookup :: Ord k => k -> Map k a -> (Map k a, Maybe a, Map k a)
splitLookup _ Tip = (Tip, Nothing, Tip)
splitLookup i (Bin k a _ m_l m_r)
| i == k = (m_l, Just a, m_r)
| i < k = let (m_l', v, m_r') = splitLookup i m_l
in (m_l', v, glueBal m_r' m_r)
| otherwise = let (m_l', v, m_r') = splitLookup i m_r
in (glueBal m_l m_l', v, m_r')
|
| demand: |
argument 3 |
| deterministic: |
deterministic operation |
| documentation: |
--- Combines delFrom and lookup. |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,{Tip}) |-> {(,,)} || (_,_,{Bin}) |-> {(,,)}}
|
| name: |
splitLookup |
| precedence: |
no precedence defined |
| result-values: |
{(,,)}
|
| signature: |
Prelude.Ord a => a -> Map a b -> (Map a b, Prelude.Maybe b, Map a b) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |