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
30 #if defined(COMPILING_GHC) && defined(DEBUG_FINITEMAPS)/* NB NB NB */
31 #define OUTPUTABLE_key , Outputable key
33 #define OUTPUTABLE_key {--}
37 FiniteMap, -- abstract type
39 emptyFM, singletonFM, listToFM,
42 IF_NOT_GHC(addToFM_C COMMA)
44 IF_NOT_GHC(delFromFM COMMA)
48 IF_NOT_GHC(intersectFM COMMA intersectFM_C COMMA)
49 minusFM, -- exported for GHCI only
51 IF_NOT_GHC(mapFM COMMA foldFM COMMA filterFM COMMA)
53 IF_NOT_GHC(sizeFM COMMA)
54 isEmptyFM, elemFM, lookupFM, lookupWithDefaultFM,
56 fmToList, keysFM, eltsFM{-used in GHCI-}
59 , FiniteSet(..), emptySet, mkSet, isEmptySet
60 , elementOf, setToList, union, minusSet{-exported for GHCI-}
63 -- To make it self-sufficient
76 #if ! OMIT_NATIVE_CODEGEN
79 #define IF_NCG(a) {--}
83 -- SIGH: but we use unboxed "sizes"...
84 #if __GLASGOW_HASKELL__
92 %************************************************************************
94 \subsection{The signature of the module}
96 %************************************************************************
100 emptyFM :: FiniteMap key elt
101 singletonFM :: key -> elt -> FiniteMap key elt
102 listToFM :: (Ord key OUTPUTABLE_key) => [(key,elt)] -> FiniteMap key elt
103 -- In the case of duplicates, the last is taken
105 -- ADDING AND DELETING
106 -- Throws away any previous binding
107 -- In the list case, the items are added starting with the
108 -- first one in the list
109 addToFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> elt -> FiniteMap key elt
110 addListToFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> [(key,elt)] -> FiniteMap key elt
112 -- Combines with previous binding
113 addToFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
114 -> FiniteMap key elt -> key -> elt
116 addListToFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
117 -> FiniteMap key elt -> [(key,elt)]
120 -- Deletion doesn't complain if you try to delete something
122 delFromFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> FiniteMap key elt
123 delListFromFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> [key] -> FiniteMap key elt
126 -- Bindings in right argument shadow those in the left
127 plusFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt
130 -- Combines bindings for the same thing with the given function
131 plusFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
132 -> FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
134 minusFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
135 -- (minusFM a1 a2) deletes from a1 any bindings which are bound in a2
137 intersectFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
138 intersectFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
139 -> FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
141 -- MAPPING, FOLDING, FILTERING
142 foldFM :: (key -> elt -> a -> a) -> a -> FiniteMap key elt -> a
143 mapFM :: (key -> elt1 -> elt2) -> FiniteMap key elt1 -> FiniteMap key elt2
144 filterFM :: (Ord key OUTPUTABLE_key) => (key -> elt -> Bool)
145 -> FiniteMap key elt -> FiniteMap key elt
148 sizeFM :: FiniteMap key elt -> Int
149 isEmptyFM :: FiniteMap key elt -> Bool
151 elemFM :: (Ord key OUTPUTABLE_key) => key -> FiniteMap key elt -> Bool
152 lookupFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> Maybe elt
154 :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> elt -> key -> elt
155 -- lookupWithDefaultFM supplies a "default" elt
156 -- to return for an unmapped key
159 fmToList :: FiniteMap key elt -> [(key,elt)]
160 keysFM :: FiniteMap key elt -> [key]
161 eltsFM :: FiniteMap key elt -> [elt]
164 %************************************************************************
166 \subsection{The @FiniteMap@ data type, and building of same}
168 %************************************************************************
170 Invariants about @FiniteMap@:
173 all keys in a FiniteMap are distinct
175 all keys in left subtree are $<$ key in Branch and
176 all keys in right subtree are $>$ key in Branch
178 size field of a Branch gives number of Branch nodes in the tree
180 size of left subtree is differs from size of right subtree by a
181 factor of at most \tr{sIZE_RATIO}
185 data FiniteMap key elt
187 | Branch key elt -- Key and elt stored here
188 IF_GHC(Int#,Int{-STRICT-}) -- Size >= 1
189 (FiniteMap key elt) -- Children
197 = Branch bottom bottom IF_GHC(0#,0) bottom bottom
199 bottom = panic "emptyFM"
202 -- #define EmptyFM (Branch _ _ IF_GHC(0#,0) _ _)
204 singletonFM key elt = Branch key elt IF_GHC(1#,1) emptyFM emptyFM
206 listToFM key_elt_pairs = addListToFM emptyFM key_elt_pairs
209 %************************************************************************
211 \subsection{Adding to and deleting from @FiniteMaps@}
213 %************************************************************************
216 addToFM fm key elt = addToFM_C (\ old new -> new) fm key elt
218 addToFM_C combiner EmptyFM key elt = singletonFM key elt
219 addToFM_C combiner (Branch key elt size fm_l fm_r) new_key new_elt
220 #ifdef __GLASGOW_HASKELL__
221 = case _tagCmp new_key key of
222 _LT -> mkBalBranch key elt (addToFM_C combiner fm_l new_key new_elt) fm_r
223 _GT -> mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt)
224 _EQ -> Branch new_key (combiner elt new_elt) size fm_l fm_r
226 | new_key < key = mkBalBranch key elt (addToFM_C combiner fm_l new_key new_elt) fm_r
227 | new_key > key = mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt)
228 | otherwise = Branch new_key (combiner elt new_elt) size fm_l fm_r
231 addListToFM fm key_elt_pairs = addListToFM_C (\ old new -> new) fm key_elt_pairs
233 addListToFM_C combiner fm key_elt_pairs
234 = foldl add fm key_elt_pairs -- foldl adds from the left
236 add fmap (key,elt) = addToFM_C combiner fmap key elt
240 delFromFM EmptyFM del_key = emptyFM
241 delFromFM (Branch key elt size fm_l fm_r) del_key
242 #ifdef __GLASGOW_HASKELL__
243 = case _tagCmp del_key key of
244 _GT -> mkBalBranch key elt fm_l (delFromFM fm_r del_key)
245 _LT -> mkBalBranch key elt (delFromFM fm_l del_key) fm_r
246 _EQ -> glueBal fm_l fm_r
249 = mkBalBranch key elt fm_l (delFromFM fm_r del_key)
252 = mkBalBranch key elt (delFromFM fm_l del_key) fm_r
258 delListFromFM fm keys = foldl delFromFM fm keys
261 %************************************************************************
263 \subsection{Combining @FiniteMaps@}
265 %************************************************************************
268 plusFM_C combiner EmptyFM fm2 = fm2
269 plusFM_C combiner fm1 EmptyFM = fm1
270 plusFM_C combiner fm1 (Branch split_key elt2 _ left right)
271 = mkVBalBranch split_key new_elt
272 (plusFM_C combiner lts left)
273 (plusFM_C combiner gts right)
275 lts = splitLT fm1 split_key
276 gts = splitGT fm1 split_key
277 new_elt = case lookupFM fm1 split_key of
279 Just elt1 -> combiner elt1 elt2
281 -- It's worth doing plusFM specially, because we don't need
282 -- to do the lookup in fm1.
284 plusFM EmptyFM fm2 = fm2
285 plusFM fm1 EmptyFM = fm1
286 plusFM fm1 (Branch split_key elt1 _ left right)
287 = mkVBalBranch split_key elt1 (plusFM lts left) (plusFM gts right)
289 lts = splitLT fm1 split_key
290 gts = splitGT fm1 split_key
292 minusFM EmptyFM fm2 = emptyFM
293 minusFM fm1 EmptyFM = fm1
294 minusFM fm1 (Branch split_key elt _ left right)
295 = glueVBal (minusFM lts left) (minusFM gts right)
296 -- The two can be way different, so we need glueVBal
298 lts = splitLT fm1 split_key -- NB gt and lt, so the equal ones
299 gts = splitGT fm1 split_key -- are not in either.
301 intersectFM fm1 fm2 = intersectFM_C (\ left right -> right) fm1 fm2
303 intersectFM_C combiner fm1 EmptyFM = emptyFM
304 intersectFM_C combiner EmptyFM fm2 = emptyFM
305 intersectFM_C combiner fm1 (Branch split_key elt2 _ left right)
307 | maybeToBool maybe_elt1 -- split_elt *is* in intersection
308 = mkVBalBranch split_key (combiner elt1 elt2) (intersectFM_C combiner lts left)
309 (intersectFM_C combiner gts right)
311 | otherwise -- split_elt is *not* in intersection
312 = glueVBal (intersectFM_C combiner lts left) (intersectFM_C combiner gts right)
315 lts = splitLT fm1 split_key -- NB gt and lt, so the equal ones
316 gts = splitGT fm1 split_key -- are not in either.
318 maybe_elt1 = lookupFM fm1 split_key
319 Just elt1 = maybe_elt1
322 %************************************************************************
324 \subsection{Mapping, folding, and filtering with @FiniteMaps@}
326 %************************************************************************
329 foldFM k z EmptyFM = z
330 foldFM k z (Branch key elt _ fm_l fm_r)
331 = foldFM k (k key elt (foldFM k z fm_r)) fm_l
333 mapFM f EmptyFM = emptyFM
334 mapFM f (Branch key elt size fm_l fm_r)
335 = Branch key (f key elt) size (mapFM f fm_l) (mapFM f fm_r)
337 filterFM p EmptyFM = emptyFM
338 filterFM p (Branch key elt _ fm_l fm_r)
339 | p key elt -- Keep the item
340 = mkVBalBranch key elt (filterFM p fm_l) (filterFM p fm_r)
342 | otherwise -- Drop the item
343 = glueVBal (filterFM p fm_l) (filterFM p fm_r)
346 %************************************************************************
348 \subsection{Interrogating @FiniteMaps@}
350 %************************************************************************
353 --{-# INLINE sizeFM #-}
355 sizeFM (Branch _ _ size _ _) = IF_GHC(I# size, size)
357 isEmptyFM fm = sizeFM fm == 0
359 lookupFM EmptyFM key = Nothing
360 lookupFM (Branch key elt _ fm_l fm_r) key_to_find
361 #ifdef __GLASGOW_HASKELL__
362 = case _tagCmp key_to_find key of
363 _LT -> lookupFM fm_l key_to_find
364 _GT -> lookupFM fm_r key_to_find
367 | key_to_find < key = lookupFM fm_l key_to_find
368 | key_to_find > key = lookupFM fm_r key_to_find
369 | otherwise = Just elt
373 = case (lookupFM fm key) of { Nothing -> False; Just elt -> True }
375 lookupWithDefaultFM fm deflt key
376 = case (lookupFM fm key) of { Nothing -> deflt; Just elt -> elt }
379 %************************************************************************
381 \subsection{Listifying @FiniteMaps@}
383 %************************************************************************
386 fmToList fm = foldFM (\ key elt rest -> (key,elt) : rest) [] fm
387 keysFM fm = foldFM (\ key elt rest -> key : rest) [] fm
388 eltsFM fm = foldFM (\ key elt rest -> elt : rest) [] fm
392 %************************************************************************
394 \subsection{The implementation of balancing}
396 %************************************************************************
398 %************************************************************************
400 \subsubsection{Basic construction of a @FiniteMap@}
402 %************************************************************************
404 @mkBranch@ simply gets the size component right. This is the ONLY
405 (non-trivial) place the Branch object is built, so the ASSERTion
406 recursively checks consistency. (The trivial use of Branch is in
413 mkBranch :: (Ord key OUTPUTABLE_key) -- Used for the assertion checking only
416 -> FiniteMap key elt -> FiniteMap key elt
419 mkBranch which key elt fm_l fm_r
420 = --ASSERT( left_ok && right_ok && balance_ok )
421 #if defined(COMPILING_GHC) && defined(DEBUG_FINITEMAPS)
422 if not ( left_ok && right_ok && balance_ok ) then
423 pprPanic ("mkBranch:"++show which) (ppAboves [ppr PprDebug [left_ok, right_ok, balance_ok],
430 result = Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r
432 -- if sizeFM result <= 8 then
435 -- pprTrace ("mkBranch:"++(show which)) (ppr PprDebug result) (
439 left_ok = case fm_l of
441 Branch left_key _ _ _ _ -> let
442 biggest_left_key = fst (findMax fm_l)
444 biggest_left_key < key
445 right_ok = case fm_r of
447 Branch right_key _ _ _ _ -> let
448 smallest_right_key = fst (findMin fm_r)
450 key < smallest_right_key
451 balance_ok = True -- sigh
454 = -- Both subtrees have one or no elements...
455 (left_size + right_size <= 1)
456 -- NO || left_size == 0 -- ???
457 -- NO || right_size == 0 -- ???
458 -- ... or the number of elements in a subtree does not exceed
459 -- sIZE_RATIO times the number of elements in the other subtree
460 || (left_size * sIZE_RATIO >= right_size &&
461 right_size * sIZE_RATIO >= left_size)
464 left_size = sizeFM fm_l
465 right_size = sizeFM fm_r
467 #ifdef __GLASGOW_HASKELL__
469 unbox (I# size) = size
476 %************************************************************************
478 \subsubsection{{\em Balanced} construction of a @FiniteMap@}
480 %************************************************************************
482 @mkBalBranch@ rebalances, assuming that the subtrees aren't too far
486 mkBalBranch :: (Ord key OUTPUTABLE_key)
488 -> FiniteMap key elt -> FiniteMap key elt
491 mkBalBranch key elt fm_L fm_R
493 | size_l + size_r < 2
494 = mkBranch 1{-which-} key elt fm_L fm_R
496 | size_r > sIZE_RATIO * size_l -- Right tree too big
498 Branch _ _ _ fm_rl fm_rr
499 | sizeFM fm_rl < 2 * sizeFM fm_rr -> single_L fm_L fm_R
500 | otherwise -> double_L fm_L fm_R
501 -- Other case impossible
503 | size_l > sIZE_RATIO * size_r -- Left tree too big
505 Branch _ _ _ fm_ll fm_lr
506 | sizeFM fm_lr < 2 * sizeFM fm_ll -> single_R fm_L fm_R
507 | otherwise -> double_R fm_L fm_R
508 -- Other case impossible
510 | otherwise -- No imbalance
511 = mkBranch 2{-which-} key elt fm_L fm_R
517 single_L fm_l (Branch key_r elt_r _ fm_rl fm_rr)
518 = mkBranch 3{-which-} key_r elt_r (mkBranch 4{-which-} key elt fm_l fm_rl) fm_rr
520 double_L fm_l (Branch key_r elt_r _ (Branch key_rl elt_rl _ fm_rll fm_rlr) fm_rr)
521 = mkBranch 5{-which-} key_rl elt_rl (mkBranch 6{-which-} key elt fm_l fm_rll)
522 (mkBranch 7{-which-} key_r elt_r fm_rlr fm_rr)
524 single_R (Branch key_l elt_l _ fm_ll fm_lr) fm_r
525 = mkBranch 8{-which-} key_l elt_l fm_ll (mkBranch 9{-which-} key elt fm_lr fm_r)
527 double_R (Branch key_l elt_l _ fm_ll (Branch key_lr elt_lr _ fm_lrl fm_lrr)) fm_r
528 = mkBranch 10{-which-} key_lr elt_lr (mkBranch 11{-which-} key_l elt_l fm_ll fm_lrl)
529 (mkBranch 12{-which-} key elt fm_lrr fm_r)
534 mkVBalBranch :: (Ord key OUTPUTABLE_key)
536 -> FiniteMap key elt -> FiniteMap key elt
539 -- Assert: in any call to (mkVBalBranch_C comb key elt l r),
540 -- (a) all keys in l are < all keys in r
541 -- (b) all keys in l are < key
542 -- (c) all keys in r are > key
544 mkVBalBranch key elt EmptyFM fm_r = addToFM fm_r key elt
545 mkVBalBranch key elt fm_l EmptyFM = addToFM fm_l key elt
547 mkVBalBranch key elt fm_l@(Branch key_l elt_l _ fm_ll fm_lr)
548 fm_r@(Branch key_r elt_r _ fm_rl fm_rr)
549 | sIZE_RATIO * size_l < size_r
550 = mkBalBranch key_r elt_r (mkVBalBranch key elt fm_l fm_rl) fm_rr
552 | sIZE_RATIO * size_r < size_l
553 = mkBalBranch key_l elt_l fm_ll (mkVBalBranch key elt fm_lr fm_r)
556 = mkBranch 13{-which-} key elt fm_l fm_r
563 %************************************************************************
565 \subsubsection{Gluing two trees together}
567 %************************************************************************
569 @glueBal@ assumes its two arguments aren't too far out of whack, just
570 like @mkBalBranch@. But: all keys in first arg are $<$ all keys in
574 glueBal :: (Ord key OUTPUTABLE_key)
575 => FiniteMap key elt -> FiniteMap key elt
578 glueBal EmptyFM fm2 = fm2
579 glueBal fm1 EmptyFM = fm1
581 -- The case analysis here (absent in Adams' program) is really to deal
582 -- with the case where fm2 is a singleton. Then deleting the minimum means
583 -- we pass an empty tree to mkBalBranch, which breaks its invariant.
584 | sizeFM fm2 > sizeFM fm1
585 = mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2)
588 = mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2
590 (mid_key1, mid_elt1) = findMax fm1
591 (mid_key2, mid_elt2) = findMin fm2
594 @glueVBal@ copes with arguments which can be of any size.
595 But: all keys in first arg are $<$ all keys in second.
598 glueVBal :: (Ord key OUTPUTABLE_key)
599 => FiniteMap key elt -> FiniteMap key elt
602 glueVBal EmptyFM fm2 = fm2
603 glueVBal fm1 EmptyFM = fm1
604 glueVBal fm_l@(Branch key_l elt_l _ fm_ll fm_lr)
605 fm_r@(Branch key_r elt_r _ fm_rl fm_rr)
606 | sIZE_RATIO * size_l < size_r
607 = mkBalBranch key_r elt_r (glueVBal fm_l fm_rl) fm_rr
609 | sIZE_RATIO * size_r < size_l
610 = mkBalBranch key_l elt_l fm_ll (glueVBal fm_lr fm_r)
612 | otherwise -- We now need the same two cases as in glueBal above.
615 (mid_key_l,mid_elt_l) = findMax fm_l
616 (mid_key_r,mid_elt_r) = findMin fm_r
621 %************************************************************************
623 \subsection{Local utilities}
625 %************************************************************************
628 splitLT, splitGT :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> FiniteMap key elt
630 -- splitLT fm split_key = fm restricted to keys < split_key
631 -- splitGT fm split_key = fm restricted to keys > split_key
633 splitLT EmptyFM split_key = emptyFM
634 splitLT (Branch key elt _ fm_l fm_r) split_key
635 #ifdef __GLASGOW_HASKELL__
636 = case _tagCmp split_key key of
637 _LT -> splitLT fm_l split_key
638 _GT -> mkVBalBranch key elt fm_l (splitLT fm_r split_key)
641 | split_key < key = splitLT fm_l split_key
642 | split_key > key = mkVBalBranch key elt fm_l (splitLT fm_r split_key)
646 splitGT EmptyFM split_key = emptyFM
647 splitGT (Branch key elt _ fm_l fm_r) split_key
648 #ifdef __GLASGOW_HASKELL__
649 = case _tagCmp split_key key of
650 _GT -> splitGT fm_r split_key
651 _LT -> mkVBalBranch key elt (splitGT fm_l split_key) fm_r
654 | split_key > key = splitGT fm_r split_key
655 | split_key < key = mkVBalBranch key elt (splitGT fm_l split_key) fm_r
659 findMin :: FiniteMap key elt -> (key,elt)
660 findMin (Branch key elt _ EmptyFM _) = (key,elt)
661 findMin (Branch key elt _ fm_l _) = findMin fm_l
663 deleteMin :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt
664 deleteMin (Branch key elt _ EmptyFM fm_r) = fm_r
665 deleteMin (Branch key elt _ fm_l fm_r) = mkBalBranch key elt (deleteMin fm_l) fm_r
667 findMax :: FiniteMap key elt -> (key,elt)
668 findMax (Branch key elt _ _ EmptyFM) = (key,elt)
669 findMax (Branch key elt _ _ fm_r) = findMax fm_r
671 deleteMax :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt
672 deleteMax (Branch key elt _ fm_l EmptyFM) = fm_l
673 deleteMax (Branch key elt _ fm_l fm_r) = mkBalBranch key elt fm_l (deleteMax fm_r)
676 %************************************************************************
678 \subsection{Output-ery}
680 %************************************************************************
683 #if defined(COMPILING_GHC) && defined(DEBUG_FINITEMAPS)
685 instance (Outputable key) => Outputable (FiniteMap key elt) where
686 ppr sty fm = pprX sty fm
688 pprX sty EmptyFM = ppChar '!'
689 pprX sty (Branch key elt sz fm_l fm_r)
690 = ppBesides [ppLparen, pprX sty fm_l, ppSP,
691 ppr sty key, ppSP, ppInt (IF_GHC(I# sz, sz)), ppSP,
692 pprX sty fm_r, ppRparen]
695 #ifndef COMPILING_GHC
696 instance (Eq key, Eq elt) => Eq (FiniteMap key elt) where
697 fm_1 == fm_2 = (sizeFM fm_1 == sizeFM fm_2) && -- quick test
698 (fmToList fm_1 == fmToList fm_2)
700 {- NO: not clear what The Right Thing to do is:
701 instance (Ord key, Ord elt) => Ord (FiniteMap key elt) where
702 fm_1 <= fm_2 = (sizeFM fm_1 <= sizeFM fm_2) && -- quick test
703 (fmToList fm_1 <= fmToList fm_2)
708 %************************************************************************
710 \subsection{FiniteSets---a thin veneer}
712 %************************************************************************
717 type FiniteSet key = FiniteMap key ()
718 emptySet :: FiniteSet key
719 mkSet :: (Ord key OUTPUTABLE_key) => [key] -> FiniteSet key
720 isEmptySet :: FiniteSet key -> Bool
721 elementOf :: (Ord key OUTPUTABLE_key) => key -> FiniteSet key -> Bool
722 minusSet :: (Ord key OUTPUTABLE_key) => FiniteSet key -> FiniteSet key -> FiniteSet key
723 setToList :: FiniteSet key -> [key]
724 union :: (Ord key OUTPUTABLE_key) => FiniteSet key -> FiniteSet key -> FiniteSet key
727 mkSet xs = listToFM [ (x, ()) | x <- xs]
728 isEmptySet = isEmptyFM
737 %************************************************************************
739 \subsection{Efficiency pragmas for GHC}
741 %************************************************************************
743 When the FiniteMap module is used in GHC, we specialise it for
744 \tr{Uniques}, for dastardly efficiency reasons.
748 #if defined(COMPILING_GHC) && __GLASGOW_HASKELL__
750 {-# SPECIALIZE listToFM
751 :: [(Int,elt)] -> FiniteMap Int elt,
752 [(CLabel,elt)] -> FiniteMap CLabel elt,
753 [(FAST_STRING,elt)] -> FiniteMap FAST_STRING elt,
754 [((FAST_STRING,FAST_STRING),elt)] -> FiniteMap (FAST_STRING, FAST_STRING) elt
755 IF_NCG(COMMA [(Reg COMMA elt)] -> FiniteMap Reg elt)
757 {-# SPECIALIZE addToFM
758 :: FiniteMap Int elt -> Int -> elt -> FiniteMap Int elt,
759 FiniteMap FAST_STRING elt -> FAST_STRING -> elt -> FiniteMap FAST_STRING elt,
760 FiniteMap CLabel elt -> CLabel -> elt -> FiniteMap CLabel elt
761 IF_NCG(COMMA FiniteMap Reg elt -> Reg -> elt -> FiniteMap Reg elt)
763 {-# SPECIALIZE addListToFM
764 :: FiniteMap Int elt -> [(Int,elt)] -> FiniteMap Int elt,
765 FiniteMap CLabel elt -> [(CLabel,elt)] -> FiniteMap CLabel elt
766 IF_NCG(COMMA FiniteMap Reg elt -> [(Reg COMMA elt)] -> FiniteMap Reg elt)
768 {-NOT EXPORTED!! # SPECIALIZE addToFM_C
769 :: (elt -> elt -> elt) -> FiniteMap Int elt -> Int -> elt -> FiniteMap Int elt,
770 (elt -> elt -> elt) -> FiniteMap CLabel elt -> CLabel -> elt -> FiniteMap CLabel elt
771 IF_NCG(COMMA (elt -> elt -> elt) -> FiniteMap Reg elt -> Reg -> elt -> FiniteMap Reg elt)
773 {-# SPECIALIZE addListToFM_C
774 :: (elt -> elt -> elt) -> FiniteMap Int elt -> [(Int,elt)] -> FiniteMap Int elt,
775 (elt -> elt -> elt) -> FiniteMap TyCon elt -> [(TyCon,elt)] -> FiniteMap TyCon elt,
776 (elt -> elt -> elt) -> FiniteMap CLabel elt -> [(CLabel,elt)] -> FiniteMap CLabel elt
777 IF_NCG(COMMA (elt -> elt -> elt) -> FiniteMap Reg elt -> [(Reg COMMA elt)] -> FiniteMap Reg elt)
779 {-NOT EXPORTED!!! # SPECIALIZE delFromFM
780 :: FiniteMap Int elt -> Int -> FiniteMap Int elt,
781 FiniteMap CLabel elt -> CLabel -> FiniteMap CLabel elt
782 IF_NCG(COMMA FiniteMap Reg elt -> Reg -> FiniteMap Reg elt)
784 {-# SPECIALIZE delListFromFM
785 :: FiniteMap Int elt -> [Int] -> FiniteMap Int elt,
786 FiniteMap CLabel elt -> [CLabel] -> FiniteMap CLabel elt
787 IF_NCG(COMMA FiniteMap Reg elt -> [Reg] -> FiniteMap Reg elt)
789 {-# SPECIALIZE elemFM
790 :: FAST_STRING -> FiniteMap FAST_STRING elt -> Bool
792 {-not EXPORTED!!! # SPECIALIZE filterFM
793 :: (Int -> elt -> Bool) -> FiniteMap Int elt -> FiniteMap Int elt,
794 (CLabel -> elt -> Bool) -> FiniteMap CLabel elt -> FiniteMap CLabel elt
795 IF_NCG(COMMA (Reg -> elt -> Bool) -> FiniteMap Reg elt -> FiniteMap Reg elt)
797 {-NOT EXPORTED!!! # SPECIALIZE intersectFM
798 :: FiniteMap Int elt -> FiniteMap Int elt -> FiniteMap Int elt,
799 FiniteMap CLabel elt -> FiniteMap CLabel elt -> FiniteMap CLabel elt
800 IF_NCG(COMMA FiniteMap Reg elt -> FiniteMap Reg elt -> FiniteMap Reg elt)
802 {-not EXPORTED !!!# SPECIALIZE intersectFM_C
803 :: (elt -> elt -> elt) -> FiniteMap Int elt -> FiniteMap Int elt -> FiniteMap Int elt,
804 (elt -> elt -> elt) -> FiniteMap CLabel elt -> FiniteMap CLabel elt -> FiniteMap CLabel elt
805 IF_NCG(COMMA (elt -> elt -> elt) -> FiniteMap Reg elt -> FiniteMap Reg elt -> FiniteMap Reg elt)
807 {-# SPECIALIZE lookupFM
808 :: FiniteMap Int elt -> Int -> Maybe elt,
809 FiniteMap CLabel elt -> CLabel -> Maybe elt,
810 FiniteMap FAST_STRING elt -> FAST_STRING -> Maybe elt,
811 FiniteMap (FAST_STRING,FAST_STRING) elt -> (FAST_STRING,FAST_STRING) -> Maybe elt
812 IF_NCG(COMMA FiniteMap Reg elt -> Reg -> Maybe elt)
814 {-# SPECIALIZE lookupWithDefaultFM
815 :: FiniteMap Int elt -> elt -> Int -> elt,
816 FiniteMap CLabel elt -> elt -> CLabel -> elt
817 IF_NCG(COMMA FiniteMap Reg elt -> elt -> Reg -> elt)
819 {-# SPECIALIZE minusFM
820 :: FiniteMap Int elt -> FiniteMap Int elt -> FiniteMap Int elt,
821 FiniteMap TyCon elt -> FiniteMap TyCon elt -> FiniteMap TyCon elt,
822 FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt,
823 FiniteMap CLabel elt -> FiniteMap CLabel elt -> FiniteMap CLabel elt
824 IF_NCG(COMMA FiniteMap Reg elt -> FiniteMap Reg elt -> FiniteMap Reg elt)
826 {-# SPECIALIZE plusFM
827 :: FiniteMap Int elt -> FiniteMap Int elt -> FiniteMap Int elt,
828 FiniteMap TyCon elt -> FiniteMap TyCon elt -> FiniteMap TyCon elt,
829 FiniteMap CLabel elt -> FiniteMap CLabel elt -> FiniteMap CLabel elt
830 IF_NCG(COMMA FiniteMap Reg elt -> FiniteMap Reg elt -> FiniteMap Reg elt)
832 {-# SPECIALIZE plusFM_C
833 :: (elt -> elt -> elt) -> FiniteMap Int elt -> FiniteMap Int elt -> FiniteMap Int elt,
834 (elt -> elt -> elt) -> FiniteMap CLabel elt -> FiniteMap CLabel elt -> FiniteMap CLabel elt
835 IF_NCG(COMMA (elt -> elt -> elt) -> FiniteMap Reg elt -> FiniteMap Reg elt -> FiniteMap Reg elt)
838 #endif {- compiling for GHC -}