2 % (c) The AQUA Project, Glasgow University, 1994-1996
4 \section[FiniteMap]{An implementation of finite maps}
6 ``Finite maps'' are the heart of the compiler's
7 lookup-tables/environments and its implementation of sets. Important
10 This code is derived from that in the paper:
13 "Efficient sets: a balancing act"
14 Journal of functional programming 3(4) Oct 1993, pp553-562
17 The code is SPECIALIZEd to various highly-desirable types (e.g., Id)
21 #include "HsVersions.h"
22 #define IF_NOT_GHC(a) {--}
24 #if defined(DEBUG_FINITEMAPS)/* NB NB NB */
25 #define OUTPUTABLE_key , Outputable key
27 #define OUTPUTABLE_key {--}
31 FiniteMap, -- abstract type
33 emptyFM, unitFM, listToFM,
51 sizeFM, isEmptyFM, elemFM, lookupFM, lookupWithDefaultFM,
53 fmToList, keysFM, eltsFM
56 , SYN_IE(FiniteSet), emptySet, mkSet, isEmptySet
57 , elementOf, setToList, union, minusSet
61 #if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ <= 201
62 IMPORT_DELOOPER(SpecLoop)
64 import {-# SOURCE #-} Name
67 #if __GLASGOW_HASKELL__ >= 202
70 #if defined(USE_FAST_STRINGS)
74 import Bag ( Bag, foldrBag )
75 import Outputable ( PprStyle, Outputable(..) )
78 #if ! OMIT_NATIVE_CODEGEN
81 # define IF_NCG(a) {--}
85 -- SIGH: but we use unboxed "sizes"...
86 #if __GLASGOW_HASKELL__
94 %************************************************************************
96 \subsection{The signature of the module}
98 %************************************************************************
102 emptyFM :: FiniteMap key elt
103 unitFM :: key -> elt -> FiniteMap key elt
104 listToFM :: (Ord key OUTPUTABLE_key) => [(key,elt)] -> FiniteMap key elt
105 -- In the case of duplicates, the last is taken
106 bagToFM :: (Ord key OUTPUTABLE_key) => Bag (key,elt) -> FiniteMap key elt
107 -- In the case of duplicates, who knows which is taken
109 -- ADDING AND DELETING
110 -- Throws away any previous binding
111 -- In the list case, the items are added starting with the
112 -- first one in the list
113 addToFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> elt -> FiniteMap key elt
114 addListToFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> [(key,elt)] -> FiniteMap key elt
116 -- Combines with previous binding
117 addToFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
118 -> FiniteMap key elt -> key -> elt
120 addListToFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
121 -> FiniteMap key elt -> [(key,elt)]
124 -- Deletion doesn't complain if you try to delete something
126 delFromFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> FiniteMap key elt
127 delListFromFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> [key] -> FiniteMap key elt
130 -- Bindings in right argument shadow those in the left
131 plusFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt
134 -- Combines bindings for the same thing with the given function
135 plusFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
136 -> FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
138 minusFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
139 -- (minusFM a1 a2) deletes from a1 any bindings which are bound in a2
141 intersectFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
142 intersectFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt2)
143 -> FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt2
145 -- MAPPING, FOLDING, FILTERING
146 foldFM :: (key -> elt -> a -> a) -> a -> FiniteMap key elt -> a
147 mapFM :: (key -> elt1 -> elt2) -> FiniteMap key elt1 -> FiniteMap key elt2
148 filterFM :: (Ord key OUTPUTABLE_key) => (key -> elt -> Bool)
149 -> FiniteMap key elt -> FiniteMap key elt
152 sizeFM :: FiniteMap key elt -> Int
153 isEmptyFM :: FiniteMap key elt -> Bool
155 elemFM :: (Ord key OUTPUTABLE_key) => key -> FiniteMap key elt -> Bool
156 lookupFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> Maybe elt
158 :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> elt -> key -> elt
159 -- lookupWithDefaultFM supplies a "default" elt
160 -- to return for an unmapped key
163 fmToList :: FiniteMap key elt -> [(key,elt)]
164 keysFM :: FiniteMap key elt -> [key]
165 eltsFM :: FiniteMap key elt -> [elt]
168 %************************************************************************
170 \subsection{The @FiniteMap@ data type, and building of same}
172 %************************************************************************
174 Invariants about @FiniteMap@:
177 all keys in a FiniteMap are distinct
179 all keys in left subtree are $<$ key in Branch and
180 all keys in right subtree are $>$ key in Branch
182 size field of a Branch gives number of Branch nodes in the tree
184 size of left subtree is differs from size of right subtree by a
185 factor of at most \tr{sIZE_RATIO}
189 data FiniteMap key elt
191 | Branch key elt -- Key and elt stored here
192 IF_GHC(Int#,Int{-STRICT-}) -- Size >= 1
193 (FiniteMap key elt) -- Children
201 = Branch bottom bottom IF_GHC(0#,0) bottom bottom
203 bottom = panic "emptyFM"
206 -- #define EmptyFM (Branch _ _ IF_GHC(0#,0) _ _)
208 unitFM key elt = Branch key elt IF_GHC(1#,1) emptyFM emptyFM
210 listToFM = addListToFM emptyFM
212 bagToFM = foldrBag (\(k,v) fm -> addToFM fm k v) emptyFM
215 %************************************************************************
217 \subsection{Adding to and deleting from @FiniteMaps@}
219 %************************************************************************
222 addToFM fm key elt = addToFM_C (\ old new -> new) fm key elt
224 addToFM_C combiner EmptyFM key elt = unitFM key elt
225 addToFM_C combiner (Branch key elt size fm_l fm_r) new_key new_elt
226 #ifdef __GLASGOW_HASKELL__
227 = case _tagCmp new_key key of
228 _LT -> mkBalBranch key elt (addToFM_C combiner fm_l new_key new_elt) fm_r
229 _GT -> mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt)
230 _EQ -> Branch new_key (combiner elt new_elt) size fm_l fm_r
232 | new_key < key = mkBalBranch key elt (addToFM_C combiner fm_l new_key new_elt) fm_r
233 | new_key > key = mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt)
234 | otherwise = Branch new_key (combiner elt new_elt) size fm_l fm_r
237 addListToFM fm key_elt_pairs = addListToFM_C (\ old new -> new) fm key_elt_pairs
239 addListToFM_C combiner fm key_elt_pairs
240 = foldl add fm key_elt_pairs -- foldl adds from the left
242 add fmap (key,elt) = addToFM_C combiner fmap key elt
246 delFromFM EmptyFM del_key = emptyFM
247 delFromFM (Branch key elt size fm_l fm_r) del_key
248 #ifdef __GLASGOW_HASKELL__
249 = case _tagCmp del_key key of
250 _GT -> mkBalBranch key elt fm_l (delFromFM fm_r del_key)
251 _LT -> mkBalBranch key elt (delFromFM fm_l del_key) fm_r
252 _EQ -> glueBal fm_l fm_r
255 = mkBalBranch key elt fm_l (delFromFM fm_r del_key)
258 = mkBalBranch key elt (delFromFM fm_l del_key) fm_r
264 delListFromFM fm keys = foldl delFromFM fm keys
267 %************************************************************************
269 \subsection{Combining @FiniteMaps@}
271 %************************************************************************
274 plusFM_C combiner EmptyFM fm2 = fm2
275 plusFM_C combiner fm1 EmptyFM = fm1
276 plusFM_C combiner fm1 (Branch split_key elt2 _ left right)
277 = mkVBalBranch split_key new_elt
278 (plusFM_C combiner lts left)
279 (plusFM_C combiner gts right)
281 lts = splitLT fm1 split_key
282 gts = splitGT fm1 split_key
283 new_elt = case lookupFM fm1 split_key of
285 Just elt1 -> combiner elt1 elt2
287 -- It's worth doing plusFM specially, because we don't need
288 -- to do the lookup in fm1.
289 -- FM2 over-rides FM1.
291 plusFM EmptyFM fm2 = fm2
292 plusFM fm1 EmptyFM = fm1
293 plusFM fm1 (Branch split_key elt1 _ left right)
294 = mkVBalBranch split_key elt1 (plusFM lts left) (plusFM gts right)
296 lts = splitLT fm1 split_key
297 gts = splitGT fm1 split_key
299 minusFM EmptyFM fm2 = emptyFM
300 minusFM fm1 EmptyFM = fm1
301 minusFM fm1 (Branch split_key elt _ left right)
302 = glueVBal (minusFM lts left) (minusFM gts right)
303 -- The two can be way different, so we need glueVBal
305 lts = splitLT fm1 split_key -- NB gt and lt, so the equal ones
306 gts = splitGT fm1 split_key -- are not in either.
308 intersectFM fm1 fm2 = intersectFM_C (\ left right -> right) fm1 fm2
310 intersectFM_C combiner fm1 EmptyFM = emptyFM
311 intersectFM_C combiner EmptyFM fm2 = emptyFM
312 intersectFM_C combiner fm1 (Branch split_key elt2 _ left right)
314 | maybeToBool maybe_elt1 -- split_elt *is* in intersection
315 = mkVBalBranch split_key (combiner elt1 elt2) (intersectFM_C combiner lts left)
316 (intersectFM_C combiner gts right)
318 | otherwise -- split_elt is *not* in intersection
319 = glueVBal (intersectFM_C combiner lts left) (intersectFM_C combiner gts right)
322 lts = splitLT fm1 split_key -- NB gt and lt, so the equal ones
323 gts = splitGT fm1 split_key -- are not in either.
325 maybe_elt1 = lookupFM fm1 split_key
326 Just elt1 = maybe_elt1
329 %************************************************************************
331 \subsection{Mapping, folding, and filtering with @FiniteMaps@}
333 %************************************************************************
336 foldFM k z EmptyFM = z
337 foldFM k z (Branch key elt _ fm_l fm_r)
338 = foldFM k (k key elt (foldFM k z fm_r)) fm_l
340 mapFM f EmptyFM = emptyFM
341 mapFM f (Branch key elt size fm_l fm_r)
342 = Branch key (f key elt) size (mapFM f fm_l) (mapFM f fm_r)
344 filterFM p EmptyFM = emptyFM
345 filterFM p (Branch key elt _ fm_l fm_r)
346 | p key elt -- Keep the item
347 = mkVBalBranch key elt (filterFM p fm_l) (filterFM p fm_r)
349 | otherwise -- Drop the item
350 = glueVBal (filterFM p fm_l) (filterFM p fm_r)
353 %************************************************************************
355 \subsection{Interrogating @FiniteMaps@}
357 %************************************************************************
360 --{-# INLINE sizeFM #-}
362 sizeFM (Branch _ _ size _ _) = IF_GHC(I# size, size)
364 isEmptyFM fm = sizeFM fm == 0
366 lookupFM EmptyFM key = Nothing
367 lookupFM (Branch key elt _ fm_l fm_r) key_to_find
368 #ifdef __GLASGOW_HASKELL__
369 = case _tagCmp key_to_find key of
370 _LT -> lookupFM fm_l key_to_find
371 _GT -> lookupFM fm_r key_to_find
374 | key_to_find < key = lookupFM fm_l key_to_find
375 | key_to_find > key = lookupFM fm_r key_to_find
376 | otherwise = Just elt
380 = case (lookupFM fm key) of { Nothing -> False; Just elt -> True }
382 lookupWithDefaultFM fm deflt key
383 = case (lookupFM fm key) of { Nothing -> deflt; Just elt -> elt }
386 %************************************************************************
388 \subsection{Listifying @FiniteMaps@}
390 %************************************************************************
393 fmToList fm = foldFM (\ key elt rest -> (key,elt) : rest) [] fm
394 keysFM fm = foldFM (\ key elt rest -> key : rest) [] fm
395 eltsFM fm = foldFM (\ key elt rest -> elt : rest) [] fm
399 %************************************************************************
401 \subsection{The implementation of balancing}
403 %************************************************************************
405 %************************************************************************
407 \subsubsection{Basic construction of a @FiniteMap@}
409 %************************************************************************
411 @mkBranch@ simply gets the size component right. This is the ONLY
412 (non-trivial) place the Branch object is built, so the ASSERTion
413 recursively checks consistency. (The trivial use of Branch is in
420 mkBranch :: (Ord key OUTPUTABLE_key) -- Used for the assertion checking only
423 -> FiniteMap key elt -> FiniteMap key elt
426 mkBranch which key elt fm_l fm_r
427 = --ASSERT( left_ok && right_ok && balance_ok )
428 #if defined(DEBUG_FINITEMAPS)
429 if not ( left_ok && right_ok && balance_ok ) then
430 pprPanic ("mkBranch:"++show which) (vcat [ppr PprDebug [left_ok, right_ok, balance_ok],
437 result = Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r
439 -- if sizeFM result <= 8 then
442 -- pprTrace ("mkBranch:"++(show which)) (ppr PprDebug result) (
446 left_ok = case fm_l of
448 Branch left_key _ _ _ _ -> let
449 biggest_left_key = fst (findMax fm_l)
451 biggest_left_key < key
452 right_ok = case fm_r of
454 Branch right_key _ _ _ _ -> let
455 smallest_right_key = fst (findMin fm_r)
457 key < smallest_right_key
458 balance_ok = True -- sigh
461 = -- Both subtrees have one or no elements...
462 (left_size + right_size <= 1)
463 -- NO || left_size == 0 -- ???
464 -- NO || right_size == 0 -- ???
465 -- ... or the number of elements in a subtree does not exceed
466 -- sIZE_RATIO times the number of elements in the other subtree
467 || (left_size * sIZE_RATIO >= right_size &&
468 right_size * sIZE_RATIO >= left_size)
471 left_size = sizeFM fm_l
472 right_size = sizeFM fm_r
474 #ifdef __GLASGOW_HASKELL__
476 unbox (I# size) = size
483 %************************************************************************
485 \subsubsection{{\em Balanced} construction of a @FiniteMap@}
487 %************************************************************************
489 @mkBalBranch@ rebalances, assuming that the subtrees aren't too far
493 mkBalBranch :: (Ord key OUTPUTABLE_key)
495 -> FiniteMap key elt -> FiniteMap key elt
498 mkBalBranch key elt fm_L fm_R
500 | size_l + size_r < 2
501 = mkBranch 1{-which-} key elt fm_L fm_R
503 | size_r > sIZE_RATIO * size_l -- Right tree too big
505 Branch _ _ _ fm_rl fm_rr
506 | sizeFM fm_rl < 2 * sizeFM fm_rr -> single_L fm_L fm_R
507 | otherwise -> double_L fm_L fm_R
508 -- Other case impossible
510 | size_l > sIZE_RATIO * size_r -- Left tree too big
512 Branch _ _ _ fm_ll fm_lr
513 | sizeFM fm_lr < 2 * sizeFM fm_ll -> single_R fm_L fm_R
514 | otherwise -> double_R fm_L fm_R
515 -- Other case impossible
517 | otherwise -- No imbalance
518 = mkBranch 2{-which-} key elt fm_L fm_R
524 single_L fm_l (Branch key_r elt_r _ fm_rl fm_rr)
525 = mkBranch 3{-which-} key_r elt_r (mkBranch 4{-which-} key elt fm_l fm_rl) fm_rr
527 double_L fm_l (Branch key_r elt_r _ (Branch key_rl elt_rl _ fm_rll fm_rlr) fm_rr)
528 = mkBranch 5{-which-} key_rl elt_rl (mkBranch 6{-which-} key elt fm_l fm_rll)
529 (mkBranch 7{-which-} key_r elt_r fm_rlr fm_rr)
531 single_R (Branch key_l elt_l _ fm_ll fm_lr) fm_r
532 = mkBranch 8{-which-} key_l elt_l fm_ll (mkBranch 9{-which-} key elt fm_lr fm_r)
534 double_R (Branch key_l elt_l _ fm_ll (Branch key_lr elt_lr _ fm_lrl fm_lrr)) fm_r
535 = mkBranch 10{-which-} key_lr elt_lr (mkBranch 11{-which-} key_l elt_l fm_ll fm_lrl)
536 (mkBranch 12{-which-} key elt fm_lrr fm_r)
541 mkVBalBranch :: (Ord key OUTPUTABLE_key)
543 -> FiniteMap key elt -> FiniteMap key elt
546 -- Assert: in any call to (mkVBalBranch_C comb key elt l r),
547 -- (a) all keys in l are < all keys in r
548 -- (b) all keys in l are < key
549 -- (c) all keys in r are > key
551 mkVBalBranch key elt EmptyFM fm_r = addToFM fm_r key elt
552 mkVBalBranch key elt fm_l EmptyFM = addToFM fm_l key elt
554 mkVBalBranch key elt fm_l@(Branch key_l elt_l _ fm_ll fm_lr)
555 fm_r@(Branch key_r elt_r _ fm_rl fm_rr)
556 | sIZE_RATIO * size_l < size_r
557 = mkBalBranch key_r elt_r (mkVBalBranch key elt fm_l fm_rl) fm_rr
559 | sIZE_RATIO * size_r < size_l
560 = mkBalBranch key_l elt_l fm_ll (mkVBalBranch key elt fm_lr fm_r)
563 = mkBranch 13{-which-} key elt fm_l fm_r
570 %************************************************************************
572 \subsubsection{Gluing two trees together}
574 %************************************************************************
576 @glueBal@ assumes its two arguments aren't too far out of whack, just
577 like @mkBalBranch@. But: all keys in first arg are $<$ all keys in
581 glueBal :: (Ord key OUTPUTABLE_key)
582 => FiniteMap key elt -> FiniteMap key elt
585 glueBal EmptyFM fm2 = fm2
586 glueBal fm1 EmptyFM = fm1
588 -- The case analysis here (absent in Adams' program) is really to deal
589 -- with the case where fm2 is a singleton. Then deleting the minimum means
590 -- we pass an empty tree to mkBalBranch, which breaks its invariant.
591 | sizeFM fm2 > sizeFM fm1
592 = mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2)
595 = mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2
597 (mid_key1, mid_elt1) = findMax fm1
598 (mid_key2, mid_elt2) = findMin fm2
601 @glueVBal@ copes with arguments which can be of any size.
602 But: all keys in first arg are $<$ all keys in second.
605 glueVBal :: (Ord key OUTPUTABLE_key)
606 => FiniteMap key elt -> FiniteMap key elt
609 glueVBal EmptyFM fm2 = fm2
610 glueVBal fm1 EmptyFM = fm1
611 glueVBal fm_l@(Branch key_l elt_l _ fm_ll fm_lr)
612 fm_r@(Branch key_r elt_r _ fm_rl fm_rr)
613 | sIZE_RATIO * size_l < size_r
614 = mkBalBranch key_r elt_r (glueVBal fm_l fm_rl) fm_rr
616 | sIZE_RATIO * size_r < size_l
617 = mkBalBranch key_l elt_l fm_ll (glueVBal fm_lr fm_r)
619 | otherwise -- We now need the same two cases as in glueBal above.
622 (mid_key_l,mid_elt_l) = findMax fm_l
623 (mid_key_r,mid_elt_r) = findMin fm_r
628 %************************************************************************
630 \subsection{Local utilities}
632 %************************************************************************
635 splitLT, splitGT :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> FiniteMap key elt
637 -- splitLT fm split_key = fm restricted to keys < split_key
638 -- splitGT fm split_key = fm restricted to keys > split_key
640 splitLT EmptyFM split_key = emptyFM
641 splitLT (Branch key elt _ fm_l fm_r) split_key
642 #ifdef __GLASGOW_HASKELL__
643 = case _tagCmp split_key key of
644 _LT -> splitLT fm_l split_key
645 _GT -> mkVBalBranch key elt fm_l (splitLT fm_r split_key)
648 | split_key < key = splitLT fm_l split_key
649 | split_key > key = mkVBalBranch key elt fm_l (splitLT fm_r split_key)
653 splitGT EmptyFM split_key = emptyFM
654 splitGT (Branch key elt _ fm_l fm_r) split_key
655 #ifdef __GLASGOW_HASKELL__
656 = case _tagCmp split_key key of
657 _GT -> splitGT fm_r split_key
658 _LT -> mkVBalBranch key elt (splitGT fm_l split_key) fm_r
661 | split_key > key = splitGT fm_r split_key
662 | split_key < key = mkVBalBranch key elt (splitGT fm_l split_key) fm_r
666 findMin :: FiniteMap key elt -> (key,elt)
667 findMin (Branch key elt _ EmptyFM _) = (key,elt)
668 findMin (Branch key elt _ fm_l _) = findMin fm_l
670 deleteMin :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt
671 deleteMin (Branch key elt _ EmptyFM fm_r) = fm_r
672 deleteMin (Branch key elt _ fm_l fm_r) = mkBalBranch key elt (deleteMin fm_l) fm_r
674 findMax :: FiniteMap key elt -> (key,elt)
675 findMax (Branch key elt _ _ EmptyFM) = (key,elt)
676 findMax (Branch key elt _ _ fm_r) = findMax fm_r
678 deleteMax :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt
679 deleteMax (Branch key elt _ fm_l EmptyFM) = fm_l
680 deleteMax (Branch key elt _ fm_l fm_r) = mkBalBranch key elt fm_l (deleteMax fm_r)
683 %************************************************************************
685 \subsection{Output-ery}
687 %************************************************************************
690 #if defined(DEBUG_FINITEMAPS)
692 instance (Outputable key) => Outputable (FiniteMap key elt) where
693 ppr sty fm = pprX sty fm
695 pprX sty EmptyFM = char '!'
696 pprX sty (Branch key elt sz fm_l fm_r)
697 = parens (hcat [pprX sty fm_l, space,
698 ppr sty key, space, int (IF_GHC(I# sz, sz)), space,
703 instance (Eq key, Eq elt) => Eq (FiniteMap key elt) where
704 fm_1 == fm_2 = (sizeFM fm_1 == sizeFM fm_2) && -- quick test
705 (fmToList fm_1 == fmToList fm_2)
707 {- NO: not clear what The Right Thing to do is:
708 instance (Ord key, Ord elt) => Ord (FiniteMap key elt) where
709 fm_1 <= fm_2 = (sizeFM fm_1 <= sizeFM fm_2) && -- quick test
710 (fmToList fm_1 <= fmToList fm_2)
715 %************************************************************************
717 \subsection{FiniteSets---a thin veneer}
719 %************************************************************************
722 type FiniteSet key = FiniteMap key ()
723 emptySet :: FiniteSet key
724 mkSet :: (Ord key OUTPUTABLE_key) => [key] -> FiniteSet key
725 isEmptySet :: FiniteSet key -> Bool
726 elementOf :: (Ord key OUTPUTABLE_key) => key -> FiniteSet key -> Bool
727 minusSet :: (Ord key OUTPUTABLE_key) => FiniteSet key -> FiniteSet key -> FiniteSet key
728 setToList :: FiniteSet key -> [key]
729 union :: (Ord key OUTPUTABLE_key) => FiniteSet key -> FiniteSet key -> FiniteSet key
732 mkSet xs = listToFM [ (x, ()) | x <- xs]
733 isEmptySet = isEmptyFM
741 %************************************************************************
743 \subsection{Efficiency pragmas for GHC}
745 %************************************************************************
747 When the FiniteMap module is used in GHC, we specialise it for
748 \tr{Uniques}, for dastardly efficiency reasons.
751 #if __GLASGOW_HASKELL__ && !defined(REALLY_HASKELL_1_3)
753 {-# SPECIALIZE addListToFM
754 :: FiniteMap (FAST_STRING, FAST_STRING) elt -> [((FAST_STRING, FAST_STRING),elt)] -> FiniteMap (FAST_STRING, FAST_STRING) elt
755 , FiniteMap RdrName elt -> [(RdrName,elt)] -> FiniteMap RdrName elt
756 IF_NCG(COMMA FiniteMap Reg elt -> [(Reg COMMA elt)] -> FiniteMap Reg elt)
758 {-# SPECIALIZE addListToFM_C
759 :: (elt -> elt -> elt) -> FiniteMap TyCon elt -> [(TyCon,elt)] -> FiniteMap TyCon elt
760 , (elt -> elt -> elt) -> FiniteMap FAST_STRING elt -> [(FAST_STRING,elt)] -> FiniteMap FAST_STRING elt
761 IF_NCG(COMMA (elt -> elt -> elt) -> FiniteMap Reg elt -> [(Reg COMMA elt)] -> FiniteMap Reg elt)
763 {-# SPECIALIZE addToFM
764 :: FiniteMap CLabel elt -> CLabel -> elt -> FiniteMap CLabel elt
765 , FiniteMap FAST_STRING elt -> FAST_STRING -> elt -> FiniteMap FAST_STRING elt
766 , FiniteMap (FAST_STRING, FAST_STRING) elt -> (FAST_STRING, FAST_STRING) -> elt -> FiniteMap (FAST_STRING, FAST_STRING) elt
767 , FiniteMap RdrName elt -> RdrName -> elt -> FiniteMap RdrName elt
768 IF_NCG(COMMA FiniteMap Reg elt -> Reg -> elt -> FiniteMap Reg elt)
770 {-# SPECIALIZE addToFM_C
771 :: (elt -> elt -> elt) -> FiniteMap (RdrName, RdrName) elt -> (RdrName, RdrName) -> elt -> FiniteMap (RdrName, RdrName) elt
772 , (elt -> elt -> elt) -> FiniteMap FAST_STRING elt -> FAST_STRING -> elt -> FiniteMap FAST_STRING elt
773 IF_NCG(COMMA (elt -> elt -> elt) -> FiniteMap Reg elt -> Reg -> elt -> FiniteMap Reg elt)
775 {-# SPECIALIZE bagToFM
776 :: Bag (FAST_STRING,elt) -> FiniteMap FAST_STRING elt
778 {-# SPECIALIZE delListFromFM
779 :: FiniteMap RdrName elt -> [RdrName] -> FiniteMap RdrName elt
780 , FiniteMap FAST_STRING elt -> [FAST_STRING] -> FiniteMap FAST_STRING elt
781 IF_NCG(COMMA FiniteMap Reg elt -> [Reg] -> FiniteMap Reg elt)
783 {-# SPECIALIZE listToFM
784 :: [([Char],elt)] -> FiniteMap [Char] elt
785 , [(FAST_STRING,elt)] -> FiniteMap FAST_STRING elt
786 , [((FAST_STRING,FAST_STRING),elt)] -> FiniteMap (FAST_STRING, FAST_STRING) elt
787 IF_NCG(COMMA [(Reg COMMA elt)] -> FiniteMap Reg elt)
789 {-# SPECIALIZE lookupFM
790 :: FiniteMap CLabel elt -> CLabel -> Maybe elt
791 , FiniteMap [Char] elt -> [Char] -> Maybe elt
792 , FiniteMap FAST_STRING elt -> FAST_STRING -> Maybe elt
793 , FiniteMap (FAST_STRING,FAST_STRING) elt -> (FAST_STRING,FAST_STRING) -> Maybe elt
794 , FiniteMap RdrName elt -> RdrName -> Maybe elt
795 , FiniteMap (RdrName,RdrName) elt -> (RdrName,RdrName) -> Maybe elt
796 IF_NCG(COMMA FiniteMap Reg elt -> Reg -> Maybe elt)
798 {-# SPECIALIZE lookupWithDefaultFM
799 :: FiniteMap FAST_STRING elt -> elt -> FAST_STRING -> elt
800 IF_NCG(COMMA FiniteMap Reg elt -> elt -> Reg -> elt)
802 {-# SPECIALIZE plusFM
803 :: FiniteMap RdrName elt -> FiniteMap RdrName elt -> FiniteMap RdrName elt
804 , FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt
805 IF_NCG(COMMA FiniteMap Reg elt -> FiniteMap Reg elt -> FiniteMap Reg elt)
807 {-# SPECIALIZE plusFM_C
808 :: (elt -> elt -> elt) -> FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt
809 IF_NCG(COMMA (elt -> elt -> elt) -> FiniteMap Reg elt -> FiniteMap Reg elt -> FiniteMap Reg elt)
812 #endif {- compiling with ghc and have specialiser -}