USE_REPORT_PRELUDE patches from Wolfram Kahl.
maximum, minimum, concatMap,
zip, zip3, zipWith, zipWith3, unzip, unzip3,
maximum, minimum, concatMap,
zip, zip3, zipWith, zipWith3, unzip, unzip3,
+#ifdef USE_REPORT_PRELUDE
+
+#else
+
-- non-standard, but hidden when creating the Prelude
-- export list.
takeUInt_append
-- non-standard, but hidden when creating the Prelude
-- export list.
takeUInt_append
) where
import {-# SOURCE #-} PrelErr ( error )
) where
import {-# SOURCE #-} PrelErr ( error )
take :: Int -> [a] -> [a]
take 0 _ = []
take _ [] = []
take :: Int -> [a] -> [a]
take 0 _ = []
take _ [] = []
-take n (x:xs) | n > 0 = x : take (n-1) xs
+take n (x:xs) | n > 0 = x : take (minusInt n 1) xs
take _ _ = errorNegativeIdx "take"
drop :: Int -> [a] -> [a]
drop 0 xs = xs
drop _ [] = []
take _ _ = errorNegativeIdx "take"
drop :: Int -> [a] -> [a]
drop 0 xs = xs
drop _ [] = []
-drop n (_:xs) | n > 0 = drop (n-1) xs
+drop n (_:xs) | n > 0 = drop (minusInt n 1) xs
drop _ _ = errorNegativeIdx "drop"
splitAt :: Int -> [a] -> ([a],[a])
splitAt 0 xs = ([],xs)
splitAt _ [] = ([],[])
drop _ _ = errorNegativeIdx "drop"
splitAt :: Int -> [a] -> ([a],[a])
splitAt 0 xs = ([],xs)
splitAt _ [] = ([],[])
-splitAt n (x:xs) | n > 0 = (x:xs',xs'') where (xs',xs'') = splitAt (n-1) xs
+splitAt n (x:xs) | n > 0 = (x:xs',xs'') where (xs',xs'') = splitAt (minusInt n 1) xs
splitAt _ _ = errorNegativeIdx "splitAt"
#else /* hack away */
splitAt _ _ = errorNegativeIdx "splitAt"
#else /* hack away */
(!!) :: [a] -> Int -> a
#ifdef USE_REPORT_PRELUDE
(x:_) !! 0 = x
(!!) :: [a] -> Int -> a
#ifdef USE_REPORT_PRELUDE
(x:_) !! 0 = x
-(_:xs) !! n | n > 0 = xs !! (n-1)
+(_:xs) !! n | n > 0 = xs !! (minusInt n 1)
(_:_) !! _ = error "Prelude.(!!): negative index"
[] !! _ = error "Prelude.(!!): index too large"
#else
(_:_) !! _ = error "Prelude.(!!): negative index"
[] !! _ = error "Prelude.(!!): index too large"
#else
s@(h:t) = show ((round (r * 10^n))::Integer)
e = e0+1
s@(h:t) = show ((round (r * 10^n))::Integer)
e = e0+1
+#ifdef USE_REPORT_PRELUDE
+ takeN n ls rs = take n ls ++ rs
+#else
takeN (I# n#) ls rs = takeUInt_append n# ls rs
takeN (I# n#) ls rs = takeUInt_append n# ls rs
drop0 :: String -> String -> String
drop0 [] rs = rs
drop0 :: String -> String -> String
drop0 [] rs = rs
import {-# SOURCE #-} PrelErr ( error )
import PrelBase
import PrelMaybe
import {-# SOURCE #-} PrelErr ( error )
import PrelBase
import PrelMaybe
-import PrelList ( (!!), break, dropWhile )
+import PrelList ( (!!), break, dropWhile
+#ifdef USE_REPORT_PRELUDE
+ , concatMap, foldr1
+#endif
+ )
-import PrelList hiding ( takeUInt_append )
+import PrelList
+#ifndef USE_REPORT_PRELUDE
+ hiding ( takeUInt_append )
+#endif
import PrelRead
import PrelEnum
import PrelNum
import PrelRead
import PrelEnum
import PrelNum