splitUniqSupply :: UniqSupply -> (UniqSupply, UniqSupply)
uniqFromSupply :: UniqSupply -> Unique
-uniqsFromSupply :: Int -> UniqSupply -> [Unique]
+uniqsFromSupply :: UniqSupply -> [Unique] -- Infinite
\end{code}
\begin{code}
mkSplitUniqSupply (C# c#)
= let
+#if __GLASGOW_HASKELL__ >= 503
+ mask# = (i2w (ord# c#)) `uncheckedShiftL#` (i2w_s 24#)
+#else
mask# = (i2w (ord# c#)) `shiftL#` (i2w_s 24#)
-
+#endif
-- here comes THE MAGIC:
-- This is one of the most hammered bits in the whole compiler
\end{code}
\begin{code}
-uniqFromSupply (MkSplitUniqSupply (I# n) _ _) = mkUniqueGrimily n
-
-uniqsFromSupply (I# i) supply = i `get_from` supply
- where
- get_from 0# _ = []
- get_from n (MkSplitUniqSupply (I# u) _ s2)
- = mkUniqueGrimily u : get_from (n -# 1#) s2
+uniqFromSupply (MkSplitUniqSupply (I# n) _ _) = mkUniqueGrimily n
+uniqsFromSupply (MkSplitUniqSupply (I# n) _ s2) = mkUniqueGrimily n : uniqsFromSupply s2
\end{code}
%************************************************************************
getUniqueUs us = case splitUniqSupply us of
(us1,us2) -> (uniqFromSupply us1, us2)
-getUniquesUs :: Int -> UniqSM [Unique]
-getUniquesUs n us = case splitUniqSupply us of
- (us1,us2) -> (uniqsFromSupply n us1, us2)
+getUniquesUs :: UniqSM [Unique]
+getUniquesUs us = case splitUniqSupply us of
+ (us1,us2) -> (uniqsFromSupply us1, us2)
\end{code}
\begin{code}