add comment about lack of _chsize_s()

[ghc-base.git] / GHC / Exts.hs

diff --git a/GHC/Exts.hs b/GHC/Exts.hs
index 5205456..7869c47 100644 (file)
--- a/GHC/Exts.hs
+++ b/GHC/Exts.hs
@@ -21,6 +21,8 @@ module GHC.Exts
         -- * Primitive operations
         module GHC.Prim,
        shiftL#, shiftRL#, iShiftL#, iShiftRA#, iShiftRL#,
+        uncheckedShiftL64#, uncheckedShiftRL64#,
+        uncheckedIShiftL64#, uncheckedIShiftRA64#,
 
        -- * Fusion
        build, augment,
@@ -29,11 +31,14 @@ module GHC.Exts
        IsString(..),
 
        -- * Debugging
-       breakpoint, breakpointCond, Unknown, Unknown2, Unknown3, Unknown4,
+       breakpoint, breakpointCond,
 
        -- * Ids with special behaviour
        lazy, inline,
 
+        -- * Transform comprehensions
+        groupWith, sortWith, the
+
        ) where
 
 import Prelude
@@ -41,7 +46,28 @@ import Prelude
 import GHC.Prim
 import GHC.Base
 import GHC.Word
+import GHC.Int
 import GHC.Num
 import GHC.Float
 import GHC.Ptr
+import Data.String
+import Data.List
+
+-- | 'the' ensures that all the elements of the list are identical
+-- and then returns that unique element
+the :: Eq a => [a] -> a
+the (x:xs) 
+  | all (x ==) xs = x
+  | otherwise     = error "GHC.Exts.the: non-identical elements"
+the []            = error "GHC.Exts.the: empty list"
+
+-- | The 'sortWith' function sorts a list of elements using the
+-- user supplied function to project something out of each element
+sortWith :: Ord b => (a -> b) -> [a] -> [a]
+sortWith f = sortBy (\x y -> compare (f x) (f y))
 
+-- | The 'groupWith' function uses the user supplied function which
+-- projects an element out of every list element in order to to first sort the 
+-- input list and then to form groups by equality on these projected elements
+groupWith :: Ord b => (a -> b) -> [a] -> [[a]]
+groupWith f = groupBy (\x y -> f x == f y) . sortWith f