whitespace changes and a little re-ordering to make the export lists match
authorRoss Paterson <ross@soi.city.ac.uk>
Wed, 15 Dec 2010 16:21:27 +0000 (16:21 +0000)
committerRoss Paterson <ross@soi.city.ac.uk>
Wed, 15 Dec 2010 16:21:27 +0000 (16:21 +0000)
Data/IntSet.hs
Data/Set.hs

index cbcbcac..bcc5104 100644 (file)
@@ -41,7 +41,7 @@
 -- usually gets it right, but it is disastrous if it does not. Therefore we
 -- explicitly mark these functions INLINE.
 
-module Data.IntSet  ( 
+module Data.IntSet (
             -- * Set type
 #if !defined(TESTING)
               IntSet          -- instance Eq,Show
@@ -59,26 +59,33 @@ module Data.IntSet  (
             , notMember
             , isSubsetOf
             , isProperSubsetOf
-            
+
             -- * Construction
             , empty
             , singleton
             , insert
             , delete
-            
+
             -- * Combine
-            , union, unions
+            , union
+            , unions
             , difference
             , intersection
-            
+
             -- * Filter
             , filter
             , partition
             , split
             , splitMember
 
+            -- * Map
+            , map
+
+            -- * Fold
+            , fold
+
             -- * Min\/Max
-            , findMin   
+            , findMin
             , findMax
             , deleteMin
             , deleteMax
@@ -87,23 +94,18 @@ module Data.IntSet  (
             , maxView
             , minView
 
-            -- * Map
-           , map
-
-            -- * Fold
-            , fold
-
             -- * Conversion
+
             -- ** List
             , elems
             , toList
             , fromList
-            
+
             -- ** Ordered list
             , toAscList
             , fromAscList
             , fromDistinctAscList
-                        
+
             -- * Debugging
             , showTree
             , showTreeWith
index fed1072..640170c 100644 (file)
@@ -49,9 +49,9 @@
 -- All methods that can be INLINE are not recursive -- a 'go' function doing
 -- the real work is provided.
 
-module Data.Set  ( 
+module Data.Set (
             -- * Set type
-#if !defined(TESTING)    
+#if !defined(TESTING)
               Set          -- instance Eq,Ord,Show,Read,Data,Typeable
 #else
               Set(..)
@@ -67,19 +67,19 @@ module Data.Set  (
             , notMember
             , isSubsetOf
             , isProperSubsetOf
-            
+
             -- * Construction
             , empty
             , singleton
             , insert
             , delete
-            
+
             -- * Combine
             , union
             , unions
             , difference
             , intersection
-            
+
             -- * Filter
             , filter
             , partition
@@ -109,12 +109,12 @@ module Data.Set  (
             , elems
             , toList
             , fromList
-            
+
             -- ** Ordered list
             , toAscList
             , fromAscList
             , fromDistinctAscList
-                        
+
             -- * Debugging
             , showTree
             , showTreeWith
@@ -126,7 +126,7 @@ module Data.Set  (
             , balanced
             , join
             , merge
-#endif    
+#endif
             ) where
 
 import Prelude hiding (filter,foldr,null,map)