CurryInfo: containers-3.0.0 / Data.Map.insertWith

insertWith :: Ord k => (a -> a -> a)
           -> k -> a -> Map k a -> Map k a
insertWith _ k a Tip = singleton k a
insertWith combiner new_k new_a (Bin k a sizeM m_l m_r)
  = if new_k < k
    then mkBalBranch k a (insertWith combiner new_k new_a m_l) m_r
    else
      if new_k == k
      then Bin new_k (combiner a new_a) sizeM m_l m_r
      else mkBalBranch k a m_l (insertWith combiner new_k new_a m_r)

argument 5

deterministic operation

--- Instead of throwing away the old binding,
--- insertWith combines the new element with the old one.
--- @param combiner a function combining to elements
--- @param k the key of the elements to be combined
--- @param a the new element
--- @param m a map
--- @result a modified map

(_, _, _, _, _)

referentially transparent operation

no fixity defined

{(_,_,_,_,{Tip}) |-> {Bin} || (_,_,_,_,{Bin}) |-> {Bin}}

insertWith

no precedence defined

{Bin}

Prelude.Ord b => (a -> a -> a) -> b -> a -> Map b a -> Map b a

operation might suspend on free variables

possibly non-terminating

possibly non-reducible on same data term