diff options
Diffstat (limited to 'libraries/base/Data')
29 files changed, 42 insertions, 6 deletions
diff --git a/libraries/base/Data/Bits.hs b/libraries/base/Data/Bits.hs index 22a6e41a58..b14585498b 100644 --- a/libraries/base/Data/Bits.hs +++ b/libraries/base/Data/Bits.hs @@ -380,5 +380,4 @@ own to enable constant folding; for example 'shift': 10000000 -> ww_sOb } -} - diff --git a/libraries/base/Data/Bool.hs b/libraries/base/Data/Bool.hs index 8d80ec849d..1f53177aef 100644 --- a/libraries/base/Data/Bool.hs +++ b/libraries/base/Data/Bool.hs @@ -39,3 +39,4 @@ import Prelude , otherwise ) #endif + diff --git a/libraries/base/Data/Char.hs b/libraries/base/Data/Char.hs index f45f3696ca..e1afc44596 100644 --- a/libraries/base/Data/Char.hs +++ b/libraries/base/Data/Char.hs @@ -209,3 +209,4 @@ isSeparator c = case generalCategory c of toTitle :: Char -> Char toTitle = toUpper #endif + diff --git a/libraries/base/Data/Complex.hs b/libraries/base/Data/Complex.hs index b456055ee9..d78a6c9871 100644 --- a/libraries/base/Data/Complex.hs +++ b/libraries/base/Data/Complex.hs @@ -205,3 +205,4 @@ instance (RealFloat a) => Floating (Complex a) where asinh z = log (z + sqrt (1+z*z)) acosh z = log (z + (z+1) * sqrt ((z-1)/(z+1))) atanh z = 0.5 * log ((1.0+z) / (1.0-z)) + diff --git a/libraries/base/Data/Data.hs b/libraries/base/Data/Data.hs index 5de1eaff41..cd401675a4 100644 --- a/libraries/base/Data/Data.hs +++ b/libraries/base/Data/Data.hs @@ -23,7 +23,6 @@ -- For more information, please visit the new -- SYB wiki: <http://www.cs.uu.nl/wiki/bin/view/GenericProgramming/SYB>. -- --- ----------------------------------------------------------------------------- module Data.Data ( diff --git a/libraries/base/Data/Dynamic.hs b/libraries/base/Data/Dynamic.hs index b3f935080c..11501b8c98 100644 --- a/libraries/base/Data/Dynamic.hs +++ b/libraries/base/Data/Dynamic.hs @@ -168,3 +168,4 @@ dynApp f x = case dynApply f x of dynTypeRep :: Dynamic -> TypeRep dynTypeRep (Dynamic tr _) = tr + diff --git a/libraries/base/Data/Eq.hs b/libraries/base/Data/Eq.hs index 9386d60fec..0c45c78e1d 100644 --- a/libraries/base/Data/Eq.hs +++ b/libraries/base/Data/Eq.hs @@ -22,3 +22,4 @@ module Data.Eq ( #if __GLASGOW_HASKELL__ import GHC.Base #endif + diff --git a/libraries/base/Data/Fixed.hs b/libraries/base/Data/Fixed.hs index b1d7113c14..81e7c038b0 100644 --- a/libraries/base/Data/Fixed.hs +++ b/libraries/base/Data/Fixed.hs @@ -1,10 +1,10 @@ {-# LANGUAGE Trustworthy #-} {-# LANGUAGE CPP #-} {-# OPTIONS -Wall -fno-warn-unused-binds #-} - #ifndef __NHC__ {-# LANGUAGE DeriveDataTypeable #-} #endif + ----------------------------------------------------------------------------- -- | -- Module : Data.Fixed @@ -246,3 +246,4 @@ instance HasResolution E12 where resolution _ = 1000000000000 -- | resolution of 10^-12 = .000000000001 type Pico = Fixed E12 + diff --git a/libraries/base/Data/Foldable.hs b/libraries/base/Data/Foldable.hs index a925fca9d6..01ef297300 100644 --- a/libraries/base/Data/Foldable.hs +++ b/libraries/base/Data/Foldable.hs @@ -18,6 +18,8 @@ -- functor. To avoid ambiguity, either import those modules hiding -- these names or qualify uses of these function names with an alias -- for this module. +-- +----------------------------------------------------------------------------- module Data.Foldable ( -- * Folds @@ -320,3 +322,4 @@ notElem x = not . elem x -- 'Nothing' if there is no such element. find :: Foldable t => (a -> Bool) -> t a -> Maybe a find p = listToMaybe . concatMap (\ x -> if p x then [x] else []) + diff --git a/libraries/base/Data/Function.hs b/libraries/base/Data/Function.hs index ef6d9cf589..54eabbb6e7 100644 --- a/libraries/base/Data/Function.hs +++ b/libraries/base/Data/Function.hs @@ -1,4 +1,5 @@ {-# LANGUAGE Safe #-} + ----------------------------------------------------------------------------- -- | -- Module : Data.Function @@ -10,6 +11,8 @@ -- Portability : portable -- -- Simple combinators working solely on and with functions. +-- +----------------------------------------------------------------------------- module Data.Function ( -- * "Prelude" re-exports @@ -82,3 +85,4 @@ fix f = let x = f x in x on :: (b -> b -> c) -> (a -> b) -> a -> a -> c (.*.) `on` f = \x y -> f x .*. f y + diff --git a/libraries/base/Data/Functor.hs b/libraries/base/Data/Functor.hs index 2369cdb497..416768e325 100644 --- a/libraries/base/Data/Functor.hs +++ b/libraries/base/Data/Functor.hs @@ -33,3 +33,4 @@ infixl 4 <$> -- | An infix synonym for 'fmap'. (<$>) :: Functor f => (a -> b) -> f a -> f b (<$>) = fmap + diff --git a/libraries/base/Data/HashTable.hs b/libraries/base/Data/HashTable.hs index 9fe78991d7..b59486390c 100644 --- a/libraries/base/Data/HashTable.hs +++ b/libraries/base/Data/HashTable.hs @@ -531,3 +531,4 @@ longestChain = mapReduce id (maximumBy lengthCmp) lengthCmp [] [] = EQ lengthCmp [] _ = LT lengthCmp _ [] = GT + diff --git a/libraries/base/Data/IORef.hs b/libraries/base/Data/IORef.hs index 13eb9c9a48..1a3ddfd2df 100644 --- a/libraries/base/Data/IORef.hs +++ b/libraries/base/Data/IORef.hs @@ -138,3 +138,4 @@ atomicModifyIORef r f = 'IORef' operations. -} + diff --git a/libraries/base/Data/Int.hs b/libraries/base/Data/Int.hs index 1ff37bd51c..084bb0ef05 100644 --- a/libraries/base/Data/Int.hs +++ b/libraries/base/Data/Int.hs @@ -65,3 +65,4 @@ import NHC.SizedTypes (Int8, Int16, Int32, Int64) -- instances of Bits count to the width of the type, for example @1 \<\< 32 == 1@ in some C implementations. -} + diff --git a/libraries/base/Data/Ix.hs b/libraries/base/Data/Ix.hs index f1edf00907..fdfc33a1cd 100644 --- a/libraries/base/Data/Ix.hs +++ b/libraries/base/Data/Ix.hs @@ -16,6 +16,7 @@ -- (see the array package). -- ----------------------------------------------------------------------------- + module Data.Ix ( -- * The 'Ix' class diff --git a/libraries/base/Data/List.hs b/libraries/base/Data/List.hs index 4f76c83c22..4edd9ebde8 100644 --- a/libraries/base/Data/List.hs +++ b/libraries/base/Data/List.hs @@ -1105,3 +1105,4 @@ errorEmptyList fun = error ("Prelude." ++ fun ++ ": empty list") #endif /* !__GLASGOW_HASKELL__ */ + diff --git a/libraries/base/Data/Maybe.hs b/libraries/base/Data/Maybe.hs index a405bb4625..135040228c 100644 --- a/libraries/base/Data/Maybe.hs +++ b/libraries/base/Data/Maybe.hs @@ -149,3 +149,4 @@ mapMaybe f (x:xs) = Just r -> r:rs #endif /* else not __NHC__ */ + diff --git a/libraries/base/Data/Monoid.hs b/libraries/base/Data/Monoid.hs index beac4f70f7..228e25433e 100644 --- a/libraries/base/Data/Monoid.hs +++ b/libraries/base/Data/Monoid.hs @@ -14,6 +14,7 @@ -- -- A class for monoids (types with an associative binary operation that -- has an identity) with various general-purpose instances. +-- ----------------------------------------------------------------------------- module Data.Monoid ( @@ -276,3 +277,4 @@ prop_mconcatLast x = where listLastToMaybe [] = Nothing listLastToMaybe lst = Just (last lst) -- -} + diff --git a/libraries/base/Data/Ord.hs b/libraries/base/Data/Ord.hs index 250e797d2c..8180df23e6 100644 --- a/libraries/base/Data/Ord.hs +++ b/libraries/base/Data/Ord.hs @@ -34,3 +34,4 @@ import GHC.Base -- > ... sortBy (comparing fst) ... comparing :: (Ord a) => (b -> a) -> b -> b -> Ordering comparing p x y = compare (p x) (p y) + diff --git a/libraries/base/Data/Ratio.hs b/libraries/base/Data/Ratio.hs index 766fe41e82..d3d29c8bb9 100644 --- a/libraries/base/Data/Ratio.hs +++ b/libraries/base/Data/Ratio.hs @@ -95,3 +95,4 @@ approxRational rat eps = simplest (rat-eps) (rat+eps) n'' = numerator nd'' d'' = denominator nd'' #endif + diff --git a/libraries/base/Data/STRef.hs b/libraries/base/Data/STRef.hs index 851a20f9fc..c628bb6618 100644 --- a/libraries/base/Data/STRef.hs +++ b/libraries/base/Data/STRef.hs @@ -42,3 +42,4 @@ INSTANCE_TYPEABLE2(STRef,stRefTc,"STRef") -- |Mutate the contents of an 'STRef' modifySTRef :: STRef s a -> (a -> a) -> ST s () modifySTRef ref f = writeSTRef ref . f =<< readSTRef ref + diff --git a/libraries/base/Data/STRef/Lazy.hs b/libraries/base/Data/STRef/Lazy.hs index ccc19051de..7c9a74e9b5 100644 --- a/libraries/base/Data/STRef/Lazy.hs +++ b/libraries/base/Data/STRef/Lazy.hs @@ -1,4 +1,5 @@ {-# LANGUAGE Safe #-} + ----------------------------------------------------------------------------- -- | -- Module : Data.STRef.Lazy @@ -12,6 +13,7 @@ -- Mutable references in the lazy ST monad. -- ----------------------------------------------------------------------------- + module Data.STRef.Lazy ( -- * STRefs ST.STRef, -- abstract, instance Eq @@ -30,7 +32,8 @@ readSTRef :: ST.STRef s a -> ST s a writeSTRef :: ST.STRef s a -> a -> ST s () modifySTRef :: ST.STRef s a -> (a -> a) -> ST s () -newSTRef = strictToLazyST . ST.newSTRef -readSTRef = strictToLazyST . ST.readSTRef -writeSTRef r a = strictToLazyST (ST.writeSTRef r a) +newSTRef = strictToLazyST . ST.newSTRef +readSTRef = strictToLazyST . ST.readSTRef +writeSTRef r a = strictToLazyST (ST.writeSTRef r a) modifySTRef r f = strictToLazyST (ST.modifySTRef r f) + diff --git a/libraries/base/Data/STRef/Strict.hs b/libraries/base/Data/STRef/Strict.hs index 202df73450..ead6683f8a 100644 --- a/libraries/base/Data/STRef/Strict.hs +++ b/libraries/base/Data/STRef/Strict.hs @@ -1,4 +1,5 @@ {-# LANGUAGE Safe #-} + ----------------------------------------------------------------------------- -- | -- Module : Data.STRef.Strict @@ -18,3 +19,4 @@ module Data.STRef.Strict ( ) where import Data.STRef + diff --git a/libraries/base/Data/String.hs b/libraries/base/Data/String.hs index 27d61d5991..0124f13ab0 100644 --- a/libraries/base/Data/String.hs +++ b/libraries/base/Data/String.hs @@ -41,3 +41,4 @@ class IsString a where instance IsString [Char] where fromString xs = xs #endif + diff --git a/libraries/base/Data/Traversable.hs b/libraries/base/Data/Traversable.hs index 96ea010d8b..75356ec55a 100644 --- a/libraries/base/Data/Traversable.hs +++ b/libraries/base/Data/Traversable.hs @@ -29,6 +29,8 @@ -- functions of the same names from lists to any 'Traversable' functor. -- To avoid ambiguity, either import the "Prelude" hiding these names -- or qualify uses of these function names with an alias for this module. +-- +----------------------------------------------------------------------------- module Data.Traversable ( Traversable(..), @@ -194,3 +196,4 @@ instance Functor Id where instance Applicative Id where pure = Id Id f <*> Id x = Id (f x) + diff --git a/libraries/base/Data/Tuple.hs b/libraries/base/Data/Tuple.hs index 0029fb976f..30f93c5e63 100644 --- a/libraries/base/Data/Tuple.hs +++ b/libraries/base/Data/Tuple.hs @@ -2,6 +2,7 @@ {-# LANGUAGE CPP, NoImplicitPrelude #-} {-# OPTIONS_GHC -fno-warn-unused-imports #-} -- XXX -fno-warn-unused-imports needed for the GHC.Tuple import below. Sigh. + ----------------------------------------------------------------------------- -- | -- Module : Data.Tuple diff --git a/libraries/base/Data/Typeable/Internal.hs b/libraries/base/Data/Typeable/Internal.hs index 16b303d68c..93218a87f1 100644 --- a/libraries/base/Data/Typeable/Internal.hs +++ b/libraries/base/Data/Typeable/Internal.hs @@ -1,4 +1,5 @@ {-# LANGUAGE Unsafe #-} + ----------------------------------------------------------------------------- -- | -- Module : Data.Typeable.Internal diff --git a/libraries/base/Data/Typeable/Internal.hs-boot b/libraries/base/Data/Typeable/Internal.hs-boot index f314abe570..c83c77e1a0 100644 --- a/libraries/base/Data/Typeable/Internal.hs-boot +++ b/libraries/base/Data/Typeable/Internal.hs-boot @@ -1,5 +1,6 @@ {-# LANGUAGE Unsafe #-} {-# LANGUAGE CPP, NoImplicitPrelude, MagicHash #-} + module Data.Typeable.Internal ( Typeable(typeOf), TypeRep, diff --git a/libraries/base/Data/Word.hs b/libraries/base/Data/Word.hs index 1540999df4..84a4d0721c 100644 --- a/libraries/base/Data/Word.hs +++ b/libraries/base/Data/Word.hs @@ -68,3 +68,4 @@ type Word = Word32 truncate the shift count to the width of the type, for example @1 \<\< 32 == 1@ in some C implementations. -} + |