2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
4 \section[UniqSupply]{The @UniqueSupply@ data type and a (monadic) supply thereof}
9 UniqSupply, -- Abstractly
11 uniqFromSupply, uniqsFromSupply, -- basic ops
13 UniqSM, -- type: unique supply monad
14 initUs, initUs_, thenUs, thenUs_, returnUs, fixUs, getUs, withUs,
15 getUniqueUs, getUniquesUs,
16 mapUs, mapAndUnzipUs, mapAndUnzip3Us,
17 thenMaybeUs, mapAccumLUs,
18 lazyThenUs, lazyMapUs,
24 #include "HsVersions.h"
29 import UNSAFE_IO ( unsafeInterleaveIO )
37 %************************************************************************
39 \subsection{Splittable Unique supply: @UniqSupply@}
41 %************************************************************************
43 A value of type @UniqSupply@ is unique, and it can
44 supply {\em one} distinct @Unique@. Also, from the supply, one can
45 also manufacture an arbitrary number of further @UniqueSupplies@,
46 which will be distinct from the first and from all others.
50 = MkSplitUniqSupply Int -- make the Unique with this
52 -- when split => these two supplies
56 mkSplitUniqSupply :: Char -> IO UniqSupply
58 splitUniqSupply :: UniqSupply -> (UniqSupply, UniqSupply)
59 uniqFromSupply :: UniqSupply -> Unique
60 uniqsFromSupply :: UniqSupply -> [Unique] -- Infinite
64 mkSplitUniqSupply (C# c#)
66 #if __GLASGOW_HASKELL__ >= 503
67 mask# = (i2w (ord# c#)) `uncheckedShiftL#` (i2w_s 24#)
69 mask# = (i2w (ord# c#)) `shiftL#` (i2w_s 24#)
71 -- here comes THE MAGIC:
73 -- This is one of the most hammered bits in the whole compiler
75 = unsafeInterleaveIO (
76 mk_unique >>= \ uniq ->
77 mk_supply# >>= \ s1 ->
78 mk_supply# >>= \ s2 ->
79 return (MkSplitUniqSupply uniq s1 s2)
82 mk_unique = _ccall_ genSymZh >>= \ (W# u#) ->
83 return (I# (w2i (mask# `or#` u#)))
87 splitUniqSupply (MkSplitUniqSupply _ s1 s2) = (s1, s2)
91 uniqFromSupply (MkSplitUniqSupply (I# n) _ _) = mkUniqueGrimily n
92 uniqsFromSupply (MkSplitUniqSupply (I# n) _ s2) = mkUniqueGrimily n : uniqsFromSupply s2
95 %************************************************************************
97 \subsubsection[UniqSupply-monad]{@UniqSupply@ monad: @UniqSM@}
99 %************************************************************************
102 type UniqSM result = UniqSupply -> (result, UniqSupply)
104 -- the initUs function also returns the final UniqSupply; initUs_ drops it
105 initUs :: UniqSupply -> UniqSM a -> (a,UniqSupply)
106 initUs init_us m = case m init_us of { (r,us) -> (r,us) }
108 initUs_ :: UniqSupply -> UniqSM a -> a
109 initUs_ init_us m = case m init_us of { (r,us) -> r }
111 {-# INLINE thenUs #-}
112 {-# INLINE lazyThenUs #-}
113 {-# INLINE returnUs #-}
114 {-# INLINE splitUniqSupply #-}
117 @thenUs@ is where we split the @UniqSupply@.
119 fixUs :: (a -> UniqSM a) -> UniqSM a
121 = (r,us') where (r,us') = m r us
123 thenUs :: UniqSM a -> (a -> UniqSM b) -> UniqSM b
125 = case (expr us) of { (result, us') -> cont result us' }
127 lazyThenUs :: UniqSM a -> (a -> UniqSM b) -> UniqSM b
128 lazyThenUs expr cont us
129 = let (result, us') = expr us in cont result us'
131 thenUs_ :: UniqSM a -> UniqSM b -> UniqSM b
133 = case (expr us) of { (_, us') -> cont us' }
136 returnUs :: a -> UniqSM a
137 returnUs result us = (result, us)
139 withUs :: (UniqSupply -> (a, UniqSupply)) -> UniqSM a
140 withUs f us = f us -- Ha ha!
142 getUs :: UniqSM UniqSupply
143 getUs us = splitUniqSupply us
145 getUniqueUs :: UniqSM Unique
146 getUniqueUs us = case splitUniqSupply us of
147 (us1,us2) -> (uniqFromSupply us1, us2)
149 getUniquesUs :: UniqSM [Unique]
150 getUniquesUs us = case splitUniqSupply us of
151 (us1,us2) -> (uniqsFromSupply us1, us2)
155 mapUs :: (a -> UniqSM b) -> [a] -> UniqSM [b]
156 mapUs f [] = returnUs []
158 = f x `thenUs` \ r ->
159 mapUs f xs `thenUs` \ rs ->
162 lazyMapUs :: (a -> UniqSM b) -> [a] -> UniqSM [b]
163 lazyMapUs f [] = returnUs []
165 = f x `lazyThenUs` \ r ->
166 lazyMapUs f xs `lazyThenUs` \ rs ->
169 mapAndUnzipUs :: (a -> UniqSM (b,c)) -> [a] -> UniqSM ([b],[c])
170 mapAndUnzip3Us :: (a -> UniqSM (b,c,d)) -> [a] -> UniqSM ([b],[c],[d])
172 mapAndUnzipUs f [] = returnUs ([],[])
173 mapAndUnzipUs f (x:xs)
174 = f x `thenUs` \ (r1, r2) ->
175 mapAndUnzipUs f xs `thenUs` \ (rs1, rs2) ->
176 returnUs (r1:rs1, r2:rs2)
178 mapAndUnzip3Us f [] = returnUs ([],[],[])
179 mapAndUnzip3Us f (x:xs)
180 = f x `thenUs` \ (r1, r2, r3) ->
181 mapAndUnzip3Us f xs `thenUs` \ (rs1, rs2, rs3) ->
182 returnUs (r1:rs1, r2:rs2, r3:rs3)
184 thenMaybeUs :: UniqSM (Maybe a) -> (a -> UniqSM (Maybe b)) -> UniqSM (Maybe b)
186 = m `thenUs` \ result ->
188 Nothing -> returnUs Nothing
191 mapAccumLUs :: (acc -> x -> UniqSM (acc, y))
196 mapAccumLUs f b [] = returnUs (b, [])
197 mapAccumLUs f b (x:xs)
198 = f b x `thenUs` \ (b__2, x__2) ->
199 mapAccumLUs f b__2 xs `thenUs` \ (b__3, xs__2) ->
200 returnUs (b__3, x__2:xs__2)