1 % -----------------------------------------------------------------------------
2 % $Id: PrelBase.lhs,v 1.47 2001/04/28 04:44:05 qrczak Exp $
4 % (c) The University of Glasgow, 1992-2000
6 \section[PrelBase]{Module @PrelBase@}
9 The overall structure of the GHC Prelude is a bit tricky.
11 a) We want to avoid "orphan modules", i.e. ones with instance
12 decls that don't belong either to a tycon or a class
13 defined in the same module
15 b) We want to avoid giant modules
17 So the rough structure is as follows, in (linearised) dependency order
20 PrelGHC Has no implementation. It defines built-in things, and
21 by importing it you bring them into scope.
22 The source file is PrelGHC.hi-boot, which is just
23 copied to make PrelGHC.hi
25 Classes: CCallable, CReturnable
27 PrelBase Classes: Eq, Ord, Functor, Monad
28 Types: list, (), Int, Bool, Ordering, Char, String
30 PrelTup Types: tuples, plus instances for PrelBase classes
32 PrelShow Class: Show, plus instances for PrelBase/PrelTup types
34 PrelEnum Class: Enum, plus instances for PrelBase/PrelTup types
36 PrelMaybe Type: Maybe, plus instances for PrelBase classes
38 PrelNum Class: Num, plus instances for Int
39 Type: Integer, plus instances for all classes so far (Eq, Ord, Num, Show)
41 Integer is needed here because it is mentioned in the signature
42 of 'fromInteger' in class Num
44 PrelReal Classes: Real, Integral, Fractional, RealFrac
45 plus instances for Int, Integer
46 Types: Ratio, Rational
47 plus intances for classes so far
49 Rational is needed here because it is mentioned in the signature
50 of 'toRational' in class Real
52 Ix Classes: Ix, plus instances for Int, Bool, Char, Integer, Ordering, tuples
54 PrelArr Types: Array, MutableArray, MutableVar
56 Does *not* contain any ByteArray stuff (see PrelByteArr)
57 Arrays are used by a function in PrelFloat
59 PrelFloat Classes: Floating, RealFloat
60 Types: Float, Double, plus instances of all classes so far
62 This module contains everything to do with floating point.
63 It is a big module (900 lines)
64 With a bit of luck, many modules can be compiled without ever reading PrelFloat.hi
66 PrelByteArr Types: ByteArray, MutableByteArray
68 We want this one to be after PrelFloat, because it defines arrays
72 Other Prelude modules are much easier with fewer complex dependencies.
76 {-# OPTIONS -fno-implicit-prelude #-}
83 module PrelGHC, -- Re-export PrelGHC and PrelErr, to avoid lots
84 module PrelErr -- of people having to import it explicitly
89 import {-# SOURCE #-} PrelErr
93 infix 4 ==, /=, <, <=, >=, >
99 default () -- Double isn't available yet
103 %*********************************************************
105 \subsection{DEBUGGING STUFF}
106 %* (for use when compiling PrelBase itself doesn't work)
108 %*********************************************************
112 data Bool = False | True
113 data Ordering = LT | EQ | GT
121 (&&) True True = True
127 unpackCString# :: Addr# -> [Char]
128 unpackFoldrCString# :: Addr# -> (Char -> a -> a) -> a -> a
129 unpackAppendCString# :: Addr# -> [Char] -> [Char]
130 unpackCStringUtf8# :: Addr# -> [Char]
131 unpackCString# a = error "urk"
132 unpackFoldrCString# a = error "urk"
133 unpackAppendCString# a = error "urk"
134 unpackCStringUtf8# a = error "urk"
139 %*********************************************************
141 \subsection{Standard classes @Eq@, @Ord@}
143 %*********************************************************
147 (==), (/=) :: a -> a -> Bool
149 x /= y = not (x == y)
150 x == y = not (x /= y)
152 class (Eq a) => Ord a where
153 compare :: a -> a -> Ordering
154 (<), (<=), (>), (>=) :: a -> a -> Bool
155 max, min :: a -> a -> a
157 -- An instance of Ord should define either 'compare' or '<='.
158 -- Using 'compare' can be more efficient for complex types.
162 | x <= y = LT -- NB: must be '<=' not '<' to validate the
163 -- above claim about the minimal things that
164 -- can be defined for an instance of Ord
167 x < y = case compare x y of { LT -> True; _other -> False }
168 x <= y = case compare x y of { GT -> False; _other -> True }
169 x > y = case compare x y of { GT -> True; _other -> False }
170 x >= y = case compare x y of { LT -> False; _other -> True }
172 -- These two default methods use '<=' rather than 'compare'
173 -- because the latter is often more expensive
174 max x y = if x <= y then y else x
175 min x y = if x <= y then x else y
178 %*********************************************************
180 \subsection{Monadic classes @Functor@, @Monad@ }
182 %*********************************************************
185 class Functor f where
186 fmap :: (a -> b) -> f a -> f b
189 (>>=) :: m a -> (a -> m b) -> m b
190 (>>) :: m a -> m b -> m b
192 fail :: String -> m a
194 m >> k = m >>= \_ -> k
199 %*********************************************************
201 \subsection{The list type}
203 %*********************************************************
206 data [] a = [] | a : [a] -- do explicitly: deriving (Eq, Ord)
207 -- to avoid weird names like con2tag_[]#
210 instance (Eq a) => Eq [a] where
211 {-# SPECIALISE instance Eq [Char] #-}
213 (x:xs) == (y:ys) = x == y && xs == ys
216 instance (Ord a) => Ord [a] where
217 {-# SPECIALISE instance Ord [Char] #-}
220 compare [] (_:_) = LT
221 compare (_:_) [] = GT
222 compare (x:xs) (y:ys) = case compare x y of
226 instance Functor [] where
229 instance Monad [] where
230 m >>= k = foldr ((++) . k) [] m
231 m >> k = foldr ((++) . (\ _ -> k)) [] m
236 A few list functions that appear here because they are used here.
237 The rest of the prelude list functions are in PrelList.
239 ----------------------------------------------
240 -- foldr/build/augment
241 ----------------------------------------------
244 foldr :: (a -> b -> b) -> b -> [a] -> b
246 -- foldr f z (x:xs) = f x (foldr f z xs)
251 go (y:ys) = y `k` go ys
253 build :: forall a. (forall b. (a -> b -> b) -> b -> b) -> [a]
254 {-# INLINE 2 build #-}
255 -- The INLINE is important, even though build is tiny,
256 -- because it prevents [] getting inlined in the version that
257 -- appears in the interface file. If [] *is* inlined, it
258 -- won't match with [] appearing in rules in an importing module.
260 -- The "2" says to inline in phase 2
264 augment :: forall a. (forall b. (a->b->b) -> b -> b) -> [a] -> [a]
265 {-# INLINE 2 augment #-}
266 augment g xs = g (:) xs
269 "fold/build" forall k z (g::forall b. (a->b->b) -> b -> b) .
270 foldr k z (build g) = g k z
272 "foldr/augment" forall k z xs (g::forall b. (a->b->b) -> b -> b) .
273 foldr k z (augment g xs) = g k (foldr k z xs)
275 "foldr/id" foldr (:) [] = \x->x
276 "foldr/app" forall xs ys. foldr (:) ys xs = append xs ys
278 "foldr/cons" forall k z x xs. foldr k z (x:xs) = k x (foldr k z xs)
279 "foldr/nil" forall k z. foldr k z [] = z
281 "augment/build" forall (g::forall b. (a->b->b) -> b -> b)
282 (h::forall b. (a->b->b) -> b -> b) .
283 augment g (build h) = build (\c n -> g c (h c n))
284 "augment/nil" forall (g::forall b. (a->b->b) -> b -> b) .
285 augment g [] = build g
288 -- This rule is true, but not (I think) useful:
289 -- augment g (augment h t) = augment (\cn -> g c (h c n)) t
293 ----------------------------------------------
295 ----------------------------------------------
298 map :: (a -> b) -> [a] -> [b]
302 mapFB :: (elt -> lst -> lst) -> (a -> elt) -> a -> lst -> lst
303 mapFB c f x ys = c (f x) ys
305 mapList :: (a -> b) -> [a] -> [b]
307 mapList f (x:xs) = f x : mapList f xs
310 "map" forall f xs. map f xs = build (\c n -> foldr (mapFB c f) n xs)
311 "mapFB" forall c f g. mapFB (mapFB c f) g = mapFB c (f.g)
312 "mapList" forall f. foldr (mapFB (:) f) [] = mapList f
317 ----------------------------------------------
319 ----------------------------------------------
321 (++) :: [a] -> [a] -> [a]
325 "++" forall xs ys. (++) xs ys = augment (\c n -> foldr c n xs) ys
328 append :: [a] -> [a] -> [a]
330 append (x:xs) ys = x : append xs ys
334 %*********************************************************
336 \subsection{Type @Bool@}
338 %*********************************************************
341 data Bool = False | True deriving (Eq, Ord)
342 -- Read in PrelRead, Show in PrelShow
346 (&&), (||) :: Bool -> Bool -> Bool
361 %*********************************************************
363 \subsection{The @()@ type}
365 %*********************************************************
367 The Unit type is here because virtually any program needs it (whereas
368 some programs may get away without consulting PrelTup). Furthermore,
369 the renamer currently *always* asks for () to be in scope, so that
370 ccalls can use () as their default type; so when compiling PrelBase we
371 need (). (We could arrange suck in () only if -fglasgow-exts, but putting
372 it here seems more direct.)
381 instance Ord () where
392 %*********************************************************
394 \subsection{Type @Ordering@}
396 %*********************************************************
399 data Ordering = LT | EQ | GT deriving (Eq, Ord)
400 -- Read in PrelRead, Show in PrelShow
404 %*********************************************************
406 \subsection{Type @Char@ and @String@}
408 %*********************************************************
415 -- We don't use deriving for Eq and Ord, because for Ord the derived
416 -- instance defines only compare, which takes two primops. Then
417 -- '>' uses compare, and therefore takes two primops instead of one.
419 instance Eq Char where
420 (C# c1) == (C# c2) = c1 `eqChar#` c2
421 (C# c1) /= (C# c2) = c1 `neChar#` c2
423 instance Ord Char where
424 (C# c1) > (C# c2) = c1 `gtChar#` c2
425 (C# c1) >= (C# c2) = c1 `geChar#` c2
426 (C# c1) <= (C# c2) = c1 `leChar#` c2
427 (C# c1) < (C# c2) = c1 `ltChar#` c2
431 "x# `eqChar#` x#" forall x#. eqChar# x# x# = True
432 "x# `neChar#` x#" forall x#. neChar# x# x# = False
433 "x# `gtChar#` x#" forall x#. gtChar# x# x# = False
434 "x# `geChar#` x#" forall x#. geChar# x# x# = True
435 "x# `leChar#` x#" forall x#. leChar# x# x# = True
436 "x# `ltChar#` x#" forall x#. ltChar# x# x# = False
441 chr (I# i#) | int2Word# i# `leWord#` int2Word# 0x10FFFF# = C# (chr# i#)
442 | otherwise = error "Prelude.chr: bad argument"
444 unsafeChr :: Int -> Char
445 unsafeChr (I# i#) = C# (chr# i#)
448 ord (C# c#) = I# (ord# c#)
451 String equality is used when desugaring pattern-matches against strings.
454 eqString :: String -> String -> Bool
458 %*********************************************************
460 \subsection{Type @Int@}
462 %*********************************************************
467 zeroInt, oneInt, twoInt, maxInt, minInt :: Int
471 #if WORD_SIZE_IN_BYTES == 4
472 minInt = I# (-0x80000000#)
473 maxInt = I# 0x7FFFFFFF#
475 minInt = I# (-0x8000000000000000#)
476 maxInt = I# 0x7FFFFFFFFFFFFFFF#
479 instance Eq Int where
483 instance Ord Int where
491 compareInt :: Int -> Int -> Ordering
492 (I# x) `compareInt` (I# y) = compareInt# x y
494 compareInt# :: Int# -> Int# -> Ordering
502 %*********************************************************
504 \subsection{The function type}
506 %*********************************************************
517 -- function composition
519 (.) :: (b -> c) -> (a -> b) -> a -> c
522 -- flip f takes its (first) two arguments in the reverse order of f.
523 flip :: (a -> b -> c) -> b -> a -> c
526 -- right-associating infix application operator (useful in continuation-
529 ($) :: (a -> b) -> a -> b
532 -- until p f yields the result of applying f until p holds.
533 until :: (a -> Bool) -> (a -> a) -> a -> a
534 until p f x | p x = x
535 | otherwise = until p f (f x)
537 -- asTypeOf is a type-restricted version of const. It is usually used
538 -- as an infix operator, and its typing forces its first argument
539 -- (which is usually overloaded) to have the same type as the second.
540 asTypeOf :: a -> a -> a
544 %*********************************************************
546 \subsection{CCallable instances}
548 %*********************************************************
550 Defined here to avoid orphans
553 instance CCallable Char
554 instance CReturnable Char
556 instance CCallable Int
557 instance CReturnable Int
559 instance CReturnable () -- Why, exactly?
563 %*********************************************************
565 \subsection{Generics}
567 %*********************************************************
571 data a :+: b = Inl a | Inr b
572 data a :*: b = a :*: b
576 %*********************************************************
578 \subsection{Numeric primops}
580 %*********************************************************
583 divInt#, modInt# :: Int# -> Int# -> Int#
585 | (x# ># 0#) && (y# <# 0#) = ((x# -# y#) -# 1#) `quotInt#` y#
586 | (x# <# 0#) && (y# ># 0#) = ((x# -# y#) +# 1#) `quotInt#` y#
587 | otherwise = x# `quotInt#` y#
589 | (x# ># 0#) && (y# <# 0#) ||
590 (x# <# 0#) && (y# ># 0#) = if r# /=# 0# then r# +# y# else 0#
596 Definitions of the boxed PrimOps; these will be
597 used in the case of partial applications, etc.
606 {-# INLINE plusInt #-}
607 {-# INLINE minusInt #-}
608 {-# INLINE timesInt #-}
609 {-# INLINE quotInt #-}
610 {-# INLINE remInt #-}
611 {-# INLINE negateInt #-}
613 plusInt, minusInt, timesInt, quotInt, remInt, divInt, modInt, gcdInt :: Int -> Int -> Int
614 (I# x) `plusInt` (I# y) = I# (x +# y)
615 (I# x) `minusInt` (I# y) = I# (x -# y)
616 (I# x) `timesInt` (I# y) = I# (x *# y)
617 (I# x) `quotInt` (I# y) = I# (x `quotInt#` y)
618 (I# x) `remInt` (I# y) = I# (x `remInt#` y)
619 (I# x) `divInt` (I# y) = I# (x `divInt#` y)
620 (I# x) `modInt` (I# y) = I# (x `modInt#` y)
624 "x# +# 0#" forall x#. x# +# 0# = x#
625 "0# +# x#" forall x#. 0# +# x# = x#
626 "x# -# 0#" forall x#. x# -# 0# = x#
627 "x# -# x#" forall x#. x# -# x# = 0#
628 "x# *# 0#" forall x#. x# *# 0# = 0#
629 "0# *# x#" forall x#. 0# *# x# = 0#
630 "x# *# 1#" forall x#. x# *# 1# = x#
631 "1# *# x#" forall x#. 1# *# x# = x#
635 gcdInt (I# a) (I# b) = g a b
636 where g 0# 0# = error "PrelBase.gcdInt: gcd 0 0 is undefined"
639 g _ _ = I# (gcdInt# absA absB)
641 absInt x = if x <# 0# then negateInt# x else x
646 negateInt :: Int -> Int
647 negateInt (I# x) = I# (negateInt# x)
649 gtInt, geInt, eqInt, neInt, ltInt, leInt :: Int -> Int -> Bool
650 (I# x) `gtInt` (I# y) = x ># y
651 (I# x) `geInt` (I# y) = x >=# y
652 (I# x) `eqInt` (I# y) = x ==# y
653 (I# x) `neInt` (I# y) = x /=# y
654 (I# x) `ltInt` (I# y) = x <# y
655 (I# x) `leInt` (I# y) = x <=# y
659 "x# ># x#" forall x#. x# ># x# = False
660 "x# >=# x#" forall x#. x# >=# x# = True
661 "x# ==# x#" forall x#. x# ==# x# = True
662 "x# /=# x#" forall x#. x# /=# x# = False
663 "x# <# x#" forall x#. x# <# x# = False
664 "x# <=# x#" forall x#. x# <=# x# = True
667 #if WORD_SIZE_IN_BYTES == 4
669 "intToInt32#" forall x#. intToInt32# x# = x#
670 "wordToWord32#" forall x#. wordToWord32# x# = x#
675 "int2Word2Int" forall x#. int2Word# (word2Int# x#) = x#
676 "word2Int2Word" forall x#. word2Int# (int2Word# x#) = x#
682 %********************************************************
684 \subsection{Unpacking C strings}
686 %********************************************************
688 This code is needed for virtually all programs, since it's used for
689 unpacking the strings of error messages.
692 unpackCString# :: Addr# -> [Char]
693 unpackCString# a = unpackCStringList# a
695 unpackCStringList# :: Addr# -> [Char]
696 unpackCStringList# addr
700 | ch `eqChar#` '\0'# = []
701 | otherwise = C# ch : unpack (nh +# 1#)
703 ch = indexCharOffAddr# addr nh
705 unpackAppendCString# :: Addr# -> [Char] -> [Char]
706 unpackAppendCString# addr rest
710 | ch `eqChar#` '\0'# = rest
711 | otherwise = C# ch : unpack (nh +# 1#)
713 ch = indexCharOffAddr# addr nh
715 unpackFoldrCString# :: Addr# -> (Char -> a -> a) -> a -> a
716 unpackFoldrCString# addr f z
720 | ch `eqChar#` '\0'# = z
721 | otherwise = C# ch `f` unpack (nh +# 1#)
723 ch = indexCharOffAddr# addr nh
725 unpackCStringUtf8# :: Addr# -> [Char]
726 unpackCStringUtf8# addr
730 | ch `eqChar#` '\0'# = []
731 | ch `leChar#` '\x7F'# = C# ch : unpack (nh +# 1#)
732 | ch `leChar#` '\xDF'# =
733 C# (chr# ((ord# ch -# 0xC0#) `iShiftL#` 6# +#
734 (ord# (indexCharOffAddr# addr (nh +# 1#)) -# 0x80#))) :
736 | ch `leChar#` '\xEF'# =
737 C# (chr# ((ord# ch -# 0xE0#) `iShiftL#` 12# +#
738 (ord# (indexCharOffAddr# addr (nh +# 1#)) -# 0x80#) `iShiftL#` 6# +#
739 (ord# (indexCharOffAddr# addr (nh +# 2#)) -# 0x80#))) :
742 C# (chr# ((ord# ch -# 0xF0#) `iShiftL#` 18# +#
743 (ord# (indexCharOffAddr# addr (nh +# 1#)) -# 0x80#) `iShiftL#` 12# +#
744 (ord# (indexCharOffAddr# addr (nh +# 2#)) -# 0x80#) `iShiftL#` 6# +#
745 (ord# (indexCharOffAddr# addr (nh +# 3#)) -# 0x80#))) :
748 ch = indexCharOffAddr# addr nh
750 unpackNBytes# :: Addr# -> Int# -> [Char]
751 unpackNBytes# _addr 0# = []
752 unpackNBytes# addr len# = unpack [] (len# -# 1#)
757 case indexCharOffAddr# addr i# of
758 ch -> unpack (C# ch : acc) (i# -# 1#)
761 "unpack" forall a . unpackCString# a = build (unpackFoldrCString# a)
762 "unpack-list" forall a . unpackFoldrCString# a (:) [] = unpackCStringList# a
763 "unpack-append" forall a n . unpackFoldrCString# a (:) n = unpackAppendCString# a n
765 -- There's a built-in rule (in PrelRules.lhs) for
766 -- unpackFoldr "foo" c (unpackFoldr "baz" c n) = unpackFoldr "foobaz" c n