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)
18 near the end (only \tr{#ifdef COMPILING_GHC}).
22 #include "HsVersions.h"
23 #define IF_NOT_GHC(a) {--}
25 #define ASSERT(e) {--}
26 #define IF_NOT_GHC(a) a
28 #define _tagCmp compare
34 #if defined(COMPILING_GHC) && defined(DEBUG_FINITEMAPS)/* NB NB NB */
35 #define OUTPUTABLE_key , Outputable key
37 #define OUTPUTABLE_key {--}
41 FiniteMap, -- abstract type
43 emptyFM, unitFM, listToFM,
61 sizeFM, isEmptyFM, elemFM, lookupFM, lookupWithDefaultFM,
63 fmToList, keysFM, eltsFM
67 , SYN_IE(FiniteSet), emptySet, mkSet, isEmptySet
68 , elementOf, setToList, union, minusSet
72 IMPORT_DELOOPER(SpecLoop)
73 #if __GLASGOW_HASKELL__ >= 202
76 #if defined(USE_FAST_STRINGS)
80 import Bag ( Bag, foldrBag )
81 import Outputable ( Outputable(..) )
82 import PprStyle ( PprStyle )
87 # if ! OMIT_NATIVE_CODEGEN
90 # define IF_NCG(a) {--}
94 -- SIGH: but we use unboxed "sizes"...
95 #if __GLASGOW_HASKELL__
103 %************************************************************************
105 \subsection{The signature of the module}
107 %************************************************************************
111 emptyFM :: FiniteMap key elt
112 unitFM :: key -> elt -> FiniteMap key elt
113 listToFM :: (Ord key OUTPUTABLE_key) => [(key,elt)] -> FiniteMap key elt
114 -- In the case of duplicates, the last is taken
116 bagToFM :: (Ord key OUTPUTABLE_key) => Bag (key,elt) -> FiniteMap key elt
117 -- In the case of duplicates, who knows which is taken
120 -- ADDING AND DELETING
121 -- Throws away any previous binding
122 -- In the list case, the items are added starting with the
123 -- first one in the list
124 addToFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> elt -> FiniteMap key elt
125 addListToFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> [(key,elt)] -> FiniteMap key elt
127 -- Combines with previous binding
128 addToFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
129 -> FiniteMap key elt -> key -> elt
131 addListToFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
132 -> FiniteMap key elt -> [(key,elt)]
135 -- Deletion doesn't complain if you try to delete something
137 delFromFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> FiniteMap key elt
138 delListFromFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> [key] -> FiniteMap key elt
141 -- Bindings in right argument shadow those in the left
142 plusFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt
145 -- Combines bindings for the same thing with the given function
146 plusFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
147 -> FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
149 minusFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
150 -- (minusFM a1 a2) deletes from a1 any bindings which are bound in a2
152 intersectFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
153 intersectFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt2)
154 -> FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt2
156 -- MAPPING, FOLDING, FILTERING
157 foldFM :: (key -> elt -> a -> a) -> a -> FiniteMap key elt -> a
158 mapFM :: (key -> elt1 -> elt2) -> FiniteMap key elt1 -> FiniteMap key elt2
159 filterFM :: (Ord key OUTPUTABLE_key) => (key -> elt -> Bool)
160 -> FiniteMap key elt -> FiniteMap key elt
163 sizeFM :: FiniteMap key elt -> Int
164 isEmptyFM :: FiniteMap key elt -> Bool
166 elemFM :: (Ord key OUTPUTABLE_key) => key -> FiniteMap key elt -> Bool
167 lookupFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> Maybe elt
169 :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> elt -> key -> elt
170 -- lookupWithDefaultFM supplies a "default" elt
171 -- to return for an unmapped key
174 fmToList :: FiniteMap key elt -> [(key,elt)]
175 keysFM :: FiniteMap key elt -> [key]
176 eltsFM :: FiniteMap key elt -> [elt]
179 %************************************************************************
181 \subsection{The @FiniteMap@ data type, and building of same}
183 %************************************************************************
185 Invariants about @FiniteMap@:
188 all keys in a FiniteMap are distinct
190 all keys in left subtree are $<$ key in Branch and
191 all keys in right subtree are $>$ key in Branch
193 size field of a Branch gives number of Branch nodes in the tree
195 size of left subtree is differs from size of right subtree by a
196 factor of at most \tr{sIZE_RATIO}
200 data FiniteMap key elt
202 | Branch key elt -- Key and elt stored here
203 IF_GHC(Int#,Int{-STRICT-}) -- Size >= 1
204 (FiniteMap key elt) -- Children
212 = Branch bottom bottom IF_GHC(0#,0) bottom bottom
214 bottom = panic "emptyFM"
217 -- #define EmptyFM (Branch _ _ IF_GHC(0#,0) _ _)
219 unitFM key elt = Branch key elt IF_GHC(1#,1) emptyFM emptyFM
221 listToFM = addListToFM emptyFM
224 bagToFM = foldrBag (\(k,v) fm -> addToFM fm k v) emptyFM
228 %************************************************************************
230 \subsection{Adding to and deleting from @FiniteMaps@}
232 %************************************************************************
235 addToFM fm key elt = addToFM_C (\ old new -> new) fm key elt
237 addToFM_C combiner EmptyFM key elt = unitFM key elt
238 addToFM_C combiner (Branch key elt size fm_l fm_r) new_key new_elt
239 #ifdef __GLASGOW_HASKELL__
240 = case _tagCmp new_key key of
241 _LT -> mkBalBranch key elt (addToFM_C combiner fm_l new_key new_elt) fm_r
242 _GT -> mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt)
243 _EQ -> Branch new_key (combiner elt new_elt) size fm_l fm_r
245 | new_key < key = mkBalBranch key elt (addToFM_C combiner fm_l new_key new_elt) fm_r
246 | new_key > key = mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt)
247 | otherwise = Branch new_key (combiner elt new_elt) size fm_l fm_r
250 addListToFM fm key_elt_pairs = addListToFM_C (\ old new -> new) fm key_elt_pairs
252 addListToFM_C combiner fm key_elt_pairs
253 = foldl add fm key_elt_pairs -- foldl adds from the left
255 add fmap (key,elt) = addToFM_C combiner fmap key elt
259 delFromFM EmptyFM del_key = emptyFM
260 delFromFM (Branch key elt size fm_l fm_r) del_key
261 #ifdef __GLASGOW_HASKELL__
262 = case _tagCmp del_key key of
263 _GT -> mkBalBranch key elt fm_l (delFromFM fm_r del_key)
264 _LT -> mkBalBranch key elt (delFromFM fm_l del_key) fm_r
265 _EQ -> glueBal fm_l fm_r
268 = mkBalBranch key elt fm_l (delFromFM fm_r del_key)
271 = mkBalBranch key elt (delFromFM fm_l del_key) fm_r
277 delListFromFM fm keys = foldl delFromFM fm keys
280 %************************************************************************
282 \subsection{Combining @FiniteMaps@}
284 %************************************************************************
287 plusFM_C combiner EmptyFM fm2 = fm2
288 plusFM_C combiner fm1 EmptyFM = fm1
289 plusFM_C combiner fm1 (Branch split_key elt2 _ left right)
290 = mkVBalBranch split_key new_elt
291 (plusFM_C combiner lts left)
292 (plusFM_C combiner gts right)
294 lts = splitLT fm1 split_key
295 gts = splitGT fm1 split_key
296 new_elt = case lookupFM fm1 split_key of
298 Just elt1 -> combiner elt1 elt2
300 -- It's worth doing plusFM specially, because we don't need
301 -- to do the lookup in fm1.
303 plusFM EmptyFM fm2 = fm2
304 plusFM fm1 EmptyFM = fm1
305 plusFM fm1 (Branch split_key elt1 _ left right)
306 = mkVBalBranch split_key elt1 (plusFM lts left) (plusFM gts right)
308 lts = splitLT fm1 split_key
309 gts = splitGT fm1 split_key
311 minusFM EmptyFM fm2 = emptyFM
312 minusFM fm1 EmptyFM = fm1
313 minusFM fm1 (Branch split_key elt _ left right)
314 = glueVBal (minusFM lts left) (minusFM gts right)
315 -- The two can be way different, so we need glueVBal
317 lts = splitLT fm1 split_key -- NB gt and lt, so the equal ones
318 gts = splitGT fm1 split_key -- are not in either.
320 intersectFM fm1 fm2 = intersectFM_C (\ left right -> right) fm1 fm2
322 intersectFM_C combiner fm1 EmptyFM = emptyFM
323 intersectFM_C combiner EmptyFM fm2 = emptyFM
324 intersectFM_C combiner fm1 (Branch split_key elt2 _ left right)
326 | maybeToBool maybe_elt1 -- split_elt *is* in intersection
327 = mkVBalBranch split_key (combiner elt1 elt2) (intersectFM_C combiner lts left)
328 (intersectFM_C combiner gts right)
330 | otherwise -- split_elt is *not* in intersection
331 = glueVBal (intersectFM_C combiner lts left) (intersectFM_C combiner gts right)
334 lts = splitLT fm1 split_key -- NB gt and lt, so the equal ones
335 gts = splitGT fm1 split_key -- are not in either.
337 maybe_elt1 = lookupFM fm1 split_key
338 Just elt1 = maybe_elt1
341 %************************************************************************
343 \subsection{Mapping, folding, and filtering with @FiniteMaps@}
345 %************************************************************************
348 foldFM k z EmptyFM = z
349 foldFM k z (Branch key elt _ fm_l fm_r)
350 = foldFM k (k key elt (foldFM k z fm_r)) fm_l
352 mapFM f EmptyFM = emptyFM
353 mapFM f (Branch key elt size fm_l fm_r)
354 = Branch key (f key elt) size (mapFM f fm_l) (mapFM f fm_r)
356 filterFM p EmptyFM = emptyFM
357 filterFM p (Branch key elt _ fm_l fm_r)
358 | p key elt -- Keep the item
359 = mkVBalBranch key elt (filterFM p fm_l) (filterFM p fm_r)
361 | otherwise -- Drop the item
362 = glueVBal (filterFM p fm_l) (filterFM p fm_r)
365 %************************************************************************
367 \subsection{Interrogating @FiniteMaps@}
369 %************************************************************************
372 --{-# INLINE sizeFM #-}
374 sizeFM (Branch _ _ size _ _) = IF_GHC(I# size, size)
376 isEmptyFM fm = sizeFM fm == 0
378 lookupFM EmptyFM key = Nothing
379 lookupFM (Branch key elt _ fm_l fm_r) key_to_find
380 #ifdef __GLASGOW_HASKELL__
381 = case _tagCmp key_to_find key of
382 _LT -> lookupFM fm_l key_to_find
383 _GT -> lookupFM fm_r key_to_find
386 | key_to_find < key = lookupFM fm_l key_to_find
387 | key_to_find > key = lookupFM fm_r key_to_find
388 | otherwise = Just elt
392 = case (lookupFM fm key) of { Nothing -> False; Just elt -> True }
394 lookupWithDefaultFM fm deflt key
395 = case (lookupFM fm key) of { Nothing -> deflt; Just elt -> elt }
398 %************************************************************************
400 \subsection{Listifying @FiniteMaps@}
402 %************************************************************************
405 fmToList fm = foldFM (\ key elt rest -> (key,elt) : rest) [] fm
406 keysFM fm = foldFM (\ key elt rest -> key : rest) [] fm
407 eltsFM fm = foldFM (\ key elt rest -> elt : rest) [] fm
411 %************************************************************************
413 \subsection{The implementation of balancing}
415 %************************************************************************
417 %************************************************************************
419 \subsubsection{Basic construction of a @FiniteMap@}
421 %************************************************************************
423 @mkBranch@ simply gets the size component right. This is the ONLY
424 (non-trivial) place the Branch object is built, so the ASSERTion
425 recursively checks consistency. (The trivial use of Branch is in
432 mkBranch :: (Ord key OUTPUTABLE_key) -- Used for the assertion checking only
435 -> FiniteMap key elt -> FiniteMap key elt
438 mkBranch which key elt fm_l fm_r
439 = --ASSERT( left_ok && right_ok && balance_ok )
440 #if defined(COMPILING_GHC) && defined(DEBUG_FINITEMAPS)
441 if not ( left_ok && right_ok && balance_ok ) then
442 pprPanic ("mkBranch:"++show which) (vcat [ppr PprDebug [left_ok, right_ok, balance_ok],
449 result = Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r
451 -- if sizeFM result <= 8 then
454 -- pprTrace ("mkBranch:"++(show which)) (ppr PprDebug result) (
458 left_ok = case fm_l of
460 Branch left_key _ _ _ _ -> let
461 biggest_left_key = fst (findMax fm_l)
463 biggest_left_key < key
464 right_ok = case fm_r of
466 Branch right_key _ _ _ _ -> let
467 smallest_right_key = fst (findMin fm_r)
469 key < smallest_right_key
470 balance_ok = True -- sigh
473 = -- Both subtrees have one or no elements...
474 (left_size + right_size <= 1)
475 -- NO || left_size == 0 -- ???
476 -- NO || right_size == 0 -- ???
477 -- ... or the number of elements in a subtree does not exceed
478 -- sIZE_RATIO times the number of elements in the other subtree
479 || (left_size * sIZE_RATIO >= right_size &&
480 right_size * sIZE_RATIO >= left_size)
483 left_size = sizeFM fm_l
484 right_size = sizeFM fm_r
486 #ifdef __GLASGOW_HASKELL__
488 unbox (I# size) = size
495 %************************************************************************
497 \subsubsection{{\em Balanced} construction of a @FiniteMap@}
499 %************************************************************************
501 @mkBalBranch@ rebalances, assuming that the subtrees aren't too far
505 mkBalBranch :: (Ord key OUTPUTABLE_key)
507 -> FiniteMap key elt -> FiniteMap key elt
510 mkBalBranch key elt fm_L fm_R
512 | size_l + size_r < 2
513 = mkBranch 1{-which-} key elt fm_L fm_R
515 | size_r > sIZE_RATIO * size_l -- Right tree too big
517 Branch _ _ _ fm_rl fm_rr
518 | sizeFM fm_rl < 2 * sizeFM fm_rr -> single_L fm_L fm_R
519 | otherwise -> double_L fm_L fm_R
520 -- Other case impossible
522 | size_l > sIZE_RATIO * size_r -- Left tree too big
524 Branch _ _ _ fm_ll fm_lr
525 | sizeFM fm_lr < 2 * sizeFM fm_ll -> single_R fm_L fm_R
526 | otherwise -> double_R fm_L fm_R
527 -- Other case impossible
529 | otherwise -- No imbalance
530 = mkBranch 2{-which-} key elt fm_L fm_R
536 single_L fm_l (Branch key_r elt_r _ fm_rl fm_rr)
537 = mkBranch 3{-which-} key_r elt_r (mkBranch 4{-which-} key elt fm_l fm_rl) fm_rr
539 double_L fm_l (Branch key_r elt_r _ (Branch key_rl elt_rl _ fm_rll fm_rlr) fm_rr)
540 = mkBranch 5{-which-} key_rl elt_rl (mkBranch 6{-which-} key elt fm_l fm_rll)
541 (mkBranch 7{-which-} key_r elt_r fm_rlr fm_rr)
543 single_R (Branch key_l elt_l _ fm_ll fm_lr) fm_r
544 = mkBranch 8{-which-} key_l elt_l fm_ll (mkBranch 9{-which-} key elt fm_lr fm_r)
546 double_R (Branch key_l elt_l _ fm_ll (Branch key_lr elt_lr _ fm_lrl fm_lrr)) fm_r
547 = mkBranch 10{-which-} key_lr elt_lr (mkBranch 11{-which-} key_l elt_l fm_ll fm_lrl)
548 (mkBranch 12{-which-} key elt fm_lrr fm_r)
553 mkVBalBranch :: (Ord key OUTPUTABLE_key)
555 -> FiniteMap key elt -> FiniteMap key elt
558 -- Assert: in any call to (mkVBalBranch_C comb key elt l r),
559 -- (a) all keys in l are < all keys in r
560 -- (b) all keys in l are < key
561 -- (c) all keys in r are > key
563 mkVBalBranch key elt EmptyFM fm_r = addToFM fm_r key elt
564 mkVBalBranch key elt fm_l EmptyFM = addToFM fm_l key elt
566 mkVBalBranch key elt fm_l@(Branch key_l elt_l _ fm_ll fm_lr)
567 fm_r@(Branch key_r elt_r _ fm_rl fm_rr)
568 | sIZE_RATIO * size_l < size_r
569 = mkBalBranch key_r elt_r (mkVBalBranch key elt fm_l fm_rl) fm_rr
571 | sIZE_RATIO * size_r < size_l
572 = mkBalBranch key_l elt_l fm_ll (mkVBalBranch key elt fm_lr fm_r)
575 = mkBranch 13{-which-} key elt fm_l fm_r
582 %************************************************************************
584 \subsubsection{Gluing two trees together}
586 %************************************************************************
588 @glueBal@ assumes its two arguments aren't too far out of whack, just
589 like @mkBalBranch@. But: all keys in first arg are $<$ all keys in
593 glueBal :: (Ord key OUTPUTABLE_key)
594 => FiniteMap key elt -> FiniteMap key elt
597 glueBal EmptyFM fm2 = fm2
598 glueBal fm1 EmptyFM = fm1
600 -- The case analysis here (absent in Adams' program) is really to deal
601 -- with the case where fm2 is a singleton. Then deleting the minimum means
602 -- we pass an empty tree to mkBalBranch, which breaks its invariant.
603 | sizeFM fm2 > sizeFM fm1
604 = mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2)
607 = mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2
609 (mid_key1, mid_elt1) = findMax fm1
610 (mid_key2, mid_elt2) = findMin fm2
613 @glueVBal@ copes with arguments which can be of any size.
614 But: all keys in first arg are $<$ all keys in second.
617 glueVBal :: (Ord key OUTPUTABLE_key)
618 => FiniteMap key elt -> FiniteMap key elt
621 glueVBal EmptyFM fm2 = fm2
622 glueVBal fm1 EmptyFM = fm1
623 glueVBal fm_l@(Branch key_l elt_l _ fm_ll fm_lr)
624 fm_r@(Branch key_r elt_r _ fm_rl fm_rr)
625 | sIZE_RATIO * size_l < size_r
626 = mkBalBranch key_r elt_r (glueVBal fm_l fm_rl) fm_rr
628 | sIZE_RATIO * size_r < size_l
629 = mkBalBranch key_l elt_l fm_ll (glueVBal fm_lr fm_r)
631 | otherwise -- We now need the same two cases as in glueBal above.
634 (mid_key_l,mid_elt_l) = findMax fm_l
635 (mid_key_r,mid_elt_r) = findMin fm_r
640 %************************************************************************
642 \subsection{Local utilities}
644 %************************************************************************
647 splitLT, splitGT :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> FiniteMap key elt
649 -- splitLT fm split_key = fm restricted to keys < split_key
650 -- splitGT fm split_key = fm restricted to keys > split_key
652 splitLT EmptyFM split_key = emptyFM
653 splitLT (Branch key elt _ fm_l fm_r) split_key
654 #ifdef __GLASGOW_HASKELL__
655 = case _tagCmp split_key key of
656 _LT -> splitLT fm_l split_key
657 _GT -> mkVBalBranch key elt fm_l (splitLT fm_r split_key)
660 | split_key < key = splitLT fm_l split_key
661 | split_key > key = mkVBalBranch key elt fm_l (splitLT fm_r split_key)
665 splitGT EmptyFM split_key = emptyFM
666 splitGT (Branch key elt _ fm_l fm_r) split_key
667 #ifdef __GLASGOW_HASKELL__
668 = case _tagCmp split_key key of
669 _GT -> splitGT fm_r split_key
670 _LT -> mkVBalBranch key elt (splitGT fm_l split_key) fm_r
673 | split_key > key = splitGT fm_r split_key
674 | split_key < key = mkVBalBranch key elt (splitGT fm_l split_key) fm_r
678 findMin :: FiniteMap key elt -> (key,elt)
679 findMin (Branch key elt _ EmptyFM _) = (key,elt)
680 findMin (Branch key elt _ fm_l _) = findMin fm_l
682 deleteMin :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt
683 deleteMin (Branch key elt _ EmptyFM fm_r) = fm_r
684 deleteMin (Branch key elt _ fm_l fm_r) = mkBalBranch key elt (deleteMin fm_l) fm_r
686 findMax :: FiniteMap key elt -> (key,elt)
687 findMax (Branch key elt _ _ EmptyFM) = (key,elt)
688 findMax (Branch key elt _ _ fm_r) = findMax fm_r
690 deleteMax :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt
691 deleteMax (Branch key elt _ fm_l EmptyFM) = fm_l
692 deleteMax (Branch key elt _ fm_l fm_r) = mkBalBranch key elt fm_l (deleteMax fm_r)
695 %************************************************************************
697 \subsection{Output-ery}
699 %************************************************************************
702 #if defined(COMPILING_GHC) && defined(DEBUG_FINITEMAPS)
704 instance (Outputable key) => Outputable (FiniteMap key elt) where
705 ppr sty fm = pprX sty fm
707 pprX sty EmptyFM = char '!'
708 pprX sty (Branch key elt sz fm_l fm_r)
709 = parens (hcat [pprX sty fm_l, space,
710 ppr sty key, space, int (IF_GHC(I# sz, sz)), space,
714 #ifndef COMPILING_GHC
715 instance (Eq key, Eq elt) => Eq (FiniteMap key elt) where
716 fm_1 == fm_2 = (sizeFM fm_1 == sizeFM fm_2) && -- quick test
717 (fmToList fm_1 == fmToList fm_2)
719 {- NO: not clear what The Right Thing to do is:
720 instance (Ord key, Ord elt) => Ord (FiniteMap key elt) where
721 fm_1 <= fm_2 = (sizeFM fm_1 <= sizeFM fm_2) && -- quick test
722 (fmToList fm_1 <= fmToList fm_2)
727 %************************************************************************
729 \subsection{FiniteSets---a thin veneer}
731 %************************************************************************
736 type FiniteSet key = FiniteMap key ()
737 emptySet :: FiniteSet key
738 mkSet :: (Ord key OUTPUTABLE_key) => [key] -> FiniteSet key
739 isEmptySet :: FiniteSet key -> Bool
740 elementOf :: (Ord key OUTPUTABLE_key) => key -> FiniteSet key -> Bool
741 minusSet :: (Ord key OUTPUTABLE_key) => FiniteSet key -> FiniteSet key -> FiniteSet key
742 setToList :: FiniteSet key -> [key]
743 union :: (Ord key OUTPUTABLE_key) => FiniteSet key -> FiniteSet key -> FiniteSet key
746 mkSet xs = listToFM [ (x, ()) | x <- xs]
747 isEmptySet = isEmptyFM
756 %************************************************************************
758 \subsection{Efficiency pragmas for GHC}
760 %************************************************************************
762 When the FiniteMap module is used in GHC, we specialise it for
763 \tr{Uniques}, for dastardly efficiency reasons.
766 #if defined(COMPILING_GHC) && __GLASGOW_HASKELL__ && !defined(REALLY_HASKELL_1_3)
768 {-# SPECIALIZE addListToFM
769 :: FiniteMap (FAST_STRING, FAST_STRING) elt -> [((FAST_STRING, FAST_STRING),elt)] -> FiniteMap (FAST_STRING, FAST_STRING) elt
770 , FiniteMap RdrName elt -> [(RdrName,elt)] -> FiniteMap RdrName elt
771 IF_NCG(COMMA FiniteMap Reg elt -> [(Reg COMMA elt)] -> FiniteMap Reg elt)
773 {-# SPECIALIZE addListToFM_C
774 :: (elt -> elt -> elt) -> FiniteMap TyCon elt -> [(TyCon,elt)] -> FiniteMap TyCon elt
775 , (elt -> elt -> elt) -> FiniteMap FAST_STRING elt -> [(FAST_STRING,elt)] -> FiniteMap FAST_STRING elt
776 IF_NCG(COMMA (elt -> elt -> elt) -> FiniteMap Reg elt -> [(Reg COMMA elt)] -> FiniteMap Reg elt)
778 {-# SPECIALIZE addToFM
779 :: FiniteMap CLabel elt -> CLabel -> elt -> FiniteMap CLabel elt
780 , FiniteMap FAST_STRING elt -> FAST_STRING -> elt -> FiniteMap FAST_STRING elt
781 , FiniteMap (FAST_STRING, FAST_STRING) elt -> (FAST_STRING, FAST_STRING) -> elt -> FiniteMap (FAST_STRING, FAST_STRING) elt
782 , FiniteMap RdrName elt -> RdrName -> elt -> FiniteMap RdrName elt
783 IF_NCG(COMMA FiniteMap Reg elt -> Reg -> elt -> FiniteMap Reg elt)
785 {-# SPECIALIZE addToFM_C
786 :: (elt -> elt -> elt) -> FiniteMap (RdrName, RdrName) elt -> (RdrName, RdrName) -> elt -> FiniteMap (RdrName, RdrName) elt
787 , (elt -> elt -> elt) -> FiniteMap FAST_STRING elt -> FAST_STRING -> elt -> FiniteMap FAST_STRING elt
788 IF_NCG(COMMA (elt -> elt -> elt) -> FiniteMap Reg elt -> Reg -> elt -> FiniteMap Reg elt)
790 {-# SPECIALIZE bagToFM
791 :: Bag (FAST_STRING,elt) -> FiniteMap FAST_STRING elt
793 {-# SPECIALIZE delListFromFM
794 :: FiniteMap RdrName elt -> [RdrName] -> FiniteMap RdrName elt
795 , FiniteMap FAST_STRING elt -> [FAST_STRING] -> FiniteMap FAST_STRING elt
796 IF_NCG(COMMA FiniteMap Reg elt -> [Reg] -> FiniteMap Reg elt)
798 {-# SPECIALIZE listToFM
799 :: [([Char],elt)] -> FiniteMap [Char] elt
800 , [(FAST_STRING,elt)] -> FiniteMap FAST_STRING elt
801 , [((FAST_STRING,FAST_STRING),elt)] -> FiniteMap (FAST_STRING, FAST_STRING) elt
802 IF_NCG(COMMA [(Reg COMMA elt)] -> FiniteMap Reg elt)
804 {-# SPECIALIZE lookupFM
805 :: FiniteMap CLabel elt -> CLabel -> Maybe elt
806 , FiniteMap [Char] elt -> [Char] -> Maybe elt
807 , FiniteMap FAST_STRING elt -> FAST_STRING -> Maybe elt
808 , FiniteMap (FAST_STRING,FAST_STRING) elt -> (FAST_STRING,FAST_STRING) -> Maybe elt
809 , FiniteMap RdrName elt -> RdrName -> Maybe elt
810 , FiniteMap (RdrName,RdrName) elt -> (RdrName,RdrName) -> Maybe elt
811 IF_NCG(COMMA FiniteMap Reg elt -> Reg -> Maybe elt)
813 {-# SPECIALIZE lookupWithDefaultFM
814 :: FiniteMap FAST_STRING elt -> elt -> FAST_STRING -> elt
815 IF_NCG(COMMA FiniteMap Reg elt -> elt -> Reg -> elt)
817 {-# SPECIALIZE plusFM
818 :: FiniteMap RdrName elt -> FiniteMap RdrName elt -> FiniteMap RdrName elt
819 , FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt
820 IF_NCG(COMMA FiniteMap Reg elt -> FiniteMap Reg elt -> FiniteMap Reg elt)
822 {-# SPECIALIZE plusFM_C
823 :: (elt -> elt -> elt) -> FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt
824 IF_NCG(COMMA (elt -> elt -> elt) -> FiniteMap Reg elt -> FiniteMap Reg elt -> FiniteMap Reg elt)
827 #endif {- compiling for GHC -}