[commit: containers] master: Remove unexported D.IntMap.Lazy.insertWithKey' (72a0994)

[Ian Lynagh]

Repository : ssh://darcs.haskell.org//srv/darcs/packages/containers

On branch  : master

http://hackage.haskell.org/trac/ghc/changeset/72a0994faf6563e7646ffca41507bdd1d0efdb4b

>---------------------------------------------------------------

commit 72a0994faf6563e7646ffca41507bdd1d0efdb4b
Author: Johan Tibell <johan.tibell at gmail.com>
Date:   Mon Nov 21 16:48:13 2011 -0800

    Remove unexported D.IntMap.Lazy.insertWithKey'

>---------------------------------------------------------------

 Data/IntMap/Lazy.hs |   13 -------------
 1 files changed, 0 insertions(+), 13 deletions(-)

diff --git a/Data/IntMap/Lazy.hs b/Data/IntMap/Lazy.hs
index ef936c2..2572c25 100644
--- a/Data/IntMap/Lazy.hs
+++ b/Data/IntMap/Lazy.hs
@@ -437,19 +437,6 @@ insertWithKey f k x t = k `seq`
       | otherwise     -> join k (Tip k x) ky t
     Nil -> Tip k x
 
--- | Same as 'insertWithKey', but the combining function is applied strictly.
-insertWithKey' :: (Key -> a -> a -> a) -> Key -> a -> IntMap a -> IntMap a
-insertWithKey' f k x t = k `seq`
-    case t of
-      Bin p m l r
-        | nomatch k p m -> join k (Tip k x) p t
-        | zero k m      -> Bin p m (insertWithKey' f k x l) r
-        | otherwise     -> Bin p m l (insertWithKey' f k x r)
-      Tip ky y
-        | k==ky         -> let x' = f k x y in seq x' (Tip k x')
-        | otherwise     -> join k (Tip k x) ky t
-      Nil -> Tip k x
-
 -- | /O(min(n,W))/. The expression (@'insertLookupWithKey' f k x map@)
 -- is a pair where the first element is equal to (@'lookup' k map@)
 -- and the second element equal to (@'insertWithKey' f k x map@).