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, unitFM, listToFM,
45 IF_NOT_GHC(delFromFM COMMA)
53 IF_NOT_GHC(intersectFM COMMA)
54 IF_NOT_GHC(intersectFM_C COMMA)
55 IF_NOT_GHC(mapFM COMMA filterFM COMMA)
57 sizeFM, isEmptyFM, elemFM, lookupFM, lookupWithDefaultFM,
59 fmToList, keysFM, eltsFM
63 , SYN_IE(FiniteSet), emptySet, mkSet, isEmptySet
64 , elementOf, setToList, union, minusSet
75 import Bag ( foldBag )
76 import {-hide from mkdependHS-}
77 Name ( RdrName, OrigName ) -- specialising only
79 # if ! OMIT_NATIVE_CODEGEN
82 # define IF_NCG(a) {--}
86 -- SIGH: but we use unboxed "sizes"...
87 #if __GLASGOW_HASKELL__
95 %************************************************************************
97 \subsection{The signature of the module}
99 %************************************************************************
103 emptyFM :: FiniteMap key elt
104 unitFM :: key -> elt -> FiniteMap key elt
105 listToFM :: (Ord key OUTPUTABLE_key) => [(key,elt)] -> FiniteMap key elt
106 -- In the case of duplicates, the last is taken
108 bagToFM :: (Ord key OUTPUTABLE_key) => Bag (key,elt) -> FiniteMap key elt
109 -- In the case of duplicates, who knows which is taken
112 -- ADDING AND DELETING
113 -- Throws away any previous binding
114 -- In the list case, the items are added starting with the
115 -- first one in the list
116 addToFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> elt -> FiniteMap key elt
117 addListToFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> [(key,elt)] -> FiniteMap key elt
119 -- Combines with previous binding
120 addToFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
121 -> FiniteMap key elt -> key -> elt
123 addListToFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
124 -> FiniteMap key elt -> [(key,elt)]
127 -- Deletion doesn't complain if you try to delete something
129 delFromFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> FiniteMap key elt
130 delListFromFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> [key] -> FiniteMap key elt
133 -- Bindings in right argument shadow those in the left
134 plusFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt
137 -- Combines bindings for the same thing with the given function
138 plusFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
139 -> FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
141 minusFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
142 -- (minusFM a1 a2) deletes from a1 any bindings which are bound in a2
144 intersectFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
145 intersectFM_C :: (Ord key OUTPUTABLE_key) => (elt -> elt -> elt)
146 -> FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt
148 -- MAPPING, FOLDING, FILTERING
149 foldFM :: (key -> elt -> a -> a) -> a -> FiniteMap key elt -> a
150 mapFM :: (key -> elt1 -> elt2) -> FiniteMap key elt1 -> FiniteMap key elt2
151 filterFM :: (Ord key OUTPUTABLE_key) => (key -> elt -> Bool)
152 -> FiniteMap key elt -> FiniteMap key elt
155 sizeFM :: FiniteMap key elt -> Int
156 isEmptyFM :: FiniteMap key elt -> Bool
158 elemFM :: (Ord key OUTPUTABLE_key) => key -> FiniteMap key elt -> Bool
159 lookupFM :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> Maybe elt
161 :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> elt -> key -> elt
162 -- lookupWithDefaultFM supplies a "default" elt
163 -- to return for an unmapped key
166 fmToList :: FiniteMap key elt -> [(key,elt)]
167 keysFM :: FiniteMap key elt -> [key]
168 eltsFM :: FiniteMap key elt -> [elt]
171 %************************************************************************
173 \subsection{The @FiniteMap@ data type, and building of same}
175 %************************************************************************
177 Invariants about @FiniteMap@:
180 all keys in a FiniteMap are distinct
182 all keys in left subtree are $<$ key in Branch and
183 all keys in right subtree are $>$ key in Branch
185 size field of a Branch gives number of Branch nodes in the tree
187 size of left subtree is differs from size of right subtree by a
188 factor of at most \tr{sIZE_RATIO}
192 data FiniteMap key elt
194 | Branch key elt -- Key and elt stored here
195 IF_GHC(Int#,Int{-STRICT-}) -- Size >= 1
196 (FiniteMap key elt) -- Children
204 = Branch bottom bottom IF_GHC(0#,0) bottom bottom
206 bottom = panic "emptyFM"
209 -- #define EmptyFM (Branch _ _ IF_GHC(0#,0) _ _)
211 unitFM key elt = Branch key elt IF_GHC(1#,1) emptyFM emptyFM
213 listToFM = addListToFM emptyFM
216 bagToFM = foldBag plusFM (\ (k,v) -> unitFM k v) emptyFM
220 %************************************************************************
222 \subsection{Adding to and deleting from @FiniteMaps@}
224 %************************************************************************
227 addToFM fm key elt = addToFM_C (\ old new -> new) fm key elt
229 addToFM_C combiner EmptyFM key elt = unitFM key elt
230 addToFM_C combiner (Branch key elt size fm_l fm_r) new_key new_elt
231 #ifdef __GLASGOW_HASKELL__
232 = case _tagCmp new_key key of
233 _LT -> mkBalBranch key elt (addToFM_C combiner fm_l new_key new_elt) fm_r
234 _GT -> mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt)
235 _EQ -> Branch new_key (combiner elt new_elt) size fm_l fm_r
237 | new_key < key = mkBalBranch key elt (addToFM_C combiner fm_l new_key new_elt) fm_r
238 | new_key > key = mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt)
239 | otherwise = Branch new_key (combiner elt new_elt) size fm_l fm_r
242 addListToFM fm key_elt_pairs = addListToFM_C (\ old new -> new) fm key_elt_pairs
244 addListToFM_C combiner fm key_elt_pairs
245 = foldl add fm key_elt_pairs -- foldl adds from the left
247 add fmap (key,elt) = addToFM_C combiner fmap key elt
251 delFromFM EmptyFM del_key = emptyFM
252 delFromFM (Branch key elt size fm_l fm_r) del_key
253 #ifdef __GLASGOW_HASKELL__
254 = case _tagCmp del_key key of
255 _GT -> mkBalBranch key elt fm_l (delFromFM fm_r del_key)
256 _LT -> mkBalBranch key elt (delFromFM fm_l del_key) fm_r
257 _EQ -> glueBal fm_l fm_r
260 = mkBalBranch key elt fm_l (delFromFM fm_r del_key)
263 = mkBalBranch key elt (delFromFM fm_l del_key) fm_r
269 delListFromFM fm keys = foldl delFromFM fm keys
272 %************************************************************************
274 \subsection{Combining @FiniteMaps@}
276 %************************************************************************
279 plusFM_C combiner EmptyFM fm2 = fm2
280 plusFM_C combiner fm1 EmptyFM = fm1
281 plusFM_C combiner fm1 (Branch split_key elt2 _ left right)
282 = mkVBalBranch split_key new_elt
283 (plusFM_C combiner lts left)
284 (plusFM_C combiner gts right)
286 lts = splitLT fm1 split_key
287 gts = splitGT fm1 split_key
288 new_elt = case lookupFM fm1 split_key of
290 Just elt1 -> combiner elt1 elt2
292 -- It's worth doing plusFM specially, because we don't need
293 -- to do the lookup in fm1.
295 plusFM EmptyFM fm2 = fm2
296 plusFM fm1 EmptyFM = fm1
297 plusFM fm1 (Branch split_key elt1 _ left right)
298 = mkVBalBranch split_key elt1 (plusFM lts left) (plusFM gts right)
300 lts = splitLT fm1 split_key
301 gts = splitGT fm1 split_key
303 minusFM EmptyFM fm2 = emptyFM
304 minusFM fm1 EmptyFM = fm1
305 minusFM fm1 (Branch split_key elt _ left right)
306 = glueVBal (minusFM lts left) (minusFM gts right)
307 -- The two can be way different, so we need glueVBal
309 lts = splitLT fm1 split_key -- NB gt and lt, so the equal ones
310 gts = splitGT fm1 split_key -- are not in either.
312 intersectFM fm1 fm2 = intersectFM_C (\ left right -> right) fm1 fm2
314 intersectFM_C combiner fm1 EmptyFM = emptyFM
315 intersectFM_C combiner EmptyFM fm2 = emptyFM
316 intersectFM_C combiner fm1 (Branch split_key elt2 _ left right)
318 | maybeToBool maybe_elt1 -- split_elt *is* in intersection
319 = mkVBalBranch split_key (combiner elt1 elt2) (intersectFM_C combiner lts left)
320 (intersectFM_C combiner gts right)
322 | otherwise -- split_elt is *not* in intersection
323 = glueVBal (intersectFM_C combiner lts left) (intersectFM_C combiner gts right)
326 lts = splitLT fm1 split_key -- NB gt and lt, so the equal ones
327 gts = splitGT fm1 split_key -- are not in either.
329 maybe_elt1 = lookupFM fm1 split_key
330 Just elt1 = maybe_elt1
333 %************************************************************************
335 \subsection{Mapping, folding, and filtering with @FiniteMaps@}
337 %************************************************************************
340 foldFM k z EmptyFM = z
341 foldFM k z (Branch key elt _ fm_l fm_r)
342 = foldFM k (k key elt (foldFM k z fm_r)) fm_l
344 mapFM f EmptyFM = emptyFM
345 mapFM f (Branch key elt size fm_l fm_r)
346 = Branch key (f key elt) size (mapFM f fm_l) (mapFM f fm_r)
348 filterFM p EmptyFM = emptyFM
349 filterFM p (Branch key elt _ fm_l fm_r)
350 | p key elt -- Keep the item
351 = mkVBalBranch key elt (filterFM p fm_l) (filterFM p fm_r)
353 | otherwise -- Drop the item
354 = glueVBal (filterFM p fm_l) (filterFM p fm_r)
357 %************************************************************************
359 \subsection{Interrogating @FiniteMaps@}
361 %************************************************************************
364 --{-# INLINE sizeFM #-}
366 sizeFM (Branch _ _ size _ _) = IF_GHC(I# size, size)
368 isEmptyFM fm = sizeFM fm == 0
370 lookupFM EmptyFM key = Nothing
371 lookupFM (Branch key elt _ fm_l fm_r) key_to_find
372 #ifdef __GLASGOW_HASKELL__
373 = case _tagCmp key_to_find key of
374 _LT -> lookupFM fm_l key_to_find
375 _GT -> lookupFM fm_r key_to_find
378 | key_to_find < key = lookupFM fm_l key_to_find
379 | key_to_find > key = lookupFM fm_r key_to_find
380 | otherwise = Just elt
384 = case (lookupFM fm key) of { Nothing -> False; Just elt -> True }
386 lookupWithDefaultFM fm deflt key
387 = case (lookupFM fm key) of { Nothing -> deflt; Just elt -> elt }
390 %************************************************************************
392 \subsection{Listifying @FiniteMaps@}
394 %************************************************************************
397 fmToList fm = foldFM (\ key elt rest -> (key,elt) : rest) [] fm
398 keysFM fm = foldFM (\ key elt rest -> key : rest) [] fm
399 eltsFM fm = foldFM (\ key elt rest -> elt : rest) [] fm
403 %************************************************************************
405 \subsection{The implementation of balancing}
407 %************************************************************************
409 %************************************************************************
411 \subsubsection{Basic construction of a @FiniteMap@}
413 %************************************************************************
415 @mkBranch@ simply gets the size component right. This is the ONLY
416 (non-trivial) place the Branch object is built, so the ASSERTion
417 recursively checks consistency. (The trivial use of Branch is in
424 mkBranch :: (Ord key OUTPUTABLE_key) -- Used for the assertion checking only
427 -> FiniteMap key elt -> FiniteMap key elt
430 mkBranch which key elt fm_l fm_r
431 = --ASSERT( left_ok && right_ok && balance_ok )
432 #if defined(COMPILING_GHC) && defined(DEBUG_FINITEMAPS)
433 if not ( left_ok && right_ok && balance_ok ) then
434 pprPanic ("mkBranch:"++show which) (ppAboves [ppr PprDebug [left_ok, right_ok, balance_ok],
441 result = Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r
443 -- if sizeFM result <= 8 then
446 -- pprTrace ("mkBranch:"++(show which)) (ppr PprDebug result) (
450 left_ok = case fm_l of
452 Branch left_key _ _ _ _ -> let
453 biggest_left_key = fst (findMax fm_l)
455 biggest_left_key < key
456 right_ok = case fm_r of
458 Branch right_key _ _ _ _ -> let
459 smallest_right_key = fst (findMin fm_r)
461 key < smallest_right_key
462 balance_ok = True -- sigh
465 = -- Both subtrees have one or no elements...
466 (left_size + right_size <= 1)
467 -- NO || left_size == 0 -- ???
468 -- NO || right_size == 0 -- ???
469 -- ... or the number of elements in a subtree does not exceed
470 -- sIZE_RATIO times the number of elements in the other subtree
471 || (left_size * sIZE_RATIO >= right_size &&
472 right_size * sIZE_RATIO >= left_size)
475 left_size = sizeFM fm_l
476 right_size = sizeFM fm_r
478 #ifdef __GLASGOW_HASKELL__
480 unbox (I# size) = size
487 %************************************************************************
489 \subsubsection{{\em Balanced} construction of a @FiniteMap@}
491 %************************************************************************
493 @mkBalBranch@ rebalances, assuming that the subtrees aren't too far
497 mkBalBranch :: (Ord key OUTPUTABLE_key)
499 -> FiniteMap key elt -> FiniteMap key elt
502 mkBalBranch key elt fm_L fm_R
504 | size_l + size_r < 2
505 = mkBranch 1{-which-} key elt fm_L fm_R
507 | size_r > sIZE_RATIO * size_l -- Right tree too big
509 Branch _ _ _ fm_rl fm_rr
510 | sizeFM fm_rl < 2 * sizeFM fm_rr -> single_L fm_L fm_R
511 | otherwise -> double_L fm_L fm_R
512 -- Other case impossible
514 | size_l > sIZE_RATIO * size_r -- Left tree too big
516 Branch _ _ _ fm_ll fm_lr
517 | sizeFM fm_lr < 2 * sizeFM fm_ll -> single_R fm_L fm_R
518 | otherwise -> double_R fm_L fm_R
519 -- Other case impossible
521 | otherwise -- No imbalance
522 = mkBranch 2{-which-} key elt fm_L fm_R
528 single_L fm_l (Branch key_r elt_r _ fm_rl fm_rr)
529 = mkBranch 3{-which-} key_r elt_r (mkBranch 4{-which-} key elt fm_l fm_rl) fm_rr
531 double_L fm_l (Branch key_r elt_r _ (Branch key_rl elt_rl _ fm_rll fm_rlr) fm_rr)
532 = mkBranch 5{-which-} key_rl elt_rl (mkBranch 6{-which-} key elt fm_l fm_rll)
533 (mkBranch 7{-which-} key_r elt_r fm_rlr fm_rr)
535 single_R (Branch key_l elt_l _ fm_ll fm_lr) fm_r
536 = mkBranch 8{-which-} key_l elt_l fm_ll (mkBranch 9{-which-} key elt fm_lr fm_r)
538 double_R (Branch key_l elt_l _ fm_ll (Branch key_lr elt_lr _ fm_lrl fm_lrr)) fm_r
539 = mkBranch 10{-which-} key_lr elt_lr (mkBranch 11{-which-} key_l elt_l fm_ll fm_lrl)
540 (mkBranch 12{-which-} key elt fm_lrr fm_r)
545 mkVBalBranch :: (Ord key OUTPUTABLE_key)
547 -> FiniteMap key elt -> FiniteMap key elt
550 -- Assert: in any call to (mkVBalBranch_C comb key elt l r),
551 -- (a) all keys in l are < all keys in r
552 -- (b) all keys in l are < key
553 -- (c) all keys in r are > key
555 mkVBalBranch key elt EmptyFM fm_r = addToFM fm_r key elt
556 mkVBalBranch key elt fm_l EmptyFM = addToFM fm_l key elt
558 mkVBalBranch key elt fm_l@(Branch key_l elt_l _ fm_ll fm_lr)
559 fm_r@(Branch key_r elt_r _ fm_rl fm_rr)
560 | sIZE_RATIO * size_l < size_r
561 = mkBalBranch key_r elt_r (mkVBalBranch key elt fm_l fm_rl) fm_rr
563 | sIZE_RATIO * size_r < size_l
564 = mkBalBranch key_l elt_l fm_ll (mkVBalBranch key elt fm_lr fm_r)
567 = mkBranch 13{-which-} key elt fm_l fm_r
574 %************************************************************************
576 \subsubsection{Gluing two trees together}
578 %************************************************************************
580 @glueBal@ assumes its two arguments aren't too far out of whack, just
581 like @mkBalBranch@. But: all keys in first arg are $<$ all keys in
585 glueBal :: (Ord key OUTPUTABLE_key)
586 => FiniteMap key elt -> FiniteMap key elt
589 glueBal EmptyFM fm2 = fm2
590 glueBal fm1 EmptyFM = fm1
592 -- The case analysis here (absent in Adams' program) is really to deal
593 -- with the case where fm2 is a singleton. Then deleting the minimum means
594 -- we pass an empty tree to mkBalBranch, which breaks its invariant.
595 | sizeFM fm2 > sizeFM fm1
596 = mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2)
599 = mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2
601 (mid_key1, mid_elt1) = findMax fm1
602 (mid_key2, mid_elt2) = findMin fm2
605 @glueVBal@ copes with arguments which can be of any size.
606 But: all keys in first arg are $<$ all keys in second.
609 glueVBal :: (Ord key OUTPUTABLE_key)
610 => FiniteMap key elt -> FiniteMap key elt
613 glueVBal EmptyFM fm2 = fm2
614 glueVBal fm1 EmptyFM = fm1
615 glueVBal fm_l@(Branch key_l elt_l _ fm_ll fm_lr)
616 fm_r@(Branch key_r elt_r _ fm_rl fm_rr)
617 | sIZE_RATIO * size_l < size_r
618 = mkBalBranch key_r elt_r (glueVBal fm_l fm_rl) fm_rr
620 | sIZE_RATIO * size_r < size_l
621 = mkBalBranch key_l elt_l fm_ll (glueVBal fm_lr fm_r)
623 | otherwise -- We now need the same two cases as in glueBal above.
626 (mid_key_l,mid_elt_l) = findMax fm_l
627 (mid_key_r,mid_elt_r) = findMin fm_r
632 %************************************************************************
634 \subsection{Local utilities}
636 %************************************************************************
639 splitLT, splitGT :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> key -> FiniteMap key elt
641 -- splitLT fm split_key = fm restricted to keys < split_key
642 -- splitGT fm split_key = fm restricted to keys > split_key
644 splitLT EmptyFM split_key = emptyFM
645 splitLT (Branch key elt _ fm_l fm_r) split_key
646 #ifdef __GLASGOW_HASKELL__
647 = case _tagCmp split_key key of
648 _LT -> splitLT fm_l split_key
649 _GT -> mkVBalBranch key elt fm_l (splitLT fm_r split_key)
652 | split_key < key = splitLT fm_l split_key
653 | split_key > key = mkVBalBranch key elt fm_l (splitLT fm_r split_key)
657 splitGT EmptyFM split_key = emptyFM
658 splitGT (Branch key elt _ fm_l fm_r) split_key
659 #ifdef __GLASGOW_HASKELL__
660 = case _tagCmp split_key key of
661 _GT -> splitGT fm_r split_key
662 _LT -> mkVBalBranch key elt (splitGT fm_l split_key) fm_r
665 | split_key > key = splitGT fm_r split_key
666 | split_key < key = mkVBalBranch key elt (splitGT fm_l split_key) fm_r
670 findMin :: FiniteMap key elt -> (key,elt)
671 findMin (Branch key elt _ EmptyFM _) = (key,elt)
672 findMin (Branch key elt _ fm_l _) = findMin fm_l
674 deleteMin :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt
675 deleteMin (Branch key elt _ EmptyFM fm_r) = fm_r
676 deleteMin (Branch key elt _ fm_l fm_r) = mkBalBranch key elt (deleteMin fm_l) fm_r
678 findMax :: FiniteMap key elt -> (key,elt)
679 findMax (Branch key elt _ _ EmptyFM) = (key,elt)
680 findMax (Branch key elt _ _ fm_r) = findMax fm_r
682 deleteMax :: (Ord key OUTPUTABLE_key) => FiniteMap key elt -> FiniteMap key elt
683 deleteMax (Branch key elt _ fm_l EmptyFM) = fm_l
684 deleteMax (Branch key elt _ fm_l fm_r) = mkBalBranch key elt fm_l (deleteMax fm_r)
687 %************************************************************************
689 \subsection{Output-ery}
691 %************************************************************************
694 #if defined(COMPILING_GHC) && defined(DEBUG_FINITEMAPS)
696 instance (Outputable key) => Outputable (FiniteMap key elt) where
697 ppr sty fm = pprX sty fm
699 pprX sty EmptyFM = ppChar '!'
700 pprX sty (Branch key elt sz fm_l fm_r)
701 = ppBesides [ppLparen, pprX sty fm_l, ppSP,
702 ppr sty key, ppSP, ppInt (IF_GHC(I# sz, sz)), ppSP,
703 pprX sty fm_r, ppRparen]
706 #ifndef COMPILING_GHC
707 instance (Eq key, Eq elt) => Eq (FiniteMap key elt) where
708 fm_1 == fm_2 = (sizeFM fm_1 == sizeFM fm_2) && -- quick test
709 (fmToList fm_1 == fmToList fm_2)
711 {- NO: not clear what The Right Thing to do is:
712 instance (Ord key, Ord elt) => Ord (FiniteMap key elt) where
713 fm_1 <= fm_2 = (sizeFM fm_1 <= sizeFM fm_2) && -- quick test
714 (fmToList fm_1 <= fmToList fm_2)
719 %************************************************************************
721 \subsection{FiniteSets---a thin veneer}
723 %************************************************************************
728 type FiniteSet key = FiniteMap key ()
729 emptySet :: FiniteSet key
730 mkSet :: (Ord key OUTPUTABLE_key) => [key] -> FiniteSet key
731 isEmptySet :: FiniteSet key -> Bool
732 elementOf :: (Ord key OUTPUTABLE_key) => key -> FiniteSet key -> Bool
733 minusSet :: (Ord key OUTPUTABLE_key) => FiniteSet key -> FiniteSet key -> FiniteSet key
734 setToList :: FiniteSet key -> [key]
735 union :: (Ord key OUTPUTABLE_key) => FiniteSet key -> FiniteSet key -> FiniteSet key
738 mkSet xs = listToFM [ (x, ()) | x <- xs]
739 isEmptySet = isEmptyFM
748 %************************************************************************
750 \subsection{Efficiency pragmas for GHC}
752 %************************************************************************
754 When the FiniteMap module is used in GHC, we specialise it for
755 \tr{Uniques}, for dastardly efficiency reasons.
758 #if defined(COMPILING_GHC) && __GLASGOW_HASKELL__ && !defined(REALLY_HASKELL_1_3)
760 {-# SPECIALIZE addListToFM
761 :: FiniteMap (FAST_STRING, FAST_STRING) elt -> [((FAST_STRING, FAST_STRING),elt)] -> FiniteMap (FAST_STRING, FAST_STRING) elt
762 , FiniteMap RdrName elt -> [(RdrName,elt)] -> FiniteMap RdrName elt
763 IF_NCG(COMMA FiniteMap Reg elt -> [(Reg COMMA elt)] -> FiniteMap Reg elt)
765 {-# SPECIALIZE addListToFM_C
766 :: (elt -> elt -> elt) -> FiniteMap TyCon elt -> [(TyCon,elt)] -> FiniteMap TyCon elt
767 , (elt -> elt -> elt) -> FiniteMap FAST_STRING elt -> [(FAST_STRING,elt)] -> FiniteMap FAST_STRING elt
768 IF_NCG(COMMA (elt -> elt -> elt) -> FiniteMap Reg elt -> [(Reg COMMA elt)] -> FiniteMap Reg elt)
770 {-# SPECIALIZE addToFM
771 :: FiniteMap CLabel elt -> CLabel -> elt -> FiniteMap CLabel elt
772 , FiniteMap FAST_STRING elt -> FAST_STRING -> elt -> FiniteMap FAST_STRING elt
773 , FiniteMap (FAST_STRING, FAST_STRING) elt -> (FAST_STRING, FAST_STRING) -> elt -> FiniteMap (FAST_STRING, FAST_STRING) elt
774 , FiniteMap RdrName elt -> RdrName -> elt -> FiniteMap RdrName elt
775 , FiniteMap OrigName elt -> OrigName -> elt -> FiniteMap OrigName elt
776 IF_NCG(COMMA FiniteMap Reg elt -> Reg -> elt -> FiniteMap Reg elt)
778 {-# SPECIALIZE addToFM_C
779 :: (elt -> elt -> elt) -> FiniteMap (RdrName, RdrName) elt -> (RdrName, RdrName) -> elt -> FiniteMap (RdrName, RdrName) elt
780 , (elt -> elt -> elt) -> FiniteMap (OrigName, OrigName) elt -> (OrigName, OrigName) -> elt -> FiniteMap (OrigName, OrigName) elt
781 , (elt -> elt -> elt) -> FiniteMap FAST_STRING elt -> FAST_STRING -> elt -> FiniteMap FAST_STRING elt
782 IF_NCG(COMMA (elt -> elt -> elt) -> FiniteMap Reg elt -> Reg -> elt -> FiniteMap Reg elt)
784 {-# SPECIALIZE bagToFM
785 :: Bag (FAST_STRING,elt) -> FiniteMap FAST_STRING elt
787 {-# SPECIALIZE delListFromFM
788 :: FiniteMap RdrName elt -> [RdrName] -> FiniteMap RdrName elt
789 , FiniteMap OrigName elt -> [OrigName] -> FiniteMap OrigName elt
790 , FiniteMap FAST_STRING elt -> [FAST_STRING] -> FiniteMap FAST_STRING elt
791 IF_NCG(COMMA FiniteMap Reg elt -> [Reg] -> FiniteMap Reg elt)
793 {-# SPECIALIZE listToFM
794 :: [([Char],elt)] -> FiniteMap [Char] elt
795 , [(FAST_STRING,elt)] -> FiniteMap FAST_STRING elt
796 , [((FAST_STRING,FAST_STRING),elt)] -> FiniteMap (FAST_STRING, FAST_STRING) elt
797 , [(OrigName,elt)] -> FiniteMap OrigName elt
798 IF_NCG(COMMA [(Reg COMMA elt)] -> FiniteMap Reg elt)
800 {-# SPECIALIZE lookupFM
801 :: FiniteMap CLabel elt -> CLabel -> Maybe elt
802 , FiniteMap [Char] elt -> [Char] -> Maybe elt
803 , FiniteMap FAST_STRING elt -> FAST_STRING -> Maybe elt
804 , FiniteMap (FAST_STRING,FAST_STRING) elt -> (FAST_STRING,FAST_STRING) -> Maybe elt
805 , FiniteMap OrigName elt -> OrigName -> Maybe elt
806 , FiniteMap (OrigName,OrigName) elt -> (OrigName,OrigName) -> Maybe elt
807 , FiniteMap RdrName elt -> RdrName -> Maybe elt
808 , FiniteMap (RdrName,RdrName) elt -> (RdrName,RdrName) -> Maybe elt
809 IF_NCG(COMMA FiniteMap Reg elt -> Reg -> Maybe elt)
811 {-# SPECIALIZE lookupWithDefaultFM
812 :: FiniteMap FAST_STRING elt -> elt -> FAST_STRING -> elt
813 IF_NCG(COMMA FiniteMap Reg elt -> elt -> Reg -> elt)
815 {-# SPECIALIZE plusFM
816 :: FiniteMap RdrName elt -> FiniteMap RdrName elt -> FiniteMap RdrName elt
817 , FiniteMap OrigName elt -> FiniteMap OrigName elt -> FiniteMap OrigName elt
818 , FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt
819 IF_NCG(COMMA FiniteMap Reg elt -> FiniteMap Reg elt -> FiniteMap Reg elt)
821 {-# SPECIALIZE plusFM_C
822 :: (elt -> elt -> elt) -> FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt -> FiniteMap FAST_STRING elt
823 IF_NCG(COMMA (elt -> elt -> elt) -> FiniteMap Reg elt -> FiniteMap Reg elt -> FiniteMap Reg elt)
826 #endif {- compiling for GHC -}