[move Seq to Util, clean up various imports
John Meacham <john@repetae.net>**20050929014929] move ./Seq.hs ./Util/Seq.hs
hunk ./C/FromGrin.hs 3
-import Atom
-import C.Gen
hunk ./C/FromGrin.hs 7
-import C.Prims
hunk ./C/FromGrin.hs 8
+import List
+import qualified Data.Map as Map
+import qualified Data.Set as Set
+import qualified Text.PrettyPrint.HughesPJ as P
+import Text.PrettyPrint.HughesPJ(nest,($$),($+$))
+
+import Atom
+import C.Gen
+import C.Prims
hunk ./C/FromGrin.hs 25
-import List
-import qualified Data.Map as Map
-import qualified Data.Set as Set
-import qualified Text.PrettyPrint.HughesPJ as P
+import qualified Util.Seq as Seq
hunk ./C/FromGrin.hs 27
-import Text.PrettyPrint.HughesPJ(nest,($$),($+$))
hunk ./C/FromGrin.hs 28
-import qualified Seq
hunk ./DataConstructors.hs 34
-import qualified Seq
+import qualified Util.Seq as Seq
hunk ./E/Eval.hs 6
-import E.E
-import E.Subst
-import E.Pretty
-import E.FreeVars
-import Seq
hunk ./E/Eval.hs 8
+
hunk ./E/Eval.hs 10
+import E.E
+import E.FreeVars
+import E.Pretty
+import E.Subst
+import Util.Seq as Seq
hunk ./E/FromHs.hs 3
+import Control.Monad.Identity
+import Control.Monad.State
+import Data.FunctorM
+import Data.Generics
+import Prelude hiding((&&),(||),not,and,or,any,all)
+import qualified Data.Map as Map
+import qualified Data.Set as Set
+import qualified Text.PrettyPrint.HughesPJ as PPrint
+
hunk ./E/FromHs.hs 17
-import Control.Monad.Identity
-import Control.Monad.State
hunk ./E/FromHs.hs 19
-import Data.FunctorM
-import Data.Generics
hunk ./E/FromHs.hs 31
+import NameMonad
hunk ./E/FromHs.hs 33
-import Prelude hiding((&&),(||),not,and,or,any,all)
-import qualified Data.Map as Map
-import qualified Data.Set as Set
hunk ./E/FromHs.hs 34
-import qualified Text.PrettyPrint.HughesPJ as PPrint
-import qualified Seq
+import qualified Util.Seq as Seq
hunk ./E/FromHs.hs 38
-import NameMonad
hunk ./E/SSimplify.hs 27
-import qualified Seq
+import qualified Util.Seq as Seq
hunk ./FrontEnd/KindInfer.hs 17
-import Representation hiding (Subst)
-import HsSyn
-import Utils
-import List (nub)
-import DependAnalysis
hunk ./FrontEnd/KindInfer.hs 18
-import MonadUtil
hunk ./FrontEnd/KindInfer.hs 19
-import qualified Seq
hunk ./FrontEnd/KindInfer.hs 20
+import List (nub)
+import qualified Data.Map as Map
hunk ./FrontEnd/KindInfer.hs 23
+
+import DependAnalysis
+import HsSyn
+import MonadUtil
+import qualified Util.Seq as Seq
+import Representation hiding (Subst)
hunk ./FrontEnd/KindInfer.hs 30
-import qualified Data.Map as Map
+import Utils
hunk ./Grin/DeadFunctions.hs 3
-
-import Atom
-import CharIO
hunk ./Grin/DeadFunctions.hs 7
+import List
+import Monad
+import qualified Data.Map as Map
+import qualified Data.Set as Set
+
+import Atom
+import CharIO
hunk ./Grin/DeadFunctions.hs 20
-import List
-import Monad
-import qualified Data.Map as Map
-import qualified Data.Set as Set
-import Seq
hunk ./Grin/DeadFunctions.hs 21
+import Util.Seq as Seq
hunk ./Util/Seq.hs 17
-module Seq( -- * Type
+module Util.Seq( -- * Type
hunk ./Util/Seq.hs 96
-tell x = W.tell (Seq.singleton x)
-tells xs = W.tell (Seq.fromList xs)
+tell x = W.tell (Util.Seq.singleton x)
+tells xs = W.tell (Util.Seq.fromList xs)
hunk ./Util/Seq.hs 104
-concat (Seq f) = (foldr Seq.append Seq.empty (f []))
+concat (Seq f) = (foldr Util.Seq.append Util.Seq.empty (f []))
hunk ./Util/Seq.hs 106
-instance Functor Seq.Seq where
+instance Functor Util.Seq.Seq where
hunk ./Util/Seq.hs 110
-instance Monad Seq.Seq where
+instance Monad Util.Seq.Seq where
hunk ./Util/Seq.hs 112
-    a >>= b  = Seq.concat (fmap b a)
-    return x = Seq.single x
-    fail _ = Seq.empty
+    a >>= b  = Util.Seq.concat (fmap b a)
+    return x = Util.Seq.single x
+    fail _ = Util.Seq.empty
hunk ./Util/Seq.hs 116
-instance MonadPlus Seq.Seq where
+instance MonadPlus Util.Seq.Seq where
hunk ./Util/Seq.hs 118
-    mzero = Seq.empty
+    mzero = Util.Seq.empty