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,
49 IF_NOT_GHC(delFromFM COMMA)
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 defined(USE_FAST_STRINGS)
77 import Bag ( Bag, foldrBag )
78 import Outputable ( Outputable(..) )
79 import PprStyle ( PprStyle )
80 import Pretty ( SYN_IE(Pretty), PrettyRep )
84 # if ! OMIT_NATIVE_CODEGEN
87 # define IF_NCG(a) {--}
91 -- SIGH: but we use unboxed "sizes"...
92 #if __GLASGOW_HASKELL__
100 %************************************************************************
102 \subsection{The signature of the module}
104 %************************************************************************
108 emptyFM :: FiniteMap key elt
109 unitFM :: key -> elt -> FiniteMap key elt
110 listToFM :: (Ord key OUTPUTABLE_key) => [(key,elt)] -> FiniteMap key elt
111 -- In the case of duplicates, the last is taken
113 bagToFM :: (Ord key OUTPUTABLE_key) => Bag (key,elt) -> FiniteMap key elt
114 -- In the case of duplicates, who knows which is taken
117 -- ADDING AND DELETING
118 -- Throws away any previous binding
119 -- In the list case, the items are added starting with the
120 -- first one in the list
121 addToFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> elt -> FiniteMap key elt
122 addListToFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> [(key,elt)] -> FiniteMap key elt
124 -- Combines with previous binding
125 addToFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
126 -> FiniteMap key elt -> key -> elt
128 addListToFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
129 -> FiniteMap key elt -> [(key,elt)]
132 -- Deletion doesn't complain if you try to delete something
134 delFromFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> FiniteMap key elt
135 delListFromFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> [key] -> FiniteMap key elt
138 -- Bindings in right argument shadow those in the left
139 plusFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt
142 -- Combines bindings for the same thing with the given function
143 plusFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
144 -> FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
146 minusFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
147 -- (minusFM a1 a2) deletes from a1 any bindings which are bound in a2
149 intersectFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
150 intersectFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt2)
151 -> FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt2
153 -- MAPPING, FOLDING, FILTERING
154 foldFM :: (key -> elt -> a -> a) -> a -> FiniteMap key elt -> a
155 mapFM :: (key -> elt1 -> elt2) -> FiniteMap key elt1 -> FiniteMap key elt2
156 filterFM :: (Ord key OUTPUTABLE_key) => (key -> elt -> Bool)
157 -> FiniteMap key elt -> FiniteMap key elt
160 sizeFM :: FiniteMap key elt -> Int
161 isEmptyFM :: FiniteMap key elt -> Bool
163 elemFM :: (Ord key OUTPUTABLE_key) => key -> FiniteMap key elt -> Bool
164 lookupFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> Maybe elt
166 :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> elt -> key -> elt
167 -- lookupWithDefaultFM supplies a "default" elt
168 -- to return for an unmapped key
171 fmToList :: FiniteMap key elt -> [(key,elt)]
172 keysFM :: FiniteMap key elt -> [key]
173 eltsFM :: FiniteMap key elt -> [elt]
176 %************************************************************************
178 \subsection{The @FiniteMap@ data type, and building of same}
180 %************************************************************************
182 Invariants about @FiniteMap@:
185 all keys in a FiniteMap are distinct
187 all keys in left subtree are $<$ key in Branch and
188 all keys in right subtree are $>$ key in Branch
190 size field of a Branch gives number of Branch nodes in the tree
192 size of left subtree is differs from size of right subtree by a
193 factor of at most \tr{sIZE_RATIO}
197 data FiniteMap key elt
199 | Branch key elt -- Key and elt stored here
200 IF_GHC(Int#,Int{-STRICT-}) -- Size >= 1
201 (FiniteMap key elt) -- Children
209 = Branch bottom bottom IF_GHC(0#,0) bottom bottom
211 bottom = panic "emptyFM"
214 -- #define EmptyFM (Branch _ _ IF_GHC(0#,0) _ _)
216 unitFM key elt = Branch key elt IF_GHC(1#,1) emptyFM emptyFM
218 listToFM = addListToFM emptyFM
221 bagToFM = foldrBag (\(k,v) fm -> addToFM fm k v) emptyFM
225 %************************************************************************
227 \subsection{Adding to and deleting from @FiniteMaps@}
229 %************************************************************************
232 addToFM fm key elt = addToFM_C (\ old new -> new) fm key elt
234 addToFM_C combiner EmptyFM key elt = unitFM key elt
235 addToFM_C combiner (Branch key elt size fm_l fm_r) new_key new_elt
236 #ifdef __GLASGOW_HASKELL__
237 = case _tagCmp new_key key of
238 _LT -> mkBalBranch key elt (addToFM_C combiner fm_l new_key new_elt) fm_r
239 _GT -> mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt)
240 _EQ -> Branch new_key (combiner elt new_elt) size fm_l fm_r
242 | new_key < key = mkBalBranch key elt (addToFM_C combiner fm_l new_key new_elt) fm_r
243 | new_key > key = mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt)
244 | otherwise = Branch new_key (combiner elt new_elt) size fm_l fm_r
247 addListToFM fm key_elt_pairs = addListToFM_C (\ old new -> new) fm key_elt_pairs
249 addListToFM_C combiner fm key_elt_pairs
250 = foldl add fm key_elt_pairs -- foldl adds from the left
252 add fmap (key,elt) = addToFM_C combiner fmap key elt
256 delFromFM EmptyFM del_key = emptyFM
257 delFromFM (Branch key elt size fm_l fm_r) del_key
258 #ifdef __GLASGOW_HASKELL__
259 = case _tagCmp del_key key of
260 _GT -> mkBalBranch key elt fm_l (delFromFM fm_r del_key)
261 _LT -> mkBalBranch key elt (delFromFM fm_l del_key) fm_r
262 _EQ -> glueBal fm_l fm_r
265 = mkBalBranch key elt fm_l (delFromFM fm_r del_key)
268 = mkBalBranch key elt (delFromFM fm_l del_key) fm_r
274 delListFromFM fm keys = foldl delFromFM fm keys
277 %************************************************************************
279 \subsection{Combining @FiniteMaps@}
281 %************************************************************************
284 plusFM_C combiner EmptyFM fm2 = fm2
285 plusFM_C combiner fm1 EmptyFM = fm1
286 plusFM_C combiner fm1 (Branch split_key elt2 _ left right)
287 = mkVBalBranch split_key new_elt
288 (plusFM_C combiner lts left)
289 (plusFM_C combiner gts right)
291 lts = splitLT fm1 split_key
292 gts = splitGT fm1 split_key
293 new_elt = case lookupFM fm1 split_key of
295 Just elt1 -> combiner elt1 elt2
297 -- It's worth doing plusFM specially, because we don't need
298 -- to do the lookup in fm1.
300 plusFM EmptyFM fm2 = fm2
301 plusFM fm1 EmptyFM = fm1
302 plusFM fm1 (Branch split_key elt1 _ left right)
303 = mkVBalBranch split_key elt1 (plusFM lts left) (plusFM gts right)
305 lts = splitLT fm1 split_key
306 gts = splitGT fm1 split_key
308 minusFM EmptyFM fm2 = emptyFM
309 minusFM fm1 EmptyFM = fm1
310 minusFM fm1 (Branch split_key elt _ left right)
311 = glueVBal (minusFM lts left) (minusFM gts right)
312 -- The two can be way different, so we need glueVBal
314 lts = splitLT fm1 split_key -- NB gt and lt, so the equal ones
315 gts = splitGT fm1 split_key -- are not in either.
317 intersectFM fm1 fm2 = intersectFM_C (\ left right -> right) fm1 fm2
319 intersectFM_C combiner fm1 EmptyFM = emptyFM
320 intersectFM_C combiner EmptyFM fm2 = emptyFM
321 intersectFM_C combiner fm1 (Branch split_key elt2 _ left right)
323 | maybeToBool maybe_elt1 -- split_elt *is* in intersection
324 = mkVBalBranch split_key (combiner elt1 elt2) (intersectFM_C combiner lts left)
325 (intersectFM_C combiner gts right)
327 | otherwise -- split_elt is *not* in intersection
328 = glueVBal (intersectFM_C combiner lts left) (intersectFM_C combiner gts right)
331 lts = splitLT fm1 split_key -- NB gt and lt, so the equal ones
332 gts = splitGT fm1 split_key -- are not in either.
334 maybe_elt1 = lookupFM fm1 split_key
335 Just elt1 = maybe_elt1
338 %************************************************************************
340 \subsection{Mapping, folding, and filtering with @FiniteMaps@}
342 %************************************************************************
345 foldFM k z EmptyFM = z
346 foldFM k z (Branch key elt _ fm_l fm_r)
347 = foldFM k (k key elt (foldFM k z fm_r)) fm_l
349 mapFM f EmptyFM = emptyFM
350 mapFM f (Branch key elt size fm_l fm_r)
351 = Branch key (f key elt) size (mapFM f fm_l) (mapFM f fm_r)
353 filterFM p EmptyFM = emptyFM
354 filterFM p (Branch key elt _ fm_l fm_r)
355 | p key elt -- Keep the item
356 = mkVBalBranch key elt (filterFM p fm_l) (filterFM p fm_r)
358 | otherwise -- Drop the item
359 = glueVBal (filterFM p fm_l) (filterFM p fm_r)
362 %************************************************************************
364 \subsection{Interrogating @FiniteMaps@}
366 %************************************************************************
369 --{-# INLINE sizeFM #-}
371 sizeFM (Branch _ _ size _ _) = IF_GHC(I# size, size)
373 isEmptyFM fm = sizeFM fm == 0
375 lookupFM EmptyFM key = Nothing
376 lookupFM (Branch key elt _ fm_l fm_r) key_to_find
377 #ifdef __GLASGOW_HASKELL__
378 = case _tagCmp key_to_find key of
379 _LT -> lookupFM fm_l key_to_find
380 _GT -> lookupFM fm_r key_to_find
383 | key_to_find < key = lookupFM fm_l key_to_find
384 | key_to_find > key = lookupFM fm_r key_to_find
385 | otherwise = Just elt
389 = case (lookupFM fm key) of { Nothing -> False; Just elt -> True }
391 lookupWithDefaultFM fm deflt key
392 = case (lookupFM fm key) of { Nothing -> deflt; Just elt -> elt }
395 %************************************************************************
397 \subsection{Listifying @FiniteMaps@}
399 %************************************************************************
402 fmToList fm = foldFM (\ key elt rest -> (key,elt) : rest) [] fm
403 keysFM fm = foldFM (\ key elt rest -> key : rest) [] fm
404 eltsFM fm = foldFM (\ key elt rest -> elt : rest) [] fm
408 %************************************************************************
410 \subsection{The implementation of balancing}
412 %************************************************************************
414 %************************************************************************
416 \subsubsection{Basic construction of a @FiniteMap@}
418 %************************************************************************
420 @mkBranch@ simply gets the size component right. This is the ONLY
421 (non-trivial) place the Branch object is built, so the ASSERTion
422 recursively checks consistency. (The trivial use of Branch is in
429 mkBranch :: (Ord key OUTPUTABLE_key) -- Used for the assertion checking only
432 -> FiniteMap key elt -> FiniteMap key elt
435 mkBranch which key elt fm_l fm_r
436 = --ASSERT( left_ok && right_ok && balance_ok )
437 #if defined(COMPILING_GHC) && defined(DEBUG_FINITEMAPS)
438 if not ( left_ok && right_ok && balance_ok ) then
439 pprPanic ("mkBranch:"++show which) (ppAboves [ppr PprDebug [left_ok, right_ok, balance_ok],
446 result = Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r
448 -- if sizeFM result <= 8 then
451 -- pprTrace ("mkBranch:"++(show which)) (ppr PprDebug result) (
455 left_ok = case fm_l of
457 Branch left_key _ _ _ _ -> let
458 biggest_left_key = fst (findMax fm_l)
460 biggest_left_key < key
461 right_ok = case fm_r of
463 Branch right_key _ _ _ _ -> let
464 smallest_right_key = fst (findMin fm_r)
466 key < smallest_right_key
467 balance_ok = True -- sigh
470 = -- Both subtrees have one or no elements...
471 (left_size + right_size <= 1)
472 -- NO || left_size == 0 -- ???
473 -- NO || right_size == 0 -- ???
474 -- ... or the number of elements in a subtree does not exceed
475 -- sIZE_RATIO times the number of elements in the other subtree
476 || (left_size * sIZE_RATIO >= right_size &&
477 right_size * sIZE_RATIO >= left_size)
480 left_size = sizeFM fm_l
481 right_size = sizeFM fm_r
483 #ifdef __GLASGOW_HASKELL__
485 unbox (I# size) = size
492 %************************************************************************
494 \subsubsection{{\em Balanced} construction of a @FiniteMap@}
496 %************************************************************************
498 @mkBalBranch@ rebalances, assuming that the subtrees aren't too far
502 mkBalBranch :: (Ord key OUTPUTABLE_key)
504 -> FiniteMap key elt -> FiniteMap key elt
507 mkBalBranch key elt fm_L fm_R
509 | size_l + size_r < 2
510 = mkBranch 1{-which-} key elt fm_L fm_R
512 | size_r > sIZE_RATIO * size_l -- Right tree too big
514 Branch _ _ _ fm_rl fm_rr
515 | sizeFM fm_rl < 2 * sizeFM fm_rr -> single_L fm_L fm_R
516 | otherwise -> double_L fm_L fm_R
517 -- Other case impossible
519 | size_l > sIZE_RATIO * size_r -- Left tree too big
521 Branch _ _ _ fm_ll fm_lr
522 | sizeFM fm_lr < 2 * sizeFM fm_ll -> single_R fm_L fm_R
523 | otherwise -> double_R fm_L fm_R
524 -- Other case impossible
526 | otherwise -- No imbalance
527 = mkBranch 2{-which-} key elt fm_L fm_R
533 single_L fm_l (Branch key_r elt_r _ fm_rl fm_rr)
534 = mkBranch 3{-which-} key_r elt_r (mkBranch 4{-which-} key elt fm_l fm_rl) fm_rr
536 double_L fm_l (Branch key_r elt_r _ (Branch key_rl elt_rl _ fm_rll fm_rlr) fm_rr)
537 = mkBranch 5{-which-} key_rl elt_rl (mkBranch 6{-which-} key elt fm_l fm_rll)
538 (mkBranch 7{-which-} key_r elt_r fm_rlr fm_rr)
540 single_R (Branch key_l elt_l _ fm_ll fm_lr) fm_r
541 = mkBranch 8{-which-} key_l elt_l fm_ll (mkBranch 9{-which-} key elt fm_lr fm_r)
543 double_R (Branch key_l elt_l _ fm_ll (Branch key_lr elt_lr _ fm_lrl fm_lrr)) fm_r
544 = mkBranch 10{-which-} key_lr elt_lr (mkBranch 11{-which-} key_l elt_l fm_ll fm_lrl)
545 (mkBranch 12{-which-} key elt fm_lrr fm_r)
550 mkVBalBranch :: (Ord key OUTPUTABLE_key)
552 -> FiniteMap key elt -> FiniteMap key elt
555 -- Assert: in any call to (mkVBalBranch_C comb key elt l r),
556 -- (a) all keys in l are < all keys in r
557 -- (b) all keys in l are < key
558 -- (c) all keys in r are > key
560 mkVBalBranch key elt EmptyFM fm_r = addToFM fm_r key elt
561 mkVBalBranch key elt fm_l EmptyFM = addToFM fm_l key elt
563 mkVBalBranch key elt fm_l@(Branch key_l elt_l _ fm_ll fm_lr)
564 fm_r@(Branch key_r elt_r _ fm_rl fm_rr)
565 | sIZE_RATIO * size_l < size_r
566 = mkBalBranch key_r elt_r (mkVBalBranch key elt fm_l fm_rl) fm_rr
568 | sIZE_RATIO * size_r < size_l
569 = mkBalBranch key_l elt_l fm_ll (mkVBalBranch key elt fm_lr fm_r)
572 = mkBranch 13{-which-} key elt fm_l fm_r
579 %************************************************************************
581 \subsubsection{Gluing two trees together}
583 %************************************************************************
585 @glueBal@ assumes its two arguments aren't too far out of whack, just
586 like @mkBalBranch@. But: all keys in first arg are $<$ all keys in
590 glueBal :: (Ord key OUTPUTABLE_key)
591 => FiniteMap key elt -> FiniteMap key elt
594 glueBal EmptyFM fm2 = fm2
595 glueBal fm1 EmptyFM = fm1
597 -- The case analysis here (absent in Adams' program) is really to deal
598 -- with the case where fm2 is a singleton. Then deleting the minimum means
599 -- we pass an empty tree to mkBalBranch, which breaks its invariant.
600 | sizeFM fm2 > sizeFM fm1
601 = mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2)
604 = mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2
606 (mid_key1, mid_elt1) = findMax fm1
607 (mid_key2, mid_elt2) = findMin fm2
610 @glueVBal@ copes with arguments which can be of any size.
611 But: all keys in first arg are $<$ all keys in second.
614 glueVBal :: (Ord key OUTPUTABLE_key)
615 => FiniteMap key elt -> FiniteMap key elt
618 glueVBal EmptyFM fm2 = fm2
619 glueVBal fm1 EmptyFM = fm1
620 glueVBal fm_l@(Branch key_l elt_l _ fm_ll fm_lr)
621 fm_r@(Branch key_r elt_r _ fm_rl fm_rr)
622 | sIZE_RATIO * size_l < size_r
623 = mkBalBranch key_r elt_r (glueVBal fm_l fm_rl) fm_rr
625 | sIZE_RATIO * size_r < size_l
626 = mkBalBranch key_l elt_l fm_ll (glueVBal fm_lr fm_r)
628 | otherwise -- We now need the same two cases as in glueBal above.
631 (mid_key_l,mid_elt_l) = findMax fm_l
632 (mid_key_r,mid_elt_r) = findMin fm_r
637 %************************************************************************
639 \subsection{Local utilities}
641 %************************************************************************
644 splitLT, splitGT :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> FiniteMap key elt
646 -- splitLT fm split_key = fm restricted to keys < split_key
647 -- splitGT fm split_key = fm restricted to keys > split_key
649 splitLT EmptyFM split_key = emptyFM
650 splitLT (Branch key elt _ fm_l fm_r) split_key
651 #ifdef __GLASGOW_HASKELL__
652 = case _tagCmp split_key key of
653 _LT -> splitLT fm_l split_key
654 _GT -> mkVBalBranch key elt fm_l (splitLT fm_r split_key)
657 | split_key < key = splitLT fm_l split_key
658 | split_key > key = mkVBalBranch key elt fm_l (splitLT fm_r split_key)
662 splitGT EmptyFM split_key = emptyFM
663 splitGT (Branch key elt _ fm_l fm_r) split_key
664 #ifdef __GLASGOW_HASKELL__
665 = case _tagCmp split_key key of
666 _GT -> splitGT fm_r split_key
667 _LT -> mkVBalBranch key elt (splitGT fm_l split_key) fm_r
670 | split_key > key = splitGT fm_r split_key
671 | split_key < key = mkVBalBranch key elt (splitGT fm_l split_key) fm_r
675 findMin :: FiniteMap key elt -> (key,elt)
676 findMin (Branch key elt _ EmptyFM _) = (key,elt)
677 findMin (Branch key elt _ fm_l _) = findMin fm_l
679 deleteMin :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt
680 deleteMin (Branch key elt _ EmptyFM fm_r) = fm_r
681 deleteMin (Branch key elt _ fm_l fm_r) = mkBalBranch key elt (deleteMin fm_l) fm_r
683 findMax :: FiniteMap key elt -> (key,elt)
684 findMax (Branch key elt _ _ EmptyFM) = (key,elt)
685 findMax (Branch key elt _ _ fm_r) = findMax fm_r
687 deleteMax :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt
688 deleteMax (Branch key elt _ fm_l EmptyFM) = fm_l
689 deleteMax (Branch key elt _ fm_l fm_r) = mkBalBranch key elt fm_l (deleteMax fm_r)
692 %************************************************************************
694 \subsection{Output-ery}
696 %************************************************************************
699 #if defined(COMPILING_GHC) && defined(DEBUG_FINITEMAPS)
701 instance (Outputable key) => Outputable (FiniteMap key elt) where
702 ppr sty fm = pprX sty fm
704 pprX sty EmptyFM = ppChar '!'
705 pprX sty (Branch key elt sz fm_l fm_r)
706 = ppBesides [ppLparen, pprX sty fm_l, ppSP,
707 ppr sty key, ppSP, ppInt (IF_GHC(I# sz, sz)), ppSP,
708 pprX sty fm_r, ppRparen]
711 #ifndef COMPILING_GHC
712 instance (Eq key, Eq elt) => Eq (FiniteMap key elt) where
713 fm_1 == fm_2 = (sizeFM fm_1 == sizeFM fm_2) && -- quick test
714 (fmToList fm_1 == fmToList fm_2)
716 {- NO: not clear what The Right Thing to do is:
717 instance (Ord key, Ord elt) => Ord (FiniteMap key elt) where
718 fm_1 <= fm_2 = (sizeFM fm_1 <= sizeFM fm_2) && -- quick test
719 (fmToList fm_1 <= fmToList fm_2)
724 %************************************************************************
726 \subsection{FiniteSets---a thin veneer}
728 %************************************************************************
733 type FiniteSet key = FiniteMap key ()
734 emptySet :: FiniteSet key
735 mkSet :: (Ord key OUTPUTABLE_key) => [key] -> FiniteSet key
736 isEmptySet :: FiniteSet key -> Bool
737 elementOf :: (Ord key OUTPUTABLE_key) => key -> FiniteSet key -> Bool
738 minusSet :: (Ord key OUTPUTABLE_key) => FiniteSet key -> FiniteSet key -> FiniteSet key
739 setToList :: FiniteSet key -> [key]
740 union :: (Ord key OUTPUTABLE_key) => FiniteSet key -> FiniteSet key -> FiniteSet key
743 mkSet xs = listToFM [ (x, ()) | x <- xs]
744 isEmptySet = isEmptyFM
753 %************************************************************************
755 \subsection{Efficiency pragmas for GHC}
757 %************************************************************************
759 When the FiniteMap module is used in GHC, we specialise it for
760 \tr{Uniques}, for dastardly efficiency reasons.
763 #if defined(COMPILING_GHC) && __GLASGOW_HASKELL__ && !defined(REALLY_HASKELL_1_3)
765 {-# SPECIALIZE addListToFM
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 COMMA elt)] -> FiniteMap Reg elt)
770 {-# SPECIALIZE addListToFM_C
771 :: (elt -> elt -> elt) -> FiniteMap TyCon elt -> [(TyCon,elt)] -> FiniteMap TyCon 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 COMMA elt)] -> FiniteMap Reg elt)
775 {-# SPECIALIZE addToFM
776 :: FiniteMap CLabel elt -> CLabel -> elt -> FiniteMap CLabel elt
777 , FiniteMap FAST_STRING elt -> FAST_STRING -> elt -> FiniteMap FAST_STRING elt
778 , FiniteMap (FAST_STRING, FAST_STRING) elt -> (FAST_STRING, FAST_STRING) -> elt -> FiniteMap (FAST_STRING, FAST_STRING) elt
779 , FiniteMap RdrName elt -> RdrName -> elt -> FiniteMap RdrName elt
780 IF_NCG(COMMA FiniteMap Reg elt -> Reg -> elt -> FiniteMap Reg elt)
782 {-# SPECIALIZE addToFM_C
783 :: (elt -> elt -> elt) -> FiniteMap (RdrName, RdrName) elt -> (RdrName, RdrName) -> elt -> FiniteMap (RdrName, RdrName) elt
784 , (elt -> elt -> elt) -> FiniteMap FAST_STRING elt -> FAST_STRING -> elt -> FiniteMap FAST_STRING elt
785 IF_NCG(COMMA (elt -> elt -> elt) -> FiniteMap Reg elt -> Reg -> elt -> FiniteMap Reg elt)
787 {-# SPECIALIZE bagToFM
788 :: Bag (FAST_STRING,elt) -> FiniteMap FAST_STRING elt
790 {-# SPECIALIZE delListFromFM
791 :: FiniteMap RdrName elt -> [RdrName] -> FiniteMap RdrName elt
792 , FiniteMap FAST_STRING elt -> [FAST_STRING] -> FiniteMap FAST_STRING elt
793 IF_NCG(COMMA FiniteMap Reg elt -> [Reg] -> FiniteMap Reg elt)
795 {-# SPECIALIZE listToFM
796 :: [([Char],elt)] -> FiniteMap [Char] elt
797 , [(FAST_STRING,elt)] -> FiniteMap FAST_STRING elt
798 , [((FAST_STRING,FAST_STRING),elt)] -> FiniteMap (FAST_STRING, FAST_STRING) elt
799 IF_NCG(COMMA [(Reg COMMA elt)] -> FiniteMap Reg elt)
801 {-# SPECIALIZE lookupFM
802 :: FiniteMap CLabel elt -> CLabel -> Maybe elt
803 , FiniteMap [Char] elt -> [Char] -> Maybe elt
804 , FiniteMap FAST_STRING elt -> FAST_STRING -> Maybe elt
805 , FiniteMap (FAST_STRING,FAST_STRING) elt -> (FAST_STRING,FAST_STRING) -> Maybe elt
806 , FiniteMap RdrName elt -> RdrName -> Maybe elt
807 , FiniteMap (RdrName,RdrName) elt -> (RdrName,RdrName) -> Maybe elt
808 IF_NCG(COMMA FiniteMap Reg elt -> Reg -> Maybe elt)
810 {-# SPECIALIZE lookupWithDefaultFM
811 :: FiniteMap FAST_STRING elt -> elt -> FAST_STRING -> elt
812 IF_NCG(COMMA FiniteMap Reg elt -> elt -> Reg -> elt)
814 {-# SPECIALIZE plusFM
815 :: FiniteMap RdrName elt -> FiniteMap RdrName elt -> FiniteMap RdrName elt
816 , FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt
817 IF_NCG(COMMA FiniteMap Reg elt -> FiniteMap Reg elt -> FiniteMap Reg elt)
819 {-# SPECIALIZE plusFM_C
820 :: (elt -> elt -> elt) -> FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt
821 IF_NCG(COMMA (elt -> elt -> elt) -> FiniteMap Reg elt -> FiniteMap Reg elt -> FiniteMap Reg elt)
824 #endif {- compiling for GHC -}