packages feed

hoogle 3.1 → 4.0

raw patch · 94 files changed

+5081/−12181 lines, 94 filesdep +arraydep +filepathdep +mtldep ~base

Dependencies added: array, filepath, mtl, parsec, process, safe, uniplate

Dependency ranges changed: base

Files

README.txt view
@@ -3,7 +3,7 @@ 
 A Haskell API search. To invoke it type
 
-	hoogle "[a] -> [b]"
+    hoogle "[a] -> [b]"
 
 Note the quotes, otherwise you will redirect the output to the file [b].
 
@@ -13,8 +13,8 @@ 
 A web version is available at http://www.haskell.org/hoogle
 
-All the appropriate documentation/credits/reference material is on the Haskell wiki at
-http://www.haskell.org/haskellwiki/Hoogle
+All the appropriate documentation/credits/reference material is on the
+Haskell wiki at http://www.haskell.org/haskellwiki/Hoogle
 
 
 Building
@@ -31,8 +31,8 @@ 
 The folders in the distribution, and their meaning are:
 
-data - programs that generate a hoogle data file
+data - tools to generate a hoogle data file
 docs - documentation on hoogle
-src  - source code to the hoogle front ends, and the main code
-test - regression tests
-web  - additional front end stuff for the web module
+misc - presentations, icons, emacs scripts, logos
+src  - source code
+web  - additional resources for the web front end (css, jpg etc.)
+ default.hoo view

file too large to diff

hoogle.cabal view
@@ -1,51 +1,99 @@-Cabal-Version:   >= 1.2-Build-type:      Simple-Name:            hoogle-Version:         3.1-License:         GPL-License-File:    LICENSE-Author:          Neil Mitchell <ndmitchell@gmail.com>-Maintainer:      Neil Mitchell <ndmitchell@gmail.com>-Copyright:       Neil Mitchell 2004-2008-Category:        Development-Synopsis:        Haskell API Search-Description:+cabal-version:      >= 1.1.4+build-type:         Simple+name:               hoogle+version:            4.0+license:            GPL+license-file:       LICENSE+category:           Development+author:             Neil Mitchell <ndmitchell@gmail.com>+maintainer:         Neil Mitchell <ndmitchell@gmail.com>+copyright:          Neil Mitchell 2004-2008+synopsis:           Haskell API Search+description:     Hoogle is a Haskell API search engine, which allows you to     search many standard Haskell libraries by either function name,     or by approximate type signature.-Homepage:        http://www.haskell.org/hoogle/-Stability:       Beta-Extra-Source-Files:-    README.txt-Data-Files:-    hoogle.txt---Flag splitBase-    Description: Choose the new smaller, split-up base package.--Executable hoogle-    Main-Is:         CmdLine.hs-    Hs-Source-Dirs:  src--    if flag(splitBase)-        Build-Depends: base >= 3, directory, containers-    else-        Build-Depends: base < 3+homepage:           http://www.haskell.org/hoogle/+stability:          Beta+build-depends:      base, parsec, filepath, directory, process, safe, containers, uniplate, mtl, array+extra-source-files: README.txt+data-files:         default.hoo -    Other-Modules:-        CmdLine.Main-        Hoogle.Database-        Hoogle.General-        Hoogle.Hoogle-        Hoogle.Lexer-        Hoogle.Match-        Hoogle.MatchClass-        Hoogle.MatchName-        Hoogle.MatchType-        Hoogle.Parser-        Hoogle.Result-        Hoogle.Search-        Hoogle.TextUtil-        Hoogle.TypeAlias-        Hoogle.TypeSig+executable:         hoogle+main-is:            Main.hs+hs-source-dirs:     src+other-modules:+    CmdLine.Action+    CmdLine.All+    CmdLine.Files+    CmdLine.Flag+    CmdLine.Query+    CmdLine.Search+    CmdLine.Test+    Data.Binary.Defer+    Data.Binary.Defer.Array+    Data.Binary.Defer.Chunk+    Data.Binary.Defer.Class+    Data.Binary.Defer.Graph+    Data.Binary.Defer.Index+    Data.Binary.Defer.Map+    Data.Binary.Defer.Monad+    Data.Binary.Defer.Trie+    Data.Binary.Defer.Vector+    Data.Binary.Raw+    Data.Heap+    Data.Key+    Data.Range+    Data.TagStr+    Data.TypeMap+    General.CGI+    General.Code+    General.Glob+    General.TextUtil+    General.Util+    Hoogle.All+    Hoogle.DataBase.Aliases+    Hoogle.DataBase.All+    Hoogle.DataBase.Instances+    Hoogle.DataBase.Items+    Hoogle.DataBase.NameSearch+    Hoogle.DataBase.Serialise+    Hoogle.DataBase.Suggest+    Hoogle.DataBase.Type+    Hoogle.DataBase.TypeSearch.All+    Hoogle.DataBase.TypeSearch.Binding+    Hoogle.DataBase.TypeSearch.Cost+    Hoogle.DataBase.TypeSearch.EntryInfo+    Hoogle.DataBase.TypeSearch.Graph+    Hoogle.DataBase.TypeSearch.Graphs+    Hoogle.DataBase.TypeSearch.Result+    Hoogle.DataBase.TypeSearch.TypeScore+    Hoogle.Item.All+    Hoogle.Item.Haddock+    Hoogle.Item.Item+    Hoogle.Operations.All+    Hoogle.Operations.Convert+    Hoogle.Operations.Rank+    Hoogle.Operations.RankSolve+    Hoogle.Query.All+    Hoogle.Query.Parser+    Hoogle.Query.Render+    Hoogle.Query.Suggest+    Hoogle.Query.Type+    Hoogle.Search.All+    Hoogle.Search.Result+    Hoogle.Search.Results+    Hoogle.TextBase.All+    Hoogle.TextBase.Parser+    Hoogle.TextBase.Type+    Hoogle.TypeSig.All+    Hoogle.TypeSig.Parser+    Hoogle.TypeSig.Type+    Main+    Test.All+    Test.General+    Test.Parse_Query+    Test.Parse_TextBase+    Test.Parse_TypeSig+    Web.Action+    Web.All
− hoogle.txt 
@@ -1,10471 +0,0 @@--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module GHC.PArr--module Unsafe.Coerce-unsafeCoerce :: a -> b--module Data.Tuple-fst :: (a, b) -> a-snd :: (a, b) -> b-curry :: ((a, b) -> c) -> a -> b -> c-uncurry :: (a -> b -> c) -> (a, b) -> c--module Data.String-class IsString a-fromString :: IsString a => String -> a-instance IsString [Char]--module Data.Ord-class Eq a => Ord a-compare :: Ord a => a -> a -> Ordering-(<) :: Ord a => a -> a -> Bool-(<=) :: Ord a => a -> a -> Bool-(>) :: Ord a => a -> a -> Bool-(>=) :: Ord a => a -> a -> Bool-max :: Ord a => a -> a -> a-min :: Ord a => a -> a -> a-instance Ord All-instance Ord Any-instance Ord ArithException-instance Ord ArrayException-instance Ord AsyncException-instance Ord Bool-instance Ord BufferMode-instance Ord CChar-instance Ord CClock-instance Ord CDouble-instance Ord CFloat-instance Ord CInt-instance Ord CIntMax-instance Ord CIntPtr-instance Ord CLDouble-instance Ord CLLong-instance Ord CLong-instance Ord CPtrdiff-instance Ord CSChar-instance Ord CShort-instance Ord CSigAtomic-instance Ord CSize-instance Ord CTime-instance Ord CUChar-instance Ord CUInt-instance Ord CUIntMax-instance Ord CUIntPtr-instance Ord CULLong-instance Ord CULong-instance Ord CUShort-instance Ord CWchar-instance Ord Char-instance Ord ConsoleEvent-instance Ord Double-instance Ord ExitCode-instance Ord Fd-instance Ord Float-instance Ord GeneralCategory-instance Ord IOMode-instance Ord Int-instance Ord Int16-instance Ord Int32-instance Ord Int64-instance Ord Int8-instance Ord IntPtr-instance Ord Integer-instance Ord Ordering-instance Ord SeekMode-instance Ord ThreadId-instance Ord Unique-instance Ord Version-instance Ord Word-instance Ord Word16-instance Ord Word32-instance Ord Word64-instance Ord Word8-instance Ord WordPtr-instance Ord ()-instance (Ord a, Ord b) => Ord (a, b)-instance (Ord a, Ord b, Ord c) => Ord (a, b, c)-instance (Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d)-instance (Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (a, b, c, d, e)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord (a, b, c, d, e, f)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord (a, b, c, d, e, f, g)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => Ord (a, b, c, d, e, f, g, h)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i) => Ord (a, b, c, d, e, f, g, h, i)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j) => Ord (a, b, c, d, e, f, g, h, i, j)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k) => Ord (a, b, c, d, e, f, g, h, i, j, k)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l) => Ord (a, b, c, d, e, f, g, h, i, j, k, l)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n, Ord o) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)-instance Ord a => Ord (Dual a)-instance Ord a => Ord (First a)-instance Ord (Fixed a)-instance Ord (ForeignPtr a)-instance Ord (FunPtr a)-instance Ord a => Ord (Last a)-instance Ord a => Ord (Maybe a)-instance Ord a => Ord (Product a)-instance Ord (Ptr a)-instance Integral a => Ord (Ratio a)-instance Ord a => Ord (Sum a)-instance Ord a => Ord [a]-instance (Ix i, Ord e) => Ord (Array i e)-instance (Ord a, Ord b) => Ord (Either a b)-data Ordering-LT :: Ordering-EQ :: Ordering-instance Bounded Ordering-instance Data Ordering-instance Enum Ordering-instance Eq Ordering-instance Ix Ordering-instance Monoid Ordering-instance Ord Ordering-instance Read Ordering-instance Show Ordering-instance Typeable Ordering-comparing :: Ord a => (b -> a) -> b -> b -> Ordering--module Data.Maybe-data Maybe a-Nothing :: Maybe a-Just :: a -> Maybe a-instance Alternative Maybe-instance Applicative Maybe-instance Foldable Maybe-instance Functor Maybe-instance Monad Maybe-instance MonadFix Maybe-instance MonadPlus Maybe-instance Traversable Maybe-instance Typeable1 Maybe-instance Data a => Data (Maybe a)-instance Eq a => Eq (Maybe a)-instance Monoid a => Monoid (Maybe a)-instance Ord a => Ord (Maybe a)-instance Read a => Read (Maybe a)-instance Show a => Show (Maybe a)-maybe :: b -> (a -> b) -> Maybe a -> b-isJust :: Maybe a -> Bool-isNothing :: Maybe a -> Bool-fromJust :: Maybe a -> a-fromMaybe :: a -> Maybe a -> a-listToMaybe :: [a] -> Maybe a-maybeToList :: Maybe a -> [a]-catMaybes :: [Maybe a] -> [a]-mapMaybe :: (a -> Maybe b) -> [a] -> [b]--module Data.Eq-class Eq a-(==) :: Eq a => a -> a -> Bool-(/=) :: Eq a => a -> a -> Bool-instance Eq All-instance Eq Any-instance Eq ArithException-instance Eq ArrayException-instance Eq AsyncException-instance Eq Bool-instance Eq BufferMode-instance Eq BufferState-instance Eq CChar-instance Eq CClock-instance Eq CDouble-instance Eq CFloat-instance Eq CInt-instance Eq CIntMax-instance Eq CIntPtr-instance Eq CLDouble-instance Eq CLLong-instance Eq CLong-instance Eq CPtrdiff-instance Eq CSChar-instance Eq CShort-instance Eq CSigAtomic-instance Eq CSize-instance Eq CTime-instance Eq CUChar-instance Eq CUInt-instance Eq CUIntMax-instance Eq CUIntPtr-instance Eq CULLong-instance Eq CULong-instance Eq CUShort-instance Eq CWchar-instance Eq Char-instance Eq ConsoleEvent-instance Eq Constr-instance Eq ConstrRep-instance Eq DataRep-instance Eq Double-instance Eq Errno-instance Eq Exception-instance Eq ExitCode-instance Eq FDType-instance Eq Fd-instance Eq Fixity-instance Eq Float-instance Eq GeneralCategory-instance Eq Handle-instance Eq HandlePosn-instance Eq HashData-instance Eq IOErrorType-instance Eq IOException-instance Eq IOMode-instance Eq Inserts-instance Eq Int-instance Eq Int16-instance Eq Int32-instance Eq Int64-instance Eq Int8-instance Eq IntPtr-instance Eq Integer-instance Eq Key-instance Eq KeyPr-instance Eq Lexeme-instance Eq Ordering-instance Eq SeekMode-instance Eq ThreadId-instance Eq Timeout-instance Eq TyCon-instance Eq TypeRep-instance Eq Unique-instance Eq Version-instance Eq Word-instance Eq Word16-instance Eq Word32-instance Eq Word64-instance Eq Word8-instance Eq WordPtr-instance Eq ()-instance (Eq a, Eq b) => Eq (a, b)-instance (Eq a, Eq b, Eq c) => Eq (a, b, c)-instance (Eq a, Eq b, Eq c, Eq d) => Eq (a, b, c, d)-instance (Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (a, b, c, d, e)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq (a, b, c, d, e, f)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq (a, b, c, d, e, f, g)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h) => Eq (a, b, c, d, e, f, g, h)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i) => Eq (a, b, c, d, e, f, g, h, i)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j) => Eq (a, b, c, d, e, f, g, h, i, j)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k) => Eq (a, b, c, d, e, f, g, h, i, j, k)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l) => Eq (a, b, c, d, e, f, g, h, i, j, k, l)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n, Eq o) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)-instance (RealFloat a, Eq a) => Eq (Complex a)-instance Eq a => Eq (Dual a)-instance Eq a => Eq (First a)-instance Eq (Fixed a)-instance Eq (ForeignPtr a)-instance Eq (FunPtr a)-instance Eq (IORef a)-instance Eq a => Eq (Last a)-instance Eq (MVar a)-instance Eq a => Eq (Maybe a)-instance Eq a => Eq (Product a)-instance Eq (Ptr a)-instance (Integral a, Eq a) => Eq (Ratio a)-instance Eq (StableName a)-instance Eq (StablePtr a)-instance Eq a => Eq (Sum a)-instance Eq (TVar a)-instance Eq a => Eq [a]-instance (Ix i, Eq e) => Eq (Array i e)-instance (Eq a, Eq b) => Eq (Either a b)-instance Eq (IOArray i e)-instance Eq (STRef s a)-instance Eq (STArray s i e)--module Data.Either-data Either a b-Left :: a -> Either a b-Right :: b -> Either a b-instance Typeable2 Either-instance Functor (Either a)-instance (Data a, Data b) => Data (Either a b)-instance (Eq a, Eq b) => Eq (Either a b)-instance (Ord a, Ord b) => Ord (Either a b)-instance (Read a, Read b) => Read (Either a b)-instance (Show a, Show b) => Show (Either a b)-either :: (a -> c) -> (b -> c) -> Either a b -> c--module Text.Show-type ShowS = String -> String-class Show a-showsPrec :: Show a => Int -> a -> ShowS-show :: Show a => a -> String-showList :: Show a => [a] -> ShowS-instance Show All-instance Show Any-instance Show ArithException-instance Show ArrayException-instance Show AsyncException-instance Show Bool-instance Show BufferMode-instance Show CChar-instance Show CClock-instance Show CDouble-instance Show CFloat-instance Show CInt-instance Show CIntMax-instance Show CIntPtr-instance Show CLDouble-instance Show CLLong-instance Show CLong-instance Show CPtrdiff-instance Show CSChar-instance Show CShort-instance Show CSigAtomic-instance Show CSize-instance Show CTime-instance Show CUChar-instance Show CUInt-instance Show CUIntMax-instance Show CUIntPtr-instance Show CULLong-instance Show CULong-instance Show CUShort-instance Show CWchar-instance Show Char-instance Show ConsoleEvent-instance Show Constr-instance Show ConstrRep-instance Show DataRep-instance Show DataType-instance Show Double-instance Show Dynamic-instance Show Exception-instance Show ExitCode-instance Show Fd-instance Show Fixity-instance Show Float-instance Show GeneralCategory-instance Show Handle-instance Show HandlePosn-instance Show HandleType-instance Show HashData-instance Show IOErrorType-instance Show IOException-instance Show IOMode-instance Show Int-instance Show Int16-instance Show Int32-instance Show Int64-instance Show Int8-instance Show IntPtr-instance Show Integer-instance Show Lexeme-instance Show Ordering-instance Show SeekMode-instance Show ThreadId-instance Show TyCon-instance Show TypeRep-instance Show Version-instance Show Word-instance Show Word16-instance Show Word32-instance Show Word64-instance Show Word8-instance Show WordPtr-instance Show ()-instance (Show a, Show b) => Show (a, b)-instance (Show a, Show b, Show c) => Show (a, b, c)-instance (Show a, Show b, Show c, Show d) => Show (a, b, c, d)-instance (Show a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e)-instance (Show a, Show b, Show c, Show d, Show e, Show f) => Show (a, b, c, d, e, f)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show (a, b, c, d, e, f, g)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h) => Show (a, b, c, d, e, f, g, h)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i) => Show (a, b, c, d, e, f, g, h, i)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j) => Show (a, b, c, d, e, f, g, h, i, j)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k) => Show (a, b, c, d, e, f, g, h, i, j, k)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l) => Show (a, b, c, d, e, f, g, h, i, j, k, l)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n, Show o) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)-instance Show (a -> b)-instance (RealFloat a, Show a) => Show (Complex a)-instance Show a => Show (Dual a)-instance Show a => Show (First a)-instance HasResolution a => Show (Fixed a)-instance Show (ForeignPtr a)-instance Show (FunPtr a)-instance Show a => Show (Last a)-instance Show a => Show (Maybe a)-instance Show a => Show (Product a)-instance Show (Ptr a)-instance Integral a => Show (Ratio a)-instance Show a => Show (Sum a)-instance Show a => Show [a]-instance (Ix a, Show a, Show b) => Show (Array a b)-instance (Show a, Show b) => Show (Either a b)-instance Show (ST s a)-shows :: Show a => a -> ShowS-showChar :: Char -> ShowS-showString :: String -> ShowS-showParen :: Bool -> ShowS -> ShowS-showListWith :: (a -> ShowS) -> [a] -> ShowS--module Data.Bool-data Bool-False :: Bool-True :: Bool-instance Bounded Bool-instance Data Bool-instance Enum Bool-instance Eq Bool-instance Ix Bool-instance Ord Bool-instance Read Bool-instance Show Bool-instance Storable Bool-instance Typeable Bool-(&&) :: Bool -> Bool -> Bool-(||) :: Bool -> Bool -> Bool-not :: Bool -> Bool-otherwise :: Bool--module Data.Bits-class Num a => Bits a-(.&.) :: Bits a => a -> a -> a-(.|.) :: Bits a => a -> a -> a-xor :: Bits a => a -> a -> a-complement :: Bits a => a -> a-shift :: Bits a => a -> Int -> a-rotate :: Bits a => a -> Int -> a-bit :: Bits a => Int -> a-setBit :: Bits a => a -> Int -> a-clearBit :: Bits a => a -> Int -> a-complementBit :: Bits a => a -> Int -> a-testBit :: Bits a => a -> Int -> Bool-bitSize :: Bits a => a -> Int-isSigned :: Bits a => a -> Bool-shiftL :: Bits a => a -> Int -> a-shiftR :: Bits a => a -> Int -> a-rotateL :: Bits a => a -> Int -> a-rotateR :: Bits a => a -> Int -> a-instance Bits CChar-instance Bits CInt-instance Bits CIntMax-instance Bits CIntPtr-instance Bits CLLong-instance Bits CLong-instance Bits CPtrdiff-instance Bits CSChar-instance Bits CShort-instance Bits CSigAtomic-instance Bits CSize-instance Bits CUChar-instance Bits CUInt-instance Bits CUIntMax-instance Bits CUIntPtr-instance Bits CULLong-instance Bits CULong-instance Bits CUShort-instance Bits CWchar-instance Bits Fd-instance Bits Int-instance Bits Int16-instance Bits Int32-instance Bits Int64-instance Bits Int8-instance Bits IntPtr-instance Bits Integer-instance Bits Word-instance Bits Word16-instance Bits Word32-instance Bits Word64-instance Bits Word8-instance Bits WordPtr--module Control.Monad-class Functor f-fmap :: Functor f => (a -> b) -> f a -> f b-instance Functor IO-instance Functor Id-instance Functor Maybe-instance Functor ReadP-instance Functor ReadPrec-instance Functor STM-instance Functor ZipList-instance Functor []-instance Ix i => Functor (Array i)-instance Functor (Const m)-instance Functor (Either a)-instance Functor (ST s)-instance Functor (ST s)-instance Monad m => Functor (WrappedMonad m)-instance Functor ((,) a)-instance Functor ((->) r)-instance Arrow a => Functor (WrappedArrow a b)-class Monad m-(>>=) :: Monad m => m a -> (a -> m b) -> m b-(>>) :: Monad m => m a -> m b -> m b-return :: Monad m => a -> m a-fail :: Monad m => String -> m a-instance Monad IO-instance Monad Maybe-instance Monad P-instance Monad ReadP-instance Monad ReadPrec-instance Monad STM-instance Monad []-instance ArrowApply a => Monad (ArrowMonad a)-instance Monad (ST s)-instance Monad (ST s)-instance Monad ((->) r)-class Monad m => MonadPlus m-mzero :: MonadPlus m => m a-mplus :: MonadPlus m => m a -> m a -> m a-instance MonadPlus Maybe-instance MonadPlus P-instance MonadPlus ReadP-instance MonadPlus ReadPrec-instance MonadPlus []-mapM :: Monad m => (a -> m b) -> [a] -> m [b]-mapM_ :: Monad m => (a -> m b) -> [a] -> m ()-forM :: Monad m => [a] -> (a -> m b) -> m [b]-forM_ :: Monad m => [a] -> (a -> m b) -> m ()-sequence :: Monad m => [m a] -> m [a]-sequence_ :: Monad m => [m a] -> m ()-(=<<) :: Monad m => (a -> m b) -> m a -> m b-(>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c-(<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c-forever :: Monad m => m a -> m ()-join :: Monad m => m (m a) -> m a-msum :: MonadPlus m => [m a] -> m a-filterM :: Monad m => (a -> m Bool) -> [a] -> m [a]-mapAndUnzipM :: Monad m => (a -> m (b, c)) -> [a] -> m ([b], [c])-zipWithM :: Monad m => (a -> b -> m c) -> [a] -> [b] -> m [c]-zipWithM_ :: Monad m => (a -> b -> m c) -> [a] -> [b] -> m ()-foldM :: Monad m => (a -> b -> m a) -> a -> [b] -> m a-foldM_ :: Monad m => (a -> b -> m a) -> a -> [b] -> m ()-replicateM :: Monad m => Int -> m a -> m [a]-replicateM_ :: Monad m => Int -> m a -> m ()-guard :: MonadPlus m => Bool -> m ()-when :: Monad m => Bool -> m () -> m ()-unless :: Monad m => Bool -> m () -> m ()-liftM :: Monad m => (a1 -> r) -> m a1 -> m r-liftM2 :: Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r-liftM3 :: Monad m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r-liftM4 :: Monad m => (a1 -> a2 -> a3 -> a4 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m r-liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r-ap :: Monad m => m (a -> b) -> m a -> m b--module Text.ParserCombinators.ReadP-data ReadP a-instance Functor ReadP-instance Monad ReadP-instance MonadPlus ReadP-get :: ReadP Char-look :: ReadP String-(+++) :: ReadP a -> ReadP a -> ReadP a-(<++) :: ReadP a -> ReadP a -> ReadP a-gather :: ReadP a -> ReadP (String, a)-pfail :: ReadP a-satisfy :: (Char -> Bool) -> ReadP Char-char :: Char -> ReadP Char-string :: String -> ReadP String-munch :: (Char -> Bool) -> ReadP String-munch1 :: (Char -> Bool) -> ReadP String-skipSpaces :: ReadP ()-choice :: [ReadP a] -> ReadP a-count :: Int -> ReadP a -> ReadP [a]-between :: ReadP open -> ReadP close -> ReadP a -> ReadP a-option :: a -> ReadP a -> ReadP a-optional :: ReadP a -> ReadP ()-many :: ReadP a -> ReadP [a]-many1 :: ReadP a -> ReadP [a]-skipMany :: ReadP a -> ReadP ()-skipMany1 :: ReadP a -> ReadP ()-sepBy :: ReadP a -> ReadP sep -> ReadP [a]-sepBy1 :: ReadP a -> ReadP sep -> ReadP [a]-endBy :: ReadP a -> ReadP sep -> ReadP [a]-endBy1 :: ReadP a -> ReadP sep -> ReadP [a]-chainr :: ReadP a -> ReadP (a -> a -> a) -> a -> ReadP a-chainl :: ReadP a -> ReadP (a -> a -> a) -> a -> ReadP a-chainl1 :: ReadP a -> ReadP (a -> a -> a) -> ReadP a-chainr1 :: ReadP a -> ReadP (a -> a -> a) -> ReadP a-manyTill :: ReadP a -> ReadP end -> ReadP [a]-type ReadS a = String -> [(a, String)]-readP_to_S :: ReadP a -> ReadS a-readS_to_P :: ReadS a -> ReadP a--module Text.ParserCombinators.ReadPrec-data ReadPrec a-instance Functor ReadPrec-instance Monad ReadPrec-instance MonadPlus ReadPrec-type Prec = Int-minPrec :: Prec-lift :: ReadP a -> ReadPrec a-prec :: Prec -> ReadPrec a -> ReadPrec a-step :: ReadPrec a -> ReadPrec a-reset :: ReadPrec a -> ReadPrec a-get :: ReadPrec Char-look :: ReadPrec String-(+++) :: ReadPrec a -> ReadPrec a -> ReadPrec a-(<++) :: ReadPrec a -> ReadPrec a -> ReadPrec a-pfail :: ReadPrec a-choice :: [ReadPrec a] -> ReadPrec a-readPrec_to_P :: ReadPrec a -> Int -> ReadP a-readP_to_Prec :: (Int -> ReadP a) -> ReadPrec a-readPrec_to_S :: ReadPrec a -> Int -> ReadS a-readS_to_Prec :: (Int -> ReadS a) -> ReadPrec a--module Text.Read.Lex-data Lexeme-Char :: Char -> Lexeme-String :: String -> Lexeme-Punc :: String -> Lexeme-Ident :: String -> Lexeme-Symbol :: String -> Lexeme-Int :: Integer -> Lexeme-Rat :: Rational -> Lexeme-EOF :: Lexeme-instance Eq Lexeme-instance Read Lexeme-instance Show Lexeme-lex :: ReadP Lexeme-hsLex :: ReadP String-lexChar :: ReadP Char-readIntP :: Num a => a -> (Char -> Bool) -> (Char -> Int) -> ReadP a-readOctP :: Num a => ReadP a-readDecP :: Num a => ReadP a-readHexP :: Num a => ReadP a--module Data.Word-data Word-instance Bits Word-instance Bounded Word-instance Data Word-instance Enum Word-instance Eq Word-instance Integral Word-instance Ix Word-instance Num Word-instance Ord Word-instance PrintfArg Word-instance Read Word-instance Real Word-instance Show Word-instance Storable Word-instance Typeable Word-data Word8-instance Bits Word8-instance Bounded Word8-instance Data Word8-instance Enum Word8-instance Eq Word8-instance Integral Word8-instance Ix Word8-instance Num Word8-instance Ord Word8-instance PrintfArg Word8-instance Read Word8-instance Real Word8-instance Show Word8-instance Storable Word8-instance Typeable Word8-data Word16-instance Bits Word16-instance Bounded Word16-instance Data Word16-instance Enum Word16-instance Eq Word16-instance Integral Word16-instance Ix Word16-instance Num Word16-instance Ord Word16-instance PrintfArg Word16-instance Read Word16-instance Real Word16-instance Show Word16-instance Storable Word16-instance Typeable Word16-data Word32-instance Bits Word32-instance Bounded Word32-instance Data Word32-instance Enum Word32-instance Eq Word32-instance Integral Word32-instance Ix Word32-instance Num Word32-instance Ord Word32-instance PrintfArg Word32-instance Read Word32-instance Real Word32-instance Show Word32-instance Storable Word32-instance Typeable Word32-data Word64-instance Bits Word64-instance Bounded Word64-instance Data Word64-instance Enum Word64-instance Eq Word64-instance Integral Word64-instance Ix Word64-instance Num Word64-instance Ord Word64-instance PrintfArg Word64-instance Read Word64-instance Real Word64-instance Show Word64-instance Storable Word64-instance Typeable Word64--module Data.Int-data Int-instance Bits Int-instance Bounded Int-instance Data Int-instance Enum Int-instance Eq Int-instance Integral Int-instance Ix Int-instance Num Int-instance Ord Int-instance PrintfArg Int-instance Read Int-instance Real Int-instance Show Int-instance Storable Int-instance Typeable Int-data Int8-instance Bits Int8-instance Bounded Int8-instance Data Int8-instance Enum Int8-instance Eq Int8-instance Integral Int8-instance Ix Int8-instance Num Int8-instance Ord Int8-instance PrintfArg Int8-instance Read Int8-instance Real Int8-instance Show Int8-instance Storable Int8-instance Typeable Int8-data Int16-instance Bits Int16-instance Bounded Int16-instance Data Int16-instance Enum Int16-instance Eq Int16-instance Integral Int16-instance Ix Int16-instance Num Int16-instance Ord Int16-instance PrintfArg Int16-instance Read Int16-instance Real Int16-instance Show Int16-instance Storable Int16-instance Typeable Int16-data Int32-instance Bits Int32-instance Bounded Int32-instance Data Int32-instance Enum Int32-instance Eq Int32-instance Integral Int32-instance Ix Int32-instance Num Int32-instance Ord Int32-instance PrintfArg Int32-instance Read Int32-instance Real Int32-instance Show Int32-instance Storable Int32-instance Typeable Int32-data Int64-instance Bits Int64-instance Bounded Int64-instance Data Int64-instance Enum Int64-instance Eq Int64-instance Integral Int64-instance Ix Int64-instance Num Int64-instance Ord Int64-instance PrintfArg Int64-instance Read Int64-instance Real Int64-instance Show Int64-instance Storable Int64-instance Typeable Int64--module Data.Char-data Char-instance Bounded Char-instance Data Char-instance Enum Char-instance Eq Char-instance IsChar Char-instance Ix Char-instance Ord Char-instance PrintfArg Char-instance Read Char-instance Show Char-instance Storable Char-instance Typeable Char-instance IsString [Char]-type String = [Char]-isControl :: Char -> Bool-isSpace :: Char -> Bool-isLower :: Char -> Bool-isUpper :: Char -> Bool-isAlpha :: Char -> Bool-isAlphaNum :: Char -> Bool-isPrint :: Char -> Bool-isDigit :: Char -> Bool-isOctDigit :: Char -> Bool-isHexDigit :: Char -> Bool-isLetter :: Char -> Bool-isMark :: Char -> Bool-isNumber :: Char -> Bool-isPunctuation :: Char -> Bool-isSymbol :: Char -> Bool-isSeparator :: Char -> Bool-isAscii :: Char -> Bool-isLatin1 :: Char -> Bool-isAsciiUpper :: Char -> Bool-isAsciiLower :: Char -> Bool-data GeneralCategory-UppercaseLetter :: GeneralCategory-LowercaseLetter :: GeneralCategory-TitlecaseLetter :: GeneralCategory-ModifierLetter :: GeneralCategory-OtherLetter :: GeneralCategory-NonSpacingMark :: GeneralCategory-SpacingCombiningMark :: GeneralCategory-EnclosingMark :: GeneralCategory-DecimalNumber :: GeneralCategory-LetterNumber :: GeneralCategory-OtherNumber :: GeneralCategory-ConnectorPunctuation :: GeneralCategory-DashPunctuation :: GeneralCategory-OpenPunctuation :: GeneralCategory-ClosePunctuation :: GeneralCategory-InitialQuote :: GeneralCategory-FinalQuote :: GeneralCategory-OtherPunctuation :: GeneralCategory-MathSymbol :: GeneralCategory-CurrencySymbol :: GeneralCategory-ModifierSymbol :: GeneralCategory-OtherSymbol :: GeneralCategory-Space :: GeneralCategory-LineSeparator :: GeneralCategory-ParagraphSeparator :: GeneralCategory-Control :: GeneralCategory-Format :: GeneralCategory-Surrogate :: GeneralCategory-PrivateUse :: GeneralCategory-NotAssigned :: GeneralCategory-instance Bounded GeneralCategory-instance Enum GeneralCategory-instance Eq GeneralCategory-instance Ix GeneralCategory-instance Ord GeneralCategory-instance Read GeneralCategory-instance Show GeneralCategory-generalCategory :: Char -> GeneralCategory-toUpper :: Char -> Char-toLower :: Char -> Char-toTitle :: Char -> Char-digitToInt :: Char -> Int-intToDigit :: Int -> Char-ord :: Char -> Int-chr :: Int -> Char-showLitChar :: Char -> ShowS-lexLitChar :: ReadS String-readLitChar :: ReadS Char--module Data.List-(++) :: [a] -> [a] -> [a]-head :: [a] -> a-last :: [a] -> a-tail :: [a] -> [a]-init :: [a] -> [a]-null :: [a] -> Bool-length :: [a] -> Int-map :: (a -> b) -> [a] -> [b]-reverse :: [a] -> [a]-intersperse :: a -> [a] -> [a]-intercalate :: [a] -> [[a]] -> [a]-transpose :: [[a]] -> [[a]]-foldl :: (a -> b -> a) -> a -> [b] -> a-foldl' :: (a -> b -> a) -> a -> [b] -> a-foldl1 :: (a -> a -> a) -> [a] -> a-foldl1' :: (a -> a -> a) -> [a] -> a-foldr :: (a -> b -> b) -> b -> [a] -> b-foldr1 :: (a -> a -> a) -> [a] -> a-concat :: [[a]] -> [a]-concatMap :: (a -> [b]) -> [a] -> [b]-and :: [Bool] -> Bool-or :: [Bool] -> Bool-any :: (a -> Bool) -> [a] -> Bool-all :: (a -> Bool) -> [a] -> Bool-sum :: Num a => [a] -> a-product :: Num a => [a] -> a-maximum :: Ord a => [a] -> a-minimum :: Ord a => [a] -> a-scanl :: (a -> b -> a) -> a -> [b] -> [a]-scanl1 :: (a -> a -> a) -> [a] -> [a]-scanr :: (a -> b -> b) -> b -> [a] -> [b]-scanr1 :: (a -> a -> a) -> [a] -> [a]-mapAccumL :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])-mapAccumR :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])-iterate :: (a -> a) -> a -> [a]-repeat :: a -> [a]-replicate :: Int -> a -> [a]-cycle :: [a] -> [a]-unfoldr :: (b -> Maybe (a, b)) -> b -> [a]-take :: Int -> [a] -> [a]-drop :: Int -> [a] -> [a]-splitAt :: Int -> [a] -> ([a], [a])-takeWhile :: (a -> Bool) -> [a] -> [a]-dropWhile :: (a -> Bool) -> [a] -> [a]-span :: (a -> Bool) -> [a] -> ([a], [a])-break :: (a -> Bool) -> [a] -> ([a], [a])-stripPrefix :: Eq a => [a] -> [a] -> Maybe [a]-group :: Eq a => [a] -> [[a]]-inits :: [a] -> [[a]]-tails :: [a] -> [[a]]-isPrefixOf :: Eq a => [a] -> [a] -> Bool-isSuffixOf :: Eq a => [a] -> [a] -> Bool-isInfixOf :: Eq a => [a] -> [a] -> Bool-elem :: Eq a => a -> [a] -> Bool-notElem :: Eq a => a -> [a] -> Bool-lookup :: Eq a => a -> [(a, b)] -> Maybe b-find :: (a -> Bool) -> [a] -> Maybe a-filter :: (a -> Bool) -> [a] -> [a]-partition :: (a -> Bool) -> [a] -> ([a], [a])-(!!) :: [a] -> Int -> a-elemIndex :: Eq a => a -> [a] -> Maybe Int-elemIndices :: Eq a => a -> [a] -> [Int]-findIndex :: (a -> Bool) -> [a] -> Maybe Int-findIndices :: (a -> Bool) -> [a] -> [Int]-zip :: [a] -> [b] -> [(a, b)]-zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]-zip4 :: [a] -> [b] -> [c] -> [d] -> [(a, b, c, d)]-zip5 :: [a] -> [b] -> [c] -> [d] -> [e] -> [(a, b, c, d, e)]-zip6 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [(a, b, c, d, e, f)]-zip7 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [(a, b, c, d, e, f, g)]-zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]-zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]-zipWith4 :: (a -> b -> c -> d -> e) -> [a] -> [b] -> [c] -> [d] -> [e]-zipWith5 :: (a -> b -> c -> d -> e -> f) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f]-zipWith6 :: (a -> b -> c -> d -> e -> f -> g) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g]-zipWith7 :: (a -> b -> c -> d -> e -> f -> g -> h) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [h]-unzip :: [(a, b)] -> ([a], [b])-unzip3 :: [(a, b, c)] -> ([a], [b], [c])-unzip4 :: [(a, b, c, d)] -> ([a], [b], [c], [d])-unzip5 :: [(a, b, c, d, e)] -> ([a], [b], [c], [d], [e])-unzip6 :: [(a, b, c, d, e, f)] -> ([a], [b], [c], [d], [e], [f])-unzip7 :: [(a, b, c, d, e, f, g)] -> ([a], [b], [c], [d], [e], [f], [g])-lines :: String -> [String]-words :: String -> [String]-unlines :: [String] -> String-unwords :: [String] -> String-nub :: Eq a => [a] -> [a]-delete :: Eq a => a -> [a] -> [a]-(\\) :: Eq a => [a] -> [a] -> [a]-union :: Eq a => [a] -> [a] -> [a]-intersect :: Eq a => [a] -> [a] -> [a]-sort :: Ord a => [a] -> [a]-insert :: Ord a => a -> [a] -> [a]-nubBy :: (a -> a -> Bool) -> [a] -> [a]-deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]-deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]-unionBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]-intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]-groupBy :: (a -> a -> Bool) -> [a] -> [[a]]-sortBy :: (a -> a -> Ordering) -> [a] -> [a]-insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a]-maximumBy :: (a -> a -> Ordering) -> [a] -> a-minimumBy :: (a -> a -> Ordering) -> [a] -> a-genericLength :: Num i => [b] -> i-genericTake :: Integral i => i -> [a] -> [a]-genericDrop :: Integral i => i -> [a] -> [a]-genericSplitAt :: Integral i => i -> [b] -> ([b], [b])-genericIndex :: Integral a => [b] -> a -> b-genericReplicate :: Integral i => i -> a -> [a]--module Numeric-showSigned :: Real a => (a -> ShowS) -> Int -> a -> ShowS-showIntAtBase :: Integral a => a -> (Int -> Char) -> a -> ShowS-showInt :: Integral a => a -> ShowS-showHex :: Integral a => a -> ShowS-showOct :: Integral a => a -> ShowS-showEFloat :: RealFloat a => Maybe Int -> a -> ShowS-showFFloat :: RealFloat a => Maybe Int -> a -> ShowS-showGFloat :: RealFloat a => Maybe Int -> a -> ShowS-showFloat :: RealFloat a => a -> ShowS-floatToDigits :: RealFloat a => Integer -> a -> ([Int], Int)-readSigned :: Real a => ReadS a -> ReadS a-readInt :: Num a => a -> (Char -> Bool) -> (Char -> Int) -> ReadS a-readDec :: Num a => ReadS a-readOct :: Num a => ReadS a-readHex :: Num a => ReadS a-readFloat :: RealFrac a => ReadS a-lexDigits :: ReadS String-fromRat :: RealFloat a => Rational -> a--module Foreign.C.Types-data CChar-instance Bits CChar-instance Bounded CChar-instance Enum CChar-instance Eq CChar-instance Integral CChar-instance Num CChar-instance Ord CChar-instance Read CChar-instance Real CChar-instance Show CChar-instance Storable CChar-instance Typeable CChar-data CSChar-instance Bits CSChar-instance Bounded CSChar-instance Enum CSChar-instance Eq CSChar-instance Integral CSChar-instance Num CSChar-instance Ord CSChar-instance Read CSChar-instance Real CSChar-instance Show CSChar-instance Storable CSChar-instance Typeable CSChar-data CUChar-instance Bits CUChar-instance Bounded CUChar-instance Enum CUChar-instance Eq CUChar-instance Integral CUChar-instance Num CUChar-instance Ord CUChar-instance Read CUChar-instance Real CUChar-instance Show CUChar-instance Storable CUChar-instance Typeable CUChar-data CShort-instance Bits CShort-instance Bounded CShort-instance Enum CShort-instance Eq CShort-instance Integral CShort-instance Num CShort-instance Ord CShort-instance Read CShort-instance Real CShort-instance Show CShort-instance Storable CShort-instance Typeable CShort-data CUShort-instance Bits CUShort-instance Bounded CUShort-instance Enum CUShort-instance Eq CUShort-instance Integral CUShort-instance Num CUShort-instance Ord CUShort-instance Read CUShort-instance Real CUShort-instance Show CUShort-instance Storable CUShort-instance Typeable CUShort-data CInt-instance Bits CInt-instance Bounded CInt-instance Enum CInt-instance Eq CInt-instance Integral CInt-instance Num CInt-instance Ord CInt-instance Read CInt-instance Real CInt-instance Show CInt-instance Storable CInt-instance Typeable CInt-data CUInt-instance Bits CUInt-instance Bounded CUInt-instance Enum CUInt-instance Eq CUInt-instance Integral CUInt-instance Num CUInt-instance Ord CUInt-instance Read CUInt-instance Real CUInt-instance Show CUInt-instance Storable CUInt-instance Typeable CUInt-data CLong-instance Bits CLong-instance Bounded CLong-instance Enum CLong-instance Eq CLong-instance Integral CLong-instance Num CLong-instance Ord CLong-instance Read CLong-instance Real CLong-instance Show CLong-instance Storable CLong-instance Typeable CLong-data CULong-instance Bits CULong-instance Bounded CULong-instance Enum CULong-instance Eq CULong-instance Integral CULong-instance Num CULong-instance Ord CULong-instance Read CULong-instance Real CULong-instance Show CULong-instance Storable CULong-instance Typeable CULong-data CPtrdiff-instance Bits CPtrdiff-instance Bounded CPtrdiff-instance Enum CPtrdiff-instance Eq CPtrdiff-instance Integral CPtrdiff-instance Num CPtrdiff-instance Ord CPtrdiff-instance Read CPtrdiff-instance Real CPtrdiff-instance Show CPtrdiff-instance Storable CPtrdiff-instance Typeable CPtrdiff-data CSize-instance Bits CSize-instance Bounded CSize-instance Enum CSize-instance Eq CSize-instance Integral CSize-instance Num CSize-instance Ord CSize-instance Read CSize-instance Real CSize-instance Show CSize-instance Storable CSize-instance Typeable CSize-data CWchar-instance Bits CWchar-instance Bounded CWchar-instance Enum CWchar-instance Eq CWchar-instance Integral CWchar-instance Num CWchar-instance Ord CWchar-instance Read CWchar-instance Real CWchar-instance Show CWchar-instance Storable CWchar-instance Typeable CWchar-data CSigAtomic-instance Bits CSigAtomic-instance Bounded CSigAtomic-instance Enum CSigAtomic-instance Eq CSigAtomic-instance Integral CSigAtomic-instance Num CSigAtomic-instance Ord CSigAtomic-instance Read CSigAtomic-instance Real CSigAtomic-instance Show CSigAtomic-instance Storable CSigAtomic-instance Typeable CSigAtomic-data CLLong-instance Bits CLLong-instance Bounded CLLong-instance Enum CLLong-instance Eq CLLong-instance Integral CLLong-instance Num CLLong-instance Ord CLLong-instance Read CLLong-instance Real CLLong-instance Show CLLong-instance Storable CLLong-instance Typeable CLLong-data CULLong-instance Bits CULLong-instance Bounded CULLong-instance Enum CULLong-instance Eq CULLong-instance Integral CULLong-instance Num CULLong-instance Ord CULLong-instance Read CULLong-instance Real CULLong-instance Show CULLong-instance Storable CULLong-instance Typeable CULLong-data CIntPtr-instance Bits CIntPtr-instance Bounded CIntPtr-instance Enum CIntPtr-instance Eq CIntPtr-instance Integral CIntPtr-instance Num CIntPtr-instance Ord CIntPtr-instance Read CIntPtr-instance Real CIntPtr-instance Show CIntPtr-instance Storable CIntPtr-instance Typeable CIntPtr-data CUIntPtr-instance Bits CUIntPtr-instance Bounded CUIntPtr-instance Enum CUIntPtr-instance Eq CUIntPtr-instance Integral CUIntPtr-instance Num CUIntPtr-instance Ord CUIntPtr-instance Read CUIntPtr-instance Real CUIntPtr-instance Show CUIntPtr-instance Storable CUIntPtr-instance Typeable CUIntPtr-data CIntMax-instance Bits CIntMax-instance Bounded CIntMax-instance Enum CIntMax-instance Eq CIntMax-instance Integral CIntMax-instance Num CIntMax-instance Ord CIntMax-instance Read CIntMax-instance Real CIntMax-instance Show CIntMax-instance Storable CIntMax-instance Typeable CIntMax-data CUIntMax-instance Bits CUIntMax-instance Bounded CUIntMax-instance Enum CUIntMax-instance Eq CUIntMax-instance Integral CUIntMax-instance Num CUIntMax-instance Ord CUIntMax-instance Read CUIntMax-instance Real CUIntMax-instance Show CUIntMax-instance Storable CUIntMax-instance Typeable CUIntMax-data CClock-instance Enum CClock-instance Eq CClock-instance Num CClock-instance Ord CClock-instance Read CClock-instance Real CClock-instance Show CClock-instance Storable CClock-instance Typeable CClock-data CTime-instance Enum CTime-instance Eq CTime-instance Num CTime-instance Ord CTime-instance Read CTime-instance Real CTime-instance Show CTime-instance Storable CTime-instance Typeable CTime-data CFloat-instance Enum CFloat-instance Eq CFloat-instance Floating CFloat-instance Fractional CFloat-instance Num CFloat-instance Ord CFloat-instance Read CFloat-instance Real CFloat-instance RealFloat CFloat-instance RealFrac CFloat-instance Show CFloat-instance Storable CFloat-instance Typeable CFloat-data CDouble-instance Enum CDouble-instance Eq CDouble-instance Floating CDouble-instance Fractional CDouble-instance Num CDouble-instance Ord CDouble-instance Read CDouble-instance Real CDouble-instance RealFloat CDouble-instance RealFrac CDouble-instance Show CDouble-instance Storable CDouble-instance Typeable CDouble-data CLDouble-instance Enum CLDouble-instance Eq CLDouble-instance Floating CLDouble-instance Fractional CLDouble-instance Num CLDouble-instance Ord CLDouble-instance Read CLDouble-instance Real CLDouble-instance RealFloat CLDouble-instance RealFrac CLDouble-instance Show CLDouble-instance Storable CLDouble-instance Typeable CLDouble-data CFile-data CFpos-data CJmpBuf--module Foreign.Storable-class Storable a-sizeOf :: Storable a => a -> Int-alignment :: Storable a => a -> Int-peekElemOff :: Storable a => Ptr a -> Int -> IO a-pokeElemOff :: Storable a => Ptr a -> Int -> a -> IO ()-peekByteOff :: Storable a => Ptr b -> Int -> IO a-pokeByteOff :: Storable a => Ptr b -> Int -> a -> IO ()-peek :: Storable a => Ptr a -> IO a-poke :: Storable a => Ptr a -> a -> IO ()-instance Storable Bool-instance Storable Char-instance Storable Double-instance Storable Fd-instance Storable Float-instance Storable Int-instance Storable Int16-instance Storable Int32-instance Storable Int64-instance Storable Int8-instance Storable IntPtr-instance Storable Word-instance Storable Word16-instance Storable Word32-instance Storable Word64-instance Storable Word8-instance Storable WordPtr-instance Storable (FunPtr a)-instance Storable (Ptr a)-instance Storable (StablePtr a)--module Data.Typeable-class Typeable a-typeOf :: Typeable a => a -> TypeRep-instance Typeable ArithException-instance Typeable ArrayException-instance Typeable AsyncException-instance Typeable Bool-instance Typeable Char-instance Typeable ConsoleEvent-instance Typeable DataType-instance Typeable Double-instance Typeable Dynamic-instance Typeable Exception-instance Typeable Fd-instance Typeable Float-instance Typeable Handle-instance Typeable IOException-instance Typeable Int-instance Typeable Int16-instance Typeable Int32-instance Typeable Int64-instance Typeable Int8-instance Typeable IntPtr-instance Typeable Integer-instance Typeable Ordering-instance Typeable QSem-instance Typeable QSemN-instance Typeable RealWorld-instance Typeable ThreadId-instance Typeable Timeout-instance Typeable TyCon-instance Typeable TypeRep-instance Typeable Version-instance Typeable Word-instance Typeable Word16-instance Typeable Word32-instance Typeable Word64-instance Typeable Word8-instance Typeable WordPtr-instance Typeable ()-instance (Typeable1 s, Typeable a) => Typeable (s a)-cast :: (Typeable a, Typeable b) => a -> Maybe b-gcast :: (Typeable a, Typeable b) => c a -> Maybe (c b)-data TypeRep-instance Data TypeRep-instance Eq TypeRep-instance Show TypeRep-instance Typeable TypeRep-data TyCon-instance Data TyCon-instance Eq TyCon-instance Show TyCon-instance Typeable TyCon-showsTypeRep :: TypeRep -> ShowS-mkTyCon :: String -> TyCon-mkTyConApp :: TyCon -> [TypeRep] -> TypeRep-mkAppTy :: TypeRep -> TypeRep -> TypeRep-mkFunTy :: TypeRep -> TypeRep -> TypeRep-splitTyConApp :: TypeRep -> (TyCon, [TypeRep])-funResultTy :: TypeRep -> TypeRep -> Maybe TypeRep-typeRepTyCon :: TypeRep -> TyCon-typeRepArgs :: TypeRep -> [TypeRep]-tyConString :: TyCon -> String-typeRepKey :: TypeRep -> IO Int-class Typeable1 t-typeOf1 :: Typeable1 t => t a -> TypeRep-instance Typeable1 Chan-instance Typeable1 Complex-instance Typeable1 ForeignPtr-instance Typeable1 FunPtr-instance Typeable1 IO-instance Typeable1 IORef-instance Typeable1 MVar-instance Typeable1 Maybe-instance Typeable1 Ptr-instance Typeable1 Ratio-instance Typeable1 STM-instance Typeable1 StableName-instance Typeable1 StablePtr-instance Typeable1 TVar-instance Typeable1 Weak-instance Typeable1 []-instance (Typeable2 s, Typeable a) => Typeable1 (s a)-class Typeable2 t-typeOf2 :: Typeable2 t => t a b -> TypeRep-instance Typeable2 Array-instance Typeable2 Either-instance Typeable2 ST-instance Typeable2 STRef-instance Typeable2 (,)-instance Typeable2 (->)-instance (Typeable3 s, Typeable a) => Typeable2 (s a)-class Typeable3 t-typeOf3 :: Typeable3 t => t a b c -> TypeRep-instance Typeable3 STArray-instance Typeable3 (,,)-instance (Typeable4 s, Typeable a) => Typeable3 (s a)-class Typeable4 t-typeOf4 :: Typeable4 t => t a b c d -> TypeRep-instance Typeable4 (,,,)-instance (Typeable5 s, Typeable a) => Typeable4 (s a)-class Typeable5 t-typeOf5 :: Typeable5 t => t a b c d e -> TypeRep-instance Typeable5 (,,,,)-instance (Typeable6 s, Typeable a) => Typeable5 (s a)-class Typeable6 t-typeOf6 :: Typeable6 t => t a b c d e f -> TypeRep-instance Typeable6 (,,,,,)-instance (Typeable7 s, Typeable a) => Typeable6 (s a)-class Typeable7 t-typeOf7 :: Typeable7 t => t a b c d e f g -> TypeRep-instance Typeable7 (,,,,,,)-gcast1 :: (Typeable1 t, Typeable1 t') => c (t a) -> Maybe (c (t' a))-gcast2 :: (Typeable2 t, Typeable2 t') => c (t a b) -> Maybe (c (t' a b))-typeOfDefault :: (Typeable1 t, Typeable a) => t a -> TypeRep-typeOf1Default :: (Typeable2 t, Typeable a) => t a b -> TypeRep-typeOf2Default :: (Typeable3 t, Typeable a) => t a b c -> TypeRep-typeOf3Default :: (Typeable4 t, Typeable a) => t a b c d -> TypeRep-typeOf4Default :: (Typeable5 t, Typeable a) => t a b c d e -> TypeRep-typeOf5Default :: (Typeable6 t, Typeable a) => t a b c d e f -> TypeRep-typeOf6Default :: (Typeable7 t, Typeable a) => t a b c d e f g -> TypeRep--module Data.HashTable-data HashTable key val-new :: (key -> key -> Bool) -> (key -> Int32) -> IO (HashTable key val)-insert :: HashTable key val -> key -> val -> IO ()-delete :: HashTable key val -> key -> IO ()-lookup :: HashTable key val -> key -> IO (Maybe val)-update :: HashTable key val -> key -> val -> IO Bool-fromList :: Eq key => (key -> Int32) -> [(key, val)] -> IO (HashTable key val)-toList :: HashTable key val -> IO [(key, val)]-hashInt :: Int -> Int32-hashString :: String -> Int32-prime :: Int32-longestChain :: HashTable key val -> IO [(key, val)]--module Data.Dynamic-data Dynamic-instance Show Dynamic-instance Typeable Dynamic-toDyn :: Typeable a => a -> Dynamic-fromDyn :: Typeable a => Dynamic -> a -> a-fromDynamic :: Typeable a => Dynamic -> Maybe a-dynApply :: Dynamic -> Dynamic -> Maybe Dynamic-dynApp :: Dynamic -> Dynamic -> Dynamic-dynTypeRep :: Dynamic -> TypeRep--module Foreign.StablePtr-data StablePtr a-instance Typeable1 StablePtr-instance Typeable a => Data (StablePtr a)-instance Eq (StablePtr a)-instance Storable (StablePtr a)-newStablePtr :: a -> IO (StablePtr a)-deRefStablePtr :: StablePtr a -> IO a-freeStablePtr :: StablePtr a -> IO ()-castStablePtrToPtr :: StablePtr a -> Ptr ()-castPtrToStablePtr :: Ptr () -> StablePtr a--module System.IO.Error-type IOError = IOException-userError :: String -> IOError-mkIOError :: IOErrorType -> String -> Maybe Handle -> Maybe FilePath -> IOError-annotateIOError :: IOError -> String -> Maybe Handle -> Maybe FilePath -> IOError-isAlreadyExistsError :: IOError -> Bool-isDoesNotExistError :: IOError -> Bool-isAlreadyInUseError :: IOError -> Bool-isFullError :: IOError -> Bool-isEOFError :: IOError -> Bool-isIllegalOperation :: IOError -> Bool-isPermissionError :: IOError -> Bool-isUserError :: IOError -> Bool-ioeGetErrorType :: IOError -> IOErrorType-ioeGetLocation :: IOError -> String-ioeGetErrorString :: IOError -> String-ioeGetHandle :: IOError -> Maybe Handle-ioeGetFileName :: IOError -> Maybe FilePath-ioeSetErrorType :: IOError -> IOErrorType -> IOError-ioeSetErrorString :: IOError -> String -> IOError-ioeSetLocation :: IOError -> String -> IOError-ioeSetHandle :: IOError -> Handle -> IOError-ioeSetFileName :: IOError -> FilePath -> IOError-data IOErrorType-instance Eq IOErrorType-instance Show IOErrorType-alreadyExistsErrorType :: IOErrorType-doesNotExistErrorType :: IOErrorType-alreadyInUseErrorType :: IOErrorType-fullErrorType :: IOErrorType-eofErrorType :: IOErrorType-illegalOperationErrorType :: IOErrorType-permissionErrorType :: IOErrorType-userErrorType :: IOErrorType-isAlreadyExistsErrorType :: IOErrorType -> Bool-isDoesNotExistErrorType :: IOErrorType -> Bool-isAlreadyInUseErrorType :: IOErrorType -> Bool-isFullErrorType :: IOErrorType -> Bool-isEOFErrorType :: IOErrorType -> Bool-isIllegalOperationErrorType :: IOErrorType -> Bool-isPermissionErrorType :: IOErrorType -> Bool-isUserErrorType :: IOErrorType -> Bool-ioError :: IOError -> IO a-catch :: IO a -> (IOError -> IO a) -> IO a-try :: IO a -> IO (Either IOError a)-modifyIOError :: (IOError -> IOError) -> IO a -> IO a--module System.IO.Unsafe-unsafePerformIO :: IO a -> a-unsafeInterleaveIO :: IO a -> IO a--module Foreign.Ptr-data Ptr a-instance Typeable1 Ptr-instance Typeable a => Data (Ptr a)-instance Eq (Ptr a)-instance Ord (Ptr a)-instance Show (Ptr a)-instance Storable (Ptr a)-nullPtr :: Ptr a-castPtr :: Ptr a -> Ptr b-plusPtr :: Ptr a -> Int -> Ptr b-alignPtr :: Ptr a -> Int -> Ptr a-minusPtr :: Ptr a -> Ptr b -> Int-data FunPtr a-instance Typeable1 FunPtr-instance Eq (FunPtr a)-instance Ord (FunPtr a)-instance Show (FunPtr a)-instance Storable (FunPtr a)-nullFunPtr :: FunPtr a-castFunPtr :: FunPtr a -> FunPtr b-castFunPtrToPtr :: FunPtr a -> Ptr b-castPtrToFunPtr :: Ptr a -> FunPtr b-freeHaskellFunPtr :: FunPtr a -> IO ()-data IntPtr-instance Bits IntPtr-instance Bounded IntPtr-instance Enum IntPtr-instance Eq IntPtr-instance Integral IntPtr-instance Num IntPtr-instance Ord IntPtr-instance Read IntPtr-instance Real IntPtr-instance Show IntPtr-instance Storable IntPtr-instance Typeable IntPtr-ptrToIntPtr :: Ptr a -> IntPtr-intPtrToPtr :: IntPtr -> Ptr a-data WordPtr-instance Bits WordPtr-instance Bounded WordPtr-instance Enum WordPtr-instance Eq WordPtr-instance Integral WordPtr-instance Num WordPtr-instance Ord WordPtr-instance Read WordPtr-instance Real WordPtr-instance Show WordPtr-instance Storable WordPtr-instance Typeable WordPtr-ptrToWordPtr :: Ptr a -> WordPtr-wordPtrToPtr :: WordPtr -> Ptr a--module Foreign.Marshal.Error-throwIf :: (a -> Bool) -> (a -> String) -> IO a -> IO a-throwIf_ :: (a -> Bool) -> (a -> String) -> IO a -> IO ()-throwIfNeg :: (Ord a, Num a) => (a -> String) -> IO a -> IO a-throwIfNeg_ :: (Ord a, Num a) => (a -> String) -> IO a -> IO ()-throwIfNull :: String -> IO (Ptr a) -> IO (Ptr a)-void :: IO a -> IO ()--module Foreign.Concurrent-newForeignPtr :: Ptr a -> IO () -> IO (ForeignPtr a)-addForeignPtrFinalizer :: ForeignPtr a -> IO () -> IO ()--module Foreign.ForeignPtr-data ForeignPtr a-instance Typeable a => Data (ForeignPtr a)-instance Eq (ForeignPtr a)-instance Ord (ForeignPtr a)-instance Show (ForeignPtr a)-type FinalizerPtr a = FunPtr (Ptr a -> IO ())-type FinalizerEnvPtr env a = FunPtr (Ptr env -> Ptr a -> IO ())-newForeignPtr :: FinalizerPtr a -> Ptr a -> IO (ForeignPtr a)-newForeignPtr_ :: Ptr a -> IO (ForeignPtr a)-addForeignPtrFinalizer :: FinalizerPtr a -> ForeignPtr a -> IO ()-newForeignPtrEnv :: FinalizerEnvPtr env a -> Ptr env -> Ptr a -> IO (ForeignPtr a)-addForeignPtrFinalizerEnv :: FinalizerEnvPtr env a -> Ptr env -> ForeignPtr a -> IO ()-withForeignPtr :: ForeignPtr a -> (Ptr a -> IO b) -> IO b-finalizeForeignPtr :: ForeignPtr a -> IO ()-unsafeForeignPtrToPtr :: ForeignPtr a -> Ptr a-touchForeignPtr :: ForeignPtr a -> IO ()-castForeignPtr :: ForeignPtr a -> ForeignPtr b-mallocForeignPtr :: Storable a => IO (ForeignPtr a)-mallocForeignPtrBytes :: Int -> IO (ForeignPtr a)-mallocForeignPtrArray :: Storable a => Int -> IO (ForeignPtr a)-mallocForeignPtrArray0 :: Storable a => Int -> IO (ForeignPtr a)--module Foreign.Marshal.Alloc-alloca :: Storable a => (Ptr a -> IO b) -> IO b-allocaBytes :: Int -> (Ptr a -> IO b) -> IO b-malloc :: Storable a => IO (Ptr a)-mallocBytes :: Int -> IO (Ptr a)-realloc :: Storable b => Ptr a -> IO (Ptr b)-reallocBytes :: Ptr a -> Int -> IO (Ptr a)-free :: Ptr a -> IO ()-finalizerFree :: FinalizerPtr a--module Foreign.Marshal.Utils-with :: Storable a => a -> (Ptr a -> IO b) -> IO b-new :: Storable a => a -> IO (Ptr a)-fromBool :: Num a => Bool -> a-toBool :: Num a => a -> Bool-maybeNew :: (a -> IO (Ptr a)) -> Maybe a -> IO (Ptr a)-maybeWith :: (a -> (Ptr b -> IO c) -> IO c) -> Maybe a -> (Ptr b -> IO c) -> IO c-maybePeek :: (Ptr a -> IO b) -> Ptr a -> IO (Maybe b)-withMany :: (a -> (b -> res) -> res) -> [a] -> ([b] -> res) -> res-copyBytes :: Ptr a -> Ptr a -> Int -> IO ()-moveBytes :: Ptr a -> Ptr a -> Int -> IO ()--module Foreign.Marshal.Array-mallocArray :: Storable a => Int -> IO (Ptr a)-mallocArray0 :: Storable a => Int -> IO (Ptr a)-allocaArray :: Storable a => Int -> (Ptr a -> IO b) -> IO b-allocaArray0 :: Storable a => Int -> (Ptr a -> IO b) -> IO b-reallocArray :: Storable a => Ptr a -> Int -> IO (Ptr a)-reallocArray0 :: Storable a => Ptr a -> Int -> IO (Ptr a)-peekArray :: Storable a => Int -> Ptr a -> IO [a]-peekArray0 :: (Storable a, Eq a) => a -> Ptr a -> IO [a]-pokeArray :: Storable a => Ptr a -> [a] -> IO ()-pokeArray0 :: Storable a => a -> Ptr a -> [a] -> IO ()-newArray :: Storable a => [a] -> IO (Ptr a)-newArray0 :: Storable a => a -> [a] -> IO (Ptr a)-withArray :: Storable a => [a] -> (Ptr a -> IO b) -> IO b-withArray0 :: Storable a => a -> [a] -> (Ptr a -> IO b) -> IO b-withArrayLen :: Storable a => [a] -> (Int -> Ptr a -> IO b) -> IO b-withArrayLen0 :: Storable a => a -> [a] -> (Int -> Ptr a -> IO b) -> IO b-copyArray :: Storable a => Ptr a -> Ptr a -> Int -> IO ()-moveArray :: Storable a => Ptr a -> Ptr a -> Int -> IO ()-lengthArray0 :: (Storable a, Eq a) => a -> Ptr a -> IO Int-advancePtr :: Storable a => Ptr a -> Int -> Ptr a--module Foreign.C.String-type CString = Ptr CChar-type CStringLen = (Ptr CChar, Int)-peekCString :: CString -> IO String-peekCStringLen :: CStringLen -> IO String-newCString :: String -> IO CString-newCStringLen :: String -> IO CStringLen-withCString :: String -> (CString -> IO a) -> IO a-withCStringLen :: String -> (CStringLen -> IO a) -> IO a-charIsRepresentable :: Char -> IO Bool-castCharToCChar :: Char -> CChar-castCCharToChar :: CChar -> Char-peekCAString :: CString -> IO String-peekCAStringLen :: CStringLen -> IO String-newCAString :: String -> IO CString-newCAStringLen :: String -> IO CStringLen-withCAString :: String -> (CString -> IO a) -> IO a-withCAStringLen :: String -> (CStringLen -> IO a) -> IO a-type CWString = Ptr CWchar-type CWStringLen = (Ptr CWchar, Int)-peekCWString :: CWString -> IO String-peekCWStringLen :: CWStringLen -> IO String-newCWString :: String -> IO CWString-newCWStringLen :: String -> IO CWStringLen-withCWString :: String -> (CWString -> IO a) -> IO a-withCWStringLen :: String -> (CWStringLen -> IO a) -> IO a--module Foreign.C.Error-newtype Errno-Errno :: CInt -> Errno-instance Eq Errno-eOK :: Errno-e2BIG :: Errno-eACCES :: Errno-eADDRINUSE :: Errno-eADDRNOTAVAIL :: Errno-eADV :: Errno-eAFNOSUPPORT :: Errno-eAGAIN :: Errno-eALREADY :: Errno-eBADF :: Errno-eBADMSG :: Errno-eBADRPC :: Errno-eBUSY :: Errno-eCHILD :: Errno-eCOMM :: Errno-eCONNABORTED :: Errno-eCONNREFUSED :: Errno-eCONNRESET :: Errno-eDEADLK :: Errno-eDESTADDRREQ :: Errno-eDIRTY :: Errno-eDOM :: Errno-eDQUOT :: Errno-eEXIST :: Errno-eFAULT :: Errno-eFBIG :: Errno-eFTYPE :: Errno-eHOSTDOWN :: Errno-eHOSTUNREACH :: Errno-eIDRM :: Errno-eILSEQ :: Errno-eINPROGRESS :: Errno-eINTR :: Errno-eINVAL :: Errno-eIO :: Errno-eISCONN :: Errno-eISDIR :: Errno-eLOOP :: Errno-eMFILE :: Errno-eMLINK :: Errno-eMSGSIZE :: Errno-eMULTIHOP :: Errno-eNAMETOOLONG :: Errno-eNETDOWN :: Errno-eNETRESET :: Errno-eNETUNREACH :: Errno-eNFILE :: Errno-eNOBUFS :: Errno-eNODATA :: Errno-eNODEV :: Errno-eNOENT :: Errno-eNOEXEC :: Errno-eNOLCK :: Errno-eNOLINK :: Errno-eNOMEM :: Errno-eNOMSG :: Errno-eNONET :: Errno-eNOPROTOOPT :: Errno-eNOSPC :: Errno-eNOSR :: Errno-eNOSTR :: Errno-eNOSYS :: Errno-eNOTBLK :: Errno-eNOTCONN :: Errno-eNOTDIR :: Errno-eNOTEMPTY :: Errno-eNOTSOCK :: Errno-eNOTTY :: Errno-eNXIO :: Errno-eOPNOTSUPP :: Errno-ePERM :: Errno-ePFNOSUPPORT :: Errno-ePIPE :: Errno-ePROCLIM :: Errno-ePROCUNAVAIL :: Errno-ePROGMISMATCH :: Errno-ePROGUNAVAIL :: Errno-ePROTO :: Errno-ePROTONOSUPPORT :: Errno-ePROTOTYPE :: Errno-eRANGE :: Errno-eREMCHG :: Errno-eREMOTE :: Errno-eROFS :: Errno-eRPCMISMATCH :: Errno-eRREMOTE :: Errno-eSHUTDOWN :: Errno-eSOCKTNOSUPPORT :: Errno-eSPIPE :: Errno-eSRCH :: Errno-eSRMNT :: Errno-eSTALE :: Errno-eTIME :: Errno-eTIMEDOUT :: Errno-eTOOMANYREFS :: Errno-eTXTBSY :: Errno-eUSERS :: Errno-eWOULDBLOCK :: Errno-eXDEV :: Errno-isValidErrno :: Errno -> Bool-getErrno :: IO Errno-resetErrno :: IO ()-errnoToIOError :: String -> Errno -> Maybe Handle -> Maybe String -> IOError-throwErrno :: String -> IO a-throwErrnoIf :: (a -> Bool) -> String -> IO a -> IO a-throwErrnoIf_ :: (a -> Bool) -> String -> IO a -> IO ()-throwErrnoIfRetry :: (a -> Bool) -> String -> IO a -> IO a-throwErrnoIfRetry_ :: (a -> Bool) -> String -> IO a -> IO ()-throwErrnoIfMinus1 :: Num a => String -> IO a -> IO a-throwErrnoIfMinus1_ :: Num a => String -> IO a -> IO ()-throwErrnoIfMinus1Retry :: Num a => String -> IO a -> IO a-throwErrnoIfMinus1Retry_ :: Num a => String -> IO a -> IO ()-throwErrnoIfNull :: String -> IO (Ptr a) -> IO (Ptr a)-throwErrnoIfNullRetry :: String -> IO (Ptr a) -> IO (Ptr a)-throwErrnoIfRetryMayBlock :: (a -> Bool) -> String -> IO a -> IO b -> IO a-throwErrnoIfRetryMayBlock_ :: (a -> Bool) -> String -> IO a -> IO b -> IO ()-throwErrnoIfMinus1RetryMayBlock :: Num a => String -> IO a -> IO b -> IO a-throwErrnoIfMinus1RetryMayBlock_ :: Num a => String -> IO a -> IO b -> IO ()-throwErrnoIfNullRetryMayBlock :: String -> IO (Ptr a) -> IO b -> IO (Ptr a)-throwErrnoPath :: String -> FilePath -> IO a-throwErrnoPathIf :: (a -> Bool) -> String -> FilePath -> IO a -> IO a-throwErrnoPathIf_ :: (a -> Bool) -> String -> FilePath -> IO a -> IO ()-throwErrnoPathIfNull :: String -> FilePath -> IO (Ptr a) -> IO (Ptr a)-throwErrnoPathIfMinus1 :: Num a => String -> FilePath -> IO a -> IO a-throwErrnoPathIfMinus1_ :: Num a => String -> FilePath -> IO a -> IO ()--module Foreign.C--module Foreign.Marshal.Pool-data Pool-newPool :: IO Pool-freePool :: Pool -> IO ()-withPool :: (Pool -> IO b) -> IO b-pooledMalloc :: Storable a => Pool -> IO (Ptr a)-pooledMallocBytes :: Pool -> Int -> IO (Ptr a)-pooledRealloc :: Storable a => Pool -> Ptr a -> IO (Ptr a)-pooledReallocBytes :: Pool -> Ptr a -> Int -> IO (Ptr a)-pooledMallocArray :: Storable a => Pool -> Int -> IO (Ptr a)-pooledMallocArray0 :: Storable a => Pool -> Int -> IO (Ptr a)-pooledReallocArray :: Storable a => Pool -> Ptr a -> Int -> IO (Ptr a)-pooledReallocArray0 :: Storable a => Pool -> Ptr a -> Int -> IO (Ptr a)-pooledNew :: Storable a => Pool -> a -> IO (Ptr a)-pooledNewArray :: Storable a => Pool -> [a] -> IO (Ptr a)-pooledNewArray0 :: Storable a => Pool -> a -> [a] -> IO (Ptr a)--module Foreign.Marshal--module Foreign-unsafePerformIO :: IO a -> a--module System.Posix.Types-newtype Fd-Fd :: CInt -> Fd-instance Bits Fd-instance Bounded Fd-instance Enum Fd-instance Eq Fd-instance Integral Fd-instance Num Fd-instance Ord Fd-instance Read Fd-instance Real Fd-instance Show Fd-instance Storable Fd-instance Typeable Fd-type ByteCount = CSize-type ClockTick = CClock-type EpochTime = CTime-type FileOffset = COff-type ProcessID = CPid-type ProcessGroupID = CPid-type DeviceID = CDev-type FileID = CIno-type FileMode = CMode-type Limit = CLong--module GHC.Conc-data ThreadId-ThreadId :: ThreadId# -> ThreadId-instance Data ThreadId-instance Eq ThreadId-instance Ord ThreadId-instance Show ThreadId-instance Typeable ThreadId-forkIO :: IO () -> IO ThreadId-forkOnIO :: Int -> IO () -> IO ThreadId-numCapabilities :: Int-childHandler :: Exception -> IO ()-myThreadId :: IO ThreadId-killThread :: ThreadId -> IO ()-throwTo :: ThreadId -> Exception -> IO ()-par :: a -> b -> b-pseq :: a -> b -> b-yield :: IO ()-labelThread :: ThreadId -> String -> IO ()-threadDelay :: Int -> IO ()-registerDelay :: Int -> IO (TVar Bool)-threadWaitRead :: Fd -> IO ()-threadWaitWrite :: Fd -> IO ()-data MVar a-instance Typeable1 MVar-instance Typeable a => Data (MVar a)-instance Eq (MVar a)-newMVar :: a -> IO (MVar a)-newEmptyMVar :: IO (MVar a)-takeMVar :: MVar a -> IO a-putMVar :: MVar a -> a -> IO ()-tryTakeMVar :: MVar a -> IO (Maybe a)-tryPutMVar :: MVar a -> a -> IO Bool-isEmptyMVar :: MVar a -> IO Bool-addMVarFinalizer :: MVar a -> IO () -> IO ()-data STM a-instance Functor STM-instance Monad STM-instance Typeable1 STM-instance Typeable a => Data (STM a)-atomically :: STM a -> IO a-retry :: STM a-orElse :: STM a -> STM a -> STM a-catchSTM :: STM a -> (Exception -> STM a) -> STM a-alwaysSucceeds :: STM a -> STM ()-always :: STM Bool -> STM ()-data TVar a-instance Typeable1 TVar-instance Typeable a => Data (TVar a)-instance Eq (TVar a)-newTVar :: a -> STM (TVar a)-newTVarIO :: a -> IO (TVar a)-readTVar :: TVar a -> STM a-writeTVar :: TVar a -> a -> STM ()-unsafeIOToSTM :: IO a -> STM a-asyncRead :: Int -> Int -> Int -> Ptr a -> IO (Int, Int)-asyncWrite :: Int -> Int -> Int -> Ptr a -> IO (Int, Int)-asyncDoProc :: FunPtr (Ptr a -> IO Int) -> Ptr a -> IO Int-asyncReadBA :: Int -> Int -> Int -> Int -> MutableByteArray# RealWorld -> IO (Int, Int)-asyncWriteBA :: Int -> Int -> Int -> Int -> MutableByteArray# RealWorld -> IO (Int, Int)-ensureIOManagerIsRunning :: IO ()-data ConsoleEvent-ControlC :: ConsoleEvent-Break :: ConsoleEvent-Close :: ConsoleEvent-Logoff :: ConsoleEvent-Shutdown :: ConsoleEvent-instance Enum ConsoleEvent-instance Eq ConsoleEvent-instance Ord ConsoleEvent-instance Read ConsoleEvent-instance Show ConsoleEvent-instance Typeable ConsoleEvent-win32ConsoleHandler :: MVar (ConsoleEvent -> IO ())--module System.IO-data IO a-instance Applicative IO-instance Functor IO-instance Monad IO-instance MonadFix IO-instance Typeable1 IO-instance Typeable a => Data (IO a)-instance HPrintfType (IO a)-instance PrintfType (IO a)-fixIO :: (a -> IO a) -> IO a-type FilePath = String-data Handle-instance Data Handle-instance Eq Handle-instance Show Handle-instance Typeable Handle-stdin :: Handle-stdout :: Handle-stderr :: Handle-withFile :: FilePath -> IOMode -> (Handle -> IO r) -> IO r-openFile :: FilePath -> IOMode -> IO Handle-data IOMode-ReadMode :: IOMode-WriteMode :: IOMode-AppendMode :: IOMode-ReadWriteMode :: IOMode-instance Enum IOMode-instance Eq IOMode-instance Ix IOMode-instance Ord IOMode-instance Read IOMode-instance Show IOMode-hClose :: Handle -> IO ()-readFile :: FilePath -> IO String-writeFile :: FilePath -> String -> IO ()-appendFile :: FilePath -> String -> IO ()-hFileSize :: Handle -> IO Integer-hSetFileSize :: Handle -> Integer -> IO ()-hIsEOF :: Handle -> IO Bool-isEOF :: IO Bool-data BufferMode-NoBuffering :: BufferMode-LineBuffering :: BufferMode-BlockBuffering :: Maybe Int -> BufferMode-instance Eq BufferMode-instance Ord BufferMode-instance Read BufferMode-instance Show BufferMode-hSetBuffering :: Handle -> BufferMode -> IO ()-hGetBuffering :: Handle -> IO BufferMode-hFlush :: Handle -> IO ()-hGetPosn :: Handle -> IO HandlePosn-hSetPosn :: HandlePosn -> IO ()-data HandlePosn-instance Eq HandlePosn-instance Show HandlePosn-hSeek :: Handle -> SeekMode -> Integer -> IO ()-data SeekMode-AbsoluteSeek :: SeekMode-RelativeSeek :: SeekMode-SeekFromEnd :: SeekMode-instance Enum SeekMode-instance Eq SeekMode-instance Ix SeekMode-instance Ord SeekMode-instance Read SeekMode-instance Show SeekMode-hTell :: Handle -> IO Integer-hIsOpen :: Handle -> IO Bool-hIsClosed :: Handle -> IO Bool-hIsReadable :: Handle -> IO Bool-hIsWritable :: Handle -> IO Bool-hIsSeekable :: Handle -> IO Bool-hIsTerminalDevice :: Handle -> IO Bool-hSetEcho :: Handle -> Bool -> IO ()-hGetEcho :: Handle -> IO Bool-hShow :: Handle -> IO String-hWaitForInput :: Handle -> Int -> IO Bool-hReady :: Handle -> IO Bool-hGetChar :: Handle -> IO Char-hGetLine :: Handle -> IO String-hLookAhead :: Handle -> IO Char-hGetContents :: Handle -> IO String-hPutChar :: Handle -> Char -> IO ()-hPutStr :: Handle -> String -> IO ()-hPutStrLn :: Handle -> String -> IO ()-hPrint :: Show a => Handle -> a -> IO ()-interact :: (String -> String) -> IO ()-putChar :: Char -> IO ()-putStr :: String -> IO ()-putStrLn :: String -> IO ()-print :: Show a => a -> IO ()-getChar :: IO Char-getLine :: IO String-getContents :: IO String-readIO :: Read a => String -> IO a-readLn :: Read a => IO a-withBinaryFile :: FilePath -> IOMode -> (Handle -> IO r) -> IO r-openBinaryFile :: FilePath -> IOMode -> IO Handle-hSetBinaryMode :: Handle -> Bool -> IO ()-hPutBuf :: Handle -> Ptr a -> Int -> IO ()-hGetBuf :: Handle -> Ptr a -> Int -> IO Int-hPutBufNonBlocking :: Handle -> Ptr a -> Int -> IO Int-hGetBufNonBlocking :: Handle -> Ptr a -> Int -> IO Int-openTempFile :: FilePath -> String -> IO (FilePath, Handle)-openBinaryTempFile :: FilePath -> String -> IO (FilePath, Handle)--module GHC.Dotnet-data Object a-unmarshalObject :: Addr# -> Object a-marshalObject :: Object a -> (Addr# -> IO b) -> IO b-unmarshalString :: Addr# -> String-marshalString :: String -> (Addr# -> IO a) -> IO a-checkResult :: (State# RealWorld -> (State# RealWorld, a, Addr#)) -> IO a--module Text.Read-class Read a-readsPrec :: Read a => Int -> ReadS a-readList :: Read a => ReadS [a]-readPrec :: Read a => ReadPrec a-readListPrec :: Read a => ReadPrec [a]-instance Read All-instance Read Any-instance Read Bool-instance Read BufferMode-instance Read CChar-instance Read CClock-instance Read CDouble-instance Read CFloat-instance Read CInt-instance Read CIntMax-instance Read CIntPtr-instance Read CLDouble-instance Read CLLong-instance Read CLong-instance Read CPtrdiff-instance Read CSChar-instance Read CShort-instance Read CSigAtomic-instance Read CSize-instance Read CTime-instance Read CUChar-instance Read CUInt-instance Read CUIntMax-instance Read CUIntPtr-instance Read CULLong-instance Read CULong-instance Read CUShort-instance Read CWchar-instance Read Char-instance Read ConsoleEvent-instance Read Double-instance Read ExitCode-instance Read Fd-instance Read Float-instance Read GeneralCategory-instance Read IOMode-instance Read Int-instance Read Int16-instance Read Int32-instance Read Int64-instance Read Int8-instance Read IntPtr-instance Read Integer-instance Read Lexeme-instance Read Ordering-instance Read SeekMode-instance Read Version-instance Read Word-instance Read Word16-instance Read Word32-instance Read Word64-instance Read Word8-instance Read WordPtr-instance Read ()-instance (Read a, Read b) => Read (a, b)-instance (Read a, Read b, Read c) => Read (a, b, c)-instance (Read a, Read b, Read c, Read d) => Read (a, b, c, d)-instance (Read a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e)-instance (Read a, Read b, Read c, Read d, Read e, Read f) => Read (a, b, c, d, e, f)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read (a, b, c, d, e, f, g)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h) => Read (a, b, c, d, e, f, g, h)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i) => Read (a, b, c, d, e, f, g, h, i)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j) => Read (a, b, c, d, e, f, g, h, i, j)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k) => Read (a, b, c, d, e, f, g, h, i, j, k)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l) => Read (a, b, c, d, e, f, g, h, i, j, k, l)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n, Read o) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)-instance (RealFloat a, Read a) => Read (Complex a)-instance Read a => Read (Dual a)-instance Read a => Read (First a)-instance Read a => Read (Last a)-instance Read a => Read (Maybe a)-instance Read a => Read (Product a)-instance (Integral a, Read a) => Read (Ratio a)-instance Read a => Read (Sum a)-instance Read a => Read [a]-instance (Ix a, Read a, Read b) => Read (Array a b)-instance (Read a, Read b) => Read (Either a b)-type ReadS a = String -> [(a, String)]-reads :: Read a => ReadS a-read :: Read a => String -> a-readParen :: Bool -> ReadS a -> ReadS a-lex :: ReadS String-data Lexeme-Char :: Char -> Lexeme-String :: String -> Lexeme-Punc :: String -> Lexeme-Ident :: String -> Lexeme-Symbol :: String -> Lexeme-Int :: Integer -> Lexeme-Rat :: Rational -> Lexeme-EOF :: Lexeme-instance Eq Lexeme-instance Read Lexeme-instance Show Lexeme-lexP :: ReadPrec Lexeme-parens :: ReadPrec a -> ReadPrec a-readListDefault :: Read a => ReadS [a]-readListPrecDefault :: Read a => ReadPrec [a]--module Prelude-keyword |-keyword ->-keyword <--keyword @-keyword !-keyword ::-keyword ~-keyword _-keyword as-keyword case-keyword class-keyword data-keyword default-keyword deriving-keyword do-keyword else-keyword forall-keyword hiding-keyword if-keyword import-keyword in-keyword infix-keyword infixl-keyword infixr-keyword instance-keyword let-keyword module-keyword newtype-keyword of-keyword qualified-keyword then-keyword type-keyword where-data Bool-False :: Bool-True :: Bool-instance Bounded Bool-instance Data Bool-instance Enum Bool-instance Eq Bool-instance Ix Bool-instance Ord Bool-instance Read Bool-instance Show Bool-instance Storable Bool-instance Typeable Bool-(&&) :: Bool -> Bool -> Bool-(||) :: Bool -> Bool -> Bool-not :: Bool -> Bool-otherwise :: Bool-data Maybe a-Nothing :: Maybe a-Just :: a -> Maybe a-instance Alternative Maybe-instance Applicative Maybe-instance Foldable Maybe-instance Functor Maybe-instance Monad Maybe-instance MonadFix Maybe-instance MonadPlus Maybe-instance Traversable Maybe-instance Typeable1 Maybe-instance Data a => Data (Maybe a)-instance Eq a => Eq (Maybe a)-instance Monoid a => Monoid (Maybe a)-instance Ord a => Ord (Maybe a)-instance Read a => Read (Maybe a)-instance Show a => Show (Maybe a)-maybe :: b -> (a -> b) -> Maybe a -> b-data Either a b-Left :: a -> Either a b-Right :: b -> Either a b-instance Typeable2 Either-instance Functor (Either a)-instance (Data a, Data b) => Data (Either a b)-instance (Eq a, Eq b) => Eq (Either a b)-instance (Ord a, Ord b) => Ord (Either a b)-instance (Read a, Read b) => Read (Either a b)-instance (Show a, Show b) => Show (Either a b)-either :: (a -> c) -> (b -> c) -> Either a b -> c-data Ordering-LT :: Ordering-EQ :: Ordering-instance Bounded Ordering-instance Data Ordering-instance Enum Ordering-instance Eq Ordering-instance Ix Ordering-instance Monoid Ordering-instance Ord Ordering-instance Read Ordering-instance Show Ordering-instance Typeable Ordering-data Char-instance Bounded Char-instance Data Char-instance Enum Char-instance Eq Char-instance IsChar Char-instance Ix Char-instance Ord Char-instance PrintfArg Char-instance Read Char-instance Show Char-instance Storable Char-instance Typeable Char-instance IsString [Char]-type String = [Char]-fst :: (a, b) -> a-snd :: (a, b) -> b-curry :: ((a, b) -> c) -> a -> b -> c-uncurry :: (a -> b -> c) -> (a, b) -> c-class Eq a-(==) :: Eq a => a -> a -> Bool-(/=) :: Eq a => a -> a -> Bool-instance Eq All-instance Eq Any-instance Eq ArithException-instance Eq ArrayException-instance Eq AsyncException-instance Eq Bool-instance Eq BufferMode-instance Eq BufferState-instance Eq CChar-instance Eq CClock-instance Eq CDouble-instance Eq CFloat-instance Eq CInt-instance Eq CIntMax-instance Eq CIntPtr-instance Eq CLDouble-instance Eq CLLong-instance Eq CLong-instance Eq CPtrdiff-instance Eq CSChar-instance Eq CShort-instance Eq CSigAtomic-instance Eq CSize-instance Eq CTime-instance Eq CUChar-instance Eq CUInt-instance Eq CUIntMax-instance Eq CUIntPtr-instance Eq CULLong-instance Eq CULong-instance Eq CUShort-instance Eq CWchar-instance Eq Char-instance Eq ConsoleEvent-instance Eq Constr-instance Eq ConstrRep-instance Eq DataRep-instance Eq Double-instance Eq Errno-instance Eq Exception-instance Eq ExitCode-instance Eq FDType-instance Eq Fd-instance Eq Fixity-instance Eq Float-instance Eq GeneralCategory-instance Eq Handle-instance Eq HandlePosn-instance Eq HashData-instance Eq IOErrorType-instance Eq IOException-instance Eq IOMode-instance Eq Inserts-instance Eq Int-instance Eq Int16-instance Eq Int32-instance Eq Int64-instance Eq Int8-instance Eq IntPtr-instance Eq Integer-instance Eq Key-instance Eq KeyPr-instance Eq Lexeme-instance Eq Ordering-instance Eq SeekMode-instance Eq ThreadId-instance Eq Timeout-instance Eq TyCon-instance Eq TypeRep-instance Eq Unique-instance Eq Version-instance Eq Word-instance Eq Word16-instance Eq Word32-instance Eq Word64-instance Eq Word8-instance Eq WordPtr-instance Eq ()-instance (Eq a, Eq b) => Eq (a, b)-instance (Eq a, Eq b, Eq c) => Eq (a, b, c)-instance (Eq a, Eq b, Eq c, Eq d) => Eq (a, b, c, d)-instance (Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (a, b, c, d, e)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq (a, b, c, d, e, f)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq (a, b, c, d, e, f, g)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h) => Eq (a, b, c, d, e, f, g, h)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i) => Eq (a, b, c, d, e, f, g, h, i)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j) => Eq (a, b, c, d, e, f, g, h, i, j)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k) => Eq (a, b, c, d, e, f, g, h, i, j, k)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l) => Eq (a, b, c, d, e, f, g, h, i, j, k, l)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n)-instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n, Eq o) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)-instance (RealFloat a, Eq a) => Eq (Complex a)-instance Eq a => Eq (Dual a)-instance Eq a => Eq (First a)-instance Eq (Fixed a)-instance Eq (ForeignPtr a)-instance Eq (FunPtr a)-instance Eq (IORef a)-instance Eq a => Eq (Last a)-instance Eq (MVar a)-instance Eq a => Eq (Maybe a)-instance Eq a => Eq (Product a)-instance Eq (Ptr a)-instance (Integral a, Eq a) => Eq (Ratio a)-instance Eq (StableName a)-instance Eq (StablePtr a)-instance Eq a => Eq (Sum a)-instance Eq (TVar a)-instance Eq a => Eq [a]-instance (Ix i, Eq e) => Eq (Array i e)-instance (Eq a, Eq b) => Eq (Either a b)-instance Eq (IOArray i e)-instance Eq (STRef s a)-instance Eq (STArray s i e)-class Eq a => Ord a-compare :: Ord a => a -> a -> Ordering-(<) :: Ord a => a -> a -> Bool-(<=) :: Ord a => a -> a -> Bool-(>) :: Ord a => a -> a -> Bool-(>=) :: Ord a => a -> a -> Bool-max :: Ord a => a -> a -> a-min :: Ord a => a -> a -> a-instance Ord All-instance Ord Any-instance Ord ArithException-instance Ord ArrayException-instance Ord AsyncException-instance Ord Bool-instance Ord BufferMode-instance Ord CChar-instance Ord CClock-instance Ord CDouble-instance Ord CFloat-instance Ord CInt-instance Ord CIntMax-instance Ord CIntPtr-instance Ord CLDouble-instance Ord CLLong-instance Ord CLong-instance Ord CPtrdiff-instance Ord CSChar-instance Ord CShort-instance Ord CSigAtomic-instance Ord CSize-instance Ord CTime-instance Ord CUChar-instance Ord CUInt-instance Ord CUIntMax-instance Ord CUIntPtr-instance Ord CULLong-instance Ord CULong-instance Ord CUShort-instance Ord CWchar-instance Ord Char-instance Ord ConsoleEvent-instance Ord Double-instance Ord ExitCode-instance Ord Fd-instance Ord Float-instance Ord GeneralCategory-instance Ord IOMode-instance Ord Int-instance Ord Int16-instance Ord Int32-instance Ord Int64-instance Ord Int8-instance Ord IntPtr-instance Ord Integer-instance Ord Ordering-instance Ord SeekMode-instance Ord ThreadId-instance Ord Unique-instance Ord Version-instance Ord Word-instance Ord Word16-instance Ord Word32-instance Ord Word64-instance Ord Word8-instance Ord WordPtr-instance Ord ()-instance (Ord a, Ord b) => Ord (a, b)-instance (Ord a, Ord b, Ord c) => Ord (a, b, c)-instance (Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d)-instance (Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (a, b, c, d, e)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord (a, b, c, d, e, f)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord (a, b, c, d, e, f, g)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => Ord (a, b, c, d, e, f, g, h)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i) => Ord (a, b, c, d, e, f, g, h, i)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j) => Ord (a, b, c, d, e, f, g, h, i, j)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k) => Ord (a, b, c, d, e, f, g, h, i, j, k)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l) => Ord (a, b, c, d, e, f, g, h, i, j, k, l)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n)-instance (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n, Ord o) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)-instance Ord a => Ord (Dual a)-instance Ord a => Ord (First a)-instance Ord (Fixed a)-instance Ord (ForeignPtr a)-instance Ord (FunPtr a)-instance Ord a => Ord (Last a)-instance Ord a => Ord (Maybe a)-instance Ord a => Ord (Product a)-instance Ord (Ptr a)-instance Integral a => Ord (Ratio a)-instance Ord a => Ord (Sum a)-instance Ord a => Ord [a]-instance (Ix i, Ord e) => Ord (Array i e)-instance (Ord a, Ord b) => Ord (Either a b)-class Enum a-succ :: Enum a => a -> a-pred :: Enum a => a -> a-toEnum :: Enum a => Int -> a-fromEnum :: Enum a => a -> Int-enumFrom :: Enum a => a -> [a]-enumFromThen :: Enum a => a -> a -> [a]-enumFromTo :: Enum a => a -> a -> [a]-enumFromThenTo :: Enum a => a -> a -> a -> [a]-instance Enum Bool-instance Enum CChar-instance Enum CClock-instance Enum CDouble-instance Enum CFloat-instance Enum CInt-instance Enum CIntMax-instance Enum CIntPtr-instance Enum CLDouble-instance Enum CLLong-instance Enum CLong-instance Enum CPtrdiff-instance Enum CSChar-instance Enum CShort-instance Enum CSigAtomic-instance Enum CSize-instance Enum CTime-instance Enum CUChar-instance Enum CUInt-instance Enum CUIntMax-instance Enum CUIntPtr-instance Enum CULLong-instance Enum CULong-instance Enum CUShort-instance Enum CWchar-instance Enum Char-instance Enum ConsoleEvent-instance Enum Double-instance Enum Fd-instance Enum Float-instance Enum GeneralCategory-instance Enum IOMode-instance Enum Int-instance Enum Int16-instance Enum Int32-instance Enum Int64-instance Enum Int8-instance Enum IntPtr-instance Enum Integer-instance Enum Ordering-instance Enum SeekMode-instance Enum Word-instance Enum Word16-instance Enum Word32-instance Enum Word64-instance Enum Word8-instance Enum WordPtr-instance Enum ()-instance Enum (Fixed a)-instance Integral a => Enum (Ratio a)-class Bounded a-minBound :: Bounded a => a-maxBound :: Bounded a => a-instance Bounded All-instance Bounded Any-instance Bounded Bool-instance Bounded CChar-instance Bounded CInt-instance Bounded CIntMax-instance Bounded CIntPtr-instance Bounded CLLong-instance Bounded CLong-instance Bounded CPtrdiff-instance Bounded CSChar-instance Bounded CShort-instance Bounded CSigAtomic-instance Bounded CSize-instance Bounded CUChar-instance Bounded CUInt-instance Bounded CUIntMax-instance Bounded CUIntPtr-instance Bounded CULLong-instance Bounded CULong-instance Bounded CUShort-instance Bounded CWchar-instance Bounded Char-instance Bounded Fd-instance Bounded GeneralCategory-instance Bounded Int-instance Bounded Int16-instance Bounded Int32-instance Bounded Int64-instance Bounded Int8-instance Bounded IntPtr-instance Bounded Ordering-instance Bounded Word-instance Bounded Word16-instance Bounded Word32-instance Bounded Word64-instance Bounded Word8-instance Bounded WordPtr-instance Bounded ()-instance (Bounded a, Bounded b) => Bounded (a, b)-instance (Bounded a, Bounded b, Bounded c) => Bounded (a, b, c)-instance (Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d)-instance (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e)-instance (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f)-instance (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g) => Bounded (a, b, c, d, e, f, g)-instance (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h) => Bounded (a, b, c, d, e, f, g, h)-instance (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i) => Bounded (a, b, c, d, e, f, g, h, i)-instance (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j) => Bounded (a, b, c, d, e, f, g, h, i, j)-instance (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k) => Bounded (a, b, c, d, e, f, g, h, i, j, k)-instance (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l)-instance (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m)-instance (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n)-instance (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n, Bounded o) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)-instance Bounded a => Bounded (Dual a)-instance Bounded a => Bounded (Product a)-instance Bounded a => Bounded (Sum a)-data Int-instance Bits Int-instance Bounded Int-instance Data Int-instance Enum Int-instance Eq Int-instance Integral Int-instance Ix Int-instance Num Int-instance Ord Int-instance PrintfArg Int-instance Read Int-instance Real Int-instance Show Int-instance Storable Int-instance Typeable Int-data Integer-instance Bits Integer-instance Data Integer-instance Enum Integer-instance Eq Integer-instance Integral Integer-instance Ix Integer-instance Num Integer-instance Ord Integer-instance PrintfArg Integer-instance Read Integer-instance Real Integer-instance Show Integer-instance Typeable Integer-data Float-instance Data Float-instance Enum Float-instance Eq Float-instance Floating Float-instance Fractional Float-instance Num Float-instance Ord Float-instance PrintfArg Float-instance Read Float-instance Real Float-instance RealFloat Float-instance RealFrac Float-instance Show Float-instance Storable Float-instance Typeable Float-data Double-instance Data Double-instance Enum Double-instance Eq Double-instance Floating Double-instance Fractional Double-instance Num Double-instance Ord Double-instance PrintfArg Double-instance Read Double-instance Real Double-instance RealFloat Double-instance RealFrac Double-instance Show Double-instance Storable Double-instance Typeable Double-type Rational = Ratio Integer-class (Eq a, Show a) => Num a-(+) :: Num a => a -> a -> a-(-) :: Num a => a -> a -> a-(*) :: Num a => a -> a -> a-negate :: Num a => a -> a-abs :: Num a => a -> a-signum :: Num a => a -> a-fromInteger :: Num a => Integer -> a-instance Num CChar-instance Num CClock-instance Num CDouble-instance Num CFloat-instance Num CInt-instance Num CIntMax-instance Num CIntPtr-instance Num CLDouble-instance Num CLLong-instance Num CLong-instance Num CPtrdiff-instance Num CSChar-instance Num CShort-instance Num CSigAtomic-instance Num CSize-instance Num CTime-instance Num CUChar-instance Num CUInt-instance Num CUIntMax-instance Num CUIntPtr-instance Num CULLong-instance Num CULong-instance Num CUShort-instance Num CWchar-instance Num Double-instance Num Fd-instance Num Float-instance Num Int-instance Num Int16-instance Num Int32-instance Num Int64-instance Num Int8-instance Num IntPtr-instance Num Integer-instance Num Word-instance Num Word16-instance Num Word32-instance Num Word64-instance Num Word8-instance Num WordPtr-instance RealFloat a => Num (Complex a)-instance HasResolution a => Num (Fixed a)-instance Integral a => Num (Ratio a)-class (Num a, Ord a) => Real a-toRational :: Real a => a -> Rational-instance Real CChar-instance Real CClock-instance Real CDouble-instance Real CFloat-instance Real CInt-instance Real CIntMax-instance Real CIntPtr-instance Real CLDouble-instance Real CLLong-instance Real CLong-instance Real CPtrdiff-instance Real CSChar-instance Real CShort-instance Real CSigAtomic-instance Real CSize-instance Real CTime-instance Real CUChar-instance Real CUInt-instance Real CUIntMax-instance Real CUIntPtr-instance Real CULLong-instance Real CULong-instance Real CUShort-instance Real CWchar-instance Real Double-instance Real Fd-instance Real Float-instance Real Int-instance Real Int16-instance Real Int32-instance Real Int64-instance Real Int8-instance Real IntPtr-instance Real Integer-instance Real Word-instance Real Word16-instance Real Word32-instance Real Word64-instance Real Word8-instance Real WordPtr-instance HasResolution a => Real (Fixed a)-instance Integral a => Real (Ratio a)-class (Real a, Enum a) => Integral a-quot :: Integral a => a -> a -> a-rem :: Integral a => a -> a -> a-div :: Integral a => a -> a -> a-mod :: Integral a => a -> a -> a-quotRem :: Integral a => a -> a -> (a, a)-divMod :: Integral a => a -> a -> (a, a)-toInteger :: Integral a => a -> Integer-instance Integral CChar-instance Integral CInt-instance Integral CIntMax-instance Integral CIntPtr-instance Integral CLLong-instance Integral CLong-instance Integral CPtrdiff-instance Integral CSChar-instance Integral CShort-instance Integral CSigAtomic-instance Integral CSize-instance Integral CUChar-instance Integral CUInt-instance Integral CUIntMax-instance Integral CUIntPtr-instance Integral CULLong-instance Integral CULong-instance Integral CUShort-instance Integral CWchar-instance Integral Fd-instance Integral Int-instance Integral Int16-instance Integral Int32-instance Integral Int64-instance Integral Int8-instance Integral IntPtr-instance Integral Integer-instance Integral Word-instance Integral Word16-instance Integral Word32-instance Integral Word64-instance Integral Word8-instance Integral WordPtr-class Num a => Fractional a-(/) :: Fractional a => a -> a -> a-recip :: Fractional a => a -> a-fromRational :: Fractional a => Rational -> a-instance Fractional CDouble-instance Fractional CFloat-instance Fractional CLDouble-instance Fractional Double-instance Fractional Float-instance RealFloat a => Fractional (Complex a)-instance HasResolution a => Fractional (Fixed a)-instance Integral a => Fractional (Ratio a)-class Fractional a => Floating a-pi :: Floating a => a-exp :: Floating a => a -> a-log :: Floating a => a -> a-sqrt :: Floating a => a -> a-(**) :: Floating a => a -> a -> a-logBase :: Floating a => a -> a -> a-sin :: Floating a => a -> a-cos :: Floating a => a -> a-tan :: Floating a => a -> a-asin :: Floating a => a -> a-acos :: Floating a => a -> a-atan :: Floating a => a -> a-sinh :: Floating a => a -> a-cosh :: Floating a => a -> a-tanh :: Floating a => a -> a-asinh :: Floating a => a -> a-acosh :: Floating a => a -> a-atanh :: Floating a => a -> a-instance Floating CDouble-instance Floating CFloat-instance Floating CLDouble-instance Floating Double-instance Floating Float-instance RealFloat a => Floating (Complex a)-class (Real a, Fractional a) => RealFrac a-properFraction :: (RealFrac a, Integral b) => a -> (b, a)-truncate :: (RealFrac a, Integral b) => a -> b-round :: (RealFrac a, Integral b) => a -> b-ceiling :: (RealFrac a, Integral b) => a -> b-floor :: (RealFrac a, Integral b) => a -> b-instance RealFrac CDouble-instance RealFrac CFloat-instance RealFrac CLDouble-instance RealFrac Double-instance RealFrac Float-instance HasResolution a => RealFrac (Fixed a)-instance Integral a => RealFrac (Ratio a)-class (RealFrac a, Floating a) => RealFloat a-floatRadix :: RealFloat a => a -> Integer-floatDigits :: RealFloat a => a -> Int-floatRange :: RealFloat a => a -> (Int, Int)-decodeFloat :: RealFloat a => a -> (Integer, Int)-encodeFloat :: RealFloat a => Integer -> Int -> a-exponent :: RealFloat a => a -> Int-significand :: RealFloat a => a -> a-scaleFloat :: RealFloat a => Int -> a -> a-isNaN :: RealFloat a => a -> Bool-isInfinite :: RealFloat a => a -> Bool-isDenormalized :: RealFloat a => a -> Bool-isNegativeZero :: RealFloat a => a -> Bool-isIEEE :: RealFloat a => a -> Bool-atan2 :: RealFloat a => a -> a -> a-instance RealFloat CDouble-instance RealFloat CFloat-instance RealFloat CLDouble-instance RealFloat Double-instance RealFloat Float-subtract :: Num a => a -> a -> a-even :: Integral a => a -> Bool-odd :: Integral a => a -> Bool-gcd :: Integral a => a -> a -> a-lcm :: Integral a => a -> a -> a-(^) :: (Num a, Integral b) => a -> b -> a-(^^) :: (Fractional a, Integral b) => a -> b -> a-fromIntegral :: (Integral a, Num b) => a -> b-realToFrac :: (Real a, Fractional b) => a -> b-class Monad m-(>>=) :: Monad m => m a -> (a -> m b) -> m b-(>>) :: Monad m => m a -> m b -> m b-return :: Monad m => a -> m a-fail :: Monad m => String -> m a-instance Monad IO-instance Monad Maybe-instance Monad P-instance Monad ReadP-instance Monad ReadPrec-instance Monad STM-instance Monad []-instance ArrowApply a => Monad (ArrowMonad a)-instance Monad (ST s)-instance Monad (ST s)-instance Monad ((->) r)-class Functor f-fmap :: Functor f => (a -> b) -> f a -> f b-instance Functor IO-instance Functor Id-instance Functor Maybe-instance Functor ReadP-instance Functor ReadPrec-instance Functor STM-instance Functor ZipList-instance Functor []-instance Ix i => Functor (Array i)-instance Functor (Const m)-instance Functor (Either a)-instance Functor (ST s)-instance Functor (ST s)-instance Monad m => Functor (WrappedMonad m)-instance Functor ((,) a)-instance Functor ((->) r)-instance Arrow a => Functor (WrappedArrow a b)-mapM :: Monad m => (a -> m b) -> [a] -> m [b]-mapM_ :: Monad m => (a -> m b) -> [a] -> m ()-sequence :: Monad m => [m a] -> m [a]-sequence_ :: Monad m => [m a] -> m ()-(=<<) :: Monad m => (a -> m b) -> m a -> m b-id :: a -> a-const :: a -> b -> a-(.) :: (b -> c) -> (a -> b) -> a -> c-flip :: (a -> b -> c) -> b -> a -> c-($) :: (a -> b) -> a -> b-until :: (a -> Bool) -> (a -> a) -> a -> a-asTypeOf :: a -> a -> a-error :: String -> a-undefined :: a-seq :: a -> b -> b-($!) :: (a -> b) -> a -> b-map :: (a -> b) -> [a] -> [b]-(++) :: [a] -> [a] -> [a]-filter :: (a -> Bool) -> [a] -> [a]-head :: [a] -> a-last :: [a] -> a-tail :: [a] -> [a]-init :: [a] -> [a]-null :: [a] -> Bool-length :: [a] -> Int-(!!) :: [a] -> Int -> a-reverse :: [a] -> [a]-foldl :: (a -> b -> a) -> a -> [b] -> a-foldl1 :: (a -> a -> a) -> [a] -> a-foldr :: (a -> b -> b) -> b -> [a] -> b-foldr1 :: (a -> a -> a) -> [a] -> a-and :: [Bool] -> Bool-or :: [Bool] -> Bool-any :: (a -> Bool) -> [a] -> Bool-all :: (a -> Bool) -> [a] -> Bool-sum :: Num a => [a] -> a-product :: Num a => [a] -> a-concat :: [[a]] -> [a]-concatMap :: (a -> [b]) -> [a] -> [b]-maximum :: Ord a => [a] -> a-minimum :: Ord a => [a] -> a-scanl :: (a -> b -> a) -> a -> [b] -> [a]-scanl1 :: (a -> a -> a) -> [a] -> [a]-scanr :: (a -> b -> b) -> b -> [a] -> [b]-scanr1 :: (a -> a -> a) -> [a] -> [a]-iterate :: (a -> a) -> a -> [a]-repeat :: a -> [a]-replicate :: Int -> a -> [a]-cycle :: [a] -> [a]-take :: Int -> [a] -> [a]-drop :: Int -> [a] -> [a]-splitAt :: Int -> [a] -> ([a], [a])-takeWhile :: (a -> Bool) -> [a] -> [a]-dropWhile :: (a -> Bool) -> [a] -> [a]-span :: (a -> Bool) -> [a] -> ([a], [a])-break :: (a -> Bool) -> [a] -> ([a], [a])-elem :: Eq a => a -> [a] -> Bool-notElem :: Eq a => a -> [a] -> Bool-lookup :: Eq a => a -> [(a, b)] -> Maybe b-zip :: [a] -> [b] -> [(a, b)]-zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]-zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]-zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]-unzip :: [(a, b)] -> ([a], [b])-unzip3 :: [(a, b, c)] -> ([a], [b], [c])-lines :: String -> [String]-words :: String -> [String]-unlines :: [String] -> String-unwords :: [String] -> String-type ShowS = String -> String-class Show a-showsPrec :: Show a => Int -> a -> ShowS-show :: Show a => a -> String-showList :: Show a => [a] -> ShowS-instance Show All-instance Show Any-instance Show ArithException-instance Show ArrayException-instance Show AsyncException-instance Show Bool-instance Show BufferMode-instance Show CChar-instance Show CClock-instance Show CDouble-instance Show CFloat-instance Show CInt-instance Show CIntMax-instance Show CIntPtr-instance Show CLDouble-instance Show CLLong-instance Show CLong-instance Show CPtrdiff-instance Show CSChar-instance Show CShort-instance Show CSigAtomic-instance Show CSize-instance Show CTime-instance Show CUChar-instance Show CUInt-instance Show CUIntMax-instance Show CUIntPtr-instance Show CULLong-instance Show CULong-instance Show CUShort-instance Show CWchar-instance Show Char-instance Show ConsoleEvent-instance Show Constr-instance Show ConstrRep-instance Show DataRep-instance Show DataType-instance Show Double-instance Show Dynamic-instance Show Exception-instance Show ExitCode-instance Show Fd-instance Show Fixity-instance Show Float-instance Show GeneralCategory-instance Show Handle-instance Show HandlePosn-instance Show HandleType-instance Show HashData-instance Show IOErrorType-instance Show IOException-instance Show IOMode-instance Show Int-instance Show Int16-instance Show Int32-instance Show Int64-instance Show Int8-instance Show IntPtr-instance Show Integer-instance Show Lexeme-instance Show Ordering-instance Show SeekMode-instance Show ThreadId-instance Show TyCon-instance Show TypeRep-instance Show Version-instance Show Word-instance Show Word16-instance Show Word32-instance Show Word64-instance Show Word8-instance Show WordPtr-instance Show ()-instance (Show a, Show b) => Show (a, b)-instance (Show a, Show b, Show c) => Show (a, b, c)-instance (Show a, Show b, Show c, Show d) => Show (a, b, c, d)-instance (Show a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e)-instance (Show a, Show b, Show c, Show d, Show e, Show f) => Show (a, b, c, d, e, f)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show (a, b, c, d, e, f, g)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h) => Show (a, b, c, d, e, f, g, h)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i) => Show (a, b, c, d, e, f, g, h, i)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j) => Show (a, b, c, d, e, f, g, h, i, j)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k) => Show (a, b, c, d, e, f, g, h, i, j, k)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l) => Show (a, b, c, d, e, f, g, h, i, j, k, l)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n)-instance (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n, Show o) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)-instance Show (a -> b)-instance (RealFloat a, Show a) => Show (Complex a)-instance Show a => Show (Dual a)-instance Show a => Show (First a)-instance HasResolution a => Show (Fixed a)-instance Show (ForeignPtr a)-instance Show (FunPtr a)-instance Show a => Show (Last a)-instance Show a => Show (Maybe a)-instance Show a => Show (Product a)-instance Show (Ptr a)-instance Integral a => Show (Ratio a)-instance Show a => Show (Sum a)-instance Show a => Show [a]-instance (Ix a, Show a, Show b) => Show (Array a b)-instance (Show a, Show b) => Show (Either a b)-instance Show (ST s a)-shows :: Show a => a -> ShowS-showChar :: Char -> ShowS-showString :: String -> ShowS-showParen :: Bool -> ShowS -> ShowS-type ReadS a = String -> [(a, String)]-class Read a-readsPrec :: Read a => Int -> ReadS a-readList :: Read a => ReadS [a]-instance Read All-instance Read Any-instance Read Bool-instance Read BufferMode-instance Read CChar-instance Read CClock-instance Read CDouble-instance Read CFloat-instance Read CInt-instance Read CIntMax-instance Read CIntPtr-instance Read CLDouble-instance Read CLLong-instance Read CLong-instance Read CPtrdiff-instance Read CSChar-instance Read CShort-instance Read CSigAtomic-instance Read CSize-instance Read CTime-instance Read CUChar-instance Read CUInt-instance Read CUIntMax-instance Read CUIntPtr-instance Read CULLong-instance Read CULong-instance Read CUShort-instance Read CWchar-instance Read Char-instance Read ConsoleEvent-instance Read Double-instance Read ExitCode-instance Read Fd-instance Read Float-instance Read GeneralCategory-instance Read IOMode-instance Read Int-instance Read Int16-instance Read Int32-instance Read Int64-instance Read Int8-instance Read IntPtr-instance Read Integer-instance Read Lexeme-instance Read Ordering-instance Read SeekMode-instance Read Version-instance Read Word-instance Read Word16-instance Read Word32-instance Read Word64-instance Read Word8-instance Read WordPtr-instance Read ()-instance (Read a, Read b) => Read (a, b)-instance (Read a, Read b, Read c) => Read (a, b, c)-instance (Read a, Read b, Read c, Read d) => Read (a, b, c, d)-instance (Read a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e)-instance (Read a, Read b, Read c, Read d, Read e, Read f) => Read (a, b, c, d, e, f)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read (a, b, c, d, e, f, g)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h) => Read (a, b, c, d, e, f, g, h)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i) => Read (a, b, c, d, e, f, g, h, i)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j) => Read (a, b, c, d, e, f, g, h, i, j)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k) => Read (a, b, c, d, e, f, g, h, i, j, k)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l) => Read (a, b, c, d, e, f, g, h, i, j, k, l)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n)-instance (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n, Read o) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)-instance (RealFloat a, Read a) => Read (Complex a)-instance Read a => Read (Dual a)-instance Read a => Read (First a)-instance Read a => Read (Last a)-instance Read a => Read (Maybe a)-instance Read a => Read (Product a)-instance (Integral a, Read a) => Read (Ratio a)-instance Read a => Read (Sum a)-instance Read a => Read [a]-instance (Ix a, Read a, Read b) => Read (Array a b)-instance (Read a, Read b) => Read (Either a b)-reads :: Read a => ReadS a-readParen :: Bool -> ReadS a -> ReadS a-read :: Read a => String -> a-lex :: ReadS String-data IO a-instance Applicative IO-instance Functor IO-instance Monad IO-instance MonadFix IO-instance Typeable1 IO-instance Typeable a => Data (IO a)-instance HPrintfType (IO a)-instance PrintfType (IO a)-putChar :: Char -> IO ()-putStr :: String -> IO ()-putStrLn :: String -> IO ()-print :: Show a => a -> IO ()-getChar :: IO Char-getLine :: IO String-getContents :: IO String-interact :: (String -> String) -> IO ()-type FilePath = String-readFile :: FilePath -> IO String-writeFile :: FilePath -> String -> IO ()-appendFile :: FilePath -> String -> IO ()-readIO :: Read a => String -> IO a-readLn :: Read a => IO a-type IOError = IOException-ioError :: IOError -> IO a-userError :: String -> IOError-catch :: IO a -> (IOError -> IO a) -> IO a--module Control.Monad.Instances-class Functor f-fmap :: Functor f => (a -> b) -> f a -> f b-instance Functor IO-instance Functor Id-instance Functor Maybe-instance Functor ReadP-instance Functor ReadPrec-instance Functor STM-instance Functor ZipList-instance Functor []-instance Ix i => Functor (Array i)-instance Functor (Const m)-instance Functor (Either a)-instance Functor (ST s)-instance Functor (ST s)-instance Monad m => Functor (WrappedMonad m)-instance Functor ((,) a)-instance Functor ((->) r)-instance Arrow a => Functor (WrappedArrow a b)-class Monad m-(>>=) :: Monad m => m a -> (a -> m b) -> m b-(>>) :: Monad m => m a -> m b -> m b-return :: Monad m => a -> m a-fail :: Monad m => String -> m a-instance Monad IO-instance Monad Maybe-instance Monad P-instance Monad ReadP-instance Monad ReadPrec-instance Monad STM-instance Monad []-instance ArrowApply a => Monad (ArrowMonad a)-instance Monad (ST s)-instance Monad (ST s)-instance Monad ((->) r)--module Data.Fixed-div' :: (Real a, Integral b) => a -> a -> b-mod' :: Real a => a -> a -> a-divMod' :: (Real a, Integral b) => a -> a -> (b, a)-data Fixed a-instance Enum (Fixed a)-instance Eq (Fixed a)-instance HasResolution a => Fractional (Fixed a)-instance HasResolution a => Num (Fixed a)-instance Ord (Fixed a)-instance HasResolution a => Real (Fixed a)-instance HasResolution a => RealFrac (Fixed a)-instance HasResolution a => Show (Fixed a)-class HasResolution a-resolution :: HasResolution a => a -> Integer-instance HasResolution E12-instance HasResolution E6-showFixed :: HasResolution a => Bool -> Fixed a -> String-data E6-instance HasResolution E6-type Micro = Fixed E6-data E12-instance HasResolution E12-type Pico = Fixed E12--module Data.Function-id :: a -> a-const :: a -> b -> a-(.) :: (b -> c) -> (a -> b) -> a -> c-flip :: (a -> b -> c) -> b -> a -> c-($) :: (a -> b) -> a -> b-fix :: (a -> a) -> a-on :: (b -> b -> c) -> (a -> b) -> a -> a -> c--module Control.Monad.Fix-class Monad m => MonadFix m-mfix :: MonadFix m => (a -> m a) -> m a-instance MonadFix IO-instance MonadFix Maybe-instance MonadFix []-instance MonadFix (ST s)-instance MonadFix (ST s)-instance MonadFix ((->) r)-fix :: (a -> a) -> a--module Control.Monad.ST-data ST s a-instance Typeable2 ST-instance Functor (ST s)-instance Monad (ST s)-instance MonadFix (ST s)-instance (Typeable s, Typeable a) => Data (ST s a)-instance Show (ST s a)-runST :: ST s a -> a-fixST :: (a -> ST s a) -> ST s a-data RealWorld-instance Typeable RealWorld-stToIO :: ST RealWorld a -> IO a-unsafeInterleaveST :: ST s a -> ST s a-unsafeIOToST :: IO a -> ST s a-unsafeSTToIO :: ST s a -> IO a--module Control.Monad.ST.Strict--module Control.Monad.ST.Lazy-data ST s a-instance Functor (ST s)-instance Monad (ST s)-instance MonadFix (ST s)-runST :: ST s a -> a-fixST :: (a -> ST s a) -> ST s a-strictToLazyST :: ST s a -> ST s a-lazyToStrictST :: ST s a -> ST s a-data RealWorld-instance Typeable RealWorld-stToIO :: ST RealWorld a -> IO a-unsafeInterleaveST :: ST s a -> ST s a-unsafeIOToST :: IO a -> ST s a--module Data.Generics.Basics-class Typeable a => Data a-gfoldl :: Data a => (c (a -> b) -> a -> c b) -> (g -> c g) -> a -> c a-gunfold :: Data a => (c (b -> r) -> c r) -> (r -> c r) -> Constr -> c a-toConstr :: Data a => a -> Constr-dataTypeOf :: Data a => a -> DataType-dataCast1 :: (Data a, Typeable1 t) => c (t a) -> Maybe (c a)-dataCast2 :: (Data a, Typeable2 t) => c (t a b) -> Maybe (c a)-gmapT :: Data a => (b -> b) -> a -> a-gmapQl :: Data a => (r -> r' -> r) -> r -> (a -> r') -> a -> r-gmapQr :: Data a => (r' -> r -> r) -> r -> (a -> r') -> a -> r-gmapQ :: Data a => (a -> u) -> a -> [u]-gmapQi :: Data a => Int -> (a -> u) -> a -> u-gmapM :: (Data a, Monad m) => (a -> m a) -> a -> m a-gmapMp :: (Data a, MonadPlus m) => (a -> m a) -> a -> m a-gmapMo :: (Data a, MonadPlus m) => (a -> m a) -> a -> m a-instance Data Bool-instance Data Char-instance Data DataType-instance Data Double-instance Data Float-instance Data Handle-instance Data Int-instance Data Int16-instance Data Int32-instance Data Int64-instance Data Int8-instance Data Integer-instance Data Ordering-instance Data ThreadId-instance Data TyCon-instance Data TypeRep-instance Data Word-instance Data Word16-instance Data Word32-instance Data Word64-instance Data Word8-instance Data ()-instance (Data a, Data b) => Data (a, b)-instance (Data a, Data b, Data c) => Data (a, b, c)-instance (Data a, Data b, Data c, Data d) => Data (a, b, c, d)-instance (Data a, Data b, Data c, Data d, Data e) => Data (a, b, c, d, e)-instance (Data a, Data b, Data c, Data d, Data e, Data f) => Data (a, b, c, d, e, f)-instance (Data a, Data b, Data c, Data d, Data e, Data f, Data g) => Data (a, b, c, d, e, f, g)-instance (Data a, Data b) => Data (a -> b)-instance (RealFloat a, Data a) => Data (Complex a)-instance Typeable a => Data (ForeignPtr a)-instance Typeable a => Data (IO a)-instance Typeable a => Data (IORef a)-instance Typeable a => Data (MVar a)-instance Data a => Data (Maybe a)-instance Typeable a => Data (Ptr a)-instance (Data a, Integral a) => Data (Ratio a)-instance Typeable a => Data (STM a)-instance Typeable a => Data (StablePtr a)-instance Typeable a => Data (TVar a)-instance Data a => Data [a]-instance (Typeable a, Data b, Ix a) => Data (Array a b)-instance (Data a, Data b) => Data (Either a b)-instance (Typeable s, Typeable a) => Data (ST s a)-data DataType-instance Data DataType-instance Show DataType-instance Typeable DataType-mkDataType :: String -> [Constr] -> DataType-mkIntType :: String -> DataType-mkFloatType :: String -> DataType-mkStringType :: String -> DataType-mkNorepType :: String -> DataType-dataTypeName :: DataType -> String-data DataRep-AlgRep :: [Constr] -> DataRep-IntRep :: DataRep-FloatRep :: DataRep-StringRep :: DataRep-NoRep :: DataRep-instance Eq DataRep-instance Show DataRep-dataTypeRep :: DataType -> DataRep-repConstr :: DataType -> ConstrRep -> Constr-isAlgType :: DataType -> Bool-dataTypeConstrs :: DataType -> [Constr]-indexConstr :: DataType -> ConIndex -> Constr-maxConstrIndex :: DataType -> ConIndex-isNorepType :: DataType -> Bool-data Constr-instance Eq Constr-instance Show Constr-type ConIndex = Int-data Fixity-Prefix :: Fixity-Infix :: Fixity-instance Eq Fixity-instance Show Fixity-mkConstr :: DataType -> String -> [String] -> Fixity -> Constr-mkIntConstr :: DataType -> Integer -> Constr-mkFloatConstr :: DataType -> Double -> Constr-mkStringConstr :: DataType -> String -> Constr-constrType :: Constr -> DataType-data ConstrRep-AlgConstr :: ConIndex -> ConstrRep-IntConstr :: Integer -> ConstrRep-FloatConstr :: Double -> ConstrRep-StringConstr :: String -> ConstrRep-instance Eq ConstrRep-instance Show ConstrRep-constrRep :: Constr -> ConstrRep-constrFields :: Constr -> [String]-constrFixity :: Constr -> Fixity-constrIndex :: Constr -> ConIndex-showConstr :: Constr -> String-readConstr :: DataType -> String -> Maybe Constr-tyconUQname :: String -> String-tyconModule :: String -> String-fromConstr :: Data a => Constr -> a-fromConstrB :: Data a => a -> Constr -> a-fromConstrM :: (Monad m, Data a) => m a -> Constr -> m a--module Data.Complex-data Complex a-(:+) :: a -> a -> Complex a-instance Typeable1 Complex-instance (RealFloat a, Data a) => Data (Complex a)-instance (RealFloat a, Eq a) => Eq (Complex a)-instance RealFloat a => Floating (Complex a)-instance RealFloat a => Fractional (Complex a)-instance RealFloat a => Num (Complex a)-instance (RealFloat a, Read a) => Read (Complex a)-instance (RealFloat a, Show a) => Show (Complex a)-realPart :: RealFloat a => Complex a -> a-imagPart :: RealFloat a => Complex a -> a-mkPolar :: RealFloat a => a -> a -> Complex a-cis :: RealFloat a => a -> Complex a-polar :: RealFloat a => Complex a -> (a, a)-magnitude :: RealFloat a => Complex a -> a-phase :: RealFloat a => Complex a -> a-conjugate :: RealFloat a => Complex a -> Complex a--module Data.Generics.Aliases-mkT :: (Typeable a, Typeable b) => (b -> b) -> a -> a-mkQ :: (Typeable a, Typeable b) => r -> (b -> r) -> a -> r-mkM :: (Monad m, Typeable a, Typeable b) => (b -> m b) -> a -> m a-mkMp :: (MonadPlus m, Typeable a, Typeable b) => (b -> m b) -> a -> m a-mkR :: (MonadPlus m, Typeable a, Typeable b) => m b -> m a-ext0 :: (Typeable a, Typeable b) => c a -> c b -> c a-extT :: (Typeable a, Typeable b) => (a -> a) -> (b -> b) -> a -> a-extQ :: (Typeable a, Typeable b) => (a -> q) -> (b -> q) -> a -> q-extM :: (Monad m, Typeable a, Typeable b) => (a -> m a) -> (b -> m b) -> a -> m a-extMp :: (MonadPlus m, Typeable a, Typeable b) => (a -> m a) -> (b -> m b) -> a -> m a-extB :: (Typeable a, Typeable b) => a -> b -> a-extR :: (Monad m, Typeable a, Typeable b) => m a -> m b -> m a-type GenericT = a -> a-type GenericQ r = a -> r-type GenericM m = a -> m a-type GenericB = a-type GenericR m = m a-type Generic c = a -> c a-data Generic' c-Generic' :: Generic c -> Generic' c-unGeneric' :: Generic' c -> Generic c-newtype GenericT'-unGT :: GenericT' -> (Data a => a -> a)-newtype GenericQ' r-GQ :: GenericQ r -> GenericQ' r-unGQ :: GenericQ' r -> GenericQ r-newtype GenericM' m-unGM :: GenericM' m -> (Data a => a -> m a)-orElse :: Maybe a -> Maybe a -> Maybe a-recoverMp :: MonadPlus m => GenericM m -> GenericM m-recoverQ :: MonadPlus m => r -> GenericQ (m r) -> GenericQ (m r)-choiceMp :: MonadPlus m => GenericM m -> GenericM m -> GenericM m-choiceQ :: MonadPlus m => GenericQ (m r) -> GenericQ (m r) -> GenericQ (m r)-ext1T :: (Data d, Typeable1 t) => (d -> d) -> (t d -> t d) -> d -> d-ext1M :: (Monad m, Data d, Typeable1 t) => (d -> m d) -> (t d -> m (t d)) -> d -> m d-ext1Q :: (Data d, Typeable1 t) => (d -> q) -> (t d -> q) -> d -> q-ext1R :: (Monad m, Data d, Typeable1 t) => m d -> m (t d) -> m d--module Data.Generics.Instances--module Data.Generics.Schemes-everywhere :: (a -> a) -> a -> a-everywhere' :: (a -> a) -> a -> a-everywhereBut :: GenericQ Bool -> GenericT -> GenericT-everywhereM :: Monad m => GenericM m -> GenericM m-somewhere :: MonadPlus m => GenericM m -> GenericM m-everything :: (r -> r -> r) -> GenericQ r -> GenericQ r-listify :: Typeable r => (r -> Bool) -> GenericQ [r]-something :: GenericQ (Maybe u) -> GenericQ (Maybe u)-synthesize :: s -> (t -> s -> s) -> GenericQ (s -> t) -> GenericQ t-gsize :: Data a => a -> Int-glength :: GenericQ Int-gdepth :: GenericQ Int-gcount :: GenericQ Bool -> GenericQ Int-gnodecount :: GenericQ Int-gtypecount :: Typeable a => a -> GenericQ Int-gfindtype :: (Data x, Typeable y) => x -> Maybe y--module Data.Generics.Text-gshow :: Data a => a -> String-gread :: Data a => ReadS a--module Data.Generics.Twins-gfoldlAccum :: Data d => (a -> c (d -> r) -> d -> (a, c r)) -> (a -> g -> (a, c g)) -> a -> d -> (a, c d)-gmapAccumT :: Data d => (a -> d -> (a, d)) -> a -> d -> (a, d)-gmapAccumM :: (Data d, Monad m) => (a -> d -> (a, m d)) -> a -> d -> (a, m d)-gmapAccumQl :: Data d => (r -> r' -> r) -> r -> (a -> d -> (a, r')) -> a -> d -> (a, r)-gmapAccumQr :: Data d => (r' -> r -> r) -> r -> (a -> d -> (a, r')) -> a -> d -> (a, r)-gmapAccumQ :: Data d => (a -> d -> (a, q)) -> a -> d -> (a, [q])-gzipWithT :: GenericQ GenericT -> GenericQ GenericT-gzipWithM :: Monad m => GenericQ (GenericM m) -> GenericQ (GenericM m)-gzipWithQ :: GenericQ (GenericQ r) -> GenericQ (GenericQ [r])-geq :: Data a => a -> a -> Bool-gzip :: GenericQ (GenericM Maybe) -> GenericQ (GenericM Maybe)--module Data.Generics--module Data.IORef-data IORef a-instance Typeable1 IORef-instance Typeable a => Data (IORef a)-instance Eq (IORef a)-newIORef :: a -> IO (IORef a)-readIORef :: IORef a -> IO a-writeIORef :: IORef a -> a -> IO ()-modifyIORef :: IORef a -> (a -> a) -> IO ()-atomicModifyIORef :: IORef a -> (a -> (a, b)) -> IO b-mkWeakIORef :: IORef a -> IO () -> IO (Weak (IORef a))--module Data.Ix-class Ord a => Ix a-range :: Ix a => (a, a) -> [a]-index :: Ix a => (a, a) -> a -> Int-inRange :: Ix a => (a, a) -> a -> Bool-rangeSize :: Ix a => (a, a) -> Int-instance Ix Bool-instance Ix Char-instance Ix GeneralCategory-instance Ix IOMode-instance Ix Int-instance Ix Int16-instance Ix Int32-instance Ix Int64-instance Ix Int8-instance Ix Integer-instance Ix Ordering-instance Ix SeekMode-instance Ix Word-instance Ix Word16-instance Ix Word32-instance Ix Word64-instance Ix Word8-instance Ix ()-instance (Ix a, Ix b) => Ix (a, b)-instance (Ix a1, Ix a2, Ix a3) => Ix (a1, a2, a3)-instance (Ix a1, Ix a2, Ix a3, Ix a4) => Ix (a1, a2, a3, a4)-instance (Ix a1, Ix a2, Ix a3, Ix a4, Ix a5) => Ix (a1, a2, a3, a4, a5)--module Data.Monoid-class Monoid a-mempty :: Monoid a => a-mappend :: Monoid a => a -> a -> a-mconcat :: Monoid a => [a] -> a-instance Monoid All-instance Monoid Any-instance Monoid Ordering-instance Monoid ()-instance (Monoid a, Monoid b) => Monoid (a, b)-instance (Monoid a, Monoid b, Monoid c) => Monoid (a, b, c)-instance (Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d)-instance (Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e)-instance Monoid b => Monoid (a -> b)-instance Monoid a => Monoid (Dual a)-instance Monoid (Endo a)-instance Monoid (First a)-instance Monoid (Last a)-instance Monoid a => Monoid (Maybe a)-instance Num a => Monoid (Product a)-instance Num a => Monoid (Sum a)-instance Monoid [a]-newtype Dual a-Dual :: a -> Dual a-getDual :: Dual a -> a-instance Bounded a => Bounded (Dual a)-instance Eq a => Eq (Dual a)-instance Monoid a => Monoid (Dual a)-instance Ord a => Ord (Dual a)-instance Read a => Read (Dual a)-instance Show a => Show (Dual a)-newtype Endo a-Endo :: (a -> a) -> Endo a-appEndo :: Endo a -> a -> a-instance Monoid (Endo a)-newtype All-All :: Bool -> All-getAll :: All -> Bool-instance Bounded All-instance Eq All-instance Monoid All-instance Ord All-instance Read All-instance Show All-newtype Any-Any :: Bool -> Any-getAny :: Any -> Bool-instance Bounded Any-instance Eq Any-instance Monoid Any-instance Ord Any-instance Read Any-instance Show Any-newtype Sum a-Sum :: a -> Sum a-getSum :: Sum a -> a-instance Bounded a => Bounded (Sum a)-instance Eq a => Eq (Sum a)-instance Num a => Monoid (Sum a)-instance Ord a => Ord (Sum a)-instance Read a => Read (Sum a)-instance Show a => Show (Sum a)-newtype Product a-Product :: a -> Product a-getProduct :: Product a -> a-instance Bounded a => Bounded (Product a)-instance Eq a => Eq (Product a)-instance Num a => Monoid (Product a)-instance Ord a => Ord (Product a)-instance Read a => Read (Product a)-instance Show a => Show (Product a)-newtype First a-First :: Maybe a -> First a-getFirst :: First a -> Maybe a-instance Eq a => Eq (First a)-instance Monoid (First a)-instance Ord a => Ord (First a)-instance Read a => Read (First a)-instance Show a => Show (First a)-newtype Last a-Last :: Maybe a -> Last a-getLast :: Last a -> Maybe a-instance Eq a => Eq (Last a)-instance Monoid (Last a)-instance Ord a => Ord (Last a)-instance Read a => Read (Last a)-instance Show a => Show (Last a)--module Data.Ratio-data Ratio a-instance Typeable1 Ratio-instance (Data a, Integral a) => Data (Ratio a)-instance Integral a => Enum (Ratio a)-instance (Integral a, Eq a) => Eq (Ratio a)-instance Integral a => Fractional (Ratio a)-instance Integral a => Num (Ratio a)-instance Integral a => Ord (Ratio a)-instance (Integral a, Read a) => Read (Ratio a)-instance Integral a => Real (Ratio a)-instance Integral a => RealFrac (Ratio a)-instance Integral a => Show (Ratio a)-type Rational = Ratio Integer-(%) :: Integral a => a -> a -> Ratio a-numerator :: Integral a => Ratio a -> a-denominator :: Integral a => Ratio a -> a-approxRational :: RealFrac a => a -> a -> Rational--module Data.STRef-data STRef s a-instance Typeable2 STRef-instance Eq (STRef s a)-newSTRef :: a -> ST s (STRef s a)-readSTRef :: STRef s a -> ST s a-writeSTRef :: STRef s a -> a -> ST s ()-modifySTRef :: STRef s a -> (a -> a) -> ST s ()--module Data.STRef.Lazy-data STRef s a-instance Typeable2 STRef-instance Eq (STRef s a)-newSTRef :: a -> ST s (STRef s a)-readSTRef :: STRef s a -> ST s a-writeSTRef :: STRef s a -> a -> ST s ()-modifySTRef :: STRef s a -> (a -> a) -> ST s ()--module Data.STRef.Strict--module Data.Version-data Version-Version :: [Int] -> [String] -> Version-versionBranch :: Version -> [Int]-versionTags :: Version -> [String]-instance Eq Version-instance Ord Version-instance Read Version-instance Show Version-instance Typeable Version-showVersion :: Version -> String-parseVersion :: ReadP Version--module Debug.Trace-putTraceMsg :: String -> IO ()-trace :: String -> a -> a--module GHC.Environment-getFullArgs :: IO [String]--module GHC.Exts-data Int-I# :: Int# -> Int-instance Bits Int-instance Bounded Int-instance Data Int-instance Enum Int-instance Eq Int-instance Integral Int-instance Ix Int-instance Num Int-instance Ord Int-instance PrintfArg Int-instance Read Int-instance Real Int-instance Show Int-instance Storable Int-instance Typeable Int-data Word-W# :: Word# -> Word-instance Bits Word-instance Bounded Word-instance Data Word-instance Enum Word-instance Eq Word-instance Integral Word-instance Ix Word-instance Num Word-instance Ord Word-instance PrintfArg Word-instance Read Word-instance Real Word-instance Show Word-instance Storable Word-instance Typeable Word-data Float-F# :: Float# -> Float-instance Data Float-instance Enum Float-instance Eq Float-instance Floating Float-instance Fractional Float-instance Num Float-instance Ord Float-instance PrintfArg Float-instance Read Float-instance Real Float-instance RealFloat Float-instance RealFrac Float-instance Show Float-instance Storable Float-instance Typeable Float-data Double-D# :: Double# -> Double-instance Data Double-instance Enum Double-instance Eq Double-instance Floating Double-instance Fractional Double-instance Num Double-instance Ord Double-instance PrintfArg Double-instance Read Double-instance Real Double-instance RealFloat Double-instance RealFrac Double-instance Show Double-instance Storable Double-instance Typeable Double-data Integer-S# :: Int# -> Integer-J# :: Int# -> ByteArray# -> Integer-instance Bits Integer-instance Data Integer-instance Enum Integer-instance Eq Integer-instance Integral Integer-instance Ix Integer-instance Num Integer-instance Ord Integer-instance PrintfArg Integer-instance Read Integer-instance Real Integer-instance Show Integer-instance Typeable Integer-data Char-C# :: Char# -> Char-instance Bounded Char-instance Data Char-instance Enum Char-instance Eq Char-instance IsChar Char-instance Ix Char-instance Ord Char-instance PrintfArg Char-instance Read Char-instance Show Char-instance Storable Char-instance Typeable Char-instance IsString [Char]-data Ptr a-Ptr :: Addr# -> Ptr a-instance Typeable1 Ptr-instance Typeable a => Data (Ptr a)-instance Eq (Ptr a)-instance Ord (Ptr a)-instance Show (Ptr a)-instance Storable (Ptr a)-data FunPtr a-FunPtr :: Addr# -> FunPtr a-instance Typeable1 FunPtr-instance Eq (FunPtr a)-instance Ord (FunPtr a)-instance Show (FunPtr a)-instance Storable (FunPtr a)-shiftL# :: Word# -> Int# -> Word#-shiftRL# :: Word# -> Int# -> Word#-iShiftL# :: Int# -> Int# -> Int#-iShiftRA# :: Int# -> Int# -> Int#-iShiftRL# :: Int# -> Int# -> Int#-uncheckedShiftL64# :: Word64# -> Int# -> Word64#-uncheckedShiftRL64# :: Word64# -> Int# -> Word64#-uncheckedIShiftL64# :: Int64# -> Int# -> Int64#-uncheckedIShiftRA64# :: Int64# -> Int# -> Int64#-build :: (a -> b -> b -> b -> b) -> [a]-augment :: (a -> b -> b -> b -> b) -> [a] -> [a]-class IsString a-fromString :: IsString a => String -> a-instance IsString [Char]-breakpoint :: a -> a-breakpointCond :: Bool -> a -> a-lazy :: a -> a-inline :: a -> a--module System.CPUTime-getCPUTime :: IO Integer-cpuTimePrecision :: Integer--module System.Console.GetOpt-getOpt :: ArgOrder a -> [OptDescr a] -> [String] -> ([a], [String], [String])-getOpt' :: ArgOrder a -> [OptDescr a] -> [String] -> ([a], [String], [String], [String])-usageInfo :: String -> [OptDescr a] -> String-data ArgOrder a-RequireOrder :: ArgOrder a-Permute :: ArgOrder a-ReturnInOrder :: (String -> a) -> ArgOrder a-data OptDescr a-Option :: [Char] -> [String] -> ArgDescr a -> String -> OptDescr a-data ArgDescr a-NoArg :: a -> ArgDescr a-ReqArg :: (String -> a) -> String -> ArgDescr a-OptArg :: (Maybe String -> a) -> String -> ArgDescr a--module System.Exit-data ExitCode-ExitSuccess :: ExitCode-ExitFailure :: Int -> ExitCode-instance Eq ExitCode-instance Ord ExitCode-instance Read ExitCode-instance Show ExitCode-exitWith :: ExitCode -> IO a-exitFailure :: IO a--module System.Info-os :: String-arch :: String-compilerName :: String-compilerVersion :: Version--module System.Mem-performGC :: IO ()--module System.Mem.StableName-data StableName a-instance Typeable1 StableName-instance Eq (StableName a)-makeStableName :: a -> IO (StableName a)-hashStableName :: StableName a -> Int--module System.Mem.Weak-data Weak v-instance Typeable1 Weak-mkWeak :: k -> v -> Maybe (IO ()) -> IO (Weak v)-deRefWeak :: Weak v -> IO (Maybe v)-finalize :: Weak v -> IO ()-mkWeakPtr :: k -> Maybe (IO ()) -> IO (Weak k)-addFinalizer :: key -> IO () -> IO ()-mkWeakPair :: k -> v -> Maybe (IO ()) -> IO (Weak (k, v))--module Text.Printf-printf :: PrintfType r => String -> r-hPrintf :: HPrintfType r => Handle -> String -> r-class PrintfType t-instance (PrintfArg a, PrintfType r) => PrintfType (a -> r)-instance PrintfType (IO a)-instance IsChar c => PrintfType [c]-class HPrintfType t-instance (PrintfArg a, HPrintfType r) => HPrintfType (a -> r)-instance HPrintfType (IO a)-class PrintfArg a-instance PrintfArg Char-instance PrintfArg Double-instance PrintfArg Float-instance PrintfArg Int-instance PrintfArg Int16-instance PrintfArg Int32-instance PrintfArg Int64-instance PrintfArg Int8-instance PrintfArg Integer-instance PrintfArg Word-instance PrintfArg Word16-instance PrintfArg Word32-instance PrintfArg Word64-instance PrintfArg Word8-instance IsChar c => PrintfArg [c]-class IsChar c-instance IsChar Char--module Text.Show.Functions--module Control.Exception-data Exception-ArithException :: ArithException -> Exception-ArrayException :: ArrayException -> Exception-AssertionFailed :: String -> Exception-AsyncException :: AsyncException -> Exception-BlockedOnDeadMVar :: Exception-BlockedIndefinitely :: Exception-NestedAtomically :: Exception-Deadlock :: Exception-DynException :: Dynamic -> Exception-ErrorCall :: String -> Exception-ExitException :: ExitCode -> Exception-IOException :: IOException -> Exception-NoMethodError :: String -> Exception-NonTermination :: Exception-PatternMatchFail :: String -> Exception-RecConError :: String -> Exception-RecSelError :: String -> Exception-RecUpdError :: String -> Exception-instance Eq Exception-instance Show Exception-instance Typeable Exception-data IOException-instance Eq IOException-instance Show IOException-instance Typeable IOException-data ArithException-Overflow :: ArithException-Underflow :: ArithException-LossOfPrecision :: ArithException-DivideByZero :: ArithException-Denormal :: ArithException-instance Eq ArithException-instance Ord ArithException-instance Show ArithException-instance Typeable ArithException-data ArrayException-IndexOutOfBounds :: String -> ArrayException-UndefinedElement :: String -> ArrayException-instance Eq ArrayException-instance Ord ArrayException-instance Show ArrayException-instance Typeable ArrayException-data AsyncException-StackOverflow :: AsyncException-HeapOverflow :: AsyncException-ThreadKilled :: AsyncException-instance Eq AsyncException-instance Ord AsyncException-instance Show AsyncException-instance Typeable AsyncException-throwIO :: Exception -> IO a-throw :: Exception -> a-ioError :: IOError -> IO a-throwTo :: ThreadId -> Exception -> IO ()-catch :: IO a -> (Exception -> IO a) -> IO a-catchJust :: (Exception -> Maybe b) -> IO a -> (b -> IO a) -> IO a-handle :: (Exception -> IO a) -> IO a -> IO a-handleJust :: (Exception -> Maybe b) -> (b -> IO a) -> IO a -> IO a-try :: IO a -> IO (Either Exception a)-tryJust :: (Exception -> Maybe b) -> IO a -> IO (Either b a)-evaluate :: a -> IO a-mapException :: (Exception -> Exception) -> a -> a-ioErrors :: Exception -> Maybe IOError-arithExceptions :: Exception -> Maybe ArithException-errorCalls :: Exception -> Maybe String-dynExceptions :: Exception -> Maybe Dynamic-assertions :: Exception -> Maybe String-asyncExceptions :: Exception -> Maybe AsyncException-userErrors :: Exception -> Maybe String-throwDyn :: Typeable exception => exception -> b-throwDynTo :: Typeable exception => ThreadId -> exception -> IO ()-catchDyn :: Typeable exception => IO a -> (exception -> IO a) -> IO a-block :: IO a -> IO a-unblock :: IO a -> IO a-assert :: Bool -> a -> a-bracket :: IO a -> (a -> IO b) -> (a -> IO c) -> IO c-bracket_ :: IO a -> IO b -> IO c -> IO c-bracketOnError :: IO a -> (a -> IO b) -> (a -> IO c) -> IO c-finally :: IO a -> IO b -> IO a-setUncaughtExceptionHandler :: (Exception -> IO ()) -> IO ()-getUncaughtExceptionHandler :: IO (Exception -> IO ())--module System.Environment-getArgs :: IO [String]-getProgName :: IO String-getEnv :: String -> IO String-withArgs :: [String] -> IO a -> IO a-withProgName :: String -> IO a -> IO a-getEnvironment :: IO [(String, String)]--module Control.Concurrent.MVar-data MVar a-instance Typeable1 MVar-instance Typeable a => Data (MVar a)-instance Eq (MVar a)-newEmptyMVar :: IO (MVar a)-newMVar :: a -> IO (MVar a)-takeMVar :: MVar a -> IO a-putMVar :: MVar a -> a -> IO ()-readMVar :: MVar a -> IO a-swapMVar :: MVar a -> a -> IO a-tryTakeMVar :: MVar a -> IO (Maybe a)-tryPutMVar :: MVar a -> a -> IO Bool-isEmptyMVar :: MVar a -> IO Bool-withMVar :: MVar a -> (a -> IO b) -> IO b-modifyMVar_ :: MVar a -> (a -> IO a) -> IO ()-modifyMVar :: MVar a -> (a -> IO (a, b)) -> IO b-addMVarFinalizer :: MVar a -> IO () -> IO ()--module Control.Concurrent.QSem-data QSem-instance Typeable QSem-newQSem :: Int -> IO QSem-waitQSem :: QSem -> IO ()-signalQSem :: QSem -> IO ()--module Control.Concurrent.QSemN-data QSemN-instance Typeable QSemN-newQSemN :: Int -> IO QSemN-waitQSemN :: QSemN -> Int -> IO ()-signalQSemN :: QSemN -> Int -> IO ()--module Control.Concurrent.SampleVar-type SampleVar a = MVar (Int, MVar a)-newEmptySampleVar :: IO (SampleVar a)-newSampleVar :: a -> IO (SampleVar a)-emptySampleVar :: SampleVar a -> IO ()-readSampleVar :: SampleVar a -> IO a-writeSampleVar :: SampleVar a -> a -> IO ()-isEmptySampleVar :: SampleVar a -> IO Bool--module Data.Unique-data Unique-instance Eq Unique-instance Ord Unique-newUnique :: IO Unique-hashUnique :: Unique -> Int--module Control.Concurrent.Chan-data Chan a-instance Typeable1 Chan-newChan :: IO (Chan a)-writeChan :: Chan a -> a -> IO ()-readChan :: Chan a -> IO a-dupChan :: Chan a -> IO (Chan a)-unGetChan :: Chan a -> a -> IO ()-isEmptyChan :: Chan a -> IO Bool-getChanContents :: Chan a -> IO [a]-writeList2Chan :: Chan a -> [a] -> IO ()--module Control.Concurrent-data ThreadId-instance Data ThreadId-instance Eq ThreadId-instance Ord ThreadId-instance Show ThreadId-instance Typeable ThreadId-myThreadId :: IO ThreadId-forkIO :: IO () -> IO ThreadId-killThread :: ThreadId -> IO ()-throwTo :: ThreadId -> Exception -> IO ()-yield :: IO ()-threadDelay :: Int -> IO ()-threadWaitRead :: Fd -> IO ()-threadWaitWrite :: Fd -> IO ()-mergeIO :: [a] -> [a] -> IO [a]-nmergeIO :: [[a]] -> IO [a]-rtsSupportsBoundThreads :: Bool-forkOS :: IO () -> IO ThreadId-isCurrentThreadBound :: IO Bool-runInBoundThread :: IO a -> IO a-runInUnboundThread :: IO a -> IO a--module GHC.ConsoleHandler-data Handler-Default :: Handler-Ignore :: Handler-Catch :: (ConsoleEvent -> IO ()) -> Handler-installHandler :: Handler -> IO Handler-data ConsoleEvent-ControlC :: ConsoleEvent-Break :: ConsoleEvent-Close :: ConsoleEvent-Logoff :: ConsoleEvent-Shutdown :: ConsoleEvent-instance Enum ConsoleEvent-instance Eq ConsoleEvent-instance Ord ConsoleEvent-instance Read ConsoleEvent-instance Show ConsoleEvent-instance Typeable ConsoleEvent-flushConsole :: Handle -> IO ()--module System.Timeout-timeout :: Int -> IO a -> IO (Maybe a)--module Control.Arrow-class Arrow a-arr :: Arrow a => (b -> c) -> a b c-pure :: Arrow a => (b -> c) -> a b c-(>>>) :: Arrow a => a b c -> a c d -> a b d-first :: Arrow a => a b c -> a (b, d) (c, d)-second :: Arrow a => a b c -> a (d, b) (d, c)-(***) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c')-(&&&) :: Arrow a => a b c -> a b c' -> a b (c, c')-instance Arrow (->)-instance Monad m => Arrow (Kleisli m)-newtype Kleisli m a b-Kleisli :: (a -> m b) -> Kleisli m a b-runKleisli :: Kleisli m a b -> a -> m b-instance Monad m => Arrow (Kleisli m)-instance Monad m => ArrowApply (Kleisli m)-instance Monad m => ArrowChoice (Kleisli m)-instance MonadFix m => ArrowLoop (Kleisli m)-instance MonadPlus m => ArrowPlus (Kleisli m)-instance MonadPlus m => ArrowZero (Kleisli m)-returnA :: Arrow a => a b b-(^>>) :: Arrow a => (b -> c) -> a c d -> a b d-(>>^) :: Arrow a => a b c -> (c -> d) -> a b d-(<<<) :: Arrow a => a c d -> a b c -> a b d-(<<^) :: Arrow a => a c d -> (b -> c) -> a b d-(^<<) :: Arrow a => (c -> d) -> a b c -> a b d-class Arrow a => ArrowZero a-zeroArrow :: ArrowZero a => a b c-instance MonadPlus m => ArrowZero (Kleisli m)-class ArrowZero a => ArrowPlus a-(<+>) :: ArrowPlus a => a b c -> a b c -> a b c-instance MonadPlus m => ArrowPlus (Kleisli m)-class Arrow a => ArrowChoice a-left :: ArrowChoice a => a b c -> a (Either b d) (Either c d)-right :: ArrowChoice a => a b c -> a (Either d b) (Either d c)-(+++) :: ArrowChoice a => a b c -> a b' c' -> a (Either b b') (Either c c')-(|||) :: ArrowChoice a => a b d -> a c d -> a (Either b c) d-instance ArrowChoice (->)-instance Monad m => ArrowChoice (Kleisli m)-class Arrow a => ArrowApply a-app :: ArrowApply a => a (a b c, b) c-instance ArrowApply (->)-instance Monad m => ArrowApply (Kleisli m)-newtype ArrowMonad a b-ArrowMonad :: a () b -> ArrowMonad a b-instance ArrowApply a => Monad (ArrowMonad a)-leftApp :: ArrowApply a => a b c -> a (Either b d) (Either c d)-class Arrow a => ArrowLoop a-loop :: ArrowLoop a => a (b, d) (c, d) -> a b c-instance ArrowLoop (->)-instance MonadFix m => ArrowLoop (Kleisli m)--module Control.Applicative-class Functor f => Applicative f-pure :: Applicative f => a -> f a-(<*>) :: Applicative f => f (a -> b) -> f a -> f b-instance Applicative IO-instance Applicative Id-instance Applicative Maybe-instance Applicative ZipList-instance Applicative []-instance Monoid m => Applicative (Const m)-instance Monad m => Applicative (WrappedMonad m)-instance Monoid a => Applicative ((,) a)-instance Applicative ((->) a)-instance Arrow a => Applicative (WrappedArrow a b)-class Applicative f => Alternative f-empty :: Alternative f => f a-(<|>) :: Alternative f => f a -> f a -> f a-instance Alternative Maybe-instance Alternative []-instance MonadPlus m => Alternative (WrappedMonad m)-instance (ArrowZero a, ArrowPlus a) => Alternative (WrappedArrow a b)-newtype Const a b-Const :: a -> Const a b-getConst :: Const a b -> a-instance Monoid m => Applicative (Const m)-instance Functor (Const m)-newtype WrappedMonad m a-WrapMonad :: m a -> WrappedMonad m a-unwrapMonad :: WrappedMonad m a -> m a-instance MonadPlus m => Alternative (WrappedMonad m)-instance Monad m => Applicative (WrappedMonad m)-instance Monad m => Functor (WrappedMonad m)-newtype WrappedArrow a b c-WrapArrow :: a b c -> WrappedArrow a b c-unwrapArrow :: WrappedArrow a b c -> a b c-instance (ArrowZero a, ArrowPlus a) => Alternative (WrappedArrow a b)-instance Arrow a => Applicative (WrappedArrow a b)-instance Arrow a => Functor (WrappedArrow a b)-newtype ZipList a-ZipList :: [a] -> ZipList a-getZipList :: ZipList a -> [a]-instance Applicative ZipList-instance Functor ZipList-(<$>) :: Functor f => (a -> b) -> f a -> f b-(<$) :: Functor f => a -> f b -> f a-(*>) :: Applicative f => f a -> f b -> f b-(<*) :: Applicative f => f a -> f b -> f a-(<**>) :: Applicative f => f a -> f (a -> b) -> f b-liftA :: Applicative f => (a -> b) -> f a -> f b-liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c-liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d-optional :: Alternative f => f a -> f (Maybe a)-some :: Alternative f => f a -> f [a]-many :: Alternative f => f a -> f [a]--module Data.Foldable-class Foldable t-fold :: (Foldable t, Monoid m) => t m -> m-foldMap :: (Foldable t, Monoid m) => (a -> m) -> t a -> m-foldr :: Foldable t => (a -> b -> b) -> b -> t a -> b-foldl :: Foldable t => (a -> b -> a) -> a -> t b -> a-foldr1 :: Foldable t => (a -> a -> a) -> t a -> a-foldl1 :: Foldable t => (a -> a -> a) -> t a -> a-instance Foldable Maybe-instance Foldable []-foldr' :: Foldable t => (a -> b -> b) -> b -> t a -> b-foldl' :: Foldable t => (a -> b -> a) -> a -> t b -> a-foldrM :: (Foldable t, Monad m) => (a -> b -> m b) -> b -> t a -> m b-foldlM :: (Foldable t, Monad m) => (a -> b -> m a) -> a -> t b -> m a-traverse_ :: (Foldable t, Applicative f) => (a -> f b) -> t a -> f ()-for_ :: (Foldable t, Applicative f) => t a -> (a -> f b) -> f ()-sequenceA_ :: (Foldable t, Applicative f) => t (f a) -> f ()-asum :: (Foldable t, Alternative f) => t (f a) -> f a-mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()-forM_ :: (Foldable t, Monad m) => t a -> (a -> m b) -> m ()-sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()-msum :: (Foldable t, MonadPlus m) => t (m a) -> m a-toList :: Foldable t => t a -> [a]-concat :: Foldable t => t [a] -> [a]-concatMap :: Foldable t => (a -> [b]) -> t a -> [b]-and :: Foldable t => t Bool -> Bool-or :: Foldable t => t Bool -> Bool-any :: Foldable t => (a -> Bool) -> t a -> Bool-all :: Foldable t => (a -> Bool) -> t a -> Bool-sum :: (Foldable t, Num a) => t a -> a-product :: (Foldable t, Num a) => t a -> a-maximum :: (Foldable t, Ord a) => t a -> a-maximumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a-minimum :: (Foldable t, Ord a) => t a -> a-minimumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a-elem :: (Foldable t, Eq a) => a -> t a -> Bool-notElem :: (Foldable t, Eq a) => a -> t a -> Bool-find :: Foldable t => (a -> Bool) -> t a -> Maybe a--module Data.Traversable-class (Functor t, Foldable t) => Traversable t-traverse :: (Traversable t, Applicative f) => (a -> f b) -> t a -> f (t b)-sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)-mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)-sequence :: (Traversable t, Monad m) => t (m a) -> m (t a)-instance Traversable Maybe-instance Traversable []-for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b)-forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b)-fmapDefault :: Traversable t => (a -> b) -> t a -> t b-foldMapDefault :: (Traversable t, Monoid m) => (a -> m) -> t a -> m--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Language.Haskell.Extension-data Extension-OverlappingInstances :: Extension-UndecidableInstances :: Extension-IncoherentInstances :: Extension-RecursiveDo :: Extension-ParallelListComp :: Extension-MultiParamTypeClasses :: Extension-NoMonomorphismRestriction :: Extension-FunctionalDependencies :: Extension-Rank2Types :: Extension-RankNTypes :: Extension-PolymorphicComponents :: Extension-ExistentialQuantification :: Extension-ScopedTypeVariables :: Extension-ImplicitParams :: Extension-FlexibleContexts :: Extension-FlexibleInstances :: Extension-EmptyDataDecls :: Extension-CPP :: Extension-KindSignatures :: Extension-BangPatterns :: Extension-TypeSynonymInstances :: Extension-TemplateHaskell :: Extension-ForeignFunctionInterface :: Extension-Arrows :: Extension-Generics :: Extension-NoImplicitPrelude :: Extension-NamedFieldPuns :: Extension-PatternGuards :: Extension-GeneralizedNewtypeDeriving :: Extension-ExtensibleRecords :: Extension-RestrictedTypeSynonyms :: Extension-HereDocuments :: Extension-MagicHash :: Extension-TypeFamilies :: Extension-StandaloneDeriving :: Extension-UnicodeSyntax :: Extension-PatternSignatures :: Extension-UnliftedFFITypes :: Extension-LiberalTypeSynonyms :: Extension-TypeOperators :: Extension-RecordWildCards :: Extension-RecordPuns :: Extension-DisambiguateRecordFields :: Extension-OverloadedStrings :: Extension-GADTs :: Extension-NoMonoPatBinds :: Extension-RelaxedPolyRec :: Extension-ExtendedDefaultRules :: Extension-UnboxedTuples :: Extension-DeriveDataTypeable :: Extension-ConstrainedClassMethods :: Extension-instance Eq Extension-instance Read Extension-instance Show Extension--module Distribution.Verbosity-data Verbosity-instance Eq Verbosity-instance Ord Verbosity-instance Show Verbosity-silent :: Verbosity-normal :: Verbosity-verbose :: Verbosity-deafening :: Verbosity-moreVerbose :: Verbosity -> Verbosity-lessVerbose :: Verbosity -> Verbosity-intToVerbosity :: Int -> Maybe Verbosity-flagToVerbosity :: Maybe String -> Verbosity-showForCabal :: Verbosity -> String-showForGHC :: Verbosity -> String--module Distribution.System-data OS-Linux :: OS-Windows :: Windows -> OS-OSX :: OS-Solaris :: OS-Other :: String -> OS-data Windows-MingW :: Windows-os :: OS--module Distribution.Simple.PreProcess.Unlit-unlit :: FilePath -> String -> String-plain :: String -> String -> String--module Distribution.Simple.GHC.Makefile-makefileTemplate :: String--module Distribution.License-data License-GPL :: License-LGPL :: License-BSD3 :: License-BSD4 :: License-PublicDomain :: License-AllRightsReserved :: License-OtherLicense :: License-instance Eq License-instance Read License-instance Show License--module Distribution.Extension-data Extension-OverlappingInstances :: Extension-UndecidableInstances :: Extension-IncoherentInstances :: Extension-RecursiveDo :: Extension-ParallelListComp :: Extension-MultiParamTypeClasses :: Extension-NoMonomorphismRestriction :: Extension-FunctionalDependencies :: Extension-Rank2Types :: Extension-RankNTypes :: Extension-PolymorphicComponents :: Extension-ExistentialQuantification :: Extension-ScopedTypeVariables :: Extension-ImplicitParams :: Extension-FlexibleContexts :: Extension-FlexibleInstances :: Extension-EmptyDataDecls :: Extension-CPP :: Extension-KindSignatures :: Extension-BangPatterns :: Extension-TypeSynonymInstances :: Extension-TemplateHaskell :: Extension-ForeignFunctionInterface :: Extension-Arrows :: Extension-Generics :: Extension-NoImplicitPrelude :: Extension-NamedFieldPuns :: Extension-PatternGuards :: Extension-GeneralizedNewtypeDeriving :: Extension-ExtensibleRecords :: Extension-RestrictedTypeSynonyms :: Extension-HereDocuments :: Extension-MagicHash :: Extension-TypeFamilies :: Extension-StandaloneDeriving :: Extension-UnicodeSyntax :: Extension-PatternSignatures :: Extension-UnliftedFFITypes :: Extension-LiberalTypeSynonyms :: Extension-TypeOperators :: Extension-RecordWildCards :: Extension-RecordPuns :: Extension-DisambiguateRecordFields :: Extension-OverloadedStrings :: Extension-GADTs :: Extension-NoMonoPatBinds :: Extension-RelaxedPolyRec :: Extension-ExtendedDefaultRules :: Extension-UnboxedTuples :: Extension-DeriveDataTypeable :: Extension-ConstrainedClassMethods :: Extension-instance Eq Extension-instance Read Extension-instance Show Extension--module Distribution.Compiler-data CompilerFlavor-GHC :: CompilerFlavor-NHC :: CompilerFlavor-Hugs :: CompilerFlavor-HBC :: CompilerFlavor-Helium :: CompilerFlavor-JHC :: CompilerFlavor-OtherCompiler :: String -> CompilerFlavor-instance Eq CompilerFlavor-instance Ord CompilerFlavor-instance Read CompilerFlavor-instance Show CompilerFlavor-defaultCompilerFlavor :: Maybe CompilerFlavor--module Distribution.Compat.ReadP-type ReadP r a = ReadP a--module Distribution.Version-readVersion :: String -> Maybe Version-data VersionRange-AnyVersion :: VersionRange-ThisVersion :: Version -> VersionRange-LaterVersion :: Version -> VersionRange-EarlierVersion :: Version -> VersionRange-UnionVersionRanges :: VersionRange -> VersionRange -> VersionRange-IntersectVersionRanges :: VersionRange -> VersionRange -> VersionRange-instance Eq VersionRange-instance Read VersionRange-instance Show VersionRange-orLaterVersion :: Version -> VersionRange-orEarlierVersion :: Version -> VersionRange-betweenVersionsInclusive :: Version -> Version -> VersionRange-withinRange :: Version -> VersionRange -> Bool-showVersionRange :: VersionRange -> String-parseVersionRange :: ReadP r VersionRange-isAnyVersion :: VersionRange -> Bool-data Dependency-Dependency :: String -> VersionRange -> Dependency-instance Eq Dependency-instance Read Dependency-instance Show Dependency--module Distribution.Configuration-data Flag-MkFlag :: String -> String -> Bool -> Flag-flagName :: Flag -> String-flagDescription :: Flag -> String-flagDefault :: Flag -> Bool-instance Show Flag-data ConfVar-OS :: String -> ConfVar-Arch :: String -> ConfVar-Flag :: ConfFlag -> ConfVar-Impl :: String -> VersionRange -> ConfVar-instance Eq ConfVar-instance Show ConfVar-data Condition c-Var :: c -> Condition c-Lit :: Bool -> Condition c-CNot :: Condition c -> Condition c-COr :: Condition c -> Condition c -> Condition c-CAnd :: Condition c -> Condition c -> Condition c-instance Show c => Show (Condition c)-parseCondition :: ReadP r (Condition ConfVar)-simplifyCondition :: Condition c -> (c -> Either d Bool) -> (Condition d, [d])-data CondTree v c a-CondNode :: a -> c -> [(Condition v, CondTree v c a, Maybe (CondTree v c a))] -> CondTree v c a-condTreeData :: CondTree v c a -> a-condTreeConstraints :: CondTree v c a -> c-condTreeComponents :: CondTree v c a -> [(Condition v, CondTree v c a, Maybe (CondTree v c a))]-instance (Show v, Show c) => Show (CondTree v c a)-ppCondTree :: Show v => CondTree v c a -> (c -> Doc) -> Doc-mapTreeData :: (a -> b) -> CondTree v c a -> CondTree v c b-resolveWithFlags :: Monoid a => [(String, [Bool])] -> String -> String -> (String, Version) -> [CondTree ConfVar [d] a] -> ([d] -> DepTestRslt [d]) -> Either [d] ([a], [d], [(String, Bool)])-ignoreConditions :: (Monoid a, Monoid c) => CondTree v c a -> (a, c)-data DepTestRslt d-DepOk :: DepTestRslt d-MissingDeps :: d -> DepTestRslt d-instance Monoid d => Monoid (DepTestRslt d)--module Distribution.Package-data PackageIdentifier-PackageIdentifier :: String -> Version -> PackageIdentifier-pkgName :: PackageIdentifier -> String-pkgVersion :: PackageIdentifier -> Version-instance Eq PackageIdentifier-instance Ord PackageIdentifier-instance Read PackageIdentifier-instance Show PackageIdentifier-showPackageId :: PackageIdentifier -> String-parsePackageId :: ReadP r PackageIdentifier-parsePackageName :: ReadP r String--module Distribution.InstalledPackageInfo-data InstalledPackageInfo-InstalledPackageInfo :: PackageIdentifier -> License -> String -> String -> String -> String -> String -> String -> String -> String -> Bool -> [String] -> [String] -> [FilePath] -> [FilePath] -> [String] -> [String] -> [String] -> [FilePath] -> [String] -> [PackageIdentifier] -> [String] -> [String] -> [String] -> [FilePath] -> [String] -> [FilePath] -> [FilePath] -> InstalledPackageInfo-package :: InstalledPackageInfo -> PackageIdentifier-license :: InstalledPackageInfo -> License-copyright :: InstalledPackageInfo -> String-maintainer :: InstalledPackageInfo -> String-author :: InstalledPackageInfo -> String-stability :: InstalledPackageInfo -> String-homepage :: InstalledPackageInfo -> String-pkgUrl :: InstalledPackageInfo -> String-description :: InstalledPackageInfo -> String-category :: InstalledPackageInfo -> String-exposed :: InstalledPackageInfo -> Bool-exposedModules :: InstalledPackageInfo -> [String]-hiddenModules :: InstalledPackageInfo -> [String]-importDirs :: InstalledPackageInfo -> [FilePath]-libraryDirs :: InstalledPackageInfo -> [FilePath]-hsLibraries :: InstalledPackageInfo -> [String]-extraLibraries :: InstalledPackageInfo -> [String]-extraGHCiLibraries :: InstalledPackageInfo -> [String]-includeDirs :: InstalledPackageInfo -> [FilePath]-includes :: InstalledPackageInfo -> [String]-depends :: InstalledPackageInfo -> [PackageIdentifier]-hugsOptions :: InstalledPackageInfo -> [String]-ccOptions :: InstalledPackageInfo -> [String]-ldOptions :: InstalledPackageInfo -> [String]-frameworkDirs :: InstalledPackageInfo -> [FilePath]-frameworks :: InstalledPackageInfo -> [String]-haddockInterfaces :: InstalledPackageInfo -> [FilePath]-haddockHTMLs :: InstalledPackageInfo -> [FilePath]-instance Read InstalledPackageInfo-instance Show InstalledPackageInfo-data ParseResult a-ParseFailed :: PError -> ParseResult a-ParseOk :: [PWarning] -> a -> ParseResult a-instance Monad ParseResult-instance Show a => Show (ParseResult a)-data PError-AmbigousParse :: String -> LineNo -> PError-NoParse :: String -> LineNo -> PError-TabsError :: LineNo -> PError-FromString :: String -> Maybe LineNo -> PError-instance Show PError-type PWarning = String-emptyInstalledPackageInfo :: InstalledPackageInfo-parseInstalledPackageInfo :: String -> ParseResult InstalledPackageInfo-showInstalledPackageInfo :: InstalledPackageInfo -> String-showInstalledPackageInfoField :: String -> Maybe (InstalledPackageInfo -> String)--module Distribution.Simple.Compiler-data Compiler-Compiler :: CompilerFlavor -> PackageIdentifier -> [(Extension, Flag)] -> Compiler-compilerFlavor :: Compiler -> CompilerFlavor-compilerId :: Compiler -> PackageIdentifier-compilerExtensions :: Compiler -> [(Extension, Flag)]-instance Read Compiler-instance Show Compiler-showCompilerId :: Compiler -> String-compilerVersion :: Compiler -> Version-data PackageDB-GlobalPackageDB :: PackageDB-UserPackageDB :: PackageDB-SpecificPackageDB :: FilePath -> PackageDB-instance Read PackageDB-instance Show PackageDB-type Flag = String-extensionsToFlags :: Compiler -> [Extension] -> [Flag]-unsupportedExtensions :: Compiler -> [Extension] -> [Extension]--module Distribution.Simple.Utils-die :: String -> IO a-dieWithLocation :: FilePath -> Maybe Int -> String -> IO a-warn :: Verbosity -> String -> IO ()-notice :: Verbosity -> String -> IO ()-info :: Verbosity -> String -> IO ()-debug :: Verbosity -> String -> IO ()-breaks :: (a -> Bool) -> [a] -> [[a]]-wrapText :: Int -> [String] -> [String]-rawSystemExit :: Verbosity -> FilePath -> [String] -> IO ()-rawSystemStdout :: Verbosity -> FilePath -> [String] -> IO String-rawSystemStdout' :: Verbosity -> FilePath -> [String] -> IO (String, ExitCode)-maybeExit :: IO ExitCode -> IO ()-xargs :: Int -> ([String] -> IO ()) -> [String] -> [String] -> IO ()-matchesDescFile :: FilePath -> Bool-rawSystemPathExit :: Verbosity -> String -> [String] -> IO ()-smartCopySources :: Verbosity -> [FilePath] -> FilePath -> [String] -> [String] -> Bool -> Bool -> IO ()-createDirectoryIfMissingVerbose :: Verbosity -> Bool -> FilePath -> IO ()-copyFileVerbose :: Verbosity -> FilePath -> FilePath -> IO ()-copyDirectoryRecursiveVerbose :: Verbosity -> FilePath -> FilePath -> IO ()-moduleToFilePath :: [FilePath] -> String -> [String] -> IO [FilePath]-moduleToFilePath2 :: [FilePath] -> String -> [String] -> IO [(FilePath, FilePath)]-mkLibName :: FilePath -> String -> String-mkProfLibName :: FilePath -> String -> String-mkSharedLibName :: FilePath -> String -> PackageIdentifier -> String-currentDir :: FilePath-dotToSep :: String -> String-findFile :: [FilePath] -> FilePath -> IO FilePath-defaultPackageDesc :: Verbosity -> IO FilePath-findPackageDesc :: Verbosity -> FilePath -> IO FilePath-defaultHookedPackageDesc :: IO (Maybe FilePath)-findHookedPackageDesc :: FilePath -> IO (Maybe FilePath)-exeExtension :: String-objExtension :: String-dllExtension :: String--module Distribution.PackageDescription-data PackageDescription-PackageDescription :: PackageIdentifier -> License -> FilePath -> String -> String -> String -> String -> [(CompilerFlavor, VersionRange)] -> String -> String -> String -> String -> String -> [Dependency] -> VersionRange -> BuildType -> Maybe Library -> [Executable] -> [FilePath] -> [FilePath] -> [FilePath] -> PackageDescription-package :: PackageDescription -> PackageIdentifier-license :: PackageDescription -> License-licenseFile :: PackageDescription -> FilePath-copyright :: PackageDescription -> String-maintainer :: PackageDescription -> String-author :: PackageDescription -> String-stability :: PackageDescription -> String-testedWith :: PackageDescription -> [(CompilerFlavor, VersionRange)]-homepage :: PackageDescription -> String-pkgUrl :: PackageDescription -> String-synopsis :: PackageDescription -> String-description :: PackageDescription -> String-category :: PackageDescription -> String-buildDepends :: PackageDescription -> [Dependency]-descCabalVersion :: PackageDescription -> VersionRange-buildType :: PackageDescription -> BuildType-library :: PackageDescription -> Maybe Library-executables :: PackageDescription -> [Executable]-dataFiles :: PackageDescription -> [FilePath]-extraSrcFiles :: PackageDescription -> [FilePath]-extraTmpFiles :: PackageDescription -> [FilePath]-instance Eq PackageDescription-instance Read PackageDescription-instance Show PackageDescription-data GenericPackageDescription-GenericPackageDescription :: PackageDescription -> [Flag] -> Maybe (CondTree ConfVar [Dependency] Library) -> [(String, CondTree ConfVar [Dependency] Executable)] -> GenericPackageDescription-packageDescription :: GenericPackageDescription -> PackageDescription-genPackageFlags :: GenericPackageDescription -> [Flag]-condLibrary :: GenericPackageDescription -> Maybe (CondTree ConfVar [Dependency] Library)-condExecutables :: GenericPackageDescription -> [(String, CondTree ConfVar [Dependency] Executable)]-instance Show GenericPackageDescription-finalizePackageDescription :: [(String, Bool)] -> Maybe [PackageIdentifier] -> String -> String -> (String, Version) -> GenericPackageDescription -> Either [Dependency] (PackageDescription, [(String, Bool)])-flattenPackageDescription :: GenericPackageDescription -> PackageDescription-emptyPackageDescription :: PackageDescription-readPackageDescription :: Verbosity -> FilePath -> IO GenericPackageDescription-writePackageDescription :: FilePath -> PackageDescription -> IO ()-parsePackageDescription :: String -> ParseResult GenericPackageDescription-showPackageDescription :: PackageDescription -> String-data BuildType-Simple :: BuildType-Configure :: BuildType-Make :: BuildType-Custom :: BuildType-instance Eq BuildType-instance Read BuildType-instance Show BuildType-data Library-Library :: [String] -> BuildInfo -> Library-exposedModules :: Library -> [String]-libBuildInfo :: Library -> BuildInfo-instance Eq Library-instance Monoid Library-instance Read Library-instance Show Library-withLib :: PackageDescription -> a -> (Library -> IO a) -> IO a-hasLibs :: PackageDescription -> Bool-libModules :: PackageDescription -> [String]-data Executable-Executable :: String -> FilePath -> BuildInfo -> Executable-exeName :: Executable -> String-modulePath :: Executable -> FilePath-buildInfo :: Executable -> BuildInfo-instance Eq Executable-instance Monoid Executable-instance Read Executable-instance Show Executable-withExe :: PackageDescription -> (Executable -> IO a) -> IO ()-hasExes :: PackageDescription -> Bool-exeModules :: PackageDescription -> [String]-data FieldDescr a-FieldDescr :: String -> (a -> Doc) -> (LineNo -> String -> a -> ParseResult a) -> FieldDescr a-fieldName :: FieldDescr a -> String-fieldGet :: FieldDescr a -> a -> Doc-fieldSet :: FieldDescr a -> LineNo -> String -> a -> ParseResult a-type LineNo = Int-sanityCheckPackage :: PackageDescription -> IO ([String], [String])-data BuildInfo-BuildInfo :: Bool -> [Dependency] -> [String] -> [String] -> [String] -> [Dependency] -> [String] -> [FilePath] -> [FilePath] -> [String] -> [Extension] -> [String] -> [String] -> [FilePath] -> [FilePath] -> [FilePath] -> [(CompilerFlavor, [String])] -> [String] -> [String] -> BuildInfo-buildable :: BuildInfo -> Bool-buildTools :: BuildInfo -> [Dependency]-cppOptions :: BuildInfo -> [String]-ccOptions :: BuildInfo -> [String]-ldOptions :: BuildInfo -> [String]-pkgconfigDepends :: BuildInfo -> [Dependency]-frameworks :: BuildInfo -> [String]-cSources :: BuildInfo -> [FilePath]-hsSourceDirs :: BuildInfo -> [FilePath]-otherModules :: BuildInfo -> [String]-extensions :: BuildInfo -> [Extension]-extraLibs :: BuildInfo -> [String]-extraLibDirs :: BuildInfo -> [String]-includeDirs :: BuildInfo -> [FilePath]-includes :: BuildInfo -> [FilePath]-installIncludes :: BuildInfo -> [FilePath]-options :: BuildInfo -> [(CompilerFlavor, [String])]-ghcProfOptions :: BuildInfo -> [String]-ghcSharedOptions :: BuildInfo -> [String]-instance Eq BuildInfo-instance Read BuildInfo-instance Show BuildInfo-emptyBuildInfo :: BuildInfo-allBuildInfo :: PackageDescription -> [BuildInfo]-type HookedBuildInfo = (Maybe BuildInfo, [(String, BuildInfo)])-emptyHookedBuildInfo :: HookedBuildInfo-readHookedBuildInfo :: Verbosity -> FilePath -> IO HookedBuildInfo-parseHookedBuildInfo :: String -> ParseResult HookedBuildInfo-writeHookedBuildInfo :: FilePath -> HookedBuildInfo -> IO ()-showHookedBuildInfo :: HookedBuildInfo -> String-updatePackageDescription :: HookedBuildInfo -> PackageDescription -> PackageDescription-satisfyDependency :: [PackageIdentifier] -> Dependency -> Maybe PackageIdentifier-data ParseResult a-ParseFailed :: PError -> ParseResult a-ParseOk :: [PWarning] -> a -> ParseResult a-instance Monad ParseResult-instance Show a => Show (ParseResult a)-hcOptions :: CompilerFlavor -> [(CompilerFlavor, [String])] -> [String]-autogenModuleName :: PackageDescription -> String-haddockName :: PackageDescription -> FilePath-setupMessage :: Verbosity -> String -> PackageDescription -> IO ()-cabalVersion :: Version--module Distribution.Simple.Program-data Program-Program :: String -> (Verbosity -> IO (Maybe FilePath)) -> (Verbosity -> FilePath -> IO (Maybe Version)) -> Program-programName :: Program -> String-programFindLocation :: Program -> Verbosity -> IO (Maybe FilePath)-programFindVersion :: Program -> Verbosity -> FilePath -> IO (Maybe Version)-simpleProgram :: String -> Program-findProgramOnPath :: FilePath -> Verbosity -> IO (Maybe FilePath)-findProgramVersion :: ProgArg -> (String -> String) -> Verbosity -> FilePath -> IO (Maybe Version)-data ConfiguredProgram-ConfiguredProgram :: String -> Maybe Version -> [ProgArg] -> ProgramLocation -> ConfiguredProgram-programId :: ConfiguredProgram -> String-programVersion :: ConfiguredProgram -> Maybe Version-programArgs :: ConfiguredProgram -> [ProgArg]-programLocation :: ConfiguredProgram -> ProgramLocation-instance Read ConfiguredProgram-instance Show ConfiguredProgram-programPath :: ConfiguredProgram -> FilePath-type ProgArg = String-data ProgramLocation-UserSpecified :: FilePath -> ProgramLocation-locationPath :: ProgramLocation -> FilePath-FoundOnSystem :: FilePath -> ProgramLocation-locationPath :: ProgramLocation -> FilePath-instance Read ProgramLocation-instance Show ProgramLocation-rawSystemProgram :: Verbosity -> ConfiguredProgram -> [ProgArg] -> IO ()-rawSystemProgramStdout :: Verbosity -> ConfiguredProgram -> [ProgArg] -> IO String-builtinPrograms :: [Program]-data ProgramConfiguration-instance Read ProgramConfiguration-instance Show ProgramConfiguration-emptyProgramConfiguration :: ProgramConfiguration-defaultProgramConfiguration :: ProgramConfiguration-addKnownProgram :: Program -> ProgramConfiguration -> ProgramConfiguration-lookupKnownProgram :: String -> ProgramConfiguration -> Maybe Program-knownPrograms :: ProgramConfiguration -> [(Program, Maybe ConfiguredProgram)]-userSpecifyPath :: String -> FilePath -> ProgramConfiguration -> ProgramConfiguration-userMaybeSpecifyPath :: String -> Maybe FilePath -> ProgramConfiguration -> ProgramConfiguration-userSpecifyArgs :: String -> [ProgArg] -> ProgramConfiguration -> ProgramConfiguration-lookupProgram :: Program -> ProgramConfiguration -> Maybe ConfiguredProgram-updateProgram :: ConfiguredProgram -> ProgramConfiguration -> ProgramConfiguration-configureAllKnownPrograms :: Verbosity -> ProgramConfiguration -> IO ProgramConfiguration-requireProgram :: Verbosity -> Program -> VersionRange -> ProgramConfiguration -> IO (ConfiguredProgram, ProgramConfiguration)-rawSystemProgramConf :: Verbosity -> Program -> ProgramConfiguration -> [ProgArg] -> IO ()-rawSystemProgramStdoutConf :: Verbosity -> Program -> ProgramConfiguration -> [ProgArg] -> IO String-ghcProgram :: Program-ghcPkgProgram :: Program-nhcProgram :: Program-hmakeProgram :: Program-jhcProgram :: Program-hugsProgram :: Program-ffihugsProgram :: Program-ranlibProgram :: Program-arProgram :: Program-happyProgram :: Program-alexProgram :: Program-hsc2hsProgram :: Program-c2hsProgram :: Program-cpphsProgram :: Program-hscolourProgram :: Program-haddockProgram :: Program-greencardProgram :: Program-ldProgram :: Program-tarProgram :: Program-cppProgram :: Program-pfesetupProgram :: Program-pkgConfigProgram :: Program--module Distribution.Simple.Setup-data Action-ConfigCmd :: ConfigFlags -> Action-BuildCmd :: Action-CleanCmd :: Action-CopyCmd :: CopyDest -> Action-HscolourCmd :: Action-HaddockCmd :: Action-ProgramaticaCmd :: Action-InstallCmd :: Action-SDistCmd :: Action-MakefileCmd :: Action-TestCmd :: Action-RegisterCmd :: Action-UnregisterCmd :: Action-HelpCmd :: Action-instance Show Action-data ConfigFlags-ConfigFlags :: ProgramConfiguration -> Maybe CompilerFlavor -> Maybe FilePath -> Maybe FilePath -> Bool -> Bool -> Bool -> Bool -> [String] -> Bool -> Maybe FilePath -> Maybe FilePath -> Maybe FilePath -> Maybe FilePath -> Maybe FilePath -> Maybe FilePath -> Maybe FilePath -> Maybe FilePath -> Maybe FilePath -> Maybe FilePath -> Verbosity -> PackageDB -> Bool -> Bool -> [(String, Bool)] -> ConfigFlags-configPrograms :: ConfigFlags -> ProgramConfiguration-configHcFlavor :: ConfigFlags -> Maybe CompilerFlavor-configHcPath :: ConfigFlags -> Maybe FilePath-configHcPkg :: ConfigFlags -> Maybe FilePath-configVanillaLib :: ConfigFlags -> Bool-configProfLib :: ConfigFlags -> Bool-configSharedLib :: ConfigFlags -> Bool-configProfExe :: ConfigFlags -> Bool-configConfigureArgs :: ConfigFlags -> [String]-configOptimization :: ConfigFlags -> Bool-configPrefix :: ConfigFlags -> Maybe FilePath-configBinDir :: ConfigFlags -> Maybe FilePath-configLibDir :: ConfigFlags -> Maybe FilePath-configLibSubDir :: ConfigFlags -> Maybe FilePath-configLibExecDir :: ConfigFlags -> Maybe FilePath-configDataDir :: ConfigFlags -> Maybe FilePath-configDataSubDir :: ConfigFlags -> Maybe FilePath-configDocDir :: ConfigFlags -> Maybe FilePath-configHtmlDir :: ConfigFlags -> Maybe FilePath-configInterfaceDir :: ConfigFlags -> Maybe FilePath-configVerbose :: ConfigFlags -> Verbosity-configPackageDB :: ConfigFlags -> PackageDB-configGHCiLib :: ConfigFlags -> Bool-configSplitObjs :: ConfigFlags -> Bool-configConfigurationsFlags :: ConfigFlags -> [(String, Bool)]-instance Show ConfigFlags-emptyConfigFlags :: ProgramConfiguration -> ConfigFlags-configureArgs :: ConfigFlags -> [String]-data CopyFlags-CopyFlags :: CopyDest -> Verbosity -> CopyFlags-copyDest :: CopyFlags -> CopyDest-copyVerbose :: CopyFlags -> Verbosity-instance Show CopyFlags-data CopyDest-NoCopyDest :: CopyDest-CopyTo :: FilePath -> CopyDest-CopyPrefix :: FilePath -> CopyDest-instance Eq CopyDest-instance Show CopyDest-emptyCopyFlags :: CopyDest -> CopyFlags-data InstallFlags-InstallFlags :: Maybe PackageDB -> Verbosity -> InstallFlags-installPackageDB :: InstallFlags -> Maybe PackageDB-installVerbose :: InstallFlags -> Verbosity-instance Show InstallFlags-emptyInstallFlags :: InstallFlags-data HaddockFlags-HaddockFlags :: Bool -> Maybe String -> Bool -> Maybe FilePath -> Bool -> Maybe FilePath -> Verbosity -> HaddockFlags-haddockHoogle :: HaddockFlags -> Bool-haddockHtmlLocation :: HaddockFlags -> Maybe String-haddockExecutables :: HaddockFlags -> Bool-haddockCss :: HaddockFlags -> Maybe FilePath-haddockHscolour :: HaddockFlags -> Bool-haddockHscolourCss :: HaddockFlags -> Maybe FilePath-haddockVerbose :: HaddockFlags -> Verbosity-instance Show HaddockFlags-emptyHaddockFlags :: HaddockFlags-data HscolourFlags-HscolourFlags :: Maybe FilePath -> Bool -> Verbosity -> HscolourFlags-hscolourCSS :: HscolourFlags -> Maybe FilePath-hscolourExecutables :: HscolourFlags -> Bool-hscolourVerbose :: HscolourFlags -> Verbosity-instance Show HscolourFlags-emptyHscolourFlags :: HscolourFlags-data BuildFlags-BuildFlags :: Verbosity -> ProgramConfiguration -> BuildFlags-buildVerbose :: BuildFlags -> Verbosity-buildPrograms :: BuildFlags -> ProgramConfiguration-instance Show BuildFlags-emptyBuildFlags :: ProgramConfiguration -> BuildFlags-data CleanFlags-CleanFlags :: Bool -> Verbosity -> CleanFlags-cleanSaveConf :: CleanFlags -> Bool-cleanVerbose :: CleanFlags -> Verbosity-instance Show CleanFlags-emptyCleanFlags :: CleanFlags-data PFEFlags-PFEFlags :: Verbosity -> PFEFlags-pfeVerbose :: PFEFlags -> Verbosity-instance Show PFEFlags-data MakefileFlags-MakefileFlags :: Verbosity -> Maybe FilePath -> MakefileFlags-makefileVerbose :: MakefileFlags -> Verbosity-makefileFile :: MakefileFlags -> Maybe FilePath-instance Show MakefileFlags-emptyMakefileFlags :: MakefileFlags-data RegisterFlags-RegisterFlags :: Maybe PackageDB -> Bool -> Bool -> Maybe FilePath -> Bool -> Verbosity -> RegisterFlags-regPackageDB :: RegisterFlags -> Maybe PackageDB-regGenScript :: RegisterFlags -> Bool-regGenPkgConf :: RegisterFlags -> Bool-regPkgConfFile :: RegisterFlags -> Maybe FilePath-regInPlace :: RegisterFlags -> Bool-regVerbose :: RegisterFlags -> Verbosity-instance Show RegisterFlags-emptyRegisterFlags :: RegisterFlags-data SDistFlags-SDistFlags :: Bool -> Verbosity -> SDistFlags-sDistSnapshot :: SDistFlags -> Bool-sDistVerbose :: SDistFlags -> Verbosity-instance Show SDistFlags-parseGlobalArgs :: ProgramConfiguration -> [String] -> IO (Action, [String])-parseConfigureArgs :: ProgramConfiguration -> ConfigFlags -> [String] -> [OptDescr a] -> IO (ConfigFlags, [a], [String])-parseBuildArgs :: ProgramConfiguration -> BuildFlags -> [String] -> [OptDescr a] -> IO (BuildFlags, [a], [String])-parseCleanArgs :: CleanFlags -> [String] -> [OptDescr a] -> IO (CleanFlags, [a], [String])-parseMakefileArgs :: MakefileFlags -> [String] -> [OptDescr a] -> IO (MakefileFlags, [a], [String])-parseHscolourArgs :: HscolourFlags -> [String] -> [OptDescr a] -> IO (HscolourFlags, [a], [String])-parseHaddockArgs :: HaddockFlags -> [String] -> [OptDescr a] -> IO (HaddockFlags, [a], [String])-parseProgramaticaArgs :: [String] -> [OptDescr a] -> IO (PFEFlags, [a], [String])-parseTestArgs :: [String] -> [OptDescr a] -> IO (Verbosity, [a], [String])-parseInstallArgs :: InstallFlags -> [String] -> [OptDescr a] -> IO (InstallFlags, [a], [String])-parseSDistArgs :: [String] -> [OptDescr a] -> IO (SDistFlags, [a], [String])-parseRegisterArgs :: RegisterFlags -> [String] -> [OptDescr a] -> IO (RegisterFlags, [a], [String])-parseUnregisterArgs :: RegisterFlags -> [String] -> [OptDescr a] -> IO (RegisterFlags, [a], [String])-parseCopyArgs :: CopyFlags -> [String] -> [OptDescr a] -> IO (CopyFlags, [a], [String])-reqPathArg :: (FilePath -> a) -> ArgDescr a-reqDirArg :: (FilePath -> a) -> ArgDescr a--module Distribution.Make-data License-GPL :: License-LGPL :: License-BSD3 :: License-BSD4 :: License-PublicDomain :: License-AllRightsReserved :: License-OtherLicense :: License-instance Eq License-instance Read License-instance Show License-defaultMain :: IO ()-defaultMainArgs :: [String] -> IO ()-defaultMainNoRead :: PackageDescription -> IO ()--module Distribution.Setup--module Distribution.Simple.InstallDirs-data InstallDirs dir-InstallDirs :: dir -> dir -> dir -> dir -> dir -> dir -> dir -> dir -> dir -> dir -> dir -> InstallDirs dir-prefix :: InstallDirs dir -> dir-bindir :: InstallDirs dir -> dir-libdir :: InstallDirs dir -> dir-dynlibdir :: InstallDirs dir -> dir-libexecdir :: InstallDirs dir -> dir-progdir :: InstallDirs dir -> dir-includedir :: InstallDirs dir -> dir-datadir :: InstallDirs dir -> dir-docdir :: InstallDirs dir -> dir-htmldir :: InstallDirs dir -> dir-interfacedir :: InstallDirs dir -> dir-instance Read dir => Read (InstallDirs dir)-instance Show dir => Show (InstallDirs dir)-haddockdir :: InstallDirs FilePath -> PackageDescription -> FilePath-haddockinterfacedir :: InstallDirs FilePath -> PackageDescription -> FilePath-data InstallDirTemplates-InstallDirTemplates :: PathTemplate -> PathTemplate -> PathTemplate -> PathTemplate -> PathTemplate -> PathTemplate -> PathTemplate -> PathTemplate -> PathTemplate -> PathTemplate -> PathTemplate -> PathTemplate -> InstallDirTemplates-prefixDirTemplate :: InstallDirTemplates -> PathTemplate-binDirTemplate :: InstallDirTemplates -> PathTemplate-libDirTemplate :: InstallDirTemplates -> PathTemplate-libSubdirTemplate :: InstallDirTemplates -> PathTemplate-libexecDirTemplate :: InstallDirTemplates -> PathTemplate-progDirTemplate :: InstallDirTemplates -> PathTemplate-includeDirTemplate :: InstallDirTemplates -> PathTemplate-dataDirTemplate :: InstallDirTemplates -> PathTemplate-dataSubdirTemplate :: InstallDirTemplates -> PathTemplate-docDirTemplate :: InstallDirTemplates -> PathTemplate-htmlDirTemplate :: InstallDirTemplates -> PathTemplate-interfaceDirTemplate :: InstallDirTemplates -> PathTemplate-instance Read InstallDirTemplates-instance Show InstallDirTemplates-defaultInstallDirs :: CompilerFlavor -> Bool -> IO InstallDirTemplates-absoluteInstallDirs :: PackageIdentifier -> PackageIdentifier -> CopyDest -> InstallDirTemplates -> InstallDirs FilePath-prefixRelativeInstallDirs :: PackageIdentifier -> PackageIdentifier -> InstallDirTemplates -> InstallDirs (Maybe FilePath)-data PathTemplate-instance Read PathTemplate-instance Show PathTemplate-data PathTemplateVariable-PrefixVar :: PathTemplateVariable-BinDirVar :: PathTemplateVariable-LibDirVar :: PathTemplateVariable-LibSubdirVar :: PathTemplateVariable-DataDirVar :: PathTemplateVariable-DataSubdirVar :: PathTemplateVariable-DocDirVar :: PathTemplateVariable-PkgNameVar :: PathTemplateVariable-PkgVerVar :: PathTemplateVariable-PkgIdVar :: PathTemplateVariable-CompilerVar :: PathTemplateVariable-instance Eq PathTemplateVariable-instance Read PathTemplateVariable-instance Show PathTemplateVariable-toPathTemplate :: FilePath -> PathTemplate-fromPathTemplate :: PathTemplate -> FilePath-substPathTemplate :: [(PathTemplateVariable, PathTemplate)] -> PathTemplate -> PathTemplate-initialPathTemplateEnv :: PackageIdentifier -> PackageIdentifier -> [(PathTemplateVariable, PathTemplate)]--module Distribution.Simple.LocalBuildInfo-data LocalBuildInfo-LocalBuildInfo :: InstallDirTemplates -> Compiler -> FilePath -> FilePath -> [PackageIdentifier] -> Maybe FilePath -> PackageDescription -> ProgramConfiguration -> PackageDB -> Bool -> Bool -> Bool -> Bool -> Bool -> Bool -> Bool -> LocalBuildInfo-installDirTemplates :: LocalBuildInfo -> InstallDirTemplates-compiler :: LocalBuildInfo -> Compiler-buildDir :: LocalBuildInfo -> FilePath-scratchDir :: LocalBuildInfo -> FilePath-packageDeps :: LocalBuildInfo -> [PackageIdentifier]-pkgDescrFile :: LocalBuildInfo -> Maybe FilePath-localPkgDescr :: LocalBuildInfo -> PackageDescription-withPrograms :: LocalBuildInfo -> ProgramConfiguration-withPackageDB :: LocalBuildInfo -> PackageDB-withVanillaLib :: LocalBuildInfo -> Bool-withProfLib :: LocalBuildInfo -> Bool-withSharedLib :: LocalBuildInfo -> Bool-withProfExe :: LocalBuildInfo -> Bool-withOptimization :: LocalBuildInfo -> Bool-withGHCiLib :: LocalBuildInfo -> Bool-splitObjs :: LocalBuildInfo -> Bool-instance Read LocalBuildInfo-instance Show LocalBuildInfo-absoluteInstallDirs :: PackageDescription -> LocalBuildInfo -> CopyDest -> InstallDirs FilePath-prefixRelativeInstallDirs :: PackageDescription -> LocalBuildInfo -> InstallDirs (Maybe FilePath)-mkLibDir :: PackageDescription -> LocalBuildInfo -> CopyDest -> FilePath-mkBinDir :: PackageDescription -> LocalBuildInfo -> CopyDest -> FilePath-mkLibexecDir :: PackageDescription -> LocalBuildInfo -> CopyDest -> FilePath-mkDataDir :: PackageDescription -> LocalBuildInfo -> CopyDest -> FilePath-distPref :: FilePath-srcPref :: FilePath-hscolourPref :: PackageDescription -> FilePath-haddockPref :: PackageDescription -> FilePath-autogenModulesDir :: LocalBuildInfo -> String--module Distribution.Simple.GHC.PackageConfig-data GHCPackageConfig-GHCPackage :: String -> Bool -> [String] -> [String] -> [String] -> [String] -> [String] -> [String] -> [String] -> [String] -> [String] -> [String] -> [String] -> [String] -> [String] -> GHCPackageConfig-name :: GHCPackageConfig -> String-auto :: GHCPackageConfig -> Bool-import_dirs :: GHCPackageConfig -> [String]-source_dirs :: GHCPackageConfig -> [String]-library_dirs :: GHCPackageConfig -> [String]-hs_libraries :: GHCPackageConfig -> [String]-extra_libraries :: GHCPackageConfig -> [String]-include_dirs :: GHCPackageConfig -> [String]-c_includes :: GHCPackageConfig -> [String]-package_deps :: GHCPackageConfig -> [String]-extra_ghc_opts :: GHCPackageConfig -> [String]-extra_cc_opts :: GHCPackageConfig -> [String]-extra_ld_opts :: GHCPackageConfig -> [String]-framework_dirs :: GHCPackageConfig -> [String]-extra_frameworks :: GHCPackageConfig -> [String]-mkGHCPackageConfig :: PackageDescription -> LocalBuildInfo -> GHCPackageConfig-defaultGHCPackageConfig :: GHCPackageConfig-showGHCPackageConfig :: GHCPackageConfig -> String-localPackageConfig :: IO FilePath-maybeCreateLocalPackageConfig :: IO Bool-canWriteLocalPackageConfig :: IO Bool-canReadLocalPackageConfig :: IO Bool--module Distribution.Simple.GHC-configure :: Verbosity -> Maybe FilePath -> Maybe FilePath -> ProgramConfiguration -> IO (Compiler, ProgramConfiguration)-getInstalledPackages :: Verbosity -> PackageDB -> ProgramConfiguration -> IO [PackageIdentifier]-build :: PackageDescription -> LocalBuildInfo -> Verbosity -> IO ()-makefile :: PackageDescription -> LocalBuildInfo -> MakefileFlags -> IO ()-installLib :: Verbosity -> LocalBuildInfo -> FilePath -> FilePath -> FilePath -> PackageDescription -> IO ()-installExe :: Verbosity -> FilePath -> FilePath -> PackageDescription -> IO ()-ghcVerbosityOptions :: Verbosity -> [String]--module Distribution.Simple.JHC-configure :: Verbosity -> Maybe FilePath -> Maybe FilePath -> ProgramConfiguration -> IO (Compiler, ProgramConfiguration)-getInstalledPackages :: Verbosity -> PackageDB -> ProgramConfiguration -> IO [PackageIdentifier]-build :: PackageDescription -> LocalBuildInfo -> Verbosity -> IO ()-installLib :: Verbosity -> FilePath -> FilePath -> PackageDescription -> Library -> IO ()-installExe :: Verbosity -> FilePath -> FilePath -> PackageDescription -> Executable -> IO ()--module Distribution.Simple.NHC-configure :: Verbosity -> Maybe FilePath -> Maybe FilePath -> ProgramConfiguration -> IO (Compiler, ProgramConfiguration)-build :: PackageDescription -> LocalBuildInfo -> Verbosity -> IO ()--module Distribution.Simple.PreProcess-preprocessSources :: PackageDescription -> LocalBuildInfo -> Bool -> Verbosity -> [PPSuffixHandler] -> IO ()-knownSuffixHandlers :: [PPSuffixHandler]-ppSuffixes :: [PPSuffixHandler] -> [String]-type PPSuffixHandler = (String, BuildInfo -> LocalBuildInfo -> PreProcessor)-data PreProcessor-PreProcessor :: Bool -> ((FilePath, FilePath) -> (FilePath, FilePath) -> Verbosity -> IO ()) -> PreProcessor-platformIndependent :: PreProcessor -> Bool-runPreProcessor :: PreProcessor -> (FilePath, FilePath) -> (FilePath, FilePath) -> Verbosity -> IO ()-mkSimplePreProcessor :: (FilePath -> FilePath -> Verbosity -> IO ()) -> (FilePath, FilePath) -> (FilePath, FilePath) -> Verbosity -> IO ()-runSimplePreProcessor :: PreProcessor -> FilePath -> FilePath -> Verbosity -> IO ()-removePreprocessed :: [FilePath] -> [String] -> [String] -> IO ()-removePreprocessedPackage :: PackageDescription -> FilePath -> [String] -> IO ()-ppCpp :: BuildInfo -> LocalBuildInfo -> PreProcessor-ppCpp' :: [String] -> BuildInfo -> LocalBuildInfo -> PreProcessor-ppGreenCard :: BuildInfo -> LocalBuildInfo -> PreProcessor-ppC2hs :: BuildInfo -> LocalBuildInfo -> PreProcessor-ppHsc2hs :: BuildInfo -> LocalBuildInfo -> PreProcessor-ppHappy :: BuildInfo -> LocalBuildInfo -> PreProcessor-ppAlex :: BuildInfo -> LocalBuildInfo -> PreProcessor-ppUnlit :: PreProcessor--module Distribution.Simple.Hugs-configure :: Verbosity -> Maybe FilePath -> Maybe FilePath -> ProgramConfiguration -> IO (Compiler, ProgramConfiguration)-build :: PackageDescription -> LocalBuildInfo -> Verbosity -> IO ()-install :: Verbosity -> FilePath -> FilePath -> FilePath -> FilePath -> FilePath -> PackageDescription -> IO ()--module Distribution.Simple.Install-install :: PackageDescription -> LocalBuildInfo -> CopyFlags -> IO ()--module Distribution.Simple.Register-register :: PackageDescription -> LocalBuildInfo -> RegisterFlags -> IO ()-unregister :: PackageDescription -> LocalBuildInfo -> RegisterFlags -> IO ()-writeInstalledConfig :: PackageDescription -> LocalBuildInfo -> Bool -> Maybe FilePath -> IO ()-removeInstalledConfig :: IO ()-removeRegScripts :: IO ()--module Distribution.Simple.Configure-configure :: (Either GenericPackageDescription PackageDescription, HookedBuildInfo) -> ConfigFlags -> IO LocalBuildInfo-writePersistBuildConfig :: LocalBuildInfo -> IO ()-getPersistBuildConfig :: IO LocalBuildInfo-checkPersistBuildConfig :: FilePath -> IO ()-maybeGetPersistBuildConfig :: IO (Maybe LocalBuildInfo)-localBuildInfoFile :: FilePath-getInstalledPackages :: Verbosity -> Compiler -> PackageDB -> ProgramConfiguration -> IO (Maybe [PackageIdentifier])-configDependency :: Verbosity -> [PackageIdentifier] -> Dependency -> IO PackageIdentifier-configCompiler :: Maybe CompilerFlavor -> Maybe FilePath -> Maybe FilePath -> ProgramConfiguration -> Verbosity -> IO (Compiler, ProgramConfiguration)-configCompilerAux :: ConfigFlags -> IO (Compiler, ProgramConfiguration)--module Distribution.Simple.Build-build :: PackageDescription -> LocalBuildInfo -> BuildFlags -> [PPSuffixHandler] -> IO ()-makefile :: PackageDescription -> LocalBuildInfo -> MakefileFlags -> [PPSuffixHandler] -> IO ()-initialBuildSteps :: PackageDescription -> LocalBuildInfo -> Verbosity -> [PPSuffixHandler] -> IO ()--module Distribution.Simple.Haddock-haddock :: PackageDescription -> LocalBuildInfo -> [PPSuffixHandler] -> HaddockFlags -> IO ()-hscolour :: PackageDescription -> LocalBuildInfo -> [PPSuffixHandler] -> HscolourFlags -> IO ()--module Distribution.Simple.SrcDist-sdist :: PackageDescription -> Maybe LocalBuildInfo -> SDistFlags -> FilePath -> FilePath -> [PPSuffixHandler] -> IO ()-createArchive :: PackageDescription -> Verbosity -> Maybe LocalBuildInfo -> FilePath -> FilePath -> IO FilePath-prepareTree :: PackageDescription -> Verbosity -> Maybe LocalBuildInfo -> Bool -> FilePath -> [PPSuffixHandler] -> Int -> IO FilePath-tarBallName :: PackageDescription -> FilePath-copyFileTo :: Verbosity -> FilePath -> FilePath -> IO ()--module Distribution.Simple-defaultMain :: IO ()-defaultMainNoRead :: PackageDescription -> IO ()-defaultMainArgs :: [String] -> IO ()-data UserHooks-UserHooks :: (Args -> Bool -> PackageDescription -> LocalBuildInfo -> IO ()) -> IO (Maybe PackageDescription) -> [PPSuffixHandler] -> [Program] -> (Args -> ConfigFlags -> IO HookedBuildInfo) -> ((Either GenericPackageDescription PackageDescription, HookedBuildInfo) -> ConfigFlags -> IO LocalBuildInfo) -> (Args -> ConfigFlags -> PackageDescription -> LocalBuildInfo -> IO ()) -> (Args -> BuildFlags -> IO HookedBuildInfo) -> (PackageDescription -> LocalBuildInfo -> UserHooks -> BuildFlags -> IO ()) -> (Args -> BuildFlags -> PackageDescription -> LocalBuildInfo -> IO ()) -> (Args -> MakefileFlags -> IO HookedBuildInfo) -> (PackageDescription -> LocalBuildInfo -> UserHooks -> MakefileFlags -> IO ()) -> (Args -> MakefileFlags -> PackageDescription -> LocalBuildInfo -> IO ()) -> (Args -> CleanFlags -> IO HookedBuildInfo) -> (PackageDescription -> Maybe LocalBuildInfo -> UserHooks -> CleanFlags -> IO ()) -> (Args -> CleanFlags -> PackageDescription -> Maybe LocalBuildInfo -> IO ()) -> (Args -> CopyFlags -> IO HookedBuildInfo) -> (PackageDescription -> LocalBuildInfo -> UserHooks -> CopyFlags -> IO ()) -> (Args -> CopyFlags -> PackageDescription -> LocalBuildInfo -> IO ()) -> (Args -> InstallFlags -> IO HookedBuildInfo) -> (PackageDescription -> LocalBuildInfo -> UserHooks -> InstallFlags -> IO ()) -> (Args -> InstallFlags -> PackageDescription -> LocalBuildInfo -> IO ()) -> (Args -> SDistFlags -> IO HookedBuildInfo) -> (PackageDescription -> Maybe LocalBuildInfo -> UserHooks -> SDistFlags -> IO ()) -> (Args -> SDistFlags -> PackageDescription -> Maybe LocalBuildInfo -> IO ()) -> (Args -> RegisterFlags -> IO HookedBuildInfo) -> (PackageDescription -> LocalBuildInfo -> UserHooks -> RegisterFlags -> IO ()) -> (Args -> RegisterFlags -> PackageDescription -> LocalBuildInfo -> IO ()) -> (Args -> RegisterFlags -> IO HookedBuildInfo) -> (PackageDescription -> LocalBuildInfo -> UserHooks -> RegisterFlags -> IO ()) -> (Args -> RegisterFlags -> PackageDescription -> LocalBuildInfo -> IO ()) -> (Args -> HscolourFlags -> IO HookedBuildInfo) -> (PackageDescription -> LocalBuildInfo -> UserHooks -> HscolourFlags -> IO ()) -> (Args -> HscolourFlags -> PackageDescription -> LocalBuildInfo -> IO ()) -> (Args -> HaddockFlags -> IO HookedBuildInfo) -> (PackageDescription -> LocalBuildInfo -> UserHooks -> HaddockFlags -> IO ()) -> (Args -> HaddockFlags -> PackageDescription -> LocalBuildInfo -> IO ()) -> (Args -> PFEFlags -> IO HookedBuildInfo) -> (PackageDescription -> LocalBuildInfo -> UserHooks -> PFEFlags -> IO ()) -> (Args -> PFEFlags -> PackageDescription -> LocalBuildInfo -> IO ()) -> UserHooks-runTests :: UserHooks -> Args -> Bool -> PackageDescription -> LocalBuildInfo -> IO ()-readDesc :: UserHooks -> IO (Maybe PackageDescription)-hookedPreProcessors :: UserHooks -> [PPSuffixHandler]-hookedPrograms :: UserHooks -> [Program]-preConf :: UserHooks -> Args -> ConfigFlags -> IO HookedBuildInfo-confHook :: UserHooks -> (Either GenericPackageDescription PackageDescription, HookedBuildInfo) -> ConfigFlags -> IO LocalBuildInfo-postConf :: UserHooks -> Args -> ConfigFlags -> PackageDescription -> LocalBuildInfo -> IO ()-preBuild :: UserHooks -> Args -> BuildFlags -> IO HookedBuildInfo-buildHook :: UserHooks -> PackageDescription -> LocalBuildInfo -> UserHooks -> BuildFlags -> IO ()-postBuild :: UserHooks -> Args -> BuildFlags -> PackageDescription -> LocalBuildInfo -> IO ()-preMakefile :: UserHooks -> Args -> MakefileFlags -> IO HookedBuildInfo-makefileHook :: UserHooks -> PackageDescription -> LocalBuildInfo -> UserHooks -> MakefileFlags -> IO ()-postMakefile :: UserHooks -> Args -> MakefileFlags -> PackageDescription -> LocalBuildInfo -> IO ()-preClean :: UserHooks -> Args -> CleanFlags -> IO HookedBuildInfo-cleanHook :: UserHooks -> PackageDescription -> Maybe LocalBuildInfo -> UserHooks -> CleanFlags -> IO ()-postClean :: UserHooks -> Args -> CleanFlags -> PackageDescription -> Maybe LocalBuildInfo -> IO ()-preCopy :: UserHooks -> Args -> CopyFlags -> IO HookedBuildInfo-copyHook :: UserHooks -> PackageDescription -> LocalBuildInfo -> UserHooks -> CopyFlags -> IO ()-postCopy :: UserHooks -> Args -> CopyFlags -> PackageDescription -> LocalBuildInfo -> IO ()-preInst :: UserHooks -> Args -> InstallFlags -> IO HookedBuildInfo-instHook :: UserHooks -> PackageDescription -> LocalBuildInfo -> UserHooks -> InstallFlags -> IO ()-postInst :: UserHooks -> Args -> InstallFlags -> PackageDescription -> LocalBuildInfo -> IO ()-preSDist :: UserHooks -> Args -> SDistFlags -> IO HookedBuildInfo-sDistHook :: UserHooks -> PackageDescription -> Maybe LocalBuildInfo -> UserHooks -> SDistFlags -> IO ()-postSDist :: UserHooks -> Args -> SDistFlags -> PackageDescription -> Maybe LocalBuildInfo -> IO ()-preReg :: UserHooks -> Args -> RegisterFlags -> IO HookedBuildInfo-regHook :: UserHooks -> PackageDescription -> LocalBuildInfo -> UserHooks -> RegisterFlags -> IO ()-postReg :: UserHooks -> Args -> RegisterFlags -> PackageDescription -> LocalBuildInfo -> IO ()-preUnreg :: UserHooks -> Args -> RegisterFlags -> IO HookedBuildInfo-unregHook :: UserHooks -> PackageDescription -> LocalBuildInfo -> UserHooks -> RegisterFlags -> IO ()-postUnreg :: UserHooks -> Args -> RegisterFlags -> PackageDescription -> LocalBuildInfo -> IO ()-preHscolour :: UserHooks -> Args -> HscolourFlags -> IO HookedBuildInfo-hscolourHook :: UserHooks -> PackageDescription -> LocalBuildInfo -> UserHooks -> HscolourFlags -> IO ()-postHscolour :: UserHooks -> Args -> HscolourFlags -> PackageDescription -> LocalBuildInfo -> IO ()-preHaddock :: UserHooks -> Args -> HaddockFlags -> IO HookedBuildInfo-haddockHook :: UserHooks -> PackageDescription -> LocalBuildInfo -> UserHooks -> HaddockFlags -> IO ()-postHaddock :: UserHooks -> Args -> HaddockFlags -> PackageDescription -> LocalBuildInfo -> IO ()-prePFE :: UserHooks -> Args -> PFEFlags -> IO HookedBuildInfo-pfeHook :: UserHooks -> PackageDescription -> LocalBuildInfo -> UserHooks -> PFEFlags -> IO ()-postPFE :: UserHooks -> Args -> PFEFlags -> PackageDescription -> LocalBuildInfo -> IO ()-type Args = [String]-defaultMainWithHooks :: UserHooks -> IO ()-defaultMainWithHooksArgs :: UserHooks -> [String] -> IO ()-simpleUserHooks :: UserHooks-defaultUserHooks :: UserHooks-emptyUserHooks :: UserHooks-defaultHookedPackageDesc :: IO (Maybe FilePath)--module Distribution.Simple.SetupWrapper-setupWrapper :: [String] -> Maybe FilePath -> IO ()--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Test.HUnit.Terminal-terminalAppearance :: String -> String--module Test.HUnit.Lang-type Assertion = IO ()-assertFailure :: String -> Assertion-performTestCase :: Assertion -> IO (Maybe (Bool, String))--module Test.HUnit.Base-type Assertion = IO ()-assertFailure :: String -> Assertion-assertString :: String -> Assertion-assertBool :: String -> Bool -> Assertion-assertEqual :: (Eq a, Show a) => String -> a -> a -> Assertion-class Assertable t-assert :: Assertable t => t -> Assertion-instance Assertable Bool-instance Assertable ()-instance Assertable t => Assertable (IO t)-instance ListAssertable t => Assertable [t]-class ListAssertable t-listAssert :: ListAssertable t => [t] -> Assertion-instance ListAssertable Char-type AssertionPredicate = IO Bool-class AssertionPredicable t-assertionPredicate :: AssertionPredicable t => t -> AssertionPredicate-instance AssertionPredicable Bool-instance AssertionPredicable t => AssertionPredicable (IO t)-(@?) :: AssertionPredicable t => t -> String -> Assertion-(@=?) :: (Eq a, Show a) => a -> a -> Assertion-(@?=) :: (Eq a, Show a) => a -> a -> Assertion-data Test-TestCase :: Assertion -> Test-TestList :: [Test] -> Test-TestLabel :: String -> Test -> Test-instance Show Test-instance Testable Test-data Node-ListItem :: Int -> Node-Label :: String -> Node-instance Eq Node-instance Read Node-instance Show Node-type Path = [Node]-testCaseCount :: Test -> Int-class Testable t-test :: Testable t => t -> Test-instance Testable Test-instance Assertable t => Testable (IO t)-instance Testable t => Testable [t]-(~?) :: AssertionPredicable t => t -> String -> Test-(~=?) :: (Eq a, Show a) => a -> a -> Test-(~?=) :: (Eq a, Show a) => a -> a -> Test-(~:) :: Testable t => String -> t -> Test-data Counts-Counts :: Int -> Int -> Int -> Int -> Counts-cases :: Counts -> Int-tried :: Counts -> Int-errors :: Counts -> Int-failures :: Counts -> Int-instance Eq Counts-instance Read Counts-instance Show Counts-data State-State :: Path -> Counts -> State-path :: State -> Path-counts :: State -> Counts-instance Eq State-instance Read State-instance Show State-type ReportStart us = State -> us -> IO us-type ReportProblem us = String -> State -> us -> IO us-testCasePaths :: Test -> [Path]-performTest :: ReportStart us -> ReportProblem us -> ReportProblem us -> us -> Test -> IO (Counts, us)--module Test.HUnit.Text-data PutText st-PutText :: (String -> Bool -> st -> IO st) -> st -> PutText st-putTextToHandle :: Handle -> Bool -> PutText Int-putTextToShowS :: PutText ShowS-runTestText :: PutText st -> Test -> IO (Counts, st)-showPath :: Path -> String-showCounts :: Counts -> String-runTestTT :: Test -> IO Counts--module Test.HUnit--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Test.QuickCheck-quickCheck :: Testable a => a -> IO ()-verboseCheck :: Testable a => a -> IO ()-test :: Testable a => a -> IO ()-data Config-Config :: Int -> Int -> (Int -> Int) -> (Int -> [String] -> String) -> Config-configMaxTest :: Config -> Int-configMaxFail :: Config -> Int-configSize :: Config -> Int -> Int-configEvery :: Config -> Int -> [String] -> String-defaultConfig :: Config-check :: Testable a => Config -> a -> IO ()-forAll :: (Show a, Testable b) => Gen a -> (a -> b) -> Property-(==>) :: Testable a => Bool -> a -> Property-label :: Testable a => String -> a -> Property-collect :: (Show a, Testable b) => a -> b -> Property-classify :: Testable a => Bool -> String -> a -> Property-trivial :: Testable a => Bool -> a -> Property-data Gen a-instance Functor Gen-instance Monad Gen-elements :: [a] -> Gen a-two :: Monad m => m a -> m (a, a)-three :: Monad m => m a -> m (a, a, a)-four :: Monad m => m a -> m (a, a, a, a)-sized :: (Int -> Gen a) -> Gen a-resize :: Int -> Gen a -> Gen a-choose :: Random a => (a, a) -> Gen a-oneof :: [Gen a] -> Gen a-frequency :: [(Int, Gen a)] -> Gen a-vector :: Arbitrary a => Int -> Gen [a]-class Arbitrary a-arbitrary :: Arbitrary a => Gen a-coarbitrary :: Arbitrary a => a -> Gen b -> Gen b-instance Arbitrary Bool-instance Arbitrary Double-instance Arbitrary Float-instance Arbitrary Int-instance Arbitrary Integer-instance Arbitrary ()-instance (Arbitrary a, Arbitrary b) => Arbitrary (a, b)-instance (Arbitrary a, Arbitrary b, Arbitrary c) => Arbitrary (a, b, c)-instance (Arbitrary a, Arbitrary b, Arbitrary c, Arbitrary d) => Arbitrary (a, b, c, d)-instance (Arbitrary a, Arbitrary b) => Arbitrary (a -> b)-instance Arbitrary a => Arbitrary (Maybe a)-instance Arbitrary (Poly a)-instance Arbitrary a => Arbitrary [a]-instance (Arbitrary a, Arbitrary b) => Arbitrary (Either a b)-rand :: Gen StdGen-promote :: (a -> Gen b) -> Gen (a -> b)-variant :: Int -> Gen a -> Gen a-class Testable a-property :: Testable a => a -> Property-instance Testable Bool-instance Testable Property-instance Testable Result-instance Testable ()-instance (Arbitrary a, Show a, Testable b) => Testable (a -> b)-data Property-instance Testable Property-data Result-Result :: Maybe Bool -> [String] -> [String] -> Result-ok :: Result -> Maybe Bool-stamp :: Result -> [String]-arguments :: Result -> [String]-instance Testable Result-generate :: Int -> StdGen -> Gen a -> a-evaluate :: Testable a => a -> Gen Result--module Test.QuickCheck.Batch-run :: Testable a => a -> TestOptions -> IO TestResult-runTests :: String -> TestOptions -> [TestOptions -> IO TestResult] -> IO ()-defOpt :: TestOptions-data TestOptions-TestOptions :: Int -> Int -> Bool -> TestOptions-no_of_tests :: TestOptions -> Int-length_of_tests :: TestOptions -> Int-debug_tests :: TestOptions -> Bool-data TestResult-TestOk :: String -> Int -> [[String]] -> TestResult-TestExausted :: String -> Int -> [[String]] -> TestResult-TestFailed :: [String] -> Int -> TestResult-TestAborted :: Exception -> TestResult-isBottom :: a -> Bool-bottom :: a--module Test.QuickCheck.Utils-isAssociativeBy :: (Show a, Testable prop) => (a -> a -> prop) -> Gen a -> (a -> a -> a) -> Property-isAssociative :: (Arbitrary a, Show a, Eq a) => (a -> a -> a) -> Property-isCommutableBy :: (Show a, Testable prop) => (b -> b -> prop) -> Gen a -> (a -> a -> b) -> Property-isCommutable :: (Arbitrary a, Show a, Eq b) => (a -> a -> b) -> Property-isTotalOrder :: (Arbitrary a, Show a, Ord a) => a -> a -> Property--module Test.QuickCheck.Poly-type ALPHA = Poly ALPHA_-type BETA = Poly BETA_-type GAMMA = Poly GAMMA_-type OrdALPHA = Poly OrdALPHA_-type OrdBETA = Poly OrdBETA_-type OrdGAMMA = Poly OrdGAMMA_--module Debug.QuickCheck.Utils--module Debug.QuickCheck.Poly--module Debug.QuickCheck.Batch--module Debug.QuickCheck--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Data.Array--module Data.Array.IArray-class IArray a e-bounds :: (IArray a e, Ix i) => a i e -> (i, i)-instance IArray Array e-instance IArray UArray Bool-instance IArray UArray Char-instance IArray UArray Double-instance IArray UArray Float-instance IArray UArray Int-instance IArray UArray Int16-instance IArray UArray Int32-instance IArray UArray Int64-instance IArray UArray Int8-instance IArray UArray Word-instance IArray UArray Word16-instance IArray UArray Word32-instance IArray UArray Word64-instance IArray UArray Word8-instance IArray UArray (FunPtr a)-instance IArray UArray (Ptr a)-instance IArray UArray (StablePtr a)-instance IArray (IOToDiffArray IOArray) e-instance IArray (IOToDiffArray IOUArray) Char-instance IArray (IOToDiffArray IOUArray) Double-instance IArray (IOToDiffArray IOUArray) Float-instance IArray (IOToDiffArray IOUArray) Int-instance IArray (IOToDiffArray IOUArray) Int16-instance IArray (IOToDiffArray IOUArray) Int32-instance IArray (IOToDiffArray IOUArray) Int64-instance IArray (IOToDiffArray IOUArray) Int8-instance IArray (IOToDiffArray IOUArray) Word-instance IArray (IOToDiffArray IOUArray) Word16-instance IArray (IOToDiffArray IOUArray) Word32-instance IArray (IOToDiffArray IOUArray) Word64-instance IArray (IOToDiffArray IOUArray) Word8-instance IArray (IOToDiffArray IOUArray) (FunPtr a)-instance IArray (IOToDiffArray IOUArray) (Ptr a)-instance IArray (IOToDiffArray IOUArray) (StablePtr a)-array :: (IArray a e, Ix i) => (i, i) -> [(i, e)] -> a i e-listArray :: (IArray a e, Ix i) => (i, i) -> [e] -> a i e-accumArray :: (IArray a e, Ix i) => (e -> e' -> e) -> e -> (i, i) -> [(i, e')] -> a i e-(!) :: (IArray a e, Ix i) => a i e -> i -> e-bounds :: (IArray a e, Ix i) => a i e -> (i, i)-indices :: (IArray a e, Ix i) => a i e -> [i]-elems :: (IArray a e, Ix i) => a i e -> [e]-assocs :: (IArray a e, Ix i) => a i e -> [(i, e)]-(//) :: (IArray a e, Ix i) => a i e -> [(i, e)] -> a i e-accum :: (IArray a e, Ix i) => (e -> e' -> e) -> a i e -> [(i, e')] -> a i e-amap :: (IArray a e', IArray a e, Ix i) => (e' -> e) -> a i e' -> a i e-ixmap :: (IArray a e, Ix i, Ix j) => (i, i) -> (i -> j) -> a j e -> a i e--module Data.Array.MArray-class Monad m => MArray a e m-getBounds :: (MArray a e m, Ix i) => a i e -> m (i, i)-newArray :: (MArray a e m, Ix i) => (i, i) -> e -> m (a i e)-newArray_ :: (MArray a e m, Ix i) => (i, i) -> m (a i e)-instance MArray IOArray e IO-instance MArray IOUArray Bool IO-instance MArray IOUArray Char IO-instance MArray IOUArray Double IO-instance MArray IOUArray Float IO-instance MArray IOUArray Int IO-instance MArray IOUArray Int16 IO-instance MArray IOUArray Int32 IO-instance MArray IOUArray Int64 IO-instance MArray IOUArray Int8 IO-instance MArray IOUArray Word IO-instance MArray IOUArray Word16 IO-instance MArray IOUArray Word32 IO-instance MArray IOUArray Word64 IO-instance MArray IOUArray Word8 IO-instance Storable e => MArray StorableArray e IO-instance MArray IOUArray (FunPtr a) IO-instance MArray IOUArray (Ptr a) IO-instance MArray IOUArray (StablePtr a) IO-instance MArray (STArray s) e (ST s)-instance MArray (STArray s) e (ST s)-instance MArray (STUArray s) Bool (ST s)-instance MArray (STUArray s) Char (ST s)-instance MArray (STUArray s) Double (ST s)-instance MArray (STUArray s) Float (ST s)-instance MArray (STUArray s) Int (ST s)-instance MArray (STUArray s) Int16 (ST s)-instance MArray (STUArray s) Int32 (ST s)-instance MArray (STUArray s) Int64 (ST s)-instance MArray (STUArray s) Int8 (ST s)-instance MArray (STUArray s) Word (ST s)-instance MArray (STUArray s) Word16 (ST s)-instance MArray (STUArray s) Word32 (ST s)-instance MArray (STUArray s) Word64 (ST s)-instance MArray (STUArray s) Word8 (ST s)-instance MArray (STUArray s) (FunPtr a) (ST s)-instance MArray (STUArray s) (Ptr a) (ST s)-instance MArray (STUArray s) (StablePtr a) (ST s)-newArray :: (MArray a e m, Ix i) => (i, i) -> e -> m (a i e)-newArray_ :: (MArray a e m, Ix i) => (i, i) -> m (a i e)-newListArray :: (MArray a e m, Ix i) => (i, i) -> [e] -> m (a i e)-readArray :: (MArray a e m, Ix i) => a i e -> i -> m e-writeArray :: (MArray a e m, Ix i) => a i e -> i -> e -> m ()-mapArray :: (MArray a e' m, MArray a e m, Ix i) => (e' -> e) -> a i e' -> m (a i e)-mapIndices :: (MArray a e m, Ix i, Ix j) => (i, i) -> (i -> j) -> a j e -> m (a i e)-getBounds :: (MArray a e m, Ix i) => a i e -> m (i, i)-getElems :: (MArray a e m, Ix i) => a i e -> m [e]-getAssocs :: (MArray a e m, Ix i) => a i e -> m [(i, e)]-freeze :: (Ix i, MArray a e m, IArray b e) => a i e -> m (b i e)-unsafeFreeze :: (Ix i, MArray a e m, IArray b e) => a i e -> m (b i e)-thaw :: (Ix i, IArray a e, MArray b e m) => a i e -> m (b i e)-unsafeThaw :: (Ix i, IArray a e, MArray b e m) => a i e -> m (b i e)--module Data.Array.ST-runSTArray :: Ix i => ST s (STArray s i e) -> Array i e-data STUArray s i a-instance Typeable3 STUArray-instance MArray (STUArray s) Bool (ST s)-instance MArray (STUArray s) Char (ST s)-instance MArray (STUArray s) Double (ST s)-instance MArray (STUArray s) Float (ST s)-instance MArray (STUArray s) Int (ST s)-instance MArray (STUArray s) Int16 (ST s)-instance MArray (STUArray s) Int32 (ST s)-instance MArray (STUArray s) Int64 (ST s)-instance MArray (STUArray s) Int8 (ST s)-instance MArray (STUArray s) Word (ST s)-instance MArray (STUArray s) Word16 (ST s)-instance MArray (STUArray s) Word32 (ST s)-instance MArray (STUArray s) Word64 (ST s)-instance MArray (STUArray s) Word8 (ST s)-instance MArray (STUArray s) (FunPtr a) (ST s)-instance MArray (STUArray s) (Ptr a) (ST s)-instance MArray (STUArray s) (StablePtr a) (ST s)-instance Eq (STUArray s i e)-runSTUArray :: Ix i => ST s (STUArray s i e) -> UArray i e-castSTUArray :: STUArray s ix a -> ST s (STUArray s ix b)--module Data.Array.Storable-data StorableArray i e-instance Storable e => MArray StorableArray e IO-withStorableArray :: StorableArray i e -> (Ptr e -> IO a) -> IO a-touchStorableArray :: StorableArray i e -> IO ()-unsafeForeignPtrToStorableArray :: Ix i => ForeignPtr e -> (i, i) -> IO (StorableArray i e)--module Data.Array.Unboxed-data UArray i e-instance Typeable2 UArray-instance IArray UArray Bool-instance IArray UArray Char-instance IArray UArray Double-instance IArray UArray Float-instance IArray UArray Int-instance IArray UArray Int16-instance IArray UArray Int32-instance IArray UArray Int64-instance IArray UArray Int8-instance IArray UArray Word-instance IArray UArray Word16-instance IArray UArray Word32-instance IArray UArray Word64-instance IArray UArray Word8-instance IArray UArray (FunPtr a)-instance IArray UArray (Ptr a)-instance IArray UArray (StablePtr a)-instance (Ix ix, Eq e, IArray UArray e) => Eq (UArray ix e)-instance (Ix ix, Ord e, IArray UArray e) => Ord (UArray ix e)-instance (Ix ix, Show ix, Show e, IArray UArray e) => Show (UArray ix e)--module Data.Array.IO-data IOUArray i e-instance Typeable2 IOUArray-instance MArray IOUArray Bool IO-instance MArray IOUArray Char IO-instance MArray IOUArray Double IO-instance MArray IOUArray Float IO-instance MArray IOUArray Int IO-instance MArray IOUArray Int16 IO-instance MArray IOUArray Int32 IO-instance MArray IOUArray Int64 IO-instance MArray IOUArray Int8 IO-instance MArray IOUArray Word IO-instance MArray IOUArray Word16 IO-instance MArray IOUArray Word32 IO-instance MArray IOUArray Word64 IO-instance MArray IOUArray Word8 IO-instance MArray IOUArray (FunPtr a) IO-instance MArray IOUArray (Ptr a) IO-instance MArray IOUArray (StablePtr a) IO-instance IArray (IOToDiffArray IOUArray) Char-instance IArray (IOToDiffArray IOUArray) Double-instance IArray (IOToDiffArray IOUArray) Float-instance IArray (IOToDiffArray IOUArray) Int-instance IArray (IOToDiffArray IOUArray) Int16-instance IArray (IOToDiffArray IOUArray) Int32-instance IArray (IOToDiffArray IOUArray) Int64-instance IArray (IOToDiffArray IOUArray) Int8-instance IArray (IOToDiffArray IOUArray) Word-instance IArray (IOToDiffArray IOUArray) Word16-instance IArray (IOToDiffArray IOUArray) Word32-instance IArray (IOToDiffArray IOUArray) Word64-instance IArray (IOToDiffArray IOUArray) Word8-instance IArray (IOToDiffArray IOUArray) (FunPtr a)-instance IArray (IOToDiffArray IOUArray) (Ptr a)-instance IArray (IOToDiffArray IOUArray) (StablePtr a)-instance Eq (IOUArray i e)-castIOUArray :: IOUArray ix a -> IO (IOUArray ix b)-hGetArray :: Handle -> IOUArray Int Word8 -> Int -> IO Int-hPutArray :: Handle -> IOUArray Int Word8 -> Int -> IO ()--module Data.Array.Diff-data IOToDiffArray a i e-instance IArray (IOToDiffArray IOArray) e-instance IArray (IOToDiffArray IOUArray) Char-instance IArray (IOToDiffArray IOUArray) Double-instance IArray (IOToDiffArray IOUArray) Float-instance IArray (IOToDiffArray IOUArray) Int-instance IArray (IOToDiffArray IOUArray) Int16-instance IArray (IOToDiffArray IOUArray) Int32-instance IArray (IOToDiffArray IOUArray) Int64-instance IArray (IOToDiffArray IOUArray) Int8-instance IArray (IOToDiffArray IOUArray) Word-instance IArray (IOToDiffArray IOUArray) Word16-instance IArray (IOToDiffArray IOUArray) Word32-instance IArray (IOToDiffArray IOUArray) Word64-instance IArray (IOToDiffArray IOUArray) Word8-instance IArray (IOToDiffArray IOUArray) (FunPtr a)-instance IArray (IOToDiffArray IOUArray) (Ptr a)-instance IArray (IOToDiffArray IOUArray) (StablePtr a)-type DiffArray = IOToDiffArray IOArray-instance (Ix ix, Show ix, Show e) => Show (DiffArray ix e)-type DiffUArray = IOToDiffArray IOUArray-instance (Ix ix, Show ix) => Show (DiffUArray ix Char)-instance (Ix ix, Show ix) => Show (DiffUArray ix Double)-instance (Ix ix, Show ix) => Show (DiffUArray ix Float)-instance (Ix ix, Show ix) => Show (DiffUArray ix Int)-instance (Ix ix, Show ix) => Show (DiffUArray ix Int16)-instance (Ix ix, Show ix) => Show (DiffUArray ix Int32)-instance (Ix ix, Show ix) => Show (DiffUArray ix Int64)-instance (Ix ix, Show ix) => Show (DiffUArray ix Int8)-instance (Ix ix, Show ix) => Show (DiffUArray ix Word)-instance (Ix ix, Show ix) => Show (DiffUArray ix Word16)-instance (Ix ix, Show ix) => Show (DiffUArray ix Word32)-instance (Ix ix, Show ix) => Show (DiffUArray ix Word64)-instance (Ix ix, Show ix) => Show (DiffUArray ix Word8)-newDiffArray :: (MArray a e IO, Ix i) => (i, i) -> [(Int, e)] -> IO (IOToDiffArray a i e)-readDiffArray :: (MArray a e IO, Ix i) => IOToDiffArray a i e -> Int -> IO e-replaceDiffArray :: (MArray a e IO, Ix i) => IOToDiffArray a i e -> [(Int, e)] -> IO (IOToDiffArray a i e)--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Control.Arrow.Transformer-class (Arrow a, Arrow (f a)) => ArrowTransformer f a-lift :: ArrowTransformer f a => a b c -> f a b c-instance Arrow a => ArrowTransformer Automaton a-instance Arrow a => ArrowTransformer StreamArrow a-instance ArrowChoice a => ArrowTransformer (ErrorArrow ex) a-instance Arrow a => ArrowTransformer (ReaderArrow r) a-instance Arrow a => ArrowTransformer (StateArrow s) a-instance (Arrow a, Applicative f) => ArrowTransformer (StaticArrow f) a-instance (Arrow a, Monoid w) => ArrowTransformer (WriterArrow w) a--module Control.Arrow.Operations-class Arrow a => ArrowState s a-fetch :: ArrowState s a => a e s-store :: ArrowState s a => a s ()-instance ArrowState s a => ArrowState s (Automaton a)-instance ArrowState s a => ArrowState s (StreamArrow a)-instance (ArrowState s a, ArrowChoice a) => ArrowState s (ErrorArrow ex a)-instance ArrowState s a => ArrowState s (ReaderArrow r a)-instance Arrow a => ArrowState s (StateArrow s a)-instance (ArrowState s a, Applicative f) => ArrowState s (StaticArrow f a)-instance (ArrowState s a, Monoid w) => ArrowState s (WriterArrow w a)-class Arrow a => ArrowReader r a-readState :: ArrowReader r a => a b r-newReader :: ArrowReader r a => a e b -> a (e, r) b-instance ArrowReader r a => ArrowReader r (Automaton a)-instance (ArrowReader r a, ArrowChoice a) => ArrowReader r (ErrorArrow ex a)-instance Arrow a => ArrowReader r (ReaderArrow r a)-instance ArrowReader r a => ArrowReader r (StateArrow s a)-instance (ArrowReader r a, Applicative f) => ArrowReader r (StaticArrow f a)-instance (ArrowReader r a, Monoid w) => ArrowReader r (WriterArrow w a)-class (Monoid w, Arrow a) => ArrowWriter w a-write :: ArrowWriter w a => a w ()-newWriter :: ArrowWriter w a => a e b -> a e (b, w)-instance ArrowWriter w a => ArrowWriter w (Automaton a)-instance ArrowWriter w a => ArrowWriter w (StreamArrow a)-instance ArrowWriter s a => ArrowWriter s (ReaderArrow r a)-instance (ArrowWriter w a, ArrowChoice a) => ArrowWriter w (ErrorArrow ex a)-instance ArrowWriter w a => ArrowWriter w (StateArrow s a)-instance (ArrowWriter w a, Applicative f) => ArrowWriter w (StaticArrow f a)-instance (Arrow a, Monoid w) => ArrowWriter w (WriterArrow w a)-class Arrow a => ArrowError ex a-raise :: ArrowError ex a => a ex b-handle :: ArrowError ex a => a e b -> a (e, ex) b -> a e b-tryInUnless :: ArrowError ex a => a e b -> a (e, b) c -> a (e, ex) c -> a e c-newError :: ArrowError ex a => a e b -> a e (Either ex b)-instance ArrowError r a => ArrowError r (Automaton a)-instance ArrowChoice a => ArrowError ex (ErrorArrow ex a)-instance ArrowError ex a => ArrowError ex (ReaderArrow r a)-instance ArrowError ex a => ArrowError ex (StateArrow s a)-instance (ArrowError ex a, Applicative f) => ArrowError ex (StaticArrow f a)-instance (ArrowError ex a, Monoid w) => ArrowError ex (WriterArrow w a)-tryInUnlessDefault :: (ArrowError ex a, ArrowChoice a) => a e b -> a (e, b) c -> a (e, ex) c -> a e c-class ArrowLoop a => ArrowCircuit a-delay :: ArrowCircuit a => b -> a b b-instance ArrowLoop a => ArrowCircuit (Automaton a)-instance ArrowLoop a => ArrowCircuit (StreamArrow a)-instance ArrowCircuit a => ArrowCircuit (ReaderArrow r a)-instance ArrowCircuit a => ArrowCircuit (StateArrow s a)-instance (ArrowCircuit a, Applicative f) => ArrowCircuit (StaticArrow f a)-instance (ArrowCircuit a, Monoid w) => ArrowCircuit (WriterArrow w a)--module Control.Arrow.Transformer.CoState-data CoStateArrow s a b c-instance Arrow a => Arrow (CoStateArrow s a)-instance ArrowLoop a => ArrowLoop (CoStateArrow s a)-instance ArrowPlus a => ArrowPlus (CoStateArrow s a)-instance ArrowZero a => ArrowZero (CoStateArrow s a)--module Control.Arrow.Transformer.Automaton-data Automaton a b c-instance Arrow a => ArrowTransformer Automaton a-instance ArrowError r a => ArrowError r (Automaton a)-instance ArrowReader r a => ArrowReader r (Automaton a)-instance ArrowState s a => ArrowState s (Automaton a)-instance ArrowWriter w a => ArrowWriter w (Automaton a)-instance ArrowAddReader r a a' => ArrowAddReader r (Automaton a) (Automaton a')-instance ArrowAddState r a a' => ArrowAddState r (Automaton a) (Automaton a')-instance ArrowAddWriter w a a' => ArrowAddWriter w (Automaton a) (Automaton a')-instance Arrow a => Arrow (Automaton a)-instance ArrowChoice a => ArrowChoice (Automaton a)-instance ArrowLoop a => ArrowCircuit (Automaton a)-instance ArrowLoop a => ArrowLoop (Automaton a)-instance ArrowPlus a => ArrowPlus (Automaton a)-instance ArrowZero a => ArrowZero (Automaton a)-instance (ArrowLoop a, ArrowApply a) => ArrowAddStream (Automaton a) a-runAutomaton :: (ArrowLoop a, ArrowApply a) => Automaton a (e, b) c -> a (e, Stream b) (Stream c)--module Control.Arrow.Transformer.Error-data ErrorArrow ex a b c-instance ArrowChoice a => ArrowError ex (ErrorArrow ex a)-instance (ArrowReader r a, ArrowChoice a) => ArrowReader r (ErrorArrow ex a)-instance (ArrowState s a, ArrowChoice a) => ArrowState s (ErrorArrow ex a)-instance (ArrowWriter w a, ArrowChoice a) => ArrowWriter w (ErrorArrow ex a)-instance ArrowChoice a => ArrowAddError ex (ErrorArrow ex a) a-instance (ArrowAddReader r a a', ArrowChoice a, ArrowChoice a') => ArrowAddReader r (ErrorArrow ex a) (ErrorArrow ex a')-instance (ArrowAddState s a a', ArrowChoice a, ArrowChoice a') => ArrowAddState s (ErrorArrow ex a) (ErrorArrow ex a')-instance (ArrowAddWriter w a a', ArrowChoice a, ArrowChoice a') => ArrowAddWriter w (ErrorArrow ex a) (ErrorArrow ex a')-instance ArrowChoice a => ArrowTransformer (ErrorArrow ex) a-instance ArrowChoice a => Arrow (ErrorArrow ex a)-instance (ArrowChoice a, ArrowApply a) => ArrowApply (ErrorArrow ex a)-instance ArrowChoice a => ArrowChoice (ErrorArrow ex a)-instance (ArrowChoice a, ArrowLoop a) => ArrowLoop (ErrorArrow ex a)-instance (Monoid ex, ArrowChoice a) => ArrowPlus (ErrorArrow ex a)-instance (Monoid ex, ArrowChoice a) => ArrowZero (ErrorArrow ex a)-runError :: ArrowChoice a => ErrorArrow ex a e b -> a (e, ex) b -> a e b-class (ArrowError ex a, Arrow a') => ArrowAddError ex a a'-liftError :: ArrowAddError ex a a' => a' e b -> a e b-elimError :: ArrowAddError ex a a' => a e b -> a' (e, ex) b -> a' e b-instance ArrowChoice a => ArrowAddError ex (ErrorArrow ex a) a-instance ArrowAddError ex a a' => ArrowAddError ex (ReaderArrow r a) (ReaderArrow r a')-instance ArrowAddError ex a a' => ArrowAddError ex (StateArrow s a) (StateArrow s a')-instance (ArrowAddError ex a a', Applicative f) => ArrowAddError ex (StaticArrow f a) (StaticArrow f a')-instance (ArrowAddError ex a a', Monoid w) => ArrowAddError ex (WriterArrow w a) (WriterArrow w a')--module Control.Arrow.Transformer.Reader-data ReaderArrow r a b c-instance ArrowError ex a => ArrowError ex (ReaderArrow r a)-instance Arrow a => ArrowReader r (ReaderArrow r a)-instance ArrowState s a => ArrowState s (ReaderArrow r a)-instance ArrowWriter s a => ArrowWriter s (ReaderArrow r a)-instance Arrow a => ArrowAddReader r (ReaderArrow r a) a-instance ArrowAddError ex a a' => ArrowAddError ex (ReaderArrow r a) (ReaderArrow r a')-instance ArrowAddState s a a' => ArrowAddState s (ReaderArrow r a) (ReaderArrow r a')-instance ArrowAddWriter s a a' => ArrowAddWriter s (ReaderArrow r a) (ReaderArrow r a')-instance Arrow a => ArrowTransformer (ReaderArrow r) a-instance Arrow a => Arrow (ReaderArrow r a)-instance ArrowApply a => ArrowApply (ReaderArrow r a)-instance ArrowChoice a => ArrowChoice (ReaderArrow r a)-instance ArrowCircuit a => ArrowCircuit (ReaderArrow r a)-instance ArrowLoop a => ArrowLoop (ReaderArrow r a)-instance ArrowPlus a => ArrowPlus (ReaderArrow r a)-instance ArrowZero a => ArrowZero (ReaderArrow r a)-runReader :: Arrow a => ReaderArrow r a e b -> a (e, r) b-class (ArrowReader r a, Arrow a') => ArrowAddReader r a a'-liftReader :: ArrowAddReader r a a' => a' e b -> a e b-elimReader :: ArrowAddReader r a a' => a e b -> a' (e, r) b-instance ArrowAddReader r a a' => ArrowAddReader r (Automaton a) (Automaton a')-instance Arrow a => ArrowAddReader r (ReaderArrow r a) a-instance (ArrowAddReader r a a', ArrowChoice a, ArrowChoice a') => ArrowAddReader r (ErrorArrow ex a) (ErrorArrow ex a')-instance ArrowAddReader r a a' => ArrowAddReader r (StateArrow s a) (StateArrow s a')-instance (ArrowAddReader r a a', Applicative f) => ArrowAddReader r (StaticArrow f a) (StaticArrow f a')-instance (ArrowAddReader r a a', Monoid w) => ArrowAddReader r (WriterArrow w a) (WriterArrow w a')--module Control.Arrow.Transformer.State-data StateArrow s a b c-instance ArrowError ex a => ArrowError ex (StateArrow s a)-instance ArrowReader r a => ArrowReader r (StateArrow s a)-instance Arrow a => ArrowState s (StateArrow s a)-instance ArrowWriter w a => ArrowWriter w (StateArrow s a)-instance Arrow a => ArrowAddState s (StateArrow s a) a-instance ArrowAddError ex a a' => ArrowAddError ex (StateArrow s a) (StateArrow s a')-instance ArrowAddReader r a a' => ArrowAddReader r (StateArrow s a) (StateArrow s a')-instance ArrowAddWriter w a a' => ArrowAddWriter w (StateArrow s a) (StateArrow s a')-instance Arrow a => ArrowTransformer (StateArrow s) a-instance Arrow a => Arrow (StateArrow s a)-instance ArrowApply a => ArrowApply (StateArrow s a)-instance ArrowChoice a => ArrowChoice (StateArrow s a)-instance ArrowCircuit a => ArrowCircuit (StateArrow s a)-instance ArrowLoop a => ArrowLoop (StateArrow s a)-instance ArrowPlus a => ArrowPlus (StateArrow s a)-instance ArrowZero a => ArrowZero (StateArrow s a)-runState :: Arrow a => StateArrow s a e b -> a (e, s) (b, s)-class (ArrowState s a, Arrow a') => ArrowAddState s a a'-liftState :: ArrowAddState s a a' => a' e b -> a e b-elimState :: ArrowAddState s a a' => a e b -> a' (e, s) (b, s)-instance ArrowAddState r a a' => ArrowAddState r (Automaton a) (Automaton a')-instance Arrow a => ArrowAddState s (StateArrow s a) a-instance (ArrowAddState s a a', ArrowChoice a, ArrowChoice a') => ArrowAddState s (ErrorArrow ex a) (ErrorArrow ex a')-instance ArrowAddState s a a' => ArrowAddState s (ReaderArrow r a) (ReaderArrow r a')-instance (ArrowAddState s a a', Applicative f) => ArrowAddState s (StaticArrow f a) (StaticArrow f a')-instance (ArrowAddState s a a', Monoid w) => ArrowAddState s (WriterArrow w a) (WriterArrow w a')--module Control.Arrow.Transformer.Static-data StaticArrow f a b c-instance (ArrowError ex a, Applicative f) => ArrowError ex (StaticArrow f a)-instance (ArrowReader r a, Applicative f) => ArrowReader r (StaticArrow f a)-instance (ArrowState s a, Applicative f) => ArrowState s (StaticArrow f a)-instance (ArrowWriter w a, Applicative f) => ArrowWriter w (StaticArrow f a)-instance (ArrowAddError ex a a', Applicative f) => ArrowAddError ex (StaticArrow f a) (StaticArrow f a')-instance (ArrowAddReader r a a', Applicative f) => ArrowAddReader r (StaticArrow f a) (StaticArrow f a')-instance (ArrowAddState s a a', Applicative f) => ArrowAddState s (StaticArrow f a) (StaticArrow f a')-instance (ArrowAddWriter w a a', Applicative f) => ArrowAddWriter w (StaticArrow f a) (StaticArrow f a')-instance (Arrow a, Applicative f) => ArrowTransformer (StaticArrow f) a-instance (Arrow a, Applicative f) => Arrow (StaticArrow f a)-instance (ArrowChoice a, Applicative f) => ArrowChoice (StaticArrow f a)-instance (ArrowCircuit a, Applicative f) => ArrowCircuit (StaticArrow f a)-instance (ArrowLoop a, Applicative f) => ArrowLoop (StaticArrow f a)-instance (ArrowPlus a, Applicative f) => ArrowPlus (StaticArrow f a)-instance (ArrowZero a, Applicative f) => ArrowZero (StaticArrow f a)-instance (ArrowAddStream a a', Applicative f) => ArrowAddStream (StaticArrow f a) (StaticArrow f a')-type StaticMonadArrow m = StaticArrow (WrappedMonad m)-type StaticArrowArrow a s = StaticArrow (WrappedArrow a s)-wrapA :: (Arrow a, Arrow a') => a s (a' b c) -> StaticArrowArrow a s a' b c-unwrapA :: (Arrow a, Arrow a') => StaticArrowArrow a s a' b c -> a s (a' b c)-wrapM :: (Monad m, Arrow a) => m (a b c) -> StaticMonadArrow m a b c-unwrapM :: (Monad m, Arrow a) => StaticMonadArrow m a b c -> m (a b c)--module Control.Arrow.Transformer.Stream-data StreamArrow a b c-instance Arrow a => ArrowTransformer StreamArrow a-instance ArrowState s a => ArrowState s (StreamArrow a)-instance ArrowWriter w a => ArrowWriter w (StreamArrow a)-instance Arrow a => Arrow (StreamArrow a)-instance Arrow a => ArrowChoice (StreamArrow a)-instance ArrowLoop a => ArrowCircuit (StreamArrow a)-instance ArrowLoop a => ArrowLoop (StreamArrow a)-instance ArrowPlus a => ArrowPlus (StreamArrow a)-instance ArrowZero a => ArrowZero (StreamArrow a)-instance ArrowLoop a => ArrowAddStream (StreamArrow a) a-runStream :: ArrowLoop a => StreamArrow a (e, b) c -> a (e, Stream b) (Stream c)-type StreamMap = StreamArrow (->)-type StreamMapST s = StreamArrow (Kleisli (ST s))-runStreamST :: StreamMapST s e c -> StreamMap e c-class (ArrowCircuit a, Arrow a') => ArrowAddStream a a'-liftStream :: ArrowAddStream a a' => a' e b -> a e b-elimStream :: ArrowAddStream a a' => a (e, b) c -> a' (e, Stream b) (Stream c)-instance (ArrowLoop a, ArrowApply a) => ArrowAddStream (Automaton a) a-instance ArrowLoop a => ArrowAddStream (StreamArrow a) a-instance (ArrowAddStream a a', Applicative f) => ArrowAddStream (StaticArrow f a) (StaticArrow f a')--module Control.Arrow.Transformer.Writer-data WriterArrow w a b c-instance (ArrowError ex a, Monoid w) => ArrowError ex (WriterArrow w a)-instance (ArrowReader r a, Monoid w) => ArrowReader r (WriterArrow w a)-instance (ArrowState s a, Monoid w) => ArrowState s (WriterArrow w a)-instance (Arrow a, Monoid w) => ArrowWriter w (WriterArrow w a)-instance (Arrow a, Monoid w) => ArrowAddWriter w (WriterArrow w a) a-instance (ArrowAddError ex a a', Monoid w) => ArrowAddError ex (WriterArrow w a) (WriterArrow w a')-instance (ArrowAddReader r a a', Monoid w) => ArrowAddReader r (WriterArrow w a) (WriterArrow w a')-instance (ArrowAddState s a a', Monoid w) => ArrowAddState s (WriterArrow w a) (WriterArrow w a')-instance (Arrow a, Monoid w) => ArrowTransformer (WriterArrow w) a-instance (Arrow a, Monoid w) => Arrow (WriterArrow w a)-instance (ArrowApply a, Monoid w) => ArrowApply (WriterArrow w a)-instance (ArrowChoice a, Monoid w) => ArrowChoice (WriterArrow w a)-instance (ArrowCircuit a, Monoid w) => ArrowCircuit (WriterArrow w a)-instance (ArrowLoop a, Monoid w) => ArrowLoop (WriterArrow w a)-instance (ArrowPlus a, Monoid w) => ArrowPlus (WriterArrow w a)-instance (ArrowZero a, Monoid w) => ArrowZero (WriterArrow w a)-runWriter :: (Arrow a, Monoid w) => WriterArrow w a e b -> a e (b, w)-class (ArrowWriter w a, Arrow a') => ArrowAddWriter w a a'-liftWriter :: ArrowAddWriter w a a' => a' e b -> a e b-elimWriter :: ArrowAddWriter w a a' => a e b -> a' e (b, w)-instance ArrowAddWriter w a a' => ArrowAddWriter w (Automaton a) (Automaton a')-instance (Arrow a, Monoid w) => ArrowAddWriter w (WriterArrow w a) a-instance ArrowAddWriter s a a' => ArrowAddWriter s (ReaderArrow r a) (ReaderArrow r a')-instance (ArrowAddWriter w a a', ArrowChoice a, ArrowChoice a') => ArrowAddWriter w (ErrorArrow ex a) (ErrorArrow ex a')-instance ArrowAddWriter w a a' => ArrowAddWriter w (StateArrow s a) (StateArrow s a')-instance (ArrowAddWriter w a a', Applicative f) => ArrowAddWriter w (StaticArrow f a) (StaticArrow f a')--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Data.ByteString.Internal-data ByteString-PS :: ForeignPtr Word8 -> Int -> Int -> ByteString-instance Data ByteString-instance Eq ByteString-instance Monoid ByteString-instance Ord ByteString-instance Read ByteString-instance Show ByteString-instance Typeable ByteString-create :: Int -> (Ptr Word8 -> IO ()) -> IO ByteString-createAndTrim :: Int -> (Ptr Word8 -> IO Int) -> IO ByteString-createAndTrim' :: Int -> (Ptr Word8 -> IO (Int, Int, a)) -> IO (ByteString, a)-unsafeCreate :: Int -> (Ptr Word8 -> IO ()) -> ByteString-mallocByteString :: Int -> IO (ForeignPtr a)-fromForeignPtr :: ForeignPtr Word8 -> Int -> Int -> ByteString-toForeignPtr :: ByteString -> (ForeignPtr Word8, Int, Int)-inlinePerformIO :: IO a -> a-nullForeignPtr :: ForeignPtr Word8-countOccurrences :: (Storable a, Num a) => Ptr a -> Ptr Word8 -> Int -> IO ()-c_strlen :: CString -> IO CSize-c_free_finalizer :: FunPtr (Ptr Word8 -> IO ())-memchr :: Ptr Word8 -> Word8 -> CSize -> IO (Ptr Word8)-memcmp :: Ptr Word8 -> Ptr Word8 -> CSize -> IO CInt-memcpy :: Ptr Word8 -> Ptr Word8 -> CSize -> IO ()-memmove :: Ptr Word8 -> Ptr Word8 -> CSize -> IO ()-memset :: Ptr Word8 -> Word8 -> CSize -> IO (Ptr Word8)-c_reverse :: Ptr Word8 -> Ptr Word8 -> CULong -> IO ()-c_intersperse :: Ptr Word8 -> Ptr Word8 -> CULong -> Word8 -> IO ()-c_maximum :: Ptr Word8 -> CULong -> IO Word8-c_minimum :: Ptr Word8 -> CULong -> IO Word8-c_count :: Ptr Word8 -> CULong -> Word8 -> IO CULong-memcpy_ptr_baoff :: Ptr a -> RawBuffer -> CInt -> CSize -> IO (Ptr ())-w2c :: Word8 -> Char-c2w :: Char -> Word8-isSpaceWord8 :: Word8 -> Bool--module Data.ByteString.Lazy.Internal-data ByteString-Empty :: ByteString-Chunk :: ByteString -> ByteString -> ByteString-instance Data ByteString-instance Eq ByteString-instance Monoid ByteString-instance Ord ByteString-instance Read ByteString-instance Show ByteString-instance Typeable ByteString-chunk :: ByteString -> ByteString -> ByteString-foldrChunks :: (ByteString -> a -> a) -> a -> ByteString -> a-foldlChunks :: (a -> ByteString -> a) -> a -> ByteString -> a-invariant :: ByteString -> Bool-checkInvariant :: ByteString -> ByteString-defaultChunkSize :: Int-smallChunkSize :: Int-chunkOverhead :: Int--module Data.ByteString.Unsafe-unsafeHead :: ByteString -> Word8-unsafeTail :: ByteString -> ByteString-unsafeIndex :: ByteString -> Int -> Word8-unsafeTake :: Int -> ByteString -> ByteString-unsafeDrop :: Int -> ByteString -> ByteString-unsafeUseAsCString :: ByteString -> (CString -> IO a) -> IO a-unsafeUseAsCStringLen :: ByteString -> (CStringLen -> IO a) -> IO a-unsafePackCString :: CString -> IO ByteString-unsafePackCStringLen :: CStringLen -> IO ByteString-unsafePackMallocCString :: CString -> IO ByteString-unsafePackAddress :: Addr# -> IO ByteString-unsafePackAddressLen :: Int -> Addr# -> IO ByteString-unsafePackCStringFinalizer :: Ptr Word8 -> Int -> IO () -> IO ByteString-unsafeFinalize :: ByteString -> IO ()--module Data.ByteString-data ByteString-instance Data ByteString-instance Eq ByteString-instance Monoid ByteString-instance Ord ByteString-instance Read ByteString-instance Show ByteString-instance Typeable ByteString-empty :: ByteString-singleton :: Word8 -> ByteString-pack :: [Word8] -> ByteString-unpack :: ByteString -> [Word8]-cons :: Word8 -> ByteString -> ByteString-snoc :: ByteString -> Word8 -> ByteString-append :: ByteString -> ByteString -> ByteString-head :: ByteString -> Word8-uncons :: ByteString -> Maybe (Word8, ByteString)-last :: ByteString -> Word8-tail :: ByteString -> ByteString-init :: ByteString -> ByteString-null :: ByteString -> Bool-length :: ByteString -> Int-map :: (Word8 -> Word8) -> ByteString -> ByteString-reverse :: ByteString -> ByteString-intersperse :: Word8 -> ByteString -> ByteString-intercalate :: ByteString -> [ByteString] -> ByteString-transpose :: [ByteString] -> [ByteString]-foldl :: (a -> Word8 -> a) -> a -> ByteString -> a-foldl' :: (a -> Word8 -> a) -> a -> ByteString -> a-foldl1 :: (Word8 -> Word8 -> Word8) -> ByteString -> Word8-foldl1' :: (Word8 -> Word8 -> Word8) -> ByteString -> Word8-foldr :: (Word8 -> a -> a) -> a -> ByteString -> a-foldr' :: (Word8 -> a -> a) -> a -> ByteString -> a-foldr1 :: (Word8 -> Word8 -> Word8) -> ByteString -> Word8-foldr1' :: (Word8 -> Word8 -> Word8) -> ByteString -> Word8-concat :: [ByteString] -> ByteString-concatMap :: (Word8 -> ByteString) -> ByteString -> ByteString-any :: (Word8 -> Bool) -> ByteString -> Bool-all :: (Word8 -> Bool) -> ByteString -> Bool-maximum :: ByteString -> Word8-minimum :: ByteString -> Word8-scanl :: (Word8 -> Word8 -> Word8) -> Word8 -> ByteString -> ByteString-scanl1 :: (Word8 -> Word8 -> Word8) -> ByteString -> ByteString-scanr :: (Word8 -> Word8 -> Word8) -> Word8 -> ByteString -> ByteString-scanr1 :: (Word8 -> Word8 -> Word8) -> ByteString -> ByteString-mapAccumL :: (acc -> Word8 -> (acc, Word8)) -> acc -> ByteString -> (acc, ByteString)-mapAccumR :: (acc -> Word8 -> (acc, Word8)) -> acc -> ByteString -> (acc, ByteString)-mapIndexed :: (Int -> Word8 -> Word8) -> ByteString -> ByteString-replicate :: Int -> Word8 -> ByteString-unfoldr :: (a -> Maybe (Word8, a)) -> a -> ByteString-unfoldrN :: Int -> (a -> Maybe (Word8, a)) -> a -> (ByteString, Maybe a)-take :: Int -> ByteString -> ByteString-drop :: Int -> ByteString -> ByteString-splitAt :: Int -> ByteString -> (ByteString, ByteString)-takeWhile :: (Word8 -> Bool) -> ByteString -> ByteString-dropWhile :: (Word8 -> Bool) -> ByteString -> ByteString-span :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString)-spanEnd :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString)-break :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString)-breakEnd :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString)-group :: ByteString -> [ByteString]-groupBy :: (Word8 -> Word8 -> Bool) -> ByteString -> [ByteString]-inits :: ByteString -> [ByteString]-tails :: ByteString -> [ByteString]-split :: Word8 -> ByteString -> [ByteString]-splitWith :: (Word8 -> Bool) -> ByteString -> [ByteString]-isPrefixOf :: ByteString -> ByteString -> Bool-isSuffixOf :: ByteString -> ByteString -> Bool-isInfixOf :: ByteString -> ByteString -> Bool-isSubstringOf :: ByteString -> ByteString -> Bool-findSubstring :: ByteString -> ByteString -> Maybe Int-findSubstrings :: ByteString -> ByteString -> [Int]-elem :: Word8 -> ByteString -> Bool-notElem :: Word8 -> ByteString -> Bool-find :: (Word8 -> Bool) -> ByteString -> Maybe Word8-filter :: (Word8 -> Bool) -> ByteString -> ByteString-partition :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString)-index :: ByteString -> Int -> Word8-elemIndex :: Word8 -> ByteString -> Maybe Int-elemIndices :: Word8 -> ByteString -> [Int]-elemIndexEnd :: Word8 -> ByteString -> Maybe Int-findIndex :: (Word8 -> Bool) -> ByteString -> Maybe Int-findIndices :: (Word8 -> Bool) -> ByteString -> [Int]-count :: Word8 -> ByteString -> Int-zip :: ByteString -> ByteString -> [(Word8, Word8)]-zipWith :: (Word8 -> Word8 -> a) -> ByteString -> ByteString -> [a]-unzip :: [(Word8, Word8)] -> (ByteString, ByteString)-sort :: ByteString -> ByteString-copy :: ByteString -> ByteString-packCString :: CString -> IO ByteString-packCStringLen :: CStringLen -> IO ByteString-useAsCString :: ByteString -> (CString -> IO a) -> IO a-useAsCStringLen :: ByteString -> (CStringLen -> IO a) -> IO a-getLine :: IO ByteString-getContents :: IO ByteString-putStr :: ByteString -> IO ()-putStrLn :: ByteString -> IO ()-interact :: (ByteString -> ByteString) -> IO ()-readFile :: FilePath -> IO ByteString-writeFile :: FilePath -> ByteString -> IO ()-appendFile :: FilePath -> ByteString -> IO ()-hGetLine :: Handle -> IO ByteString-hGetContents :: Handle -> IO ByteString-hGet :: Handle -> Int -> IO ByteString-hGetNonBlocking :: Handle -> Int -> IO ByteString-hPut :: Handle -> ByteString -> IO ()-hPutStr :: Handle -> ByteString -> IO ()-hPutStrLn :: Handle -> ByteString -> IO ()--module Data.ByteString.Char8-data ByteString-instance Data ByteString-instance Eq ByteString-instance Monoid ByteString-instance Ord ByteString-instance Read ByteString-instance Show ByteString-instance Typeable ByteString-empty :: ByteString-singleton :: Char -> ByteString-pack :: String -> ByteString-unpack :: ByteString -> [Char]-cons :: Char -> ByteString -> ByteString-snoc :: ByteString -> Char -> ByteString-append :: ByteString -> ByteString -> ByteString-head :: ByteString -> Char-uncons :: ByteString -> Maybe (Char, ByteString)-last :: ByteString -> Char-tail :: ByteString -> ByteString-init :: ByteString -> ByteString-null :: ByteString -> Bool-length :: ByteString -> Int-map :: (Char -> Char) -> ByteString -> ByteString-reverse :: ByteString -> ByteString-intersperse :: Char -> ByteString -> ByteString-intercalate :: ByteString -> [ByteString] -> ByteString-transpose :: [ByteString] -> [ByteString]-foldl :: (a -> Char -> a) -> a -> ByteString -> a-foldl' :: (a -> Char -> a) -> a -> ByteString -> a-foldl1 :: (Char -> Char -> Char) -> ByteString -> Char-foldl1' :: (Char -> Char -> Char) -> ByteString -> Char-foldr :: (Char -> a -> a) -> a -> ByteString -> a-foldr' :: (Char -> a -> a) -> a -> ByteString -> a-foldr1 :: (Char -> Char -> Char) -> ByteString -> Char-foldr1' :: (Char -> Char -> Char) -> ByteString -> Char-concat :: [ByteString] -> ByteString-concatMap :: (Char -> ByteString) -> ByteString -> ByteString-any :: (Char -> Bool) -> ByteString -> Bool-all :: (Char -> Bool) -> ByteString -> Bool-maximum :: ByteString -> Char-minimum :: ByteString -> Char-scanl :: (Char -> Char -> Char) -> Char -> ByteString -> ByteString-scanl1 :: (Char -> Char -> Char) -> ByteString -> ByteString-scanr :: (Char -> Char -> Char) -> Char -> ByteString -> ByteString-scanr1 :: (Char -> Char -> Char) -> ByteString -> ByteString-mapAccumL :: (acc -> Char -> (acc, Char)) -> acc -> ByteString -> (acc, ByteString)-mapAccumR :: (acc -> Char -> (acc, Char)) -> acc -> ByteString -> (acc, ByteString)-mapIndexed :: (Int -> Char -> Char) -> ByteString -> ByteString-replicate :: Int -> Char -> ByteString-unfoldr :: (a -> Maybe (Char, a)) -> a -> ByteString-unfoldrN :: Int -> (a -> Maybe (Char, a)) -> a -> (ByteString, Maybe a)-take :: Int -> ByteString -> ByteString-drop :: Int -> ByteString -> ByteString-splitAt :: Int -> ByteString -> (ByteString, ByteString)-takeWhile :: (Char -> Bool) -> ByteString -> ByteString-dropWhile :: (Char -> Bool) -> ByteString -> ByteString-span :: (Char -> Bool) -> ByteString -> (ByteString, ByteString)-spanEnd :: (Char -> Bool) -> ByteString -> (ByteString, ByteString)-break :: (Char -> Bool) -> ByteString -> (ByteString, ByteString)-breakEnd :: (Char -> Bool) -> ByteString -> (ByteString, ByteString)-group :: ByteString -> [ByteString]-groupBy :: (Char -> Char -> Bool) -> ByteString -> [ByteString]-inits :: ByteString -> [ByteString]-tails :: ByteString -> [ByteString]-split :: Char -> ByteString -> [ByteString]-splitWith :: (Char -> Bool) -> ByteString -> [ByteString]-lines :: ByteString -> [ByteString]-words :: ByteString -> [ByteString]-unlines :: [ByteString] -> ByteString-unwords :: [ByteString] -> ByteString-isPrefixOf :: ByteString -> ByteString -> Bool-isSuffixOf :: ByteString -> ByteString -> Bool-isInfixOf :: ByteString -> ByteString -> Bool-isSubstringOf :: ByteString -> ByteString -> Bool-findSubstring :: ByteString -> ByteString -> Maybe Int-findSubstrings :: ByteString -> ByteString -> [Int]-elem :: Char -> ByteString -> Bool-notElem :: Char -> ByteString -> Bool-find :: (Char -> Bool) -> ByteString -> Maybe Char-filter :: (Char -> Bool) -> ByteString -> ByteString-index :: ByteString -> Int -> Char-elemIndex :: Char -> ByteString -> Maybe Int-elemIndices :: Char -> ByteString -> [Int]-elemIndexEnd :: Char -> ByteString -> Maybe Int-findIndex :: (Char -> Bool) -> ByteString -> Maybe Int-findIndices :: (Char -> Bool) -> ByteString -> [Int]-count :: Char -> ByteString -> Int-zip :: ByteString -> ByteString -> [(Char, Char)]-zipWith :: (Char -> Char -> a) -> ByteString -> ByteString -> [a]-unzip :: [(Char, Char)] -> (ByteString, ByteString)-sort :: ByteString -> ByteString-readInt :: ByteString -> Maybe (Int, ByteString)-readInteger :: ByteString -> Maybe (Integer, ByteString)-copy :: ByteString -> ByteString-packCString :: CString -> IO ByteString-packCStringLen :: CStringLen -> IO ByteString-useAsCString :: ByteString -> (CString -> IO a) -> IO a-useAsCStringLen :: ByteString -> (CStringLen -> IO a) -> IO a-getLine :: IO ByteString-getContents :: IO ByteString-putStr :: ByteString -> IO ()-putStrLn :: ByteString -> IO ()-interact :: (ByteString -> ByteString) -> IO ()-readFile :: FilePath -> IO ByteString-writeFile :: FilePath -> ByteString -> IO ()-appendFile :: FilePath -> ByteString -> IO ()-hGetLine :: Handle -> IO ByteString-hGetContents :: Handle -> IO ByteString-hGet :: Handle -> Int -> IO ByteString-hGetNonBlocking :: Handle -> Int -> IO ByteString-hPut :: Handle -> ByteString -> IO ()-hPutStr :: Handle -> ByteString -> IO ()-hPutStrLn :: Handle -> ByteString -> IO ()--module Data.ByteString.Lazy-data ByteString-instance Data ByteString-instance Eq ByteString-instance Monoid ByteString-instance Ord ByteString-instance Read ByteString-instance Show ByteString-instance Typeable ByteString-empty :: ByteString-singleton :: Word8 -> ByteString-pack :: [Word8] -> ByteString-unpack :: ByteString -> [Word8]-fromChunks :: [ByteString] -> ByteString-toChunks :: ByteString -> [ByteString]-cons :: Word8 -> ByteString -> ByteString-cons' :: Word8 -> ByteString -> ByteString-snoc :: ByteString -> Word8 -> ByteString-append :: ByteString -> ByteString -> ByteString-head :: ByteString -> Word8-uncons :: ByteString -> Maybe (Word8, ByteString)-last :: ByteString -> Word8-tail :: ByteString -> ByteString-init :: ByteString -> ByteString-null :: ByteString -> Bool-length :: ByteString -> Int64-map :: (Word8 -> Word8) -> ByteString -> ByteString-reverse :: ByteString -> ByteString-intersperse :: Word8 -> ByteString -> ByteString-intercalate :: ByteString -> [ByteString] -> ByteString-transpose :: [ByteString] -> [ByteString]-foldl :: (a -> Word8 -> a) -> a -> ByteString -> a-foldl' :: (a -> Word8 -> a) -> a -> ByteString -> a-foldl1 :: (Word8 -> Word8 -> Word8) -> ByteString -> Word8-foldl1' :: (Word8 -> Word8 -> Word8) -> ByteString -> Word8-foldr :: (Word8 -> a -> a) -> a -> ByteString -> a-foldr1 :: (Word8 -> Word8 -> Word8) -> ByteString -> Word8-concat :: [ByteString] -> ByteString-concatMap :: (Word8 -> ByteString) -> ByteString -> ByteString-any :: (Word8 -> Bool) -> ByteString -> Bool-all :: (Word8 -> Bool) -> ByteString -> Bool-maximum :: ByteString -> Word8-minimum :: ByteString -> Word8-scanl :: (Word8 -> Word8 -> Word8) -> Word8 -> ByteString -> ByteString-mapAccumL :: (acc -> Word8 -> (acc, Word8)) -> acc -> ByteString -> (acc, ByteString)-mapAccumR :: (acc -> Word8 -> (acc, Word8)) -> acc -> ByteString -> (acc, ByteString)-mapIndexed :: (Int -> Word8 -> Word8) -> ByteString -> ByteString-repeat :: Word8 -> ByteString-replicate :: Int64 -> Word8 -> ByteString-cycle :: ByteString -> ByteString-iterate :: (Word8 -> Word8) -> Word8 -> ByteString-unfoldr :: (a -> Maybe (Word8, a)) -> a -> ByteString-take :: Int64 -> ByteString -> ByteString-drop :: Int64 -> ByteString -> ByteString-splitAt :: Int64 -> ByteString -> (ByteString, ByteString)-takeWhile :: (Word8 -> Bool) -> ByteString -> ByteString-dropWhile :: (Word8 -> Bool) -> ByteString -> ByteString-span :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString)-break :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString)-group :: ByteString -> [ByteString]-groupBy :: (Word8 -> Word8 -> Bool) -> ByteString -> [ByteString]-inits :: ByteString -> [ByteString]-tails :: ByteString -> [ByteString]-split :: Word8 -> ByteString -> [ByteString]-splitWith :: (Word8 -> Bool) -> ByteString -> [ByteString]-isPrefixOf :: ByteString -> ByteString -> Bool-isSuffixOf :: ByteString -> ByteString -> Bool-elem :: Word8 -> ByteString -> Bool-notElem :: Word8 -> ByteString -> Bool-find :: (Word8 -> Bool) -> ByteString -> Maybe Word8-filter :: (Word8 -> Bool) -> ByteString -> ByteString-partition :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString)-index :: ByteString -> Int64 -> Word8-elemIndex :: Word8 -> ByteString -> Maybe Int64-elemIndices :: Word8 -> ByteString -> [Int64]-findIndex :: (Word8 -> Bool) -> ByteString -> Maybe Int64-findIndices :: (Word8 -> Bool) -> ByteString -> [Int64]-count :: Word8 -> ByteString -> Int64-zip :: ByteString -> ByteString -> [(Word8, Word8)]-zipWith :: (Word8 -> Word8 -> a) -> ByteString -> ByteString -> [a]-unzip :: [(Word8, Word8)] -> (ByteString, ByteString)-copy :: ByteString -> ByteString-getContents :: IO ByteString-putStr :: ByteString -> IO ()-putStrLn :: ByteString -> IO ()-interact :: (ByteString -> ByteString) -> IO ()-readFile :: FilePath -> IO ByteString-writeFile :: FilePath -> ByteString -> IO ()-appendFile :: FilePath -> ByteString -> IO ()-hGetContents :: Handle -> IO ByteString-hGet :: Handle -> Int -> IO ByteString-hGetNonBlocking :: Handle -> Int -> IO ByteString-hPut :: Handle -> ByteString -> IO ()-hPutStr :: Handle -> ByteString -> IO ()--module Data.ByteString.Lazy.Char8-data ByteString-instance Data ByteString-instance Eq ByteString-instance Monoid ByteString-instance Ord ByteString-instance Read ByteString-instance Show ByteString-instance Typeable ByteString-empty :: ByteString-singleton :: Char -> ByteString-pack :: [Char] -> ByteString-unpack :: ByteString -> [Char]-fromChunks :: [ByteString] -> ByteString-toChunks :: ByteString -> [ByteString]-cons :: Char -> ByteString -> ByteString-cons' :: Char -> ByteString -> ByteString-snoc :: ByteString -> Char -> ByteString-append :: ByteString -> ByteString -> ByteString-head :: ByteString -> Char-uncons :: ByteString -> Maybe (Char, ByteString)-last :: ByteString -> Char-tail :: ByteString -> ByteString-init :: ByteString -> ByteString-null :: ByteString -> Bool-length :: ByteString -> Int64-map :: (Char -> Char) -> ByteString -> ByteString-reverse :: ByteString -> ByteString-intersperse :: Char -> ByteString -> ByteString-intercalate :: ByteString -> [ByteString] -> ByteString-transpose :: [ByteString] -> [ByteString]-foldl :: (a -> Char -> a) -> a -> ByteString -> a-foldl' :: (a -> Char -> a) -> a -> ByteString -> a-foldl1 :: (Char -> Char -> Char) -> ByteString -> Char-foldl1' :: (Char -> Char -> Char) -> ByteString -> Char-foldr :: (Char -> a -> a) -> a -> ByteString -> a-foldr1 :: (Char -> Char -> Char) -> ByteString -> Char-concat :: [ByteString] -> ByteString-concatMap :: (Char -> ByteString) -> ByteString -> ByteString-any :: (Char -> Bool) -> ByteString -> Bool-all :: (Char -> Bool) -> ByteString -> Bool-maximum :: ByteString -> Char-minimum :: ByteString -> Char-scanl :: (Char -> Char -> Char) -> Char -> ByteString -> ByteString-mapAccumL :: (acc -> Char -> (acc, Char)) -> acc -> ByteString -> (acc, ByteString)-mapIndexed :: (Int -> Char -> Char) -> ByteString -> ByteString-repeat :: Char -> ByteString-replicate :: Int64 -> Char -> ByteString-cycle :: ByteString -> ByteString-iterate :: (Char -> Char) -> Char -> ByteString-unfoldr :: (a -> Maybe (Char, a)) -> a -> ByteString-take :: Int64 -> ByteString -> ByteString-drop :: Int64 -> ByteString -> ByteString-splitAt :: Int64 -> ByteString -> (ByteString, ByteString)-takeWhile :: (Char -> Bool) -> ByteString -> ByteString-dropWhile :: (Char -> Bool) -> ByteString -> ByteString-span :: (Char -> Bool) -> ByteString -> (ByteString, ByteString)-break :: (Char -> Bool) -> ByteString -> (ByteString, ByteString)-group :: ByteString -> [ByteString]-groupBy :: (Char -> Char -> Bool) -> ByteString -> [ByteString]-inits :: ByteString -> [ByteString]-tails :: ByteString -> [ByteString]-split :: Char -> ByteString -> [ByteString]-splitWith :: (Char -> Bool) -> ByteString -> [ByteString]-lines :: ByteString -> [ByteString]-words :: ByteString -> [ByteString]-unlines :: [ByteString] -> ByteString-unwords :: [ByteString] -> ByteString-isPrefixOf :: ByteString -> ByteString -> Bool-elem :: Char -> ByteString -> Bool-notElem :: Char -> ByteString -> Bool-find :: (Char -> Bool) -> ByteString -> Maybe Char-filter :: (Char -> Bool) -> ByteString -> ByteString-index :: ByteString -> Int64 -> Char-elemIndex :: Char -> ByteString -> Maybe Int64-elemIndices :: Char -> ByteString -> [Int64]-findIndex :: (Char -> Bool) -> ByteString -> Maybe Int64-findIndices :: (Char -> Bool) -> ByteString -> [Int64]-count :: Char -> ByteString -> Int64-zip :: ByteString -> ByteString -> [(Char, Char)]-zipWith :: (Char -> Char -> a) -> ByteString -> ByteString -> [a]-copy :: ByteString -> ByteString-readInt :: ByteString -> Maybe (Int, ByteString)-readInteger :: ByteString -> Maybe (Integer, ByteString)-getContents :: IO ByteString-putStr :: ByteString -> IO ()-putStrLn :: ByteString -> IO ()-interact :: (ByteString -> ByteString) -> IO ()-readFile :: FilePath -> IO ByteString-writeFile :: FilePath -> ByteString -> IO ()-appendFile :: FilePath -> ByteString -> IO ()-hGetContents :: Handle -> IO ByteString-hGet :: Handle -> Int -> IO ByteString-hGetNonBlocking :: Handle -> Int -> IO ByteString-hPut :: Handle -> ByteString -> IO ()--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Network.CGI.Protocol-data CGIRequest-CGIRequest :: Map String String -> [(String, Input)] -> ByteString -> CGIRequest-cgiVars :: CGIRequest -> Map String String-cgiInputs :: CGIRequest -> [(String, Input)]-cgiRequestBody :: CGIRequest -> ByteString-instance Show CGIRequest-data Input-Input :: ByteString -> Maybe String -> ContentType -> Input-inputValue :: Input -> ByteString-inputFilename :: Input -> Maybe String-inputContentType :: Input -> ContentType-instance Show Input-data CGIResult-CGIOutput :: ByteString -> CGIResult-CGINothing :: CGIResult-instance Eq CGIResult-instance Ord CGIResult-instance Read CGIResult-instance Show CGIResult-instance Typeable CGIResult-type Headers = [(HeaderName, String)]-newtype HeaderName-HeaderName :: String -> HeaderName-instance Eq HeaderName-instance Ord HeaderName-instance Show HeaderName-hRunCGI :: MonadIO m => [(String, String)] -> Handle -> Handle -> (CGIRequest -> m (Headers, CGIResult)) -> m ()-runCGIEnvFPS :: Monad m => [(String, String)] -> ByteString -> (CGIRequest -> m (Headers, CGIResult)) -> m ByteString-decodeInput :: [(String, String)] -> ByteString -> ([(String, Input)], ByteString)-takeInput :: [(String, String)] -> ByteString -> ByteString-getCGIVars :: MonadIO m => m [(String, String)]-logCGI :: MonadIO m => String -> m ()-formEncode :: [(String, String)] -> String-urlEncode :: String -> String-formDecode :: String -> [(String, String)]-urlDecode :: String -> String-maybeRead :: Read a => String -> Maybe a-replace :: Eq a => a -> a -> [a] -> [a]--module Network.CGI.Monad-class Monad m => MonadCGI m-cgiAddHeader :: MonadCGI m => HeaderName -> String -> m ()-cgiGet :: MonadCGI m => (CGIRequest -> a) -> m a-instance Monad m => MonadCGI (CGIT m)-newtype CGIT m a-CGIT :: ReaderT CGIRequest (WriterT Headers m) a -> CGIT m a-unCGIT :: CGIT m a -> ReaderT CGIRequest (WriterT Headers m) a-instance MonadTrans CGIT-instance MonadError Exception (CGIT IO)-instance Monad m => Functor (CGIT m)-instance Monad m => Monad (CGIT m)-instance Monad m => MonadCGI (CGIT m)-instance MonadIO m => MonadIO (CGIT m)-instance (Typeable1 m, Typeable a) => Typeable (CGIT m a)-type CGI a = CGIT IO a-runCGIT :: Monad m => CGIT m a -> CGIRequest -> m (Headers, a)-data CGIRequest-CGIRequest :: Map String String -> [(String, Input)] -> ByteString -> CGIRequest-cgiVars :: CGIRequest -> Map String String-cgiInputs :: CGIRequest -> [(String, Input)]-cgiRequestBody :: CGIRequest -> ByteString-instance Show CGIRequest-throwCGI :: (MonadCGI m, MonadIO m) => Exception -> m a-catchCGI :: CGI a -> (Exception -> CGI a) -> CGI a-tryCGI :: CGI a -> CGI (Either Exception a)-handleExceptionCGI :: CGI a -> (Exception -> CGI a) -> CGI a--module Network.CGI.Cookie-data Cookie-Cookie :: String -> String -> Maybe CalendarTime -> Maybe String -> Maybe String -> Bool -> Cookie-cookieName :: Cookie -> String-cookieValue :: Cookie -> String-cookieExpires :: Cookie -> Maybe CalendarTime-cookieDomain :: Cookie -> Maybe String-cookiePath :: Cookie -> Maybe String-cookieSecure :: Cookie -> Bool-instance Eq Cookie-instance Ord Cookie-instance Read Cookie-instance Show Cookie-newCookie :: String -> String -> Cookie-findCookie :: String -> String -> Maybe String-deleteCookie :: Cookie -> Cookie-showCookie :: Cookie -> String-readCookies :: String -> [(String, String)]--module Network.CGI-class Monad m => MonadCGI m-instance Monad m => MonadCGI (CGIT m)-data CGIT m a-instance MonadTrans CGIT-instance MonadError Exception (CGIT IO)-instance Monad m => Functor (CGIT m)-instance Monad m => Monad (CGIT m)-instance Monad m => MonadCGI (CGIT m)-instance MonadIO m => MonadIO (CGIT m)-instance (Typeable1 m, Typeable a) => Typeable (CGIT m a)-data CGIResult-instance Eq CGIResult-instance Ord CGIResult-instance Read CGIResult-instance Show CGIResult-instance Typeable CGIResult-type CGI a = CGIT IO a-runCGI :: MonadIO m => CGIT m CGIResult -> m ()-throwCGI :: (MonadCGI m, MonadIO m) => Exception -> m a-catchCGI :: CGI a -> (Exception -> CGI a) -> CGI a-tryCGI :: CGI a -> CGI (Either Exception a)-handleExceptionCGI :: CGI a -> (Exception -> CGI a) -> CGI a-handleErrors :: CGI CGIResult -> CGI CGIResult-logCGI :: MonadIO m => String -> m ()-output :: MonadCGI m => String -> m CGIResult-outputFPS :: MonadCGI m => ByteString -> m CGIResult-outputNothing :: MonadCGI m => m CGIResult-redirect :: MonadCGI m => String -> m CGIResult-setHeader :: MonadCGI m => String -> String -> m ()-setStatus :: MonadCGI m => Int -> String -> m ()-outputError :: (MonadCGI m, MonadIO m) => Int -> String -> [String] -> m CGIResult-outputException :: (MonadCGI m, MonadIO m) => Exception -> m CGIResult-outputNotFound :: (MonadIO m, MonadCGI m) => String -> m CGIResult-outputMethodNotAllowed :: (MonadIO m, MonadCGI m) => [String] -> m CGIResult-outputInternalServerError :: (MonadIO m, MonadCGI m) => [String] -> m CGIResult-getInput :: MonadCGI m => String -> m (Maybe String)-getInputFPS :: MonadCGI m => String -> m (Maybe ByteString)-readInput :: (Read a, MonadCGI m) => String -> m (Maybe a)-getInputs :: MonadCGI m => m [(String, String)]-getInputNames :: MonadCGI m => m [String]-getMultiInput :: MonadCGI m => String -> m [String]-getMultiInputFPS :: MonadCGI m => String -> m [ByteString]-getInputFilename :: MonadCGI m => String -> m (Maybe String)-getInputContentType :: MonadCGI m => String -> m (Maybe String)-getVar :: MonadCGI m => String -> m (Maybe String)-getVarWithDefault :: MonadCGI m => String -> String -> m String-getVars :: MonadCGI m => m [(String, String)]-serverName :: MonadCGI m => m String-serverPort :: MonadCGI m => m Int-requestMethod :: MonadCGI m => m String-pathInfo :: MonadCGI m => m String-pathTranslated :: MonadCGI m => m String-scriptName :: MonadCGI m => m String-queryString :: MonadCGI m => m String-remoteHost :: MonadCGI m => m (Maybe String)-remoteAddr :: MonadCGI m => m String-authType :: MonadCGI m => m (Maybe String)-remoteUser :: MonadCGI m => m (Maybe String)-requestContentType :: MonadCGI m => m (Maybe String)-requestContentLength :: MonadCGI m => m (Maybe Int)-requestHeader :: MonadCGI m => String -> m (Maybe String)-progURI :: MonadCGI m => m URI-queryURI :: MonadCGI m => m URI-requestURI :: MonadCGI m => m URI-data ContentType-ContentType :: String -> String -> [(String, String)] -> ContentType-ctType :: ContentType -> String-ctSubtype :: ContentType -> String-ctParameters :: ContentType -> [(String, String)]-instance Eq ContentType-instance Ord ContentType-instance Read ContentType-instance Show ContentType-showContentType :: ContentType -> String-parseContentType :: Monad m => String -> m ContentType-data Cookie-Cookie :: String -> String -> Maybe CalendarTime -> Maybe String -> Maybe String -> Bool -> Cookie-cookieName :: Cookie -> String-cookieValue :: Cookie -> String-cookieExpires :: Cookie -> Maybe CalendarTime-cookieDomain :: Cookie -> Maybe String-cookiePath :: Cookie -> Maybe String-cookieSecure :: Cookie -> Bool-instance Eq Cookie-instance Ord Cookie-instance Read Cookie-instance Show Cookie-newCookie :: String -> String -> Cookie-getCookie :: MonadCGI m => String -> m (Maybe String)-readCookie :: (Read a, MonadCGI m) => String -> m (Maybe a)-setCookie :: MonadCGI m => Cookie -> m ()-deleteCookie :: MonadCGI m => Cookie -> m ()-formEncode :: [(String, String)] -> String-urlEncode :: String -> String-formDecode :: String -> [(String, String)]-urlDecode :: String -> String--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Data.Set-data Set a-instance Foldable Set-instance Typeable1 Set-instance (Data a, Ord a) => Data (Set a)-instance Eq a => Eq (Set a)-instance Ord a => Monoid (Set a)-instance Ord a => Ord (Set a)-instance (Read a, Ord a) => Read (Set a)-instance Show a => Show (Set a)-(\\) :: Ord a => Set a -> Set a -> Set a-null :: Set a -> Bool-size :: Set a -> Int-member :: Ord a => a -> Set a -> Bool-notMember :: Ord a => a -> Set a -> Bool-isSubsetOf :: Ord a => Set a -> Set a -> Bool-isProperSubsetOf :: Ord a => Set a -> Set a -> Bool-empty :: Set a-singleton :: a -> Set a-insert :: Ord a => a -> Set a -> Set a-delete :: Ord a => a -> Set a -> Set a-union :: Ord a => Set a -> Set a -> Set a-unions :: Ord a => [Set a] -> Set a-difference :: Ord a => Set a -> Set a -> Set a-intersection :: Ord a => Set a -> Set a -> Set a-filter :: Ord a => (a -> Bool) -> Set a -> Set a-partition :: Ord a => (a -> Bool) -> Set a -> (Set a, Set a)-split :: Ord a => a -> Set a -> (Set a, Set a)-splitMember :: Ord a => a -> Set a -> (Set a, Bool, Set a)-map :: (Ord a, Ord b) => (a -> b) -> Set a -> Set b-mapMonotonic :: (a -> b) -> Set a -> Set b-fold :: (a -> b -> b) -> b -> Set a -> b-findMin :: Set a -> a-findMax :: Set a -> a-deleteMin :: Set a -> Set a-deleteMax :: Set a -> Set a-deleteFindMin :: Set a -> (a, Set a)-deleteFindMax :: Set a -> (a, Set a)-maxView :: Monad m => Set a -> m (a, Set a)-minView :: Monad m => Set a -> m (a, Set a)-elems :: Set a -> [a]-toList :: Set a -> [a]-fromList :: Ord a => [a] -> Set a-toAscList :: Set a -> [a]-fromAscList :: Eq a => [a] -> Set a-fromDistinctAscList :: [a] -> Set a-showTree :: Show a => Set a -> String-showTreeWith :: Show a => Bool -> Bool -> Set a -> String-valid :: Ord a => Set a -> Bool--module Data.Sequence-data Seq a-instance Foldable Seq-instance Functor Seq-instance Monad Seq-instance MonadPlus Seq-instance Traversable Seq-instance Typeable1 Seq-instance Data a => Data (Seq a)-instance Eq a => Eq (Seq a)-instance Monoid (Seq a)-instance Ord a => Ord (Seq a)-instance Read a => Read (Seq a)-instance Show a => Show (Seq a)-empty :: Seq a-singleton :: a -> Seq a-(<|) :: a -> Seq a -> Seq a-(|>) :: Seq a -> a -> Seq a-(><) :: Seq a -> Seq a -> Seq a-fromList :: [a] -> Seq a-null :: Seq a -> Bool-length :: Seq a -> Int-data ViewL a-EmptyL :: ViewL a-(:<) :: a -> Seq a -> ViewL a-instance Foldable ViewL-instance Functor ViewL-instance Traversable ViewL-instance Typeable1 ViewL-instance Data a => Data (ViewL a)-instance Eq a => Eq (ViewL a)-instance Ord a => Ord (ViewL a)-instance Read a => Read (ViewL a)-instance Show a => Show (ViewL a)-viewl :: Seq a -> ViewL a-data ViewR a-EmptyR :: ViewR a-(:>) :: Seq a -> a -> ViewR a-instance Foldable ViewR-instance Functor ViewR-instance Traversable ViewR-instance Typeable1 ViewR-instance Data a => Data (ViewR a)-instance Eq a => Eq (ViewR a)-instance Ord a => Ord (ViewR a)-instance Read a => Read (ViewR a)-instance Show a => Show (ViewR a)-viewr :: Seq a -> ViewR a-index :: Seq a -> Int -> a-adjust :: (a -> a) -> Int -> Seq a -> Seq a-update :: Int -> a -> Seq a -> Seq a-take :: Int -> Seq a -> Seq a-drop :: Int -> Seq a -> Seq a-splitAt :: Int -> Seq a -> (Seq a, Seq a)-reverse :: Seq a -> Seq a--module Data.Tree-data Tree a-Node :: a -> Forest a -> Tree a-rootLabel :: Tree a -> a-subForest :: Tree a -> Forest a-instance Applicative Tree-instance Foldable Tree-instance Functor Tree-instance Monad Tree-instance Traversable Tree-instance Typeable1 Tree-instance Data a => Data (Tree a)-instance Eq a => Eq (Tree a)-instance Read a => Read (Tree a)-instance Show a => Show (Tree a)-type Forest a = [Tree a]-drawTree :: Tree String -> String-drawForest :: Forest String -> String-flatten :: Tree a -> [a]-levels :: Tree a -> [[a]]-unfoldTree :: (b -> (a, [b])) -> b -> Tree a-unfoldForest :: (b -> (a, [b])) -> [b] -> Forest a-unfoldTreeM :: Monad m => (b -> m (a, [b])) -> b -> m (Tree a)-unfoldForestM :: Monad m => (b -> m (a, [b])) -> [b] -> m (Forest a)-unfoldTreeM_BF :: Monad m => (b -> m (a, [b])) -> b -> m (Tree a)-unfoldForestM_BF :: Monad m => (b -> m (a, [b])) -> [b] -> m (Forest a)--module Data.Map-data Map k a-instance Typeable2 Map-instance Foldable (Map k)-instance Functor (Map k)-instance Traversable (Map k)-instance (Data k, Data a, Ord k) => Data (Map k a)-instance (Eq k, Eq a) => Eq (Map k a)-instance Ord k => Monoid (Map k v)-instance (Ord k, Ord v) => Ord (Map k v)-instance (Ord k, Read k, Read e) => Read (Map k e)-instance (Show k, Show a) => Show (Map k a)-(!) :: Ord k => Map k a -> k -> a-(\\) :: Ord k => Map k a -> Map k b -> Map k a-null :: Map k a -> Bool-size :: Map k a -> Int-member :: Ord k => k -> Map k a -> Bool-notMember :: Ord k => k -> Map k a -> Bool-lookup :: (Monad m, Ord k) => k -> Map k a -> m a-findWithDefault :: Ord k => a -> k -> Map k a -> a-empty :: Map k a-singleton :: k -> a -> Map k a-insert :: Ord k => k -> a -> Map k a -> Map k a-insertWith :: Ord k => (a -> a -> a) -> k -> a -> Map k a -> Map k a-insertWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> Map k a-insertLookupWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> (Maybe a, Map k a)-insertWith' :: Ord k => (a -> a -> a) -> k -> a -> Map k a -> Map k a-insertWithKey' :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> Map k a-delete :: Ord k => k -> Map k a -> Map k a-adjust :: Ord k => (a -> a) -> k -> Map k a -> Map k a-adjustWithKey :: Ord k => (k -> a -> a) -> k -> Map k a -> Map k a-update :: Ord k => (a -> Maybe a) -> k -> Map k a -> Map k a-updateWithKey :: Ord k => (k -> a -> Maybe a) -> k -> Map k a -> Map k a-updateLookupWithKey :: Ord k => (k -> a -> Maybe a) -> k -> Map k a -> (Maybe a, Map k a)-alter :: Ord k => (Maybe a -> Maybe a) -> k -> Map k a -> Map k a-union :: Ord k => Map k a -> Map k a -> Map k a-unionWith :: Ord k => (a -> a -> a) -> Map k a -> Map k a -> Map k a-unionWithKey :: Ord k => (k -> a -> a -> a) -> Map k a -> Map k a -> Map k a-unions :: Ord k => [Map k a] -> Map k a-unionsWith :: Ord k => (a -> a -> a) -> [Map k a] -> Map k a-difference :: Ord k => Map k a -> Map k b -> Map k a-differenceWith :: Ord k => (a -> b -> Maybe a) -> Map k a -> Map k b -> Map k a-differenceWithKey :: Ord k => (k -> a -> b -> Maybe a) -> Map k a -> Map k b -> Map k a-intersection :: Ord k => Map k a -> Map k b -> Map k a-intersectionWith :: Ord k => (a -> b -> c) -> Map k a -> Map k b -> Map k c-intersectionWithKey :: Ord k => (k -> a -> b -> c) -> Map k a -> Map k b -> Map k c-map :: (a -> b) -> Map k a -> Map k b-mapWithKey :: (k -> a -> b) -> Map k a -> Map k b-mapAccum :: (a -> b -> (a, c)) -> a -> Map k b -> (a, Map k c)-mapAccumWithKey :: (a -> k -> b -> (a, c)) -> a -> Map k b -> (a, Map k c)-mapKeys :: Ord k2 => (k1 -> k2) -> Map k1 a -> Map k2 a-mapKeysWith :: Ord k2 => (a -> a -> a) -> (k1 -> k2) -> Map k1 a -> Map k2 a-mapKeysMonotonic :: (k1 -> k2) -> Map k1 a -> Map k2 a-fold :: (a -> b -> b) -> b -> Map k a -> b-foldWithKey :: (k -> a -> b -> b) -> b -> Map k a -> b-elems :: Map k a -> [a]-keys :: Map k a -> [k]-keysSet :: Map k a -> Set k-assocs :: Map k a -> [(k, a)]-toList :: Map k a -> [(k, a)]-fromList :: Ord k => [(k, a)] -> Map k a-fromListWith :: Ord k => (a -> a -> a) -> [(k, a)] -> Map k a-fromListWithKey :: Ord k => (k -> a -> a -> a) -> [(k, a)] -> Map k a-toAscList :: Map k a -> [(k, a)]-fromAscList :: Eq k => [(k, a)] -> Map k a-fromAscListWith :: Eq k => (a -> a -> a) -> [(k, a)] -> Map k a-fromAscListWithKey :: Eq k => (k -> a -> a -> a) -> [(k, a)] -> Map k a-fromDistinctAscList :: [(k, a)] -> Map k a-filter :: Ord k => (a -> Bool) -> Map k a -> Map k a-filterWithKey :: Ord k => (k -> a -> Bool) -> Map k a -> Map k a-partition :: Ord k => (a -> Bool) -> Map k a -> (Map k a, Map k a)-partitionWithKey :: Ord k => (k -> a -> Bool) -> Map k a -> (Map k a, Map k a)-mapMaybe :: Ord k => (a -> Maybe b) -> Map k a -> Map k b-mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> Map k a -> Map k b-mapEither :: Ord k => (a -> Either b c) -> Map k a -> (Map k b, Map k c)-mapEitherWithKey :: Ord k => (k -> a -> Either b c) -> Map k a -> (Map k b, Map k c)-split :: Ord k => k -> Map k a -> (Map k a, Map k a)-splitLookup :: Ord k => k -> Map k a -> (Map k a, Maybe a, Map k a)-isSubmapOf :: (Ord k, Eq a) => Map k a -> Map k a -> Bool-isSubmapOfBy :: Ord k => (a -> b -> Bool) -> Map k a -> Map k b -> Bool-isProperSubmapOf :: (Ord k, Eq a) => Map k a -> Map k a -> Bool-isProperSubmapOfBy :: Ord k => (a -> b -> Bool) -> Map k a -> Map k b -> Bool-lookupIndex :: (Monad m, Ord k) => k -> Map k a -> m Int-findIndex :: Ord k => k -> Map k a -> Int-elemAt :: Int -> Map k a -> (k, a)-updateAt :: (k -> a -> Maybe a) -> Int -> Map k a -> Map k a-deleteAt :: Int -> Map k a -> Map k a-findMin :: Map k a -> (k, a)-findMax :: Map k a -> (k, a)-deleteMin :: Map k a -> Map k a-deleteMax :: Map k a -> Map k a-deleteFindMin :: Map k a -> ((k, a), Map k a)-deleteFindMax :: Map k a -> ((k, a), Map k a)-updateMin :: (a -> Maybe a) -> Map k a -> Map k a-updateMax :: (a -> Maybe a) -> Map k a -> Map k a-updateMinWithKey :: (k -> a -> Maybe a) -> Map k a -> Map k a-updateMaxWithKey :: (k -> a -> Maybe a) -> Map k a -> Map k a-minView :: Monad m => Map k a -> m (a, Map k a)-maxView :: Monad m => Map k a -> m (a, Map k a)-minViewWithKey :: Monad m => Map k a -> m ((k, a), Map k a)-maxViewWithKey :: Monad m => Map k a -> m ((k, a), Map k a)-showTree :: (Show k, Show a) => Map k a -> String-showTreeWith :: (k -> a -> String) -> Bool -> Bool -> Map k a -> String-valid :: Ord k => Map k a -> Bool--module Data.IntSet-data IntSet-instance Data IntSet-instance Eq IntSet-instance Monoid IntSet-instance Ord IntSet-instance Read IntSet-instance Show IntSet-instance Typeable IntSet-(\\) :: IntSet -> IntSet -> IntSet-null :: IntSet -> Bool-size :: IntSet -> Int-member :: Int -> IntSet -> Bool-notMember :: Int -> IntSet -> Bool-isSubsetOf :: IntSet -> IntSet -> Bool-isProperSubsetOf :: IntSet -> IntSet -> Bool-empty :: IntSet-singleton :: Int -> IntSet-insert :: Int -> IntSet -> IntSet-delete :: Int -> IntSet -> IntSet-union :: IntSet -> IntSet -> IntSet-unions :: [IntSet] -> IntSet-difference :: IntSet -> IntSet -> IntSet-intersection :: IntSet -> IntSet -> IntSet-filter :: (Int -> Bool) -> IntSet -> IntSet-partition :: (Int -> Bool) -> IntSet -> (IntSet, IntSet)-split :: Int -> IntSet -> (IntSet, IntSet)-splitMember :: Int -> IntSet -> (IntSet, Bool, IntSet)-findMin :: IntSet -> Int-findMax :: IntSet -> Int-deleteMin :: IntSet -> IntSet-deleteMax :: IntSet -> IntSet-deleteFindMin :: IntSet -> (Int, IntSet)-deleteFindMax :: IntSet -> (Int, IntSet)-maxView :: Monad m => IntSet -> m (Int, IntSet)-minView :: Monad m => IntSet -> m (Int, IntSet)-map :: (Int -> Int) -> IntSet -> IntSet-fold :: (Int -> b -> b) -> b -> IntSet -> b-elems :: IntSet -> [Int]-toList :: IntSet -> [Int]-fromList :: [Int] -> IntSet-toAscList :: IntSet -> [Int]-fromAscList :: [Int] -> IntSet-fromDistinctAscList :: [Int] -> IntSet-showTree :: IntSet -> String-showTreeWith :: Bool -> Bool -> IntSet -> String--module Data.IntMap-data IntMap a-instance Foldable IntMap-instance Functor IntMap-instance Typeable1 IntMap-instance Data a => Data (IntMap a)-instance Eq a => Eq (IntMap a)-instance Monoid (IntMap a)-instance Ord a => Ord (IntMap a)-instance Read e => Read (IntMap e)-instance Show a => Show (IntMap a)-type Key = Int-(!) :: IntMap a -> Key -> a-(\\) :: IntMap a -> IntMap b -> IntMap a-null :: IntMap a -> Bool-size :: IntMap a -> Int-member :: Key -> IntMap a -> Bool-notMember :: Key -> IntMap a -> Bool-lookup :: Monad m => Key -> IntMap a -> m a-findWithDefault :: a -> Key -> IntMap a -> a-empty :: IntMap a-singleton :: Key -> a -> IntMap a-insert :: Key -> a -> IntMap a -> IntMap a-insertWith :: (a -> a -> a) -> Key -> a -> IntMap a -> IntMap a-insertWithKey :: (Key -> a -> a -> a) -> Key -> a -> IntMap a -> IntMap a-insertLookupWithKey :: (Key -> a -> a -> a) -> Key -> a -> IntMap a -> (Maybe a, IntMap a)-delete :: Key -> IntMap a -> IntMap a-adjust :: (a -> a) -> Key -> IntMap a -> IntMap a-adjustWithKey :: (Key -> a -> a) -> Key -> IntMap a -> IntMap a-update :: (a -> Maybe a) -> Key -> IntMap a -> IntMap a-updateWithKey :: (Key -> a -> Maybe a) -> Key -> IntMap a -> IntMap a-updateLookupWithKey :: (Key -> a -> Maybe a) -> Key -> IntMap a -> (Maybe a, IntMap a)-union :: IntMap a -> IntMap a -> IntMap a-unionWith :: (a -> a -> a) -> IntMap a -> IntMap a -> IntMap a-unionWithKey :: (Key -> a -> a -> a) -> IntMap a -> IntMap a -> IntMap a-unions :: [IntMap a] -> IntMap a-unionsWith :: (a -> a -> a) -> [IntMap a] -> IntMap a-difference :: IntMap a -> IntMap b -> IntMap a-differenceWith :: (a -> b -> Maybe a) -> IntMap a -> IntMap b -> IntMap a-differenceWithKey :: (Key -> a -> b -> Maybe a) -> IntMap a -> IntMap b -> IntMap a-intersection :: IntMap a -> IntMap b -> IntMap a-intersectionWith :: (a -> b -> a) -> IntMap a -> IntMap b -> IntMap a-intersectionWithKey :: (Key -> a -> b -> a) -> IntMap a -> IntMap b -> IntMap a-map :: (a -> b) -> IntMap a -> IntMap b-mapWithKey :: (Key -> a -> b) -> IntMap a -> IntMap b-mapAccum :: (a -> b -> (a, c)) -> a -> IntMap b -> (a, IntMap c)-mapAccumWithKey :: (a -> Key -> b -> (a, c)) -> a -> IntMap b -> (a, IntMap c)-fold :: (a -> b -> b) -> b -> IntMap a -> b-foldWithKey :: (Key -> a -> b -> b) -> b -> IntMap a -> b-elems :: IntMap a -> [a]-keys :: IntMap a -> [Key]-keysSet :: IntMap a -> IntSet-assocs :: IntMap a -> [(Key, a)]-toList :: IntMap a -> [(Key, a)]-fromList :: [(Key, a)] -> IntMap a-fromListWith :: (a -> a -> a) -> [(Key, a)] -> IntMap a-fromListWithKey :: (Key -> a -> a -> a) -> [(Key, a)] -> IntMap a-toAscList :: IntMap a -> [(Key, a)]-fromAscList :: [(Key, a)] -> IntMap a-fromAscListWith :: (a -> a -> a) -> [(Key, a)] -> IntMap a-fromAscListWithKey :: (Key -> a -> a -> a) -> [(Key, a)] -> IntMap a-fromDistinctAscList :: [(Key, a)] -> IntMap a-filter :: (a -> Bool) -> IntMap a -> IntMap a-filterWithKey :: (Key -> a -> Bool) -> IntMap a -> IntMap a-partition :: (a -> Bool) -> IntMap a -> (IntMap a, IntMap a)-partitionWithKey :: (Key -> a -> Bool) -> IntMap a -> (IntMap a, IntMap a)-mapMaybe :: (a -> Maybe b) -> IntMap a -> IntMap b-mapMaybeWithKey :: (Key -> a -> Maybe b) -> IntMap a -> IntMap b-mapEither :: (a -> Either b c) -> IntMap a -> (IntMap b, IntMap c)-mapEitherWithKey :: (Key -> a -> Either b c) -> IntMap a -> (IntMap b, IntMap c)-split :: Key -> IntMap a -> (IntMap a, IntMap a)-splitLookup :: Key -> IntMap a -> (IntMap a, Maybe a, IntMap a)-isSubmapOf :: Eq a => IntMap a -> IntMap a -> Bool-isSubmapOfBy :: (a -> b -> Bool) -> IntMap a -> IntMap b -> Bool-isProperSubmapOf :: Eq a => IntMap a -> IntMap a -> Bool-isProperSubmapOfBy :: (a -> b -> Bool) -> IntMap a -> IntMap b -> Bool-updateMin :: (a -> a) -> IntMap a -> IntMap a-updateMax :: (a -> a) -> IntMap a -> IntMap a-updateMinWithKey :: (Key -> a -> a) -> IntMap a -> IntMap a-updateMaxWithKey :: (Key -> a -> a) -> IntMap a -> IntMap a-minViewWithKey :: Monad m => IntMap a -> m ((Key, a), IntMap a)-maxViewWithKey :: Monad m => IntMap a -> m ((Key, a), IntMap a)-showTree :: Show a => IntMap a -> String-showTreeWith :: Show a => Bool -> Bool -> IntMap a -> String--module Data.Graph-stronglyConnComp :: Ord key => [(node, key, [key])] -> [SCC node]-stronglyConnCompR :: Ord key => [(node, key, [key])] -> [SCC (node, key, [key])]-data SCC vertex-AcyclicSCC :: vertex -> SCC vertex-CyclicSCC :: [vertex] -> SCC vertex-flattenSCC :: SCC vertex -> [vertex]-flattenSCCs :: [SCC a] -> [a]-type Graph = Table [Vertex]-type Table a = Array Vertex a-type Bounds = (Vertex, Vertex)-type Edge = (Vertex, Vertex)-type Vertex = Int-graphFromEdges :: Ord key => [(node, key, [key])] -> (Graph, Vertex -> (node, key, [key]), key -> Maybe Vertex)-graphFromEdges' :: Ord key => [(node, key, [key])] -> (Graph, Vertex -> (node, key, [key]))-buildG :: Bounds -> [Edge] -> Graph-transposeG :: Graph -> Graph-vertices :: Graph -> [Vertex]-edges :: Graph -> [Edge]-outdegree :: Graph -> Table Int-indegree :: Graph -> Table Int-dfs :: Graph -> [Vertex] -> Forest Vertex-dff :: Graph -> Forest Vertex-topSort :: Graph -> [Vertex]-components :: Graph -> Forest Vertex-scc :: Graph -> Forest Vertex-bcc :: Graph -> Forest [Vertex]-reachable :: Graph -> Vertex -> [Vertex]-path :: Graph -> Vertex -> Vertex -> Bool--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module System.Directory-createDirectory :: FilePath -> IO ()-createDirectoryIfMissing :: Bool -> FilePath -> IO ()-removeDirectory :: FilePath -> IO ()-removeDirectoryRecursive :: FilePath -> IO ()-renameDirectory :: FilePath -> FilePath -> IO ()-getDirectoryContents :: FilePath -> IO [FilePath]-getCurrentDirectory :: IO FilePath-setCurrentDirectory :: FilePath -> IO ()-getHomeDirectory :: IO FilePath-getAppUserDataDirectory :: String -> IO FilePath-getUserDocumentsDirectory :: IO FilePath-getTemporaryDirectory :: IO FilePath-removeFile :: FilePath -> IO ()-renameFile :: FilePath -> FilePath -> IO ()-copyFile :: FilePath -> FilePath -> IO ()-canonicalizePath :: FilePath -> IO FilePath-makeRelativeToCurrentDirectory :: FilePath -> IO FilePath-findExecutable :: String -> IO (Maybe FilePath)-doesFileExist :: FilePath -> IO Bool-doesDirectoryExist :: FilePath -> IO Bool-data Permissions-Permissions :: Bool -> Bool -> Bool -> Bool -> Permissions-readable :: Permissions -> Bool-writable :: Permissions -> Bool-executable :: Permissions -> Bool-searchable :: Permissions -> Bool-instance Eq Permissions-instance Ord Permissions-instance Read Permissions-instance Show Permissions-getPermissions :: FilePath -> IO Permissions-setPermissions :: FilePath -> Permissions -> IO ()-getModificationTime :: FilePath -> IO ClockTime--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module System.FilePath.Windows-pathSeparator :: Char-pathSeparators :: [Char]-isPathSeparator :: Char -> Bool-searchPathSeparator :: Char-isSearchPathSeparator :: Char -> Bool-extSeparator :: Char-isExtSeparator :: Char -> Bool-splitSearchPath :: String -> [FilePath]-getSearchPath :: IO [FilePath]-splitExtension :: FilePath -> (String, String)-takeExtension :: FilePath -> String-replaceExtension :: FilePath -> String -> FilePath-dropExtension :: FilePath -> FilePath-addExtension :: FilePath -> String -> FilePath-hasExtension :: FilePath -> Bool-(<.>) :: FilePath -> String -> FilePath-splitExtensions :: FilePath -> (FilePath, String)-dropExtensions :: FilePath -> FilePath-takeExtensions :: FilePath -> String-splitDrive :: FilePath -> (FilePath, FilePath)-joinDrive :: FilePath -> FilePath -> FilePath-takeDrive :: FilePath -> FilePath-hasDrive :: FilePath -> Bool-dropDrive :: FilePath -> FilePath-isDrive :: FilePath -> Bool-splitFileName :: FilePath -> (String, String)-takeFileName :: FilePath -> FilePath-replaceFileName :: FilePath -> String -> FilePath-dropFileName :: FilePath -> FilePath-takeBaseName :: FilePath -> String-replaceBaseName :: FilePath -> String -> FilePath-takeDirectory :: FilePath -> FilePath-replaceDirectory :: FilePath -> String -> FilePath-combine :: FilePath -> FilePath -> FilePath-(</>) :: FilePath -> FilePath -> FilePath-splitPath :: FilePath -> [FilePath]-joinPath :: [FilePath] -> FilePath-splitDirectories :: FilePath -> [FilePath]-hasTrailingPathSeparator :: FilePath -> Bool-addTrailingPathSeparator :: FilePath -> FilePath-dropTrailingPathSeparator :: FilePath -> FilePath-normalise :: FilePath -> FilePath-equalFilePath :: FilePath -> FilePath -> Bool-makeRelative :: FilePath -> FilePath -> FilePath-isRelative :: FilePath -> Bool-isAbsolute :: FilePath -> Bool-isValid :: FilePath -> Bool-makeValid :: FilePath -> FilePath--module System.FilePath.Posix-pathSeparator :: Char-pathSeparators :: [Char]-isPathSeparator :: Char -> Bool-searchPathSeparator :: Char-isSearchPathSeparator :: Char -> Bool-extSeparator :: Char-isExtSeparator :: Char -> Bool-splitSearchPath :: String -> [FilePath]-getSearchPath :: IO [FilePath]-splitExtension :: FilePath -> (String, String)-takeExtension :: FilePath -> String-replaceExtension :: FilePath -> String -> FilePath-dropExtension :: FilePath -> FilePath-addExtension :: FilePath -> String -> FilePath-hasExtension :: FilePath -> Bool-(<.>) :: FilePath -> String -> FilePath-splitExtensions :: FilePath -> (FilePath, String)-dropExtensions :: FilePath -> FilePath-takeExtensions :: FilePath -> String-splitDrive :: FilePath -> (FilePath, FilePath)-joinDrive :: FilePath -> FilePath -> FilePath-takeDrive :: FilePath -> FilePath-hasDrive :: FilePath -> Bool-dropDrive :: FilePath -> FilePath-isDrive :: FilePath -> Bool-splitFileName :: FilePath -> (String, String)-takeFileName :: FilePath -> FilePath-replaceFileName :: FilePath -> String -> FilePath-dropFileName :: FilePath -> FilePath-takeBaseName :: FilePath -> String-replaceBaseName :: FilePath -> String -> FilePath-takeDirectory :: FilePath -> FilePath-replaceDirectory :: FilePath -> String -> FilePath-combine :: FilePath -> FilePath -> FilePath-(</>) :: FilePath -> FilePath -> FilePath-splitPath :: FilePath -> [FilePath]-joinPath :: [FilePath] -> FilePath-splitDirectories :: FilePath -> [FilePath]-hasTrailingPathSeparator :: FilePath -> Bool-addTrailingPathSeparator :: FilePath -> FilePath-dropTrailingPathSeparator :: FilePath -> FilePath-normalise :: FilePath -> FilePath-equalFilePath :: FilePath -> FilePath -> Bool-makeRelative :: FilePath -> FilePath -> FilePath-isRelative :: FilePath -> Bool-isAbsolute :: FilePath -> Bool-isValid :: FilePath -> Bool-makeValid :: FilePath -> FilePath--module System.FilePath--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Language.Haskell.Syntax-data HsModule-HsModule :: SrcLoc -> Module -> Maybe [HsExportSpec] -> [HsImportDecl] -> [HsDecl] -> HsModule-instance Data HsModule-instance Pretty HsModule-instance Show HsModule-instance Typeable HsModule-data HsExportSpec-HsEVar :: HsQName -> HsExportSpec-HsEAbs :: HsQName -> HsExportSpec-HsEThingAll :: HsQName -> HsExportSpec-HsEThingWith :: HsQName -> [HsCName] -> HsExportSpec-HsEModuleContents :: Module -> HsExportSpec-instance Data HsExportSpec-instance Eq HsExportSpec-instance Pretty HsExportSpec-instance Show HsExportSpec-instance Typeable HsExportSpec-data HsImportDecl-HsImportDecl :: SrcLoc -> Module -> Bool -> Maybe Module -> Maybe (Bool, [HsImportSpec]) -> HsImportDecl-importLoc :: HsImportDecl -> SrcLoc-importModule :: HsImportDecl -> Module-importQualified :: HsImportDecl -> Bool-importAs :: HsImportDecl -> Maybe Module-importSpecs :: HsImportDecl -> Maybe (Bool, [HsImportSpec])-instance Data HsImportDecl-instance Eq HsImportDecl-instance Pretty HsImportDecl-instance Show HsImportDecl-instance Typeable HsImportDecl-data HsImportSpec-HsIVar :: HsName -> HsImportSpec-HsIAbs :: HsName -> HsImportSpec-HsIThingAll :: HsName -> HsImportSpec-HsIThingWith :: HsName -> [HsCName] -> HsImportSpec-instance Data HsImportSpec-instance Eq HsImportSpec-instance Pretty HsImportSpec-instance Show HsImportSpec-instance Typeable HsImportSpec-data HsAssoc-HsAssocNone :: HsAssoc-HsAssocLeft :: HsAssoc-HsAssocRight :: HsAssoc-instance Data HsAssoc-instance Eq HsAssoc-instance Pretty HsAssoc-instance Show HsAssoc-instance Typeable HsAssoc-data HsDecl-HsTypeDecl :: SrcLoc -> HsName -> [HsName] -> HsType -> HsDecl-HsDataDecl :: SrcLoc -> HsContext -> HsName -> [HsName] -> [HsConDecl] -> [HsQName] -> HsDecl-HsInfixDecl :: SrcLoc -> HsAssoc -> Int -> [HsOp] -> HsDecl-HsNewTypeDecl :: SrcLoc -> HsContext -> HsName -> [HsName] -> HsConDecl -> [HsQName] -> HsDecl-HsClassDecl :: SrcLoc -> HsContext -> HsName -> [HsName] -> [HsDecl] -> HsDecl-HsInstDecl :: SrcLoc -> HsContext -> HsQName -> [HsType] -> [HsDecl] -> HsDecl-HsDefaultDecl :: SrcLoc -> [HsType] -> HsDecl-HsTypeSig :: SrcLoc -> [HsName] -> HsQualType -> HsDecl-HsFunBind :: [HsMatch] -> HsDecl-HsPatBind :: SrcLoc -> HsPat -> HsRhs -> [HsDecl] -> HsDecl-HsForeignImport :: SrcLoc -> String -> HsSafety -> String -> HsName -> HsType -> HsDecl-HsForeignExport :: SrcLoc -> String -> String -> HsName -> HsType -> HsDecl-instance Data HsDecl-instance Eq HsDecl-instance Pretty HsDecl-instance Show HsDecl-instance Typeable HsDecl-data HsConDecl-HsConDecl :: SrcLoc -> HsName -> [HsBangType] -> HsConDecl-HsRecDecl :: SrcLoc -> HsName -> [([HsName], HsBangType)] -> HsConDecl-instance Data HsConDecl-instance Eq HsConDecl-instance Pretty HsConDecl-instance Show HsConDecl-instance Typeable HsConDecl-data HsBangType-HsBangedTy :: HsType -> HsBangType-HsUnBangedTy :: HsType -> HsBangType-instance Data HsBangType-instance Eq HsBangType-instance Pretty HsBangType-instance Show HsBangType-instance Typeable HsBangType-data HsMatch-HsMatch :: SrcLoc -> HsName -> [HsPat] -> HsRhs -> [HsDecl] -> HsMatch-instance Data HsMatch-instance Eq HsMatch-instance Pretty HsMatch-instance Show HsMatch-instance Typeable HsMatch-data HsRhs-HsUnGuardedRhs :: HsExp -> HsRhs-HsGuardedRhss :: [HsGuardedRhs] -> HsRhs-instance Data HsRhs-instance Eq HsRhs-instance Pretty HsRhs-instance Show HsRhs-instance Typeable HsRhs-data HsGuardedRhs-HsGuardedRhs :: SrcLoc -> HsExp -> HsExp -> HsGuardedRhs-instance Data HsGuardedRhs-instance Eq HsGuardedRhs-instance Pretty HsGuardedRhs-instance Show HsGuardedRhs-instance Typeable HsGuardedRhs-data HsSafety-HsSafe :: HsSafety-HsUnsafe :: HsSafety-instance Data HsSafety-instance Eq HsSafety-instance Ord HsSafety-instance Pretty HsSafety-instance Show HsSafety-instance Typeable HsSafety-data HsQualType-HsQualType :: HsContext -> HsType -> HsQualType-instance Data HsQualType-instance Eq HsQualType-instance Pretty HsQualType-instance Show HsQualType-instance Typeable HsQualType-type HsContext = [HsAsst]-type HsAsst = (HsQName, [HsType])-data HsType-HsTyFun :: HsType -> HsType -> HsType-HsTyTuple :: [HsType] -> HsType-HsTyApp :: HsType -> HsType -> HsType-HsTyVar :: HsName -> HsType-HsTyCon :: HsQName -> HsType-instance Data HsType-instance Eq HsType-instance Pretty HsType-instance Show HsType-instance Typeable HsType-data HsExp-HsVar :: HsQName -> HsExp-HsCon :: HsQName -> HsExp-HsLit :: HsLiteral -> HsExp-HsInfixApp :: HsExp -> HsQOp -> HsExp -> HsExp-HsApp :: HsExp -> HsExp -> HsExp-HsNegApp :: HsExp -> HsExp-HsLambda :: SrcLoc -> [HsPat] -> HsExp -> HsExp-HsLet :: [HsDecl] -> HsExp -> HsExp-HsIf :: HsExp -> HsExp -> HsExp -> HsExp-HsCase :: HsExp -> [HsAlt] -> HsExp-HsDo :: [HsStmt] -> HsExp-HsTuple :: [HsExp] -> HsExp-HsList :: [HsExp] -> HsExp-HsParen :: HsExp -> HsExp-HsLeftSection :: HsExp -> HsQOp -> HsExp-HsRightSection :: HsQOp -> HsExp -> HsExp-HsRecConstr :: HsQName -> [HsFieldUpdate] -> HsExp-HsRecUpdate :: HsExp -> [HsFieldUpdate] -> HsExp-HsEnumFrom :: HsExp -> HsExp-HsEnumFromTo :: HsExp -> HsExp -> HsExp-HsEnumFromThen :: HsExp -> HsExp -> HsExp-HsEnumFromThenTo :: HsExp -> HsExp -> HsExp -> HsExp-HsListComp :: HsExp -> [HsStmt] -> HsExp-HsExpTypeSig :: SrcLoc -> HsExp -> HsQualType -> HsExp-HsAsPat :: HsName -> HsExp -> HsExp-HsWildCard :: HsExp-HsIrrPat :: HsExp -> HsExp-instance Data HsExp-instance Eq HsExp-instance Pretty HsExp-instance Show HsExp-instance Typeable HsExp-data HsStmt-HsGenerator :: SrcLoc -> HsPat -> HsExp -> HsStmt-HsQualifier :: HsExp -> HsStmt-HsLetStmt :: [HsDecl] -> HsStmt-instance Data HsStmt-instance Eq HsStmt-instance Pretty HsStmt-instance Show HsStmt-instance Typeable HsStmt-data HsFieldUpdate-HsFieldUpdate :: HsQName -> HsExp -> HsFieldUpdate-instance Data HsFieldUpdate-instance Eq HsFieldUpdate-instance Pretty HsFieldUpdate-instance Show HsFieldUpdate-instance Typeable HsFieldUpdate-data HsAlt-HsAlt :: SrcLoc -> HsPat -> HsGuardedAlts -> [HsDecl] -> HsAlt-instance Data HsAlt-instance Eq HsAlt-instance Pretty HsAlt-instance Show HsAlt-instance Typeable HsAlt-data HsGuardedAlts-HsUnGuardedAlt :: HsExp -> HsGuardedAlts-HsGuardedAlts :: [HsGuardedAlt] -> HsGuardedAlts-instance Data HsGuardedAlts-instance Eq HsGuardedAlts-instance Pretty HsGuardedAlts-instance Show HsGuardedAlts-instance Typeable HsGuardedAlts-data HsGuardedAlt-HsGuardedAlt :: SrcLoc -> HsExp -> HsExp -> HsGuardedAlt-instance Data HsGuardedAlt-instance Eq HsGuardedAlt-instance Pretty HsGuardedAlt-instance Show HsGuardedAlt-instance Typeable HsGuardedAlt-data HsPat-HsPVar :: HsName -> HsPat-HsPLit :: HsLiteral -> HsPat-HsPNeg :: HsPat -> HsPat-HsPInfixApp :: HsPat -> HsQName -> HsPat -> HsPat-HsPApp :: HsQName -> [HsPat] -> HsPat-HsPTuple :: [HsPat] -> HsPat-HsPList :: [HsPat] -> HsPat-HsPParen :: HsPat -> HsPat-HsPRec :: HsQName -> [HsPatField] -> HsPat-HsPAsPat :: HsName -> HsPat -> HsPat-HsPWildCard :: HsPat-HsPIrrPat :: HsPat -> HsPat-instance Data HsPat-instance Eq HsPat-instance Pretty HsPat-instance Show HsPat-instance Typeable HsPat-data HsPatField-HsPFieldPat :: HsQName -> HsPat -> HsPatField-instance Data HsPatField-instance Eq HsPatField-instance Pretty HsPatField-instance Show HsPatField-instance Typeable HsPatField-data HsLiteral-HsChar :: Char -> HsLiteral-HsString :: String -> HsLiteral-HsInt :: Integer -> HsLiteral-HsFrac :: Rational -> HsLiteral-HsCharPrim :: Char -> HsLiteral-HsStringPrim :: String -> HsLiteral-HsIntPrim :: Integer -> HsLiteral-HsFloatPrim :: Rational -> HsLiteral-HsDoublePrim :: Rational -> HsLiteral-instance Data HsLiteral-instance Eq HsLiteral-instance Pretty HsLiteral-instance Show HsLiteral-instance Typeable HsLiteral-newtype Module-Module :: String -> Module-instance Data Module-instance Eq Module-instance Ord Module-instance Pretty Module-instance Show Module-instance Typeable Module-data HsQName-Qual :: Module -> HsName -> HsQName-UnQual :: HsName -> HsQName-Special :: HsSpecialCon -> HsQName-instance Data HsQName-instance Eq HsQName-instance Ord HsQName-instance Pretty HsQName-instance Show HsQName-instance Typeable HsQName-data HsName-HsIdent :: String -> HsName-HsSymbol :: String -> HsName-instance Data HsName-instance Eq HsName-instance Ord HsName-instance Pretty HsName-instance Show HsName-instance Typeable HsName-data HsQOp-HsQVarOp :: HsQName -> HsQOp-HsQConOp :: HsQName -> HsQOp-instance Data HsQOp-instance Eq HsQOp-instance Ord HsQOp-instance Pretty HsQOp-instance Show HsQOp-instance Typeable HsQOp-data HsOp-HsVarOp :: HsName -> HsOp-HsConOp :: HsName -> HsOp-instance Data HsOp-instance Eq HsOp-instance Ord HsOp-instance Pretty HsOp-instance Show HsOp-instance Typeable HsOp-data HsSpecialCon-HsUnitCon :: HsSpecialCon-HsListCon :: HsSpecialCon-HsFunCon :: HsSpecialCon-HsTupleCon :: Int -> HsSpecialCon-HsCons :: HsSpecialCon-instance Data HsSpecialCon-instance Eq HsSpecialCon-instance Ord HsSpecialCon-instance Show HsSpecialCon-instance Typeable HsSpecialCon-data HsCName-HsVarName :: HsName -> HsCName-HsConName :: HsName -> HsCName-instance Data HsCName-instance Eq HsCName-instance Ord HsCName-instance Pretty HsCName-instance Show HsCName-instance Typeable HsCName-prelude_mod :: Module-main_mod :: Module-main_name :: HsName-unit_con_name :: HsQName-tuple_con_name :: Int -> HsQName-list_cons_name :: HsQName-unit_con :: HsExp-tuple_con :: Int -> HsExp-unit_tycon_name :: HsQName-fun_tycon_name :: HsQName-list_tycon_name :: HsQName-tuple_tycon_name :: Int -> HsQName-unit_tycon :: HsType-fun_tycon :: HsType-list_tycon :: HsType-tuple_tycon :: Int -> HsType-data SrcLoc-SrcLoc :: String -> Int -> Int -> SrcLoc-srcFilename :: SrcLoc -> String-srcLine :: SrcLoc -> Int-srcColumn :: SrcLoc -> Int-instance Data SrcLoc-instance Eq SrcLoc-instance Ord SrcLoc-instance Show SrcLoc-instance Typeable SrcLoc--module Language.Haskell.Pretty-class Pretty a-instance Pretty HsAlt-instance Pretty HsAssoc-instance Pretty HsBangType-instance Pretty HsCName-instance Pretty HsConDecl-instance Pretty HsDecl-instance Pretty HsExp-instance Pretty HsExportSpec-instance Pretty HsFieldUpdate-instance Pretty HsGuardedAlt-instance Pretty HsGuardedAlts-instance Pretty HsGuardedRhs-instance Pretty HsImportDecl-instance Pretty HsImportSpec-instance Pretty HsLiteral-instance Pretty HsMatch-instance Pretty HsModule-instance Pretty HsName-instance Pretty HsOp-instance Pretty HsPat-instance Pretty HsPatField-instance Pretty HsQName-instance Pretty HsQOp-instance Pretty HsQualType-instance Pretty HsRhs-instance Pretty HsSafety-instance Pretty HsStmt-instance Pretty HsType-instance Pretty Module-prettyPrintStyleMode :: Pretty a => Style -> PPHsMode -> a -> String-prettyPrintWithMode :: Pretty a => PPHsMode -> a -> String-prettyPrint :: Pretty a => a -> String-data PPHsMode-PPHsMode :: Indent -> Indent -> Indent -> Indent -> Indent -> Indent -> Bool -> PPLayout -> Bool -> Bool -> PPHsMode-classIndent :: PPHsMode -> Indent-doIndent :: PPHsMode -> Indent-caseIndent :: PPHsMode -> Indent-letIndent :: PPHsMode -> Indent-whereIndent :: PPHsMode -> Indent-onsideIndent :: PPHsMode -> Indent-spacing :: PPHsMode -> Bool-layout :: PPHsMode -> PPLayout-linePragmas :: PPHsMode -> Bool-comments :: PPHsMode -> Bool-type Indent = Int-data PPLayout-PPOffsideRule :: PPLayout-PPSemiColon :: PPLayout-PPInLine :: PPLayout-PPNoLayout :: PPLayout-instance Eq PPLayout-defaultMode :: PPHsMode--module Language.Haskell.Parser-parseModule :: String -> ParseResult HsModule-parseModuleWithMode :: ParseMode -> String -> ParseResult HsModule-data ParseMode-ParseMode :: String -> ParseMode-parseFilename :: ParseMode -> String-defaultParseMode :: ParseMode-data ParseResult a-ParseOk :: a -> ParseResult a-ParseFailed :: SrcLoc -> String -> ParseResult a-instance Show a => Show (ParseResult a)--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Control.Monad.Writer.Class-class (Monoid w, Monad m) => MonadWriter w m-tell :: MonadWriter w m => w -> m ()-listen :: MonadWriter w m => m a -> m (a, w)-pass :: MonadWriter w m => m (a, w -> w) -> m a-instance Monoid w => MonadWriter w (Writer w)-instance Monoid w => MonadWriter w (Writer w)-instance (Error e, MonadWriter w m) => MonadWriter w (ErrorT e m)-instance MonadWriter w m => MonadWriter w (ReaderT r m)-instance MonadWriter w m => MonadWriter w (StateT s m)-instance MonadWriter w m => MonadWriter w (StateT s m)-instance (Monoid w, Monad m) => MonadWriter w (WriterT w m)-instance (Monoid w, Monad m) => MonadWriter w (WriterT w m)-instance Monoid w => MonadWriter w (RWS r w s)-instance Monoid w => MonadWriter w (RWS r w s)-instance (Monoid w, Monad m) => MonadWriter w (RWST r w s m)-instance (Monoid w, Monad m) => MonadWriter w (RWST r w s m)-listens :: MonadWriter w m => (w -> b) -> m a -> m (a, b)-censor :: MonadWriter w m => (w -> w) -> m a -> m a--module Control.Monad.Trans-class MonadTrans t-lift :: (MonadTrans t, Monad m) => m a -> t m a-instance MonadTrans ListT-instance MonadTrans (ContT r)-instance Error e => MonadTrans (ErrorT e)-instance MonadTrans (ReaderT r)-instance MonadTrans (StateT s)-instance MonadTrans (StateT s)-instance Monoid w => MonadTrans (WriterT w)-instance Monoid w => MonadTrans (WriterT w)-instance Monoid w => MonadTrans (RWST r w s)-instance Monoid w => MonadTrans (RWST r w s)-class Monad m => MonadIO m-liftIO :: MonadIO m => IO a -> m a-instance MonadIO IO-instance MonadIO m => MonadIO (ListT m)-instance MonadIO m => MonadIO (ContT r m)-instance (Error e, MonadIO m) => MonadIO (ErrorT e m)-instance MonadIO m => MonadIO (ReaderT r m)-instance MonadIO m => MonadIO (StateT s m)-instance MonadIO m => MonadIO (StateT s m)-instance (Monoid w, MonadIO m) => MonadIO (WriterT w m)-instance (Monoid w, MonadIO m) => MonadIO (WriterT w m)-instance (Monoid w, MonadIO m) => MonadIO (RWST r w s m)-instance (Monoid w, MonadIO m) => MonadIO (RWST r w s m)--module Control.Monad.State.Class-class Monad m => MonadState s m-get :: MonadState s m => m s-put :: MonadState s m => s -> m ()-instance MonadState s m => MonadState s (ListT m)-instance MonadState s (State s)-instance MonadState s (State s)-instance MonadState s m => MonadState s (ContT r m)-instance (Error e, MonadState s m) => MonadState s (ErrorT e m)-instance MonadState s m => MonadState s (ReaderT r m)-instance Monad m => MonadState s (StateT s m)-instance Monad m => MonadState s (StateT s m)-instance (Monoid w, MonadState s m) => MonadState s (WriterT w m)-instance (Monoid w, MonadState s m) => MonadState s (WriterT w m)-instance Monoid w => MonadState s (RWS r w s)-instance Monoid w => MonadState s (RWS r w s)-instance (Monoid w, Monad m) => MonadState s (RWST r w s m)-instance (Monoid w, Monad m) => MonadState s (RWST r w s m)-modify :: MonadState s m => (s -> s) -> m ()-gets :: MonadState s m => (s -> a) -> m a--module Control.Monad.Reader.Class-class Monad m => MonadReader r m-ask :: MonadReader r m => m r-local :: MonadReader r m => (r -> r) -> m a -> m a-instance MonadReader r (Reader r)-instance MonadReader r ((->) r)-instance MonadReader s m => MonadReader s (ListT m)-instance (Error e, MonadReader r m) => MonadReader r (ErrorT e m)-instance Monad m => MonadReader r (ReaderT r m)-instance MonadReader r m => MonadReader r (StateT s m)-instance MonadReader r m => MonadReader r (StateT s m)-instance (Monoid w, MonadReader r m) => MonadReader r (WriterT w m)-instance (Monoid w, MonadReader r m) => MonadReader r (WriterT w m)-instance MonadReader r' m => MonadReader r' (ContT r m)-instance Monoid w => MonadReader r (RWS r w s)-instance Monoid w => MonadReader r (RWS r w s)-instance (Monoid w, Monad m) => MonadReader r (RWST r w s m)-instance (Monoid w, Monad m) => MonadReader r (RWST r w s m)-asks :: MonadReader r m => (r -> a) -> m a--module Control.Monad.RWS.Class-class (Monoid w, MonadReader r m, MonadWriter w m, MonadState s m) => MonadRWS r w s m-instance (Error e, MonadRWS r w s m) => MonadRWS r w s (ErrorT e m)-instance Monoid w => MonadRWS r w s (RWS r w s)-instance Monoid w => MonadRWS r w s (RWS r w s)-instance (Monoid w, Monad m) => MonadRWS r w s (RWST r w s m)-instance (Monoid w, Monad m) => MonadRWS r w s (RWST r w s m)--module Control.Monad.Identity-newtype Identity a-Identity :: a -> Identity a-runIdentity :: Identity a -> a-instance Functor Identity-instance Monad Identity-instance MonadFix Identity--module Control.Monad.Error.Class-class Error a-noMsg :: Error a => a-strMsg :: Error a => String -> a-instance Error IOError-instance Error String-class Monad m => MonadError e m-throwError :: MonadError e m => e -> m a-catchError :: MonadError e m => m a -> (e -> m a) -> m a-instance MonadError IOError IO-instance Error e => MonadError e (Either e)-instance MonadError e m => MonadError e (ListT m)-instance (Monad m, Error e) => MonadError e (ErrorT e m)-instance MonadError e m => MonadError e (ReaderT r m)-instance MonadError e m => MonadError e (StateT s m)-instance MonadError e m => MonadError e (StateT s m)-instance (Monoid w, MonadError e m) => MonadError e (WriterT w m)-instance (Monoid w, MonadError e m) => MonadError e (WriterT w m)-instance (Monoid w, MonadError e m) => MonadError e (RWST r w s m)-instance (Monoid w, MonadError e m) => MonadError e (RWST r w s m)--module Control.Monad.Cont.Class-class Monad m => MonadCont m-callCC :: MonadCont m => (a -> m b -> m a) -> m a-instance MonadCont (Cont r)-instance MonadCont m => MonadCont (ListT m)-instance Monad m => MonadCont (ContT r m)-instance (Error e, MonadCont m) => MonadCont (ErrorT e m)-instance MonadCont m => MonadCont (ReaderT r m)-instance MonadCont m => MonadCont (StateT s m)-instance MonadCont m => MonadCont (StateT s m)-instance (Monoid w, MonadCont m) => MonadCont (WriterT w m)-instance (Monoid w, MonadCont m) => MonadCont (WriterT w m)-instance (Monoid w, MonadCont m) => MonadCont (RWST r w s m)-instance (Monoid w, MonadCont m) => MonadCont (RWST r w s m)--module Control.Monad.Error-newtype ErrorT e m a-ErrorT :: m (Either e a) -> ErrorT e m a-runErrorT :: ErrorT e m a -> m (Either e a)-instance (Error e, MonadRWS r w s m) => MonadRWS r w s (ErrorT e m)-instance (Monad m, Error e) => MonadError e (ErrorT e m)-instance (Error e, MonadReader r m) => MonadReader r (ErrorT e m)-instance (Error e, MonadState s m) => MonadState s (ErrorT e m)-instance (Error e, MonadWriter w m) => MonadWriter w (ErrorT e m)-instance Error e => MonadTrans (ErrorT e)-instance Monad m => Functor (ErrorT e m)-instance (Monad m, Error e) => Monad (ErrorT e m)-instance (Error e, MonadCont m) => MonadCont (ErrorT e m)-instance (MonadFix m, Error e) => MonadFix (ErrorT e m)-instance (Error e, MonadIO m) => MonadIO (ErrorT e m)-instance (Monad m, Error e) => MonadPlus (ErrorT e m)-mapErrorT :: (m (Either e a) -> n (Either e' b)) -> ErrorT e m a -> ErrorT e' n b--module Control.Monad.List-newtype ListT m a-ListT :: m [a] -> ListT m a-runListT :: ListT m a -> m [a]-instance MonadTrans ListT-instance MonadError e m => MonadError e (ListT m)-instance MonadReader s m => MonadReader s (ListT m)-instance MonadState s m => MonadState s (ListT m)-instance Monad m => Functor (ListT m)-instance Monad m => Monad (ListT m)-instance MonadCont m => MonadCont (ListT m)-instance MonadIO m => MonadIO (ListT m)-instance Monad m => MonadPlus (ListT m)-mapListT :: (m [a] -> n [b]) -> ListT m a -> ListT n b--module Control.Monad.RWS.Lazy-newtype RWS r w s a-RWS :: (r -> s -> (a, s, w)) -> RWS r w s a-runRWS :: RWS r w s a -> r -> s -> (a, s, w)-instance Monoid w => MonadRWS r w s (RWS r w s)-instance Monoid w => MonadReader r (RWS r w s)-instance Monoid w => MonadState s (RWS r w s)-instance Monoid w => MonadWriter w (RWS r w s)-instance Functor (RWS r w s)-instance Monoid w => Monad (RWS r w s)-instance Monoid w => MonadFix (RWS r w s)-evalRWS :: RWS r w s a -> r -> s -> (a, w)-execRWS :: RWS r w s a -> r -> s -> (s, w)-mapRWS :: ((a, s, w) -> (b, s, w')) -> RWS r w s a -> RWS r w' s b-withRWS :: (r' -> s -> (r, s)) -> RWS r w s a -> RWS r' w s a-newtype RWST r w s m a-RWST :: (r -> s -> m (a, s, w)) -> RWST r w s m a-runRWST :: RWST r w s m a -> r -> s -> m (a, s, w)-instance (Monoid w, Monad m) => MonadRWS r w s (RWST r w s m)-instance (Monoid w, MonadError e m) => MonadError e (RWST r w s m)-instance (Monoid w, Monad m) => MonadReader r (RWST r w s m)-instance (Monoid w, Monad m) => MonadState s (RWST r w s m)-instance (Monoid w, Monad m) => MonadWriter w (RWST r w s m)-instance Monoid w => MonadTrans (RWST r w s)-instance Monad m => Functor (RWST r w s m)-instance (Monoid w, Monad m) => Monad (RWST r w s m)-instance (Monoid w, MonadCont m) => MonadCont (RWST r w s m)-instance (Monoid w, MonadFix m) => MonadFix (RWST r w s m)-instance (Monoid w, MonadIO m) => MonadIO (RWST r w s m)-instance (Monoid w, MonadPlus m) => MonadPlus (RWST r w s m)-evalRWST :: Monad m => RWST r w s m a -> r -> s -> m (a, w)-execRWST :: Monad m => RWST r w s m a -> r -> s -> m (s, w)-mapRWST :: (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n b-withRWST :: (r' -> s -> (r, s)) -> RWST r w s m a -> RWST r' w s m a--module Control.Monad.RWS--module Control.Monad.RWS.Strict-newtype RWS r w s a-RWS :: (r -> s -> (a, s, w)) -> RWS r w s a-runRWS :: RWS r w s a -> r -> s -> (a, s, w)-instance Monoid w => MonadRWS r w s (RWS r w s)-instance Monoid w => MonadReader r (RWS r w s)-instance Monoid w => MonadState s (RWS r w s)-instance Monoid w => MonadWriter w (RWS r w s)-instance Functor (RWS r w s)-instance Monoid w => Monad (RWS r w s)-instance Monoid w => MonadFix (RWS r w s)-evalRWS :: RWS r w s a -> r -> s -> (a, w)-execRWS :: RWS r w s a -> r -> s -> (s, w)-mapRWS :: ((a, s, w) -> (b, s, w')) -> RWS r w s a -> RWS r w' s b-withRWS :: (r' -> s -> (r, s)) -> RWS r w s a -> RWS r' w s a-newtype RWST r w s m a-RWST :: (r -> s -> m (a, s, w)) -> RWST r w s m a-runRWST :: RWST r w s m a -> r -> s -> m (a, s, w)-instance (Monoid w, Monad m) => MonadRWS r w s (RWST r w s m)-instance (Monoid w, MonadError e m) => MonadError e (RWST r w s m)-instance (Monoid w, Monad m) => MonadReader r (RWST r w s m)-instance (Monoid w, Monad m) => MonadState s (RWST r w s m)-instance (Monoid w, Monad m) => MonadWriter w (RWST r w s m)-instance Monoid w => MonadTrans (RWST r w s)-instance Monad m => Functor (RWST r w s m)-instance (Monoid w, Monad m) => Monad (RWST r w s m)-instance (Monoid w, MonadCont m) => MonadCont (RWST r w s m)-instance (Monoid w, MonadFix m) => MonadFix (RWST r w s m)-instance (Monoid w, MonadIO m) => MonadIO (RWST r w s m)-instance (Monoid w, MonadPlus m) => MonadPlus (RWST r w s m)-evalRWST :: Monad m => RWST r w s m a -> r -> s -> m (a, w)-execRWST :: Monad m => RWST r w s m a -> r -> s -> m (s, w)-mapRWST :: (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n b-withRWST :: (r' -> s -> (r, s)) -> RWST r w s m a -> RWST r' w s m a--module Control.Monad.Reader-newtype Reader r a-Reader :: (r -> a) -> Reader r a-runReader :: Reader r a -> r -> a-instance MonadReader r (Reader r)-instance Functor (Reader r)-instance Monad (Reader r)-instance MonadFix (Reader r)-mapReader :: (a -> b) -> Reader r a -> Reader r b-withReader :: (r' -> r) -> Reader r a -> Reader r' a-newtype ReaderT r m a-ReaderT :: (r -> m a) -> ReaderT r m a-runReaderT :: ReaderT r m a -> r -> m a-instance MonadError e m => MonadError e (ReaderT r m)-instance Monad m => MonadReader r (ReaderT r m)-instance MonadState s m => MonadState s (ReaderT r m)-instance MonadWriter w m => MonadWriter w (ReaderT r m)-instance MonadTrans (ReaderT r)-instance Monad m => Functor (ReaderT r m)-instance Monad m => Monad (ReaderT r m)-instance MonadCont m => MonadCont (ReaderT r m)-instance MonadFix m => MonadFix (ReaderT r m)-instance MonadIO m => MonadIO (ReaderT r m)-instance MonadPlus m => MonadPlus (ReaderT r m)-mapReaderT :: (m a -> n b) -> ReaderT w m a -> ReaderT w n b-withReaderT :: (r' -> r) -> ReaderT r m a -> ReaderT r' m a--module Control.Monad.State.Lazy-newtype State s a-State :: (s -> (a, s)) -> State s a-runState :: State s a -> s -> (a, s)-instance MonadState s (State s)-instance Functor (State s)-instance Monad (State s)-instance MonadFix (State s)-evalState :: State s a -> s -> a-execState :: State s a -> s -> s-mapState :: ((a, s) -> (b, s)) -> State s a -> State s b-withState :: (s -> s) -> State s a -> State s a-newtype StateT s m a-StateT :: (s -> m (a, s)) -> StateT s m a-runStateT :: StateT s m a -> s -> m (a, s)-instance MonadError e m => MonadError e (StateT s m)-instance MonadReader r m => MonadReader r (StateT s m)-instance Monad m => MonadState s (StateT s m)-instance MonadWriter w m => MonadWriter w (StateT s m)-instance MonadTrans (StateT s)-instance Monad m => Functor (StateT s m)-instance Monad m => Monad (StateT s m)-instance MonadCont m => MonadCont (StateT s m)-instance MonadFix m => MonadFix (StateT s m)-instance MonadIO m => MonadIO (StateT s m)-instance MonadPlus m => MonadPlus (StateT s m)-evalStateT :: Monad m => StateT s m a -> s -> m a-execStateT :: Monad m => StateT s m a -> s -> m s-mapStateT :: (m (a, s) -> n (b, s)) -> StateT s m a -> StateT s n b-withStateT :: (s -> s) -> StateT s m a -> StateT s m a--module Control.Monad.State--module Control.Monad.State.Strict-newtype State s a-State :: (s -> (a, s)) -> State s a-runState :: State s a -> s -> (a, s)-instance MonadState s (State s)-instance Functor (State s)-instance Monad (State s)-instance MonadFix (State s)-evalState :: State s a -> s -> a-execState :: State s a -> s -> s-mapState :: ((a, s) -> (b, s)) -> State s a -> State s b-withState :: (s -> s) -> State s a -> State s a-newtype StateT s m a-StateT :: (s -> m (a, s)) -> StateT s m a-runStateT :: StateT s m a -> s -> m (a, s)-instance MonadError e m => MonadError e (StateT s m)-instance MonadReader r m => MonadReader r (StateT s m)-instance Monad m => MonadState s (StateT s m)-instance MonadWriter w m => MonadWriter w (StateT s m)-instance MonadTrans (StateT s)-instance Monad m => Functor (StateT s m)-instance Monad m => Monad (StateT s m)-instance MonadCont m => MonadCont (StateT s m)-instance MonadFix m => MonadFix (StateT s m)-instance MonadIO m => MonadIO (StateT s m)-instance MonadPlus m => MonadPlus (StateT s m)-evalStateT :: Monad m => StateT s m a -> s -> m a-execStateT :: Monad m => StateT s m a -> s -> m s-mapStateT :: (m (a, s) -> n (b, s)) -> StateT s m a -> StateT s n b-withStateT :: (s -> s) -> StateT s m a -> StateT s m a--module Control.Monad.Writer.Lazy-newtype Writer w a-Writer :: (a, w) -> Writer w a-runWriter :: Writer w a -> (a, w)-instance Monoid w => MonadWriter w (Writer w)-instance Functor (Writer w)-instance Monoid w => Monad (Writer w)-instance Monoid w => MonadFix (Writer w)-execWriter :: Writer w a -> w-mapWriter :: ((a, w) -> (b, w')) -> Writer w a -> Writer w' b-newtype WriterT w m a-WriterT :: m (a, w) -> WriterT w m a-runWriterT :: WriterT w m a -> m (a, w)-instance (Monoid w, MonadError e m) => MonadError e (WriterT w m)-instance (Monoid w, MonadReader r m) => MonadReader r (WriterT w m)-instance (Monoid w, MonadState s m) => MonadState s (WriterT w m)-instance (Monoid w, Monad m) => MonadWriter w (WriterT w m)-instance Monoid w => MonadTrans (WriterT w)-instance Monad m => Functor (WriterT w m)-instance (Monoid w, Monad m) => Monad (WriterT w m)-instance (Monoid w, MonadCont m) => MonadCont (WriterT w m)-instance (Monoid w, MonadFix m) => MonadFix (WriterT w m)-instance (Monoid w, MonadIO m) => MonadIO (WriterT w m)-instance (Monoid w, MonadPlus m) => MonadPlus (WriterT w m)-execWriterT :: Monad m => WriterT w m a -> m w-mapWriterT :: (m (a, w) -> n (b, w')) -> WriterT w m a -> WriterT w' n b--module Control.Monad.Writer--module Control.Monad.Writer.Strict-newtype Writer w a-Writer :: (a, w) -> Writer w a-runWriter :: Writer w a -> (a, w)-instance Monoid w => MonadWriter w (Writer w)-instance Functor (Writer w)-instance Monoid w => Monad (Writer w)-instance Monoid w => MonadFix (Writer w)-execWriter :: Writer w a -> w-mapWriter :: ((a, w) -> (b, w')) -> Writer w a -> Writer w' b-newtype WriterT w m a-WriterT :: m (a, w) -> WriterT w m a-runWriterT :: WriterT w m a -> m (a, w)-instance (Monoid w, MonadError e m) => MonadError e (WriterT w m)-instance (Monoid w, MonadReader r m) => MonadReader r (WriterT w m)-instance (Monoid w, MonadState s m) => MonadState s (WriterT w m)-instance (Monoid w, Monad m) => MonadWriter w (WriterT w m)-instance Monoid w => MonadTrans (WriterT w)-instance Monad m => Functor (WriterT w m)-instance (Monoid w, Monad m) => Monad (WriterT w m)-instance (Monoid w, MonadCont m) => MonadCont (WriterT w m)-instance (Monoid w, MonadFix m) => MonadFix (WriterT w m)-instance (Monoid w, MonadIO m) => MonadIO (WriterT w m)-instance (Monoid w, MonadPlus m) => MonadPlus (WriterT w m)-execWriterT :: Monad m => WriterT w m a -> m w-mapWriterT :: (m (a, w) -> n (b, w')) -> WriterT w m a -> WriterT w' n b--module Control.Monad.Cont-newtype Cont r a-Cont :: (a -> r -> r) -> Cont r a-runCont :: Cont r a -> (a -> r) -> r-instance Functor (Cont r)-instance Monad (Cont r)-instance MonadCont (Cont r)-mapCont :: (r -> r) -> Cont r a -> Cont r a-withCont :: (b -> r -> a -> r) -> Cont r a -> Cont r b-newtype ContT r m a-ContT :: (a -> m r -> m r) -> ContT r m a-runContT :: ContT r m a -> (a -> m r) -> m r-instance MonadReader r' m => MonadReader r' (ContT r m)-instance MonadState s m => MonadState s (ContT r m)-instance MonadTrans (ContT r)-instance Monad m => Functor (ContT r m)-instance Monad m => Monad (ContT r m)-instance Monad m => MonadCont (ContT r m)-instance MonadIO m => MonadIO (ContT r m)-mapContT :: (m r -> m r) -> ContT r m a -> ContT r m a-withContT :: (b -> m r -> a -> m r) -> ContT r m a -> ContT r m b--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module System.Locale-data TimeLocale-TimeLocale :: [(String, String)] -> [(String, String)] -> [(String, String)] -> (String, String) -> String -> String -> String -> String -> TimeLocale-wDays :: TimeLocale -> [(String, String)]-months :: TimeLocale -> [(String, String)]-intervals :: TimeLocale -> [(String, String)]-amPm :: TimeLocale -> (String, String)-dateTimeFmt :: TimeLocale -> String-dateFmt :: TimeLocale -> String-timeFmt :: TimeLocale -> String-time12Fmt :: TimeLocale -> String-instance Eq TimeLocale-instance Ord TimeLocale-instance Show TimeLocale-defaultTimeLocale :: TimeLocale-iso8601DateFormat :: Maybe String -> String-rfc822DateFormat :: String--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module System.Time-data ClockTime-TOD :: Integer -> Integer -> ClockTime-instance Eq ClockTime-instance Ord ClockTime-instance Show ClockTime-getClockTime :: IO ClockTime-data TimeDiff-TimeDiff :: Int -> Int -> Int -> Int -> Int -> Int -> Integer -> TimeDiff-tdYear :: TimeDiff -> Int-tdMonth :: TimeDiff -> Int-tdDay :: TimeDiff -> Int-tdHour :: TimeDiff -> Int-tdMin :: TimeDiff -> Int-tdSec :: TimeDiff -> Int-tdPicosec :: TimeDiff -> Integer-instance Eq TimeDiff-instance Ord TimeDiff-instance Read TimeDiff-instance Show TimeDiff-noTimeDiff :: TimeDiff-diffClockTimes :: ClockTime -> ClockTime -> TimeDiff-addToClockTime :: TimeDiff -> ClockTime -> ClockTime-normalizeTimeDiff :: TimeDiff -> TimeDiff-timeDiffToString :: TimeDiff -> String-formatTimeDiff :: TimeLocale -> String -> TimeDiff -> String-data CalendarTime-CalendarTime :: Int -> Month -> Int -> Int -> Int -> Int -> Integer -> Day -> Int -> String -> Int -> Bool -> CalendarTime-ctYear :: CalendarTime -> Int-ctMonth :: CalendarTime -> Month-ctDay :: CalendarTime -> Int-ctHour :: CalendarTime -> Int-ctMin :: CalendarTime -> Int-ctSec :: CalendarTime -> Int-ctPicosec :: CalendarTime -> Integer-ctWDay :: CalendarTime -> Day-ctYDay :: CalendarTime -> Int-ctTZName :: CalendarTime -> String-ctTZ :: CalendarTime -> Int-ctIsDST :: CalendarTime -> Bool-instance Eq CalendarTime-instance Ord CalendarTime-instance Read CalendarTime-instance Show CalendarTime-data Month-January :: Month-February :: Month-March :: Month-April :: Month-May :: Month-June :: Month-July :: Month-August :: Month-September :: Month-October :: Month-November :: Month-December :: Month-instance Bounded Month-instance Enum Month-instance Eq Month-instance Ix Month-instance Ord Month-instance Read Month-instance Show Month-data Day-Sunday :: Day-Monday :: Day-Tuesday :: Day-Wednesday :: Day-Thursday :: Day-Friday :: Day-Saturday :: Day-instance Bounded Day-instance Enum Day-instance Eq Day-instance Ix Day-instance Ord Day-instance Read Day-instance Show Day-toCalendarTime :: ClockTime -> IO CalendarTime-toUTCTime :: ClockTime -> CalendarTime-toClockTime :: CalendarTime -> ClockTime-calendarTimeToString :: CalendarTime -> String-formatCalendarTime :: TimeLocale -> String -> CalendarTime -> String--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Data.PackedString-data PackedString-instance Data PackedString-instance Eq PackedString-instance Ord PackedString-instance Show PackedString-instance Typeable PackedString-packString :: String -> PackedString-unpackPS :: PackedString -> String-hPutPS :: Handle -> PackedString -> IO ()-hGetPS :: Handle -> Int -> IO PackedString-nilPS :: PackedString-consPS :: Char -> PackedString -> PackedString-headPS :: PackedString -> Char-tailPS :: PackedString -> PackedString-nullPS :: PackedString -> Bool-appendPS :: PackedString -> PackedString -> PackedString-lengthPS :: PackedString -> Int-indexPS :: PackedString -> Int -> Char-mapPS :: (Char -> Char) -> PackedString -> PackedString-filterPS :: (Char -> Bool) -> PackedString -> PackedString-reversePS :: PackedString -> PackedString-concatPS :: [PackedString] -> PackedString-elemPS :: Char -> PackedString -> Bool-substrPS :: PackedString -> Int -> Int -> PackedString-takePS :: Int -> PackedString -> PackedString-dropPS :: Int -> PackedString -> PackedString-splitAtPS :: Int -> PackedString -> (PackedString, PackedString)-foldlPS :: (a -> Char -> a) -> a -> PackedString -> a-foldrPS :: (Char -> a -> a) -> a -> PackedString -> a-takeWhilePS :: (Char -> Bool) -> PackedString -> PackedString-dropWhilePS :: (Char -> Bool) -> PackedString -> PackedString-spanPS :: (Char -> Bool) -> PackedString -> (PackedString, PackedString)-breakPS :: (Char -> Bool) -> PackedString -> (PackedString, PackedString)-linesPS :: PackedString -> [PackedString]-unlinesPS :: [PackedString] -> PackedString-wordsPS :: PackedString -> [PackedString]-unwordsPS :: [PackedString] -> PackedString-splitPS :: Char -> PackedString -> [PackedString]-splitWithPS :: (Char -> Bool) -> PackedString -> [PackedString]-joinPS :: PackedString -> [PackedString] -> PackedString--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Control.Parallel-par :: a -> b -> b-pseq :: a -> b -> b--module Control.Parallel.Strategies-type Done = ()-type Strategy a = a -> Done-(>|) :: Done -> Done -> Done-(>||) :: Done -> Done -> Done-using :: a -> Strategy a -> a-demanding :: a -> Done -> a-sparking :: a -> Done -> a-r0 :: Strategy a-rwhnf :: Strategy a-class NFData a-rnf :: NFData a => Strategy a-instance NFData Bool-instance NFData Char-instance NFData Double-instance NFData Float-instance NFData Int-instance NFData Int16-instance NFData Int32-instance NFData Int64-instance NFData Int8-instance NFData IntSet-instance NFData Integer-instance NFData Word16-instance NFData Word32-instance NFData Word64-instance NFData Word8-instance NFData ()-instance (NFData a, NFData b) => NFData (a, b)-instance (NFData a, NFData b, NFData c) => NFData (a, b, c)-instance (NFData a, NFData b, NFData c, NFData d) => NFData (a, b, c, d)-instance (NFData a1, NFData a2, NFData a3, NFData a4, NFData a5) => NFData (a1, a2, a3, a4, a5)-instance (NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6) => NFData (a1, a2, a3, a4, a5, a6)-instance (NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7) => NFData (a1, a2, a3, a4, a5, a6, a7)-instance (NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7, NFData a8) => NFData (a1, a2, a3, a4, a5, a6, a7, a8)-instance (NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7, NFData a8, NFData a9) => NFData (a1, a2, a3, a4, a5, a6, a7, a8, a9)-instance (RealFloat a, NFData a) => NFData (Complex a)-instance NFData a => NFData (IntMap a)-instance NFData a => NFData (Maybe a)-instance (Integral a, NFData a) => NFData (Ratio a)-instance NFData a => NFData (Set a)-instance NFData a => NFData (Tree a)-instance NFData a => NFData [a]-instance (Ix a, NFData a, NFData b) => NFData (Array a b)-instance (NFData a, NFData b) => NFData (Assoc a b)-instance (NFData a, NFData b) => NFData (Either a b)-instance (NFData k, NFData a) => NFData (Map k a)-($|) :: (a -> b) -> Strategy a -> a -> b-($||) :: (a -> b) -> Strategy a -> a -> b-(.|) :: (b -> c) -> Strategy b -> (a -> b) -> a -> c-(.||) :: (b -> c) -> Strategy b -> (a -> b) -> a -> c-(-|) :: (a -> b) -> Strategy b -> (b -> c) -> a -> c-(-||) :: (a -> b) -> Strategy b -> (b -> c) -> a -> c-seqPair :: Strategy a -> Strategy b -> Strategy (a, b)-parPair :: Strategy a -> Strategy b -> Strategy (a, b)-seqTriple :: Strategy a -> Strategy b -> Strategy c -> Strategy (a, b, c)-parTriple :: Strategy a -> Strategy b -> Strategy c -> Strategy (a, b, c)-parList :: Strategy a -> Strategy [a]-parListN :: Integral b => b -> Strategy a -> Strategy [a]-parListNth :: Int -> Strategy a -> Strategy [a]-parListChunk :: Int -> Strategy a -> Strategy [a]-parMap :: Strategy b -> (a -> b) -> [a] -> [b]-parFlatMap :: Strategy [b] -> (a -> [b]) -> [a] -> [b]-parZipWith :: Strategy c -> (a -> b -> c) -> [a] -> [b] -> [c]-seqList :: Strategy a -> Strategy [a]-seqListN :: Integral a => a -> Strategy b -> Strategy [b]-seqListNth :: Int -> Strategy b -> Strategy [b]-parBuffer :: Int -> Strategy a -> [a] -> [a]-seqArr :: Ix b => Strategy a -> Strategy (Array b a)-parArr :: Ix b => Strategy a -> Strategy (Array b a)-sPar :: a -> Strategy b-sSeq :: a -> Strategy b-data Assoc a b-(:=) :: a -> b -> Assoc a b-instance (NFData a, NFData b) => NFData (Assoc a b)-fstPairFstList :: NFData a => Strategy [(a, b)]-force :: NFData a => a -> a-sforce :: NFData a => a -> b -> b--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Text.ParserCombinators.Parsec.Pos-type SourceName = String-type Line = Int-type Column = Int-data SourcePos-instance Eq SourcePos-instance Ord SourcePos-instance Show SourcePos-sourceLine :: SourcePos -> Line-sourceColumn :: SourcePos -> Column-sourceName :: SourcePos -> SourceName-incSourceLine :: SourcePos -> Line -> SourcePos-incSourceColumn :: SourcePos -> Column -> SourcePos-setSourceLine :: SourcePos -> Line -> SourcePos-setSourceColumn :: SourcePos -> Column -> SourcePos-setSourceName :: SourcePos -> SourceName -> SourcePos-newPos :: SourceName -> Line -> Column -> SourcePos-initialPos :: SourceName -> SourcePos-updatePosChar :: SourcePos -> Char -> SourcePos-updatePosString :: SourcePos -> String -> SourcePos--module Text.ParserCombinators.Parsec.Error-data Message-SysUnExpect :: String -> Message-UnExpect :: String -> Message-Expect :: String -> Message-Message :: String -> Message-messageString :: Message -> String-messageCompare :: Message -> Message -> Ordering-messageEq :: Message -> Message -> Bool-data ParseError-instance Show ParseError-errorPos :: ParseError -> SourcePos-errorMessages :: ParseError -> [Message]-errorIsUnknown :: ParseError -> Bool-showErrorMessages :: String -> String -> String -> String -> String -> [Message] -> String-newErrorMessage :: Message -> SourcePos -> ParseError-newErrorUnknown :: SourcePos -> ParseError-addErrorMessage :: Message -> ParseError -> ParseError-setErrorPos :: SourcePos -> ParseError -> ParseError-setErrorMessage :: Message -> ParseError -> ParseError-mergeError :: ParseError -> ParseError -> ParseError--module Text.ParserCombinators.Parsec.Prim-(<?>) :: GenParser tok st a -> String -> GenParser tok st a-(<|>) :: GenParser tok st a -> GenParser tok st a -> GenParser tok st a-type Parser a = GenParser Char () a-data GenParser tok st a-instance Functor (GenParser tok st)-instance Monad (GenParser tok st)-instance MonadPlus (GenParser tok st)-runParser :: GenParser tok st a -> st -> SourceName -> [tok] -> Either ParseError a-parse :: GenParser tok () a -> SourceName -> [tok] -> Either ParseError a-parseFromFile :: Parser a -> SourceName -> IO (Either ParseError a)-parseTest :: Show a => GenParser tok () a -> [tok] -> IO ()-token :: (tok -> String) -> (tok -> SourcePos) -> (tok -> Maybe a) -> GenParser tok st a-tokens :: Eq tok => ([tok] -> String) -> (SourcePos -> [tok] -> SourcePos) -> [tok] -> GenParser tok st [tok]-tokenPrim :: (tok -> String) -> (SourcePos -> tok -> [tok] -> SourcePos) -> (tok -> Maybe a) -> GenParser tok st a-tokenPrimEx :: (tok -> String) -> (SourcePos -> tok -> [tok] -> SourcePos) -> Maybe (SourcePos -> tok -> [tok] -> st -> st) -> (tok -> Maybe a) -> GenParser tok st a-try :: GenParser tok st a -> GenParser tok st a-label :: GenParser tok st a -> String -> GenParser tok st a-labels :: GenParser tok st a -> [String] -> GenParser tok st a-unexpected :: String -> GenParser tok st a-pzero :: GenParser tok st a-many :: GenParser tok st a -> GenParser tok st [a]-skipMany :: GenParser tok st a -> GenParser tok st ()-getState :: GenParser tok st st-setState :: st -> GenParser tok st ()-updateState :: (st -> st) -> GenParser tok st ()-getPosition :: GenParser tok st SourcePos-setPosition :: SourcePos -> GenParser tok st ()-getInput :: GenParser tok st [tok]-setInput :: [tok] -> GenParser tok st ()-data State tok st-State :: [tok] -> SourcePos -> st -> State tok st-stateInput :: State tok st -> [tok]-statePos :: State tok st -> SourcePos-stateUser :: State tok st -> st-getParserState :: GenParser tok st (State tok st)-setParserState :: State tok st -> GenParser tok st (State tok st)--module Text.ParserCombinators.Parsec.Combinator-choice :: [GenParser tok st a] -> GenParser tok st a-count :: Int -> GenParser tok st a -> GenParser tok st [a]-between :: GenParser tok st open -> GenParser tok st close -> GenParser tok st a -> GenParser tok st a-option :: a -> GenParser tok st a -> GenParser tok st a-optionMaybe :: GenParser tok st a -> GenParser tok st (Maybe a)-optional :: GenParser tok st a -> GenParser tok st ()-skipMany1 :: GenParser tok st a -> GenParser tok st ()-many1 :: GenParser tok st a -> GenParser tok st [a]-sepBy :: GenParser tok st a -> GenParser tok st sep -> GenParser tok st [a]-sepBy1 :: GenParser tok st a -> GenParser tok st sep -> GenParser tok st [a]-endBy :: GenParser tok st a -> GenParser tok st sep -> GenParser tok st [a]-endBy1 :: GenParser tok st a -> GenParser tok st sep -> GenParser tok st [a]-sepEndBy :: GenParser tok st a -> GenParser tok st sep -> GenParser tok st [a]-sepEndBy1 :: GenParser tok st a -> GenParser tok st sep -> GenParser tok st [a]-chainl :: GenParser tok st a -> GenParser tok st (a -> a -> a) -> a -> GenParser tok st a-chainl1 :: GenParser tok st a -> GenParser tok st (a -> a -> a) -> GenParser tok st a-chainr :: GenParser tok st a -> GenParser tok st (a -> a -> a) -> a -> GenParser tok st a-chainr1 :: GenParser tok st a -> GenParser tok st (a -> a -> a) -> GenParser tok st a-eof :: Show tok => GenParser tok st ()-notFollowedBy :: Show tok => GenParser tok st tok -> GenParser tok st ()-manyTill :: GenParser tok st a -> GenParser tok st end -> GenParser tok st [a]-lookAhead :: GenParser tok st a -> GenParser tok st a-anyToken :: Show tok => GenParser tok st tok--module Text.ParserCombinators.Parsec.Expr-data Assoc-AssocNone :: Assoc-AssocLeft :: Assoc-AssocRight :: Assoc-data Operator t st a-Infix :: GenParser t st (a -> a -> a) -> Assoc -> Operator t st a-Prefix :: GenParser t st (a -> a) -> Operator t st a-Postfix :: GenParser t st (a -> a) -> Operator t st a-type OperatorTable t st a = [[Operator t st a]]-buildExpressionParser :: OperatorTable tok st a -> GenParser tok st a -> GenParser tok st a--module Text.ParserCombinators.Parsec.Char-type CharParser st a = GenParser Char st a-spaces :: CharParser st ()-space :: CharParser st Char-newline :: CharParser st Char-tab :: CharParser st Char-upper :: CharParser st Char-lower :: CharParser st Char-alphaNum :: CharParser st Char-letter :: CharParser st Char-digit :: CharParser st Char-hexDigit :: CharParser st Char-octDigit :: CharParser st Char-char :: Char -> CharParser st Char-string :: String -> CharParser st String-anyChar :: CharParser st Char-oneOf :: [Char] -> CharParser st Char-noneOf :: [Char] -> CharParser st Char-satisfy :: (Char -> Bool) -> CharParser st Char--module Text.ParserCombinators.Parsec-data ParseError-instance Show ParseError-errorPos :: ParseError -> SourcePos-data SourcePos-instance Eq SourcePos-instance Ord SourcePos-instance Show SourcePos-type SourceName = String-type Line = Int-type Column = Int-sourceName :: SourcePos -> SourceName-sourceLine :: SourcePos -> Line-sourceColumn :: SourcePos -> Column-incSourceLine :: SourcePos -> Line -> SourcePos-incSourceColumn :: SourcePos -> Column -> SourcePos-setSourceLine :: SourcePos -> Line -> SourcePos-setSourceColumn :: SourcePos -> Column -> SourcePos-setSourceName :: SourcePos -> SourceName -> SourcePos--module Text.ParserCombinators.Parsec.Perm-data PermParser tok st a-permute :: PermParser tok st a -> GenParser tok st a-(<||>) :: PermParser tok st (a -> b) -> GenParser tok st a -> PermParser tok st b-(<$$>) :: (a -> b) -> GenParser tok st a -> PermParser tok st b-(<|?>) :: PermParser tok st (a -> b) -> (a, GenParser tok st a) -> PermParser tok st b-(<$?>) :: (a -> b) -> (a, GenParser tok st a) -> PermParser tok st b--module Text.ParserCombinators.Parsec.Token-data LanguageDef st-LanguageDef :: String -> String -> String -> Bool -> CharParser st Char -> CharParser st Char -> CharParser st Char -> CharParser st Char -> [String] -> [String] -> Bool -> LanguageDef st-commentStart :: LanguageDef st -> String-commentEnd :: LanguageDef st -> String-commentLine :: LanguageDef st -> String-nestedComments :: LanguageDef st -> Bool-identStart :: LanguageDef st -> CharParser st Char-identLetter :: LanguageDef st -> CharParser st Char-opStart :: LanguageDef st -> CharParser st Char-opLetter :: LanguageDef st -> CharParser st Char-reservedNames :: LanguageDef st -> [String]-reservedOpNames :: LanguageDef st -> [String]-caseSensitive :: LanguageDef st -> Bool-data TokenParser st-TokenParser :: CharParser st String -> (String -> CharParser st ()) -> CharParser st String -> (String -> CharParser st ()) -> CharParser st Char -> CharParser st String -> CharParser st Integer -> CharParser st Integer -> CharParser st Double -> CharParser st (Either Integer Double) -> CharParser st Integer -> CharParser st Integer -> CharParser st Integer -> (String -> CharParser st String) -> (CharParser st a -> CharParser st a) -> CharParser st () -> (CharParser st a -> CharParser st a) -> (CharParser st a -> CharParser st a) -> (CharParser st a -> CharParser st a) -> (CharParser st a -> CharParser st a) -> (CharParser st a -> CharParser st a) -> CharParser st String -> CharParser st String -> CharParser st String -> CharParser st String -> (CharParser st a -> CharParser st [a]) -> (CharParser st a -> CharParser st [a]) -> (CharParser st a -> CharParser st [a]) -> (CharParser st a -> CharParser st [a]) -> TokenParser st-identifier :: TokenParser st -> CharParser st String-reserved :: TokenParser st -> String -> CharParser st ()-operator :: TokenParser st -> CharParser st String-reservedOp :: TokenParser st -> String -> CharParser st ()-charLiteral :: TokenParser st -> CharParser st Char-stringLiteral :: TokenParser st -> CharParser st String-natural :: TokenParser st -> CharParser st Integer-integer :: TokenParser st -> CharParser st Integer-float :: TokenParser st -> CharParser st Double-naturalOrFloat :: TokenParser st -> CharParser st (Either Integer Double)-decimal :: TokenParser st -> CharParser st Integer-hexadecimal :: TokenParser st -> CharParser st Integer-octal :: TokenParser st -> CharParser st Integer-symbol :: TokenParser st -> String -> CharParser st String-lexeme :: TokenParser st -> CharParser st a -> CharParser st a-whiteSpace :: TokenParser st -> CharParser st ()-parens :: TokenParser st -> CharParser st a -> CharParser st a-braces :: TokenParser st -> CharParser st a -> CharParser st a-angles :: TokenParser st -> CharParser st a -> CharParser st a-brackets :: TokenParser st -> CharParser st a -> CharParser st a-squares :: TokenParser st -> CharParser st a -> CharParser st a-semi :: TokenParser st -> CharParser st String-comma :: TokenParser st -> CharParser st String-colon :: TokenParser st -> CharParser st String-dot :: TokenParser st -> CharParser st String-semiSep :: TokenParser st -> CharParser st a -> CharParser st [a]-semiSep1 :: TokenParser st -> CharParser st a -> CharParser st [a]-commaSep :: TokenParser st -> CharParser st a -> CharParser st [a]-commaSep1 :: TokenParser st -> CharParser st a -> CharParser st [a]-makeTokenParser :: LanguageDef st -> TokenParser st--module Text.ParserCombinators.Parsec.Language-haskellDef :: LanguageDef st-haskell :: TokenParser st-mondrianDef :: LanguageDef st-mondrian :: TokenParser st-emptyDef :: LanguageDef st-haskellStyle :: LanguageDef st-javaStyle :: LanguageDef st-data LanguageDef st-LanguageDef :: String -> String -> String -> Bool -> CharParser st Char -> CharParser st Char -> CharParser st Char -> CharParser st Char -> [String] -> [String] -> Bool -> LanguageDef st-commentStart :: LanguageDef st -> String-commentEnd :: LanguageDef st -> String-commentLine :: LanguageDef st -> String-nestedComments :: LanguageDef st -> Bool-identStart :: LanguageDef st -> CharParser st Char-identLetter :: LanguageDef st -> CharParser st Char-opStart :: LanguageDef st -> CharParser st Char-opLetter :: LanguageDef st -> CharParser st Char-reservedNames :: LanguageDef st -> [String]-reservedOpNames :: LanguageDef st -> [String]-caseSensitive :: LanguageDef st -> Bool--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Text.PrettyPrint.HughesPJ-data Doc-instance Show Doc-char :: Char -> Doc-text :: String -> Doc-ptext :: String -> Doc-int :: Int -> Doc-integer :: Integer -> Doc-float :: Float -> Doc-double :: Double -> Doc-rational :: Rational -> Doc-semi :: Doc-comma :: Doc-colon :: Doc-space :: Doc-equals :: Doc-lparen :: Doc-rparen :: Doc-lbrack :: Doc-rbrack :: Doc-lbrace :: Doc-rbrace :: Doc-parens :: Doc -> Doc-brackets :: Doc -> Doc-braces :: Doc -> Doc-quotes :: Doc -> Doc-doubleQuotes :: Doc -> Doc-empty :: Doc-(<>) :: Doc -> Doc -> Doc-(<+>) :: Doc -> Doc -> Doc-hcat :: [Doc] -> Doc-hsep :: [Doc] -> Doc-($$) :: Doc -> Doc -> Doc-($+$) :: Doc -> Doc -> Doc-vcat :: [Doc] -> Doc-sep :: [Doc] -> Doc-cat :: [Doc] -> Doc-fsep :: [Doc] -> Doc-fcat :: [Doc] -> Doc-nest :: Int -> Doc -> Doc-hang :: Doc -> Int -> Doc -> Doc-punctuate :: Doc -> [Doc] -> [Doc]-isEmpty :: Doc -> Bool-render :: Doc -> String-data Style-Style :: Mode -> Int -> Float -> Style-mode :: Style -> Mode-lineLength :: Style -> Int-ribbonsPerLine :: Style -> Float-style :: Style-renderStyle :: Style -> Doc -> String-fullRender :: Mode -> Int -> Float -> (TextDetails -> a -> a) -> a -> Doc -> a-data Mode-PageMode :: Mode-ZigZagMode :: Mode-LeftMode :: Mode-OneLineMode :: Mode-data TextDetails-Chr :: Char -> TextDetails-Str :: String -> TextDetails-PStr :: String -> TextDetails--module Text.PrettyPrint--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module System.Process-data ProcessHandle-runCommand :: String -> IO ProcessHandle-runProcess :: FilePath -> [String] -> Maybe FilePath -> Maybe [(String, String)] -> Maybe Handle -> Maybe Handle -> Maybe Handle -> IO ProcessHandle-runInteractiveCommand :: String -> IO (Handle, Handle, Handle, ProcessHandle)-runInteractiveProcess :: FilePath -> [String] -> Maybe FilePath -> Maybe [(String, String)] -> IO (Handle, Handle, Handle, ProcessHandle)-waitForProcess :: ProcessHandle -> IO ExitCode-getProcessExitCode :: ProcessHandle -> IO (Maybe ExitCode)-terminateProcess :: ProcessHandle -> IO ()--module System.Cmd-system :: String -> IO ExitCode-rawSystem :: String -> [String] -> IO ExitCode--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module System.Random-class RandomGen g-next :: RandomGen g => g -> (Int, g)-split :: RandomGen g => g -> (g, g)-genRange :: RandomGen g => g -> (Int, Int)-instance RandomGen StdGen-data StdGen-instance RandomGen StdGen-instance Read StdGen-instance Show StdGen-mkStdGen :: Int -> StdGen-getStdRandom :: (StdGen -> (a, StdGen)) -> IO a-getStdGen :: IO StdGen-setStdGen :: StdGen -> IO ()-newStdGen :: IO StdGen-class Random a-randomR :: (Random a, RandomGen g) => (a, a) -> g -> (a, g)-random :: (Random a, RandomGen g) => g -> (a, g)-randomRs :: (Random a, RandomGen g) => (a, a) -> g -> [a]-randoms :: (Random a, RandomGen g) => g -> [a]-randomRIO :: Random a => (a, a) -> IO a-randomIO :: Random a => IO a-instance Random Bool-instance Random Char-instance Random Double-instance Random Float-instance Random Int-instance Random Integer--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Control.Monad.STM-check :: Bool -> STM a--module Control.Concurrent.STM.TVar--module Control.Concurrent.STM.TMVar-data TMVar a-newTMVar :: a -> STM (TMVar a)-newEmptyTMVar :: STM (TMVar a)-newTMVarIO :: a -> IO (TMVar a)-newEmptyTMVarIO :: IO (TMVar a)-takeTMVar :: TMVar a -> STM a-putTMVar :: TMVar a -> a -> STM ()-readTMVar :: TMVar a -> STM a-swapTMVar :: TMVar a -> a -> STM a-tryTakeTMVar :: TMVar a -> STM (Maybe a)-tryPutTMVar :: TMVar a -> a -> STM Bool-isEmptyTMVar :: TMVar a -> STM Bool--module Control.Concurrent.STM.TChan-data TChan a-newTChan :: STM (TChan a)-newTChanIO :: IO (TChan a)-readTChan :: TChan a -> STM a-writeTChan :: TChan a -> a -> STM ()-dupTChan :: TChan a -> STM (TChan a)-unGetTChan :: TChan a -> a -> STM ()-isEmptyTChan :: TChan a -> STM Bool--module Control.Concurrent.STM.TArray-data TArray i e-instance MArray TArray e STM--module Control.Concurrent.STM--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Language.Haskell.TH.Syntax-class (Monad m, Functor m) => Quasi m-qNewName :: Quasi m => String -> m Name-qReport :: Quasi m => Bool -> String -> m ()-qRecover :: Quasi m => m a -> m a -> m a-qReify :: Quasi m => Name -> m Info-qCurrentModule :: Quasi m => m String-qRunIO :: Quasi m => IO a -> m a-instance Quasi IO-instance Quasi Q-class Lift t-lift :: Lift t => t -> Q Exp-instance Lift Bool-instance Lift Char-instance Lift Int-instance Lift Integer-instance (Lift a, Lift b) => Lift (a, b)-instance (Lift a, Lift b, Lift c) => Lift (a, b, c)-instance (Lift a, Lift b, Lift c, Lift d) => Lift (a, b, c, d)-instance (Lift a, Lift b, Lift c, Lift d, Lift e) => Lift (a, b, c, d, e)-instance (Lift a, Lift b, Lift c, Lift d, Lift e, Lift f) => Lift (a, b, c, d, e, f)-instance (Lift a, Lift b, Lift c, Lift d, Lift e, Lift f, Lift g) => Lift (a, b, c, d, e, f, g)-instance Lift a => Lift (Maybe a)-instance Lift a => Lift [a]-instance (Lift a, Lift b) => Lift (Either a b)-data Q a-instance Functor Q-instance Monad Q-instance Quasi Q-runQ :: Quasi m => Q a -> m a-report :: Bool -> String -> Q ()-recover :: Q a -> Q a -> Q a-reify :: Name -> Q Info-currentModule :: Q String-runIO :: IO a -> Q a-data Name-Name :: OccName -> NameFlavour -> Name-instance Data Name-instance Eq Name-instance Ord Name-instance Ppr Name-instance Show Name-instance Typeable Name-mkName :: String -> Name-newName :: String -> Q Name-nameBase :: Name -> String-nameModule :: Name -> Maybe String-showName :: Name -> String-showName' :: NameIs -> Name -> String-data NameIs-Alone :: NameIs-Applied :: NameIs-Infix :: NameIs-data Dec-FunD :: Name -> [Clause] -> Dec-ValD :: Pat -> Body -> [Dec] -> Dec-DataD :: Cxt -> Name -> [Name] -> [Con] -> [Name] -> Dec-NewtypeD :: Cxt -> Name -> [Name] -> Con -> [Name] -> Dec-TySynD :: Name -> [Name] -> Type -> Dec-ClassD :: Cxt -> Name -> [Name] -> [FunDep] -> [Dec] -> Dec-InstanceD :: Cxt -> Type -> [Dec] -> Dec-SigD :: Name -> Type -> Dec-ForeignD :: Foreign -> Dec-instance Data Dec-instance Eq Dec-instance Ppr Dec-instance Show Dec-instance Typeable Dec-data Exp-VarE :: Name -> Exp-ConE :: Name -> Exp-LitE :: Lit -> Exp-AppE :: Exp -> Exp -> Exp-InfixE :: Maybe Exp -> Exp -> Maybe Exp -> Exp-LamE :: [Pat] -> Exp -> Exp-TupE :: [Exp] -> Exp-CondE :: Exp -> Exp -> Exp -> Exp-LetE :: [Dec] -> Exp -> Exp-CaseE :: Exp -> [Match] -> Exp-DoE :: [Stmt] -> Exp-CompE :: [Stmt] -> Exp-ArithSeqE :: Range -> Exp-ListE :: [Exp] -> Exp-SigE :: Exp -> Type -> Exp-RecConE :: Name -> [FieldExp] -> Exp-RecUpdE :: Exp -> [FieldExp] -> Exp-instance Data Exp-instance Eq Exp-instance Ppr Exp-instance Show Exp-instance Typeable Exp-data Con-NormalC :: Name -> [StrictType] -> Con-RecC :: Name -> [VarStrictType] -> Con-InfixC :: StrictType -> Name -> StrictType -> Con-ForallC :: [Name] -> Cxt -> Con -> Con-instance Data Con-instance Eq Con-instance Ppr Con-instance Show Con-instance Typeable Con-data Type-ForallT :: [Name] -> Cxt -> Type -> Type-VarT :: Name -> Type-ConT :: Name -> Type-TupleT :: Int -> Type-ArrowT :: Type-ListT :: Type-AppT :: Type -> Type -> Type-instance Data Type-instance Eq Type-instance Ppr Type-instance Show Type-instance Typeable Type-type Cxt = [Type]-data Match-Match :: Pat -> Body -> [Dec] -> Match-instance Data Match-instance Eq Match-instance Ppr Match-instance Show Match-instance Typeable Match-data Clause-Clause :: [Pat] -> Body -> [Dec] -> Clause-instance Data Clause-instance Eq Clause-instance Ppr Clause-instance Show Clause-instance Typeable Clause-data Body-GuardedB :: [(Guard, Exp)] -> Body-NormalB :: Exp -> Body-instance Data Body-instance Eq Body-instance Show Body-instance Typeable Body-data Guard-NormalG :: Exp -> Guard-PatG :: [Stmt] -> Guard-instance Data Guard-instance Eq Guard-instance Show Guard-instance Typeable Guard-data Stmt-BindS :: Pat -> Exp -> Stmt-LetS :: [Dec] -> Stmt-NoBindS :: Exp -> Stmt-ParS :: [[Stmt]] -> Stmt-instance Data Stmt-instance Eq Stmt-instance Ppr Stmt-instance Show Stmt-instance Typeable Stmt-data Range-FromR :: Exp -> Range-FromThenR :: Exp -> Exp -> Range-FromToR :: Exp -> Exp -> Range-FromThenToR :: Exp -> Exp -> Exp -> Range-instance Data Range-instance Eq Range-instance Ppr Range-instance Show Range-instance Typeable Range-data Lit-CharL :: Char -> Lit-StringL :: String -> Lit-IntegerL :: Integer -> Lit-RationalL :: Rational -> Lit-IntPrimL :: Integer -> Lit-FloatPrimL :: Rational -> Lit-DoublePrimL :: Rational -> Lit-instance Data Lit-instance Eq Lit-instance Show Lit-instance Typeable Lit-data Pat-LitP :: Lit -> Pat-VarP :: Name -> Pat-TupP :: [Pat] -> Pat-ConP :: Name -> [Pat] -> Pat-InfixP :: Pat -> Name -> Pat -> Pat-TildeP :: Pat -> Pat-AsP :: Name -> Pat -> Pat-WildP :: Pat-RecP :: Name -> [FieldPat] -> Pat-ListP :: [Pat] -> Pat-SigP :: Pat -> Type -> Pat-instance Data Pat-instance Eq Pat-instance Ppr Pat-instance Show Pat-instance Typeable Pat-type FieldExp = (Name, Exp)-type FieldPat = (Name, Pat)-data Strict-IsStrict :: Strict-NotStrict :: Strict-instance Data Strict-instance Eq Strict-instance Show Strict-instance Typeable Strict-data Foreign-ImportF :: Callconv -> Safety -> String -> Name -> Type -> Foreign-ExportF :: Callconv -> String -> Name -> Type -> Foreign-instance Data Foreign-instance Eq Foreign-instance Ppr Foreign-instance Show Foreign-instance Typeable Foreign-data Callconv-CCall :: Callconv-StdCall :: Callconv-instance Data Callconv-instance Eq Callconv-instance Show Callconv-instance Typeable Callconv-data Safety-Unsafe :: Safety-Safe :: Safety-Threadsafe :: Safety-instance Data Safety-instance Eq Safety-instance Show Safety-instance Typeable Safety-type StrictType = (Strict, Type)-type VarStrictType = (Name, Strict, Type)-data FunDep-FunDep :: [Name] -> [Name] -> FunDep-instance Data FunDep-instance Eq FunDep-instance Ppr FunDep-instance Show FunDep-instance Typeable FunDep-data Info-ClassI :: Dec -> Info-ClassOpI :: Name -> Type -> Name -> Fixity -> Info-TyConI :: Dec -> Info-PrimTyConI :: Name -> Int -> Bool -> Info-DataConI :: Name -> Type -> Name -> Fixity -> Info-VarI :: Name -> Type -> Maybe Dec -> Fixity -> Info-TyVarI :: Name -> Type -> Info-instance Data Info-instance Ppr Info-instance Show Info-instance Typeable Info-data Fixity-Fixity :: Int -> FixityDirection -> Fixity-instance Data Fixity-instance Eq Fixity-instance Show Fixity-instance Typeable Fixity-data FixityDirection-InfixL :: FixityDirection-InfixR :: FixityDirection-InfixN :: FixityDirection-instance Data FixityDirection-instance Eq FixityDirection-instance Show FixityDirection-instance Typeable FixityDirection-defaultFixity :: Fixity-maxPrecedence :: Int-returnQ :: a -> Q a-bindQ :: Q a -> (a -> Q b) -> Q b-sequenceQ :: [Q a] -> Q [a]-data NameFlavour-NameS :: NameFlavour-NameQ :: ModName -> NameFlavour-NameU :: Int# -> NameFlavour-NameL :: Int# -> NameFlavour-NameG :: NameSpace -> PkgName -> ModName -> NameFlavour-instance Data NameFlavour-instance Eq NameFlavour-instance Ord NameFlavour-instance Typeable NameFlavour-data NameSpace-VarName :: NameSpace-DataName :: NameSpace-TcClsName :: NameSpace-instance Data NameSpace-instance Eq NameSpace-instance Ord NameSpace-instance Typeable NameSpace-mkNameG_v :: String -> String -> String -> Name-mkNameG_d :: String -> String -> String -> Name-mkNameG_tc :: String -> String -> String -> Name-type Uniq = Int-mkNameL :: String -> Uniq -> Name-mkNameU :: String -> Uniq -> Name-tupleTypeName :: Int -> Name-tupleDataName :: Int -> Name-type OccName = PackedString-mkOccName :: String -> OccName-occString :: OccName -> String-type ModName = PackedString-mkModName :: String -> ModName-modString :: ModName -> String-type PkgName = PackedString-mkPkgName :: String -> PkgName-pkgString :: PkgName -> String--module Language.Haskell.TH.PprLib-type Doc = PprM Doc-instance Show Doc-data PprM a-instance Monad PprM-empty :: Doc-semi :: Doc-comma :: Doc-colon :: Doc-space :: Doc-equals :: Doc-lparen :: Doc-rparen :: Doc-lbrack :: Doc-rbrack :: Doc-lbrace :: Doc-rbrace :: Doc-text :: String -> Doc-char :: Char -> Doc-ptext :: String -> Doc-int :: Int -> Doc-integer :: Integer -> Doc-float :: Float -> Doc-double :: Double -> Doc-rational :: Rational -> Doc-parens :: Doc -> Doc-brackets :: Doc -> Doc-braces :: Doc -> Doc-quotes :: Doc -> Doc-doubleQuotes :: Doc -> Doc-(<>) :: Doc -> Doc -> Doc-(<+>) :: Doc -> Doc -> Doc-hcat :: [Doc] -> Doc-hsep :: [Doc] -> Doc-($$) :: Doc -> Doc -> Doc-($+$) :: Doc -> Doc -> Doc-vcat :: [Doc] -> Doc-sep :: [Doc] -> Doc-cat :: [Doc] -> Doc-fsep :: [Doc] -> Doc-fcat :: [Doc] -> Doc-nest :: Int -> Doc -> Doc-hang :: Doc -> Int -> Doc -> Doc-punctuate :: Doc -> [Doc] -> [Doc]-isEmpty :: Doc -> PprM Bool-to_HPJ_Doc :: Doc -> Doc-pprName :: Name -> Doc-pprName' :: NameIs -> Name -> Doc--module Language.Haskell.TH.Ppr-nestDepth :: Int-type Precedence = Int-appPrec :: Precedence-opPrec :: Precedence-noPrec :: Precedence-parensIf :: Bool -> Doc -> Doc-pprint :: Ppr a => a -> String-class Ppr a-ppr :: Ppr a => a -> Doc-ppr_list :: Ppr a => [a] -> Doc-instance Ppr Clause-instance Ppr Con-instance Ppr Dec-instance Ppr Exp-instance Ppr Foreign-instance Ppr FunDep-instance Ppr Info-instance Ppr Match-instance Ppr Name-instance Ppr Pat-instance Ppr Range-instance Ppr Stmt-instance Ppr Type-instance Ppr a => Ppr [a]-pprFixity :: Name -> Fixity -> Doc-pprInfixExp :: Exp -> Doc-pprExp :: Precedence -> Exp -> Doc-pprFields :: [(Name, Exp)] -> Doc-pprMaybeExp :: Precedence -> Maybe Exp -> Doc-pprBody :: Bool -> Body -> Doc-pprLit :: Precedence -> Lit -> Doc-pprPat :: Precedence -> Pat -> Doc-pprVarStrictType :: (Name, Strict, Type) -> Doc-pprStrictType :: (Strict, Type) -> Doc-pprParendType :: Type -> Doc-pprTyApp :: (Type, [Type]) -> Doc-split :: Type -> (Type, [Type])-pprCxt :: Cxt -> Doc-where_clause :: [Dec] -> Doc-showtextl :: Show a => a -> Doc--module Language.Haskell.TH.Lib-type InfoQ = Q Info-type PatQ = Q Pat-type FieldPatQ = Q FieldPat-type ExpQ = Q Exp-type DecQ = Q Dec-type ConQ = Q Con-type TypeQ = Q Type-type CxtQ = Q Cxt-type MatchQ = Q Match-type ClauseQ = Q Clause-type BodyQ = Q Body-type GuardQ = Q Guard-type StmtQ = Q Stmt-type RangeQ = Q Range-type StrictTypeQ = Q StrictType-type VarStrictTypeQ = Q VarStrictType-type FieldExpQ = Q FieldExp-intPrimL :: Integer -> Lit-floatPrimL :: Rational -> Lit-doublePrimL :: Rational -> Lit-integerL :: Integer -> Lit-charL :: Char -> Lit-stringL :: String -> Lit-rationalL :: Rational -> Lit-litP :: Lit -> PatQ-varP :: Name -> PatQ-tupP :: [PatQ] -> PatQ-conP :: Name -> [PatQ] -> PatQ-infixP :: PatQ -> Name -> PatQ -> PatQ-tildeP :: PatQ -> PatQ-asP :: Name -> PatQ -> PatQ-wildP :: PatQ-recP :: Name -> [FieldPatQ] -> PatQ-listP :: [PatQ] -> PatQ-sigP :: PatQ -> TypeQ -> PatQ-fieldPat :: Name -> PatQ -> FieldPatQ-bindS :: PatQ -> ExpQ -> StmtQ-letS :: [DecQ] -> StmtQ-noBindS :: ExpQ -> StmtQ-parS :: [[StmtQ]] -> StmtQ-fromR :: ExpQ -> RangeQ-fromThenR :: ExpQ -> ExpQ -> RangeQ-fromToR :: ExpQ -> ExpQ -> RangeQ-fromThenToR :: ExpQ -> ExpQ -> ExpQ -> RangeQ-normalB :: ExpQ -> BodyQ-guardedB :: [Q (Guard, Exp)] -> BodyQ-normalG :: ExpQ -> GuardQ-normalGE :: ExpQ -> ExpQ -> Q (Guard, Exp)-patG :: [StmtQ] -> GuardQ-patGE :: [StmtQ] -> ExpQ -> Q (Guard, Exp)-match :: PatQ -> BodyQ -> [DecQ] -> MatchQ-clause :: [PatQ] -> BodyQ -> [DecQ] -> ClauseQ-dyn :: String -> Q Exp-global :: Name -> ExpQ-varE :: Name -> ExpQ-conE :: Name -> ExpQ-litE :: Lit -> ExpQ-appE :: ExpQ -> ExpQ -> ExpQ-infixE :: Maybe ExpQ -> ExpQ -> Maybe ExpQ -> ExpQ-infixApp :: ExpQ -> ExpQ -> ExpQ -> ExpQ-sectionL :: ExpQ -> ExpQ -> ExpQ-sectionR :: ExpQ -> ExpQ -> ExpQ-lamE :: [PatQ] -> ExpQ -> ExpQ-lam1E :: PatQ -> ExpQ -> ExpQ-tupE :: [ExpQ] -> ExpQ-condE :: ExpQ -> ExpQ -> ExpQ -> ExpQ-letE :: [DecQ] -> ExpQ -> ExpQ-caseE :: ExpQ -> [MatchQ] -> ExpQ-doE :: [StmtQ] -> ExpQ-compE :: [StmtQ] -> ExpQ-arithSeqE :: RangeQ -> ExpQ-fromE :: ExpQ -> ExpQ-fromThenE :: ExpQ -> ExpQ -> ExpQ-fromToE :: ExpQ -> ExpQ -> ExpQ-fromThenToE :: ExpQ -> ExpQ -> ExpQ -> ExpQ-listE :: [ExpQ] -> ExpQ-sigE :: ExpQ -> TypeQ -> ExpQ-recConE :: Name -> [Q (Name, Exp)] -> ExpQ-recUpdE :: ExpQ -> [Q (Name, Exp)] -> ExpQ-stringE :: String -> ExpQ-fieldExp :: Name -> ExpQ -> Q (Name, Exp)-valD :: PatQ -> BodyQ -> [DecQ] -> DecQ-funD :: Name -> [ClauseQ] -> DecQ-tySynD :: Name -> [Name] -> TypeQ -> DecQ-dataD :: CxtQ -> Name -> [Name] -> [ConQ] -> [Name] -> DecQ-newtypeD :: CxtQ -> Name -> [Name] -> ConQ -> [Name] -> DecQ-classD :: CxtQ -> Name -> [Name] -> [FunDep] -> [DecQ] -> DecQ-instanceD :: CxtQ -> TypeQ -> [DecQ] -> DecQ-sigD :: Name -> TypeQ -> DecQ-forImpD :: Callconv -> Safety -> String -> Name -> TypeQ -> DecQ-cxt :: [TypeQ] -> CxtQ-normalC :: Name -> [StrictTypeQ] -> ConQ-recC :: Name -> [VarStrictTypeQ] -> ConQ-infixC :: Q (Strict, Type) -> Name -> Q (Strict, Type) -> ConQ-forallC :: [Name] -> CxtQ -> ConQ -> ConQ-forallT :: [Name] -> CxtQ -> TypeQ -> TypeQ-varT :: Name -> TypeQ-conT :: Name -> TypeQ-appT :: TypeQ -> TypeQ -> TypeQ-arrowT :: TypeQ-listT :: TypeQ-tupleT :: Int -> TypeQ-isStrict :: Q Strict-notStrict :: Q Strict-strictType :: Q Strict -> TypeQ -> StrictTypeQ-varStrictType :: Name -> StrictTypeQ -> VarStrictTypeQ-cCall :: Callconv-stdCall :: Callconv-unsafe :: Safety-safe :: Safety-threadsafe :: Safety-funDep :: [Name] -> [Name] -> FunDep-combine :: [([(Name, Name)], Pat)] -> ([(Name, Name)], [Pat])-rename :: Pat -> Q ([(Name, Name)], Pat)-genpat :: Pat -> Q (Name -> ExpQ, Pat)-alpha :: [(Name, Name)] -> Name -> ExpQ-appsE :: [ExpQ] -> ExpQ-simpleMatch :: Pat -> Exp -> Match--module Language.Haskell.TH-data Q a-instance Functor Q-instance Monad Q-instance Quasi Q-runQ :: Quasi m => Q a -> m a-report :: Bool -> String -> Q ()-recover :: Q a -> Q a -> Q a-reify :: Name -> Q Info-currentModule :: Q String-runIO :: IO a -> Q a-data Name-instance Data Name-instance Eq Name-instance Ord Name-instance Ppr Name-instance Show Name-instance Typeable Name-mkName :: String -> Name-newName :: String -> Q Name-nameBase :: Name -> String-nameModule :: Name -> Maybe String-tupleTypeName :: Int -> Name-tupleDataName :: Int -> Name-data Dec-FunD :: Name -> [Clause] -> Dec-ValD :: Pat -> Body -> [Dec] -> Dec-DataD :: Cxt -> Name -> [Name] -> [Con] -> [Name] -> Dec-NewtypeD :: Cxt -> Name -> [Name] -> Con -> [Name] -> Dec-TySynD :: Name -> [Name] -> Type -> Dec-ClassD :: Cxt -> Name -> [Name] -> [FunDep] -> [Dec] -> Dec-InstanceD :: Cxt -> Type -> [Dec] -> Dec-SigD :: Name -> Type -> Dec-ForeignD :: Foreign -> Dec-instance Data Dec-instance Eq Dec-instance Ppr Dec-instance Show Dec-instance Typeable Dec-data Exp-VarE :: Name -> Exp-ConE :: Name -> Exp-LitE :: Lit -> Exp-AppE :: Exp -> Exp -> Exp-InfixE :: Maybe Exp -> Exp -> Maybe Exp -> Exp-LamE :: [Pat] -> Exp -> Exp-TupE :: [Exp] -> Exp-CondE :: Exp -> Exp -> Exp -> Exp-LetE :: [Dec] -> Exp -> Exp-CaseE :: Exp -> [Match] -> Exp-DoE :: [Stmt] -> Exp-CompE :: [Stmt] -> Exp-ArithSeqE :: Range -> Exp-ListE :: [Exp] -> Exp-SigE :: Exp -> Type -> Exp-RecConE :: Name -> [FieldExp] -> Exp-RecUpdE :: Exp -> [FieldExp] -> Exp-instance Data Exp-instance Eq Exp-instance Ppr Exp-instance Show Exp-instance Typeable Exp-data Con-NormalC :: Name -> [StrictType] -> Con-RecC :: Name -> [VarStrictType] -> Con-InfixC :: StrictType -> Name -> StrictType -> Con-ForallC :: [Name] -> Cxt -> Con -> Con-instance Data Con-instance Eq Con-instance Ppr Con-instance Show Con-instance Typeable Con-data Type-ForallT :: [Name] -> Cxt -> Type -> Type-VarT :: Name -> Type-ConT :: Name -> Type-TupleT :: Int -> Type-ArrowT :: Type-ListT :: Type-AppT :: Type -> Type -> Type-instance Data Type-instance Eq Type-instance Ppr Type-instance Show Type-instance Typeable Type-type Cxt = [Type]-data Match-Match :: Pat -> Body -> [Dec] -> Match-instance Data Match-instance Eq Match-instance Ppr Match-instance Show Match-instance Typeable Match-data Clause-Clause :: [Pat] -> Body -> [Dec] -> Clause-instance Data Clause-instance Eq Clause-instance Ppr Clause-instance Show Clause-instance Typeable Clause-data Body-GuardedB :: [(Guard, Exp)] -> Body-NormalB :: Exp -> Body-instance Data Body-instance Eq Body-instance Show Body-instance Typeable Body-data Guard-NormalG :: Exp -> Guard-PatG :: [Stmt] -> Guard-instance Data Guard-instance Eq Guard-instance Show Guard-instance Typeable Guard-data Stmt-BindS :: Pat -> Exp -> Stmt-LetS :: [Dec] -> Stmt-NoBindS :: Exp -> Stmt-ParS :: [[Stmt]] -> Stmt-instance Data Stmt-instance Eq Stmt-instance Ppr Stmt-instance Show Stmt-instance Typeable Stmt-data Range-FromR :: Exp -> Range-FromThenR :: Exp -> Exp -> Range-FromToR :: Exp -> Exp -> Range-FromThenToR :: Exp -> Exp -> Exp -> Range-instance Data Range-instance Eq Range-instance Ppr Range-instance Show Range-instance Typeable Range-data Lit-CharL :: Char -> Lit-StringL :: String -> Lit-IntegerL :: Integer -> Lit-RationalL :: Rational -> Lit-IntPrimL :: Integer -> Lit-FloatPrimL :: Rational -> Lit-DoublePrimL :: Rational -> Lit-instance Data Lit-instance Eq Lit-instance Show Lit-instance Typeable Lit-data Pat-LitP :: Lit -> Pat-VarP :: Name -> Pat-TupP :: [Pat] -> Pat-ConP :: Name -> [Pat] -> Pat-InfixP :: Pat -> Name -> Pat -> Pat-TildeP :: Pat -> Pat-AsP :: Name -> Pat -> Pat-WildP :: Pat-RecP :: Name -> [FieldPat] -> Pat-ListP :: [Pat] -> Pat-SigP :: Pat -> Type -> Pat-instance Data Pat-instance Eq Pat-instance Ppr Pat-instance Show Pat-instance Typeable Pat-type FieldExp = (Name, Exp)-type FieldPat = (Name, Pat)-data Strict-IsStrict :: Strict-NotStrict :: Strict-instance Data Strict-instance Eq Strict-instance Show Strict-instance Typeable Strict-data Foreign-ImportF :: Callconv -> Safety -> String -> Name -> Type -> Foreign-ExportF :: Callconv -> String -> Name -> Type -> Foreign-instance Data Foreign-instance Eq Foreign-instance Ppr Foreign-instance Show Foreign-instance Typeable Foreign-data Callconv-CCall :: Callconv-StdCall :: Callconv-instance Data Callconv-instance Eq Callconv-instance Show Callconv-instance Typeable Callconv-data Safety-Unsafe :: Safety-Safe :: Safety-Threadsafe :: Safety-instance Data Safety-instance Eq Safety-instance Show Safety-instance Typeable Safety-data FunDep-FunDep :: [Name] -> [Name] -> FunDep-instance Data FunDep-instance Eq FunDep-instance Ppr FunDep-instance Show FunDep-instance Typeable FunDep-data Info-ClassI :: Dec -> Info-ClassOpI :: Name -> Type -> Name -> Fixity -> Info-TyConI :: Dec -> Info-PrimTyConI :: Name -> Int -> Bool -> Info-DataConI :: Name -> Type -> Name -> Fixity -> Info-VarI :: Name -> Type -> Maybe Dec -> Fixity -> Info-TyVarI :: Name -> Type -> Info-instance Data Info-instance Ppr Info-instance Show Info-instance Typeable Info-data Fixity-Fixity :: Int -> FixityDirection -> Fixity-instance Data Fixity-instance Eq Fixity-instance Show Fixity-instance Typeable Fixity-data FixityDirection-InfixL :: FixityDirection-InfixR :: FixityDirection-InfixN :: FixityDirection-instance Data FixityDirection-instance Eq FixityDirection-instance Show FixityDirection-instance Typeable FixityDirection-defaultFixity :: Fixity-maxPrecedence :: Int-type InfoQ = Q Info-type ExpQ = Q Exp-type DecQ = Q Dec-type ConQ = Q Con-type TypeQ = Q Type-type CxtQ = Q Cxt-type MatchQ = Q Match-type ClauseQ = Q Clause-type BodyQ = Q Body-type GuardQ = Q Guard-type StmtQ = Q Stmt-type RangeQ = Q Range-type StrictTypeQ = Q StrictType-type VarStrictTypeQ = Q VarStrictType-type PatQ = Q Pat-type FieldPatQ = Q FieldPat-intPrimL :: Integer -> Lit-floatPrimL :: Rational -> Lit-doublePrimL :: Rational -> Lit-integerL :: Integer -> Lit-charL :: Char -> Lit-stringL :: String -> Lit-rationalL :: Rational -> Lit-litP :: Lit -> PatQ-varP :: Name -> PatQ-tupP :: [PatQ] -> PatQ-conP :: Name -> [PatQ] -> PatQ-infixP :: PatQ -> Name -> PatQ -> PatQ-tildeP :: PatQ -> PatQ-asP :: Name -> PatQ -> PatQ-wildP :: PatQ-recP :: Name -> [FieldPatQ] -> PatQ-listP :: [PatQ] -> PatQ-sigP :: PatQ -> TypeQ -> PatQ-fieldPat :: Name -> PatQ -> FieldPatQ-bindS :: PatQ -> ExpQ -> StmtQ-letS :: [DecQ] -> StmtQ-noBindS :: ExpQ -> StmtQ-parS :: [[StmtQ]] -> StmtQ-fromR :: ExpQ -> RangeQ-fromThenR :: ExpQ -> ExpQ -> RangeQ-fromToR :: ExpQ -> ExpQ -> RangeQ-fromThenToR :: ExpQ -> ExpQ -> ExpQ -> RangeQ-normalB :: ExpQ -> BodyQ-guardedB :: [Q (Guard, Exp)] -> BodyQ-normalG :: ExpQ -> GuardQ-normalGE :: ExpQ -> ExpQ -> Q (Guard, Exp)-patG :: [StmtQ] -> GuardQ-patGE :: [StmtQ] -> ExpQ -> Q (Guard, Exp)-match :: PatQ -> BodyQ -> [DecQ] -> MatchQ-clause :: [PatQ] -> BodyQ -> [DecQ] -> ClauseQ-dyn :: String -> Q Exp-global :: Name -> ExpQ-varE :: Name -> ExpQ-conE :: Name -> ExpQ-litE :: Lit -> ExpQ-appE :: ExpQ -> ExpQ -> ExpQ-infixE :: Maybe ExpQ -> ExpQ -> Maybe ExpQ -> ExpQ-infixApp :: ExpQ -> ExpQ -> ExpQ -> ExpQ-sectionL :: ExpQ -> ExpQ -> ExpQ-sectionR :: ExpQ -> ExpQ -> ExpQ-lamE :: [PatQ] -> ExpQ -> ExpQ-lam1E :: PatQ -> ExpQ -> ExpQ-tupE :: [ExpQ] -> ExpQ-condE :: ExpQ -> ExpQ -> ExpQ -> ExpQ-letE :: [DecQ] -> ExpQ -> ExpQ-caseE :: ExpQ -> [MatchQ] -> ExpQ-doE :: [StmtQ] -> ExpQ-compE :: [StmtQ] -> ExpQ-arithSeqE :: RangeQ -> ExpQ-appsE :: [ExpQ] -> ExpQ-fromE :: ExpQ -> ExpQ-fromThenE :: ExpQ -> ExpQ -> ExpQ-fromToE :: ExpQ -> ExpQ -> ExpQ-fromThenToE :: ExpQ -> ExpQ -> ExpQ -> ExpQ-listE :: [ExpQ] -> ExpQ-sigE :: ExpQ -> TypeQ -> ExpQ-recConE :: Name -> [Q (Name, Exp)] -> ExpQ-recUpdE :: ExpQ -> [Q (Name, Exp)] -> ExpQ-stringE :: String -> ExpQ-fieldExp :: Name -> ExpQ -> Q (Name, Exp)-valD :: PatQ -> BodyQ -> [DecQ] -> DecQ-funD :: Name -> [ClauseQ] -> DecQ-tySynD :: Name -> [Name] -> TypeQ -> DecQ-dataD :: CxtQ -> Name -> [Name] -> [ConQ] -> [Name] -> DecQ-newtypeD :: CxtQ -> Name -> [Name] -> ConQ -> [Name] -> DecQ-classD :: CxtQ -> Name -> [Name] -> [FunDep] -> [DecQ] -> DecQ-instanceD :: CxtQ -> TypeQ -> [DecQ] -> DecQ-sigD :: Name -> TypeQ -> DecQ-forImpD :: Callconv -> Safety -> String -> Name -> TypeQ -> DecQ-cxt :: [TypeQ] -> CxtQ-normalC :: Name -> [StrictTypeQ] -> ConQ-recC :: Name -> [VarStrictTypeQ] -> ConQ-infixC :: Q (Strict, Type) -> Name -> Q (Strict, Type) -> ConQ-forallT :: [Name] -> CxtQ -> TypeQ -> TypeQ-varT :: Name -> TypeQ-conT :: Name -> TypeQ-appT :: TypeQ -> TypeQ -> TypeQ-arrowT :: TypeQ-listT :: TypeQ-tupleT :: Int -> TypeQ-isStrict :: Q Strict-notStrict :: Q Strict-strictType :: Q Strict -> TypeQ -> StrictTypeQ-varStrictType :: Name -> StrictTypeQ -> VarStrictTypeQ-cCall :: Callconv-stdCall :: Callconv-unsafe :: Safety-safe :: Safety-threadsafe :: Safety-class Ppr a-ppr :: Ppr a => a -> Doc-ppr_list :: Ppr a => [a] -> Doc-instance Ppr Clause-instance Ppr Con-instance Ppr Dec-instance Ppr Exp-instance Ppr Foreign-instance Ppr FunDep-instance Ppr Info-instance Ppr Match-instance Ppr Name-instance Ppr Pat-instance Ppr Range-instance Ppr Stmt-instance Ppr Type-instance Ppr a => Ppr [a]-pprint :: Ppr a => a -> String-pprExp :: Precedence -> Exp -> Doc-pprLit :: Precedence -> Lit -> Doc-pprPat :: Precedence -> Pat -> Doc-pprParendType :: Type -> Doc--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Data.Time.Calendar.MonthDay-monthAndDayToDayOfYear :: Bool -> Int -> Int -> Int-dayOfYearToMonthAndDay :: Bool -> Int -> (Int, Int)-monthLength :: Bool -> Int -> Int--module Data.Time.Calendar.Julian-toJulianYearAndDay :: Day -> (Integer, Int)-fromJulianYearAndDay :: Integer -> Int -> Day-showJulianYearAndDay :: Day -> String-isJulianLeapYear :: Integer -> Bool-toJulian :: Day -> (Integer, Int, Int)-fromJulian :: Integer -> Int -> Int -> Day-showJulian :: Day -> String-julianMonthLength :: Integer -> Int -> Int-addJulianMonthsClip :: Integer -> Day -> Day-addJulianMonthsRollOver :: Integer -> Day -> Day-addJulianYearsClip :: Integer -> Day -> Day-addJulianYearsRollOver :: Integer -> Day -> Day--module Data.Time.Calendar.OrdinalDate-toOrdinalDate :: Day -> (Integer, Int)-fromOrdinalDate :: Integer -> Int -> Day-showOrdinalDate :: Day -> String-isLeapYear :: Integer -> Bool-mondayStartWeek :: Day -> (Int, Int)-sundayStartWeek :: Day -> (Int, Int)-fromMondayStartWeek :: Integer -> Int -> Int -> Day-fromSundayStartWeek :: Integer -> Int -> Int -> Day--module Data.Time.Calendar.WeekDate-toWeekDate :: Day -> (Integer, Int, Int)-fromWeekDate :: Integer -> Int -> Int -> Day-showWeekDate :: Day -> String--module Data.Time.Clock.POSIX-posixDayLength :: NominalDiffTime-type POSIXTime = NominalDiffTime-posixSecondsToUTCTime :: POSIXTime -> UTCTime-utcTimeToPOSIXSeconds :: UTCTime -> POSIXTime-getPOSIXTime :: IO POSIXTime--module Data.Time.Clock-newtype UniversalTime-ModJulianDate :: Rational -> UniversalTime-getModJulianDate :: UniversalTime -> Rational-instance Eq UniversalTime-instance Ord UniversalTime-data DiffTime-instance Enum DiffTime-instance Eq DiffTime-instance Fractional DiffTime-instance Num DiffTime-instance Ord DiffTime-instance Real DiffTime-instance Show DiffTime-secondsToDiffTime :: Integer -> DiffTime-picosecondsToDiffTime :: Integer -> DiffTime-data UTCTime-UTCTime :: Day -> DiffTime -> UTCTime-utctDay :: UTCTime -> Day-utctDayTime :: UTCTime -> DiffTime-instance Eq UTCTime-instance FormatTime UTCTime-instance Ord UTCTime-instance ParseTime UTCTime-instance Read UTCTime-instance Show UTCTime-data NominalDiffTime-instance Enum NominalDiffTime-instance Eq NominalDiffTime-instance Fractional NominalDiffTime-instance Num NominalDiffTime-instance Ord NominalDiffTime-instance Real NominalDiffTime-instance RealFrac NominalDiffTime-instance Show NominalDiffTime-addUTCTime :: NominalDiffTime -> UTCTime -> UTCTime-diffUTCTime :: UTCTime -> UTCTime -> NominalDiffTime-getCurrentTime :: IO UTCTime--module Data.Time.Calendar-newtype Day-ModifiedJulianDay :: Integer -> Day-toModifiedJulianDay :: Day -> Integer-instance Enum Day-instance Eq Day-instance FormatTime Day-instance Ord Day-instance ParseTime Day-instance Read Day-instance Show Day-addDays :: Integer -> Day -> Day-diffDays :: Day -> Day -> Integer-toGregorian :: Day -> (Integer, Int, Int)-fromGregorian :: Integer -> Int -> Int -> Day-showGregorian :: Day -> String-gregorianMonthLength :: Integer -> Int -> Int-addGregorianMonthsClip :: Integer -> Day -> Day-addGregorianMonthsRollOver :: Integer -> Day -> Day-addGregorianYearsClip :: Integer -> Day -> Day-addGregorianYearsRollOver :: Integer -> Day -> Day-isLeapYear :: Integer -> Bool--module Data.Time.Calendar.Easter-sundayAfter :: Day -> Day-orthodoxPaschalMoon :: Integer -> Day-orthodoxEaster :: Integer -> Day-gregorianPaschalMoon :: Integer -> Day-gregorianEaster :: Integer -> Day--module Data.Time.LocalTime-data TimeZone-TimeZone :: Int -> Bool -> String -> TimeZone-timeZoneMinutes :: TimeZone -> Int-timeZoneSummerOnly :: TimeZone -> Bool-timeZoneName :: TimeZone -> String-instance Eq TimeZone-instance FormatTime TimeZone-instance Ord TimeZone-instance ParseTime TimeZone-instance Read TimeZone-instance Show TimeZone-timeZoneOffsetString :: TimeZone -> String-minutesToTimeZone :: Int -> TimeZone-hoursToTimeZone :: Int -> TimeZone-utc :: TimeZone-getTimeZone :: UTCTime -> IO TimeZone-getCurrentTimeZone :: IO TimeZone-data TimeOfDay-TimeOfDay :: Int -> Int -> Pico -> TimeOfDay-todHour :: TimeOfDay -> Int-todMin :: TimeOfDay -> Int-todSec :: TimeOfDay -> Pico-instance Eq TimeOfDay-instance FormatTime TimeOfDay-instance Ord TimeOfDay-instance ParseTime TimeOfDay-instance Read TimeOfDay-instance Show TimeOfDay-midnight :: TimeOfDay-midday :: TimeOfDay-utcToLocalTimeOfDay :: TimeZone -> TimeOfDay -> (Integer, TimeOfDay)-localToUTCTimeOfDay :: TimeZone -> TimeOfDay -> (Integer, TimeOfDay)-timeToTimeOfDay :: DiffTime -> TimeOfDay-timeOfDayToTime :: TimeOfDay -> DiffTime-dayFractionToTimeOfDay :: Rational -> TimeOfDay-timeOfDayToDayFraction :: TimeOfDay -> Rational-data LocalTime-LocalTime :: Day -> TimeOfDay -> LocalTime-localDay :: LocalTime -> Day-localTimeOfDay :: LocalTime -> TimeOfDay-instance Eq LocalTime-instance FormatTime LocalTime-instance Ord LocalTime-instance ParseTime LocalTime-instance Read LocalTime-instance Show LocalTime-utcToLocalTime :: TimeZone -> UTCTime -> LocalTime-localTimeToUTC :: TimeZone -> LocalTime -> UTCTime-ut1ToLocalTime :: Rational -> UniversalTime -> LocalTime-localTimeToUT1 :: Rational -> LocalTime -> UniversalTime-data ZonedTime-ZonedTime :: LocalTime -> TimeZone -> ZonedTime-zonedTimeToLocalTime :: ZonedTime -> LocalTime-zonedTimeZone :: ZonedTime -> TimeZone-instance FormatTime ZonedTime-instance ParseTime ZonedTime-instance Read ZonedTime-instance Show ZonedTime-utcToZonedTime :: TimeZone -> UTCTime -> ZonedTime-zonedTimeToUTC :: ZonedTime -> UTCTime-getZonedTime :: IO ZonedTime-utcToLocalZonedTime :: UTCTime -> IO ZonedTime--module Data.Time.Clock.TAI-data AbsoluteTime-instance Eq AbsoluteTime-instance Ord AbsoluteTime-instance Show AbsoluteTime-taiEpoch :: AbsoluteTime-addAbsoluteTime :: DiffTime -> AbsoluteTime -> AbsoluteTime-diffAbsoluteTime :: AbsoluteTime -> AbsoluteTime -> DiffTime-type LeapSecondTable = Day -> Integer-utcDayLength :: LeapSecondTable -> Day -> DiffTime-utcToTAITime :: LeapSecondTable -> UTCTime -> AbsoluteTime-taiToUTCTime :: LeapSecondTable -> AbsoluteTime -> UTCTime-parseTAIUTCDATFile :: String -> LeapSecondTable--module Data.Time.Format-class FormatTime t-formatCharacter :: FormatTime t => Char -> Maybe (TimeLocale -> t -> String)-instance FormatTime Day-instance FormatTime LocalTime-instance FormatTime TimeOfDay-instance FormatTime TimeZone-instance FormatTime UTCTime-instance FormatTime ZonedTime-formatTime :: FormatTime t => TimeLocale -> String -> t -> String-parseTime :: ParseTime t => TimeLocale -> String -> String -> Maybe t-readTime :: ParseTime t => TimeLocale -> String -> String -> t-readsTime :: ParseTime t => TimeLocale -> String -> ReadS t-class ParseTime t-buildTime :: ParseTime t => TimeLocale -> [(Char, String)] -> t-instance ParseTime Day-instance ParseTime LocalTime-instance ParseTime TimeOfDay-instance ParseTime TimeZone-instance ParseTime UTCTime-instance ParseTime ZonedTime--module Data.Time--- Hoogle documentation, generated by Haddock--- See Hoogle, http://www.haskell.org/hoogle/--module Text.XHtml.Frameset-data Html-instance ADDATTRS Html-instance HTML Html-instance HTMLTABLE Html-instance Monoid Html-instance Show Html-data HtmlAttr-instance Show HtmlAttr-class HTML a-toHtml :: HTML a => a -> Html-toHtmlFromList :: HTML a => [a] -> Html-instance HTML Char-instance HTML HotLink-instance HTML Html-instance HTML HtmlTable-instance HTML HtmlTree-instance HTML a => HTML [a]-class ADDATTRS a-(!) :: ADDATTRS a => a -> [HtmlAttr] -> a-instance ADDATTRS Html-instance ADDATTRS b => ADDATTRS (a -> b)-(<<) :: HTML a => (Html -> b) -> a -> b-concatHtml :: HTML a => [a] -> Html-(+++) :: (HTML a, HTML b) => a -> b -> Html-noHtml :: Html-isNoHtml :: Html -> Bool-tag :: String -> Html -> Html-itag :: String -> Html-emptyAttr :: String -> HtmlAttr-intAttr :: String -> Int -> HtmlAttr-strAttr :: String -> String -> HtmlAttr-htmlAttr :: String -> Html -> HtmlAttr-primHtml :: String -> Html-showHtml :: HTML html => html -> String-renderHtml :: HTML html => html -> String-prettyHtml :: HTML html => html -> String-showHtmlFragment :: HTML html => html -> String-renderHtmlFragment :: HTML html => html -> String-prettyHtmlFragment :: HTML html => html -> String-abbr :: Html -> Html-acronym :: Html -> Html-address :: Html -> Html-anchor :: Html -> Html-area :: Html-bdo :: Html -> Html-big :: Html -> Html-blockquote :: Html -> Html-body :: Html -> Html-bold :: Html -> Html-br :: Html-button :: Html -> Html-caption :: Html -> Html-cite :: Html -> Html-col :: Html -> Html-colgroup :: Html -> Html-del :: Html -> Html-ddef :: Html -> Html-define :: Html -> Html-dlist :: Html -> Html-dterm :: Html -> Html-emphasize :: Html -> Html-fieldset :: Html -> Html-form :: Html -> Html-h1 :: Html -> Html-h2 :: Html -> Html-h3 :: Html -> Html-h4 :: Html -> Html-h5 :: Html -> Html-h6 :: Html -> Html-header :: Html -> Html-hr :: Html-image :: Html-input :: Html-ins :: Html -> Html-italics :: Html -> Html-keyboard :: Html -> Html-label :: Html -> Html-legend :: Html -> Html-li :: Html -> Html-meta :: Html-noscript :: Html -> Html-object :: Html -> Html-olist :: Html -> Html-optgroup :: Html -> Html-option :: Html -> Html-paragraph :: Html -> Html-param :: Html-pre :: Html -> Html-quote :: Html -> Html-sample :: Html -> Html-script :: Html -> Html-select :: Html -> Html-small :: Html -> Html-strong :: Html -> Html-style :: Html -> Html-sub :: Html -> Html-sup :: Html -> Html-table :: Html -> Html-tbody :: Html -> Html-td :: Html -> Html-textarea :: Html -> Html-tfoot :: Html -> Html-th :: Html -> Html-thead :: Html -> Html-thebase :: Html-thecode :: Html -> Html-thediv :: Html -> Html-thehtml :: Html -> Html-thelink :: Html -> Html-themap :: Html -> Html-thespan :: Html -> Html-thetitle :: Html -> Html-tr :: Html -> Html-tt :: Html -> Html-ulist :: Html -> Html-variable :: Html -> Html-frame :: Html -> Html-frameset :: Html -> Html-noframes :: Html -> Html-action :: String -> HtmlAttr-align :: String -> HtmlAttr-alt :: String -> HtmlAttr-altcode :: String -> HtmlAttr-archive :: String -> HtmlAttr-base :: String -> HtmlAttr-border :: Int -> HtmlAttr-bordercolor :: String -> HtmlAttr-cellpadding :: Int -> HtmlAttr-cellspacing :: Int -> HtmlAttr-checked :: HtmlAttr-codebase :: String -> HtmlAttr-cols :: String -> HtmlAttr-colspan :: Int -> HtmlAttr-content :: String -> HtmlAttr-coords :: String -> HtmlAttr-disabled :: HtmlAttr-enctype :: String -> HtmlAttr-height :: String -> HtmlAttr-href :: String -> HtmlAttr-httpequiv :: String -> HtmlAttr-identifier :: String -> HtmlAttr-ismap :: HtmlAttr-lang :: String -> HtmlAttr-maxlength :: Int -> HtmlAttr-method :: String -> HtmlAttr-multiple :: HtmlAttr-name :: String -> HtmlAttr-nohref :: HtmlAttr-rel :: String -> HtmlAttr-rev :: String -> HtmlAttr-rows :: String -> HtmlAttr-rowspan :: Int -> HtmlAttr-rules :: String -> HtmlAttr-selected :: HtmlAttr-shape :: String -> HtmlAttr-size :: String -> HtmlAttr-src :: String -> HtmlAttr-theclass :: String -> HtmlAttr-thefor :: String -> HtmlAttr-thestyle :: String -> HtmlAttr-thetype :: String -> HtmlAttr-title :: String -> HtmlAttr-usemap :: String -> HtmlAttr-valign :: String -> HtmlAttr-value :: String -> HtmlAttr-width :: String -> HtmlAttr-frameborder :: Int -> HtmlAttr-marginheight :: Int -> HtmlAttr-marginwidth :: Int -> HtmlAttr-noresize :: HtmlAttr-scrolling :: String -> HtmlAttr-stringToHtml :: String -> Html-lineToHtml :: String -> Html-linesToHtml :: [String] -> Html-primHtmlChar :: String -> Html-copyright :: Html-spaceHtml :: Html-bullet :: Html-p :: Html -> Html-type URL = String-data HotLink-HotLink :: URL -> Html -> [HtmlAttr] -> HotLink-hotLinkURL :: HotLink -> URL-hotLinkContents :: HotLink -> Html-hotLinkAttributes :: HotLink -> [HtmlAttr]-instance HTML HotLink-instance Show HotLink-hotlink :: URL -> Html -> HotLink-ordList :: HTML a => [a] -> Html-unordList :: HTML a => [a] -> Html-defList :: (HTML a, HTML b) => [(a, b)] -> Html-widget :: String -> String -> [HtmlAttr] -> Html-checkbox :: String -> String -> Html-hidden :: String -> String -> Html-radio :: String -> String -> Html-reset :: String -> String -> Html-submit :: String -> String -> Html-password :: String -> Html-textfield :: String -> Html-afile :: String -> Html-clickmap :: String -> Html-menu :: String -> [Html] -> Html-gui :: String -> Html -> Html--module Text.XHtml.Strict-data Html-instance ADDATTRS Html-instance HTML Html-instance HTMLTABLE Html-instance Monoid Html-instance Show Html-data HtmlAttr-instance Show HtmlAttr-class HTML a-toHtml :: HTML a => a -> Html-toHtmlFromList :: HTML a => [a] -> Html-instance HTML Char-instance HTML HotLink-instance HTML Html-instance HTML HtmlTable-instance HTML HtmlTree-instance HTML a => HTML [a]-class ADDATTRS a-(!) :: ADDATTRS a => a -> [HtmlAttr] -> a-instance ADDATTRS Html-instance ADDATTRS b => ADDATTRS (a -> b)-(<<) :: HTML a => (Html -> b) -> a -> b-concatHtml :: HTML a => [a] -> Html-(+++) :: (HTML a, HTML b) => a -> b -> Html-noHtml :: Html-isNoHtml :: Html -> Bool-tag :: String -> Html -> Html-itag :: String -> Html-emptyAttr :: String -> HtmlAttr-intAttr :: String -> Int -> HtmlAttr-strAttr :: String -> String -> HtmlAttr-htmlAttr :: String -> Html -> HtmlAttr-primHtml :: String -> Html-showHtml :: HTML html => html -> String-renderHtml :: HTML html => html -> String-prettyHtml :: HTML html => html -> String-showHtmlFragment :: HTML html => html -> String-renderHtmlFragment :: HTML html => html -> String-prettyHtmlFragment :: HTML html => html -> String-abbr :: Html -> Html-acronym :: Html -> Html-address :: Html -> Html-anchor :: Html -> Html-area :: Html-bdo :: Html -> Html-big :: Html -> Html-blockquote :: Html -> Html-body :: Html -> Html-bold :: Html -> Html-br :: Html-button :: Html -> Html-caption :: Html -> Html-cite :: Html -> Html-col :: Html -> Html-colgroup :: Html -> Html-del :: Html -> Html-ddef :: Html -> Html-define :: Html -> Html-dlist :: Html -> Html-dterm :: Html -> Html-emphasize :: Html -> Html-fieldset :: Html -> Html-form :: Html -> Html-h1 :: Html -> Html-h2 :: Html -> Html-h3 :: Html -> Html-h4 :: Html -> Html-h5 :: Html -> Html-h6 :: Html -> Html-header :: Html -> Html-hr :: Html-image :: Html-input :: Html-ins :: Html -> Html-italics :: Html -> Html-keyboard :: Html -> Html-label :: Html -> Html-legend :: Html -> Html-li :: Html -> Html-meta :: Html-noscript :: Html -> Html-object :: Html -> Html-olist :: Html -> Html-optgroup :: Html -> Html-option :: Html -> Html-paragraph :: Html -> Html-param :: Html-pre :: Html -> Html-quote :: Html -> Html-sample :: Html -> Html-script :: Html -> Html-select :: Html -> Html-small :: Html -> Html-strong :: Html -> Html-style :: Html -> Html-sub :: Html -> Html-sup :: Html -> Html-table :: Html -> Html-tbody :: Html -> Html-td :: Html -> Html-textarea :: Html -> Html-tfoot :: Html -> Html-th :: Html -> Html-thead :: Html -> Html-thebase :: Html-thecode :: Html -> Html-thediv :: Html -> Html-thehtml :: Html -> Html-thelink :: Html -> Html-themap :: Html -> Html-thespan :: Html -> Html-thetitle :: Html -> Html-tr :: Html -> Html-tt :: Html -> Html-ulist :: Html -> Html-variable :: Html -> Html-action :: String -> HtmlAttr-align :: String -> HtmlAttr-alt :: String -> HtmlAttr-altcode :: String -> HtmlAttr-archive :: String -> HtmlAttr-base :: String -> HtmlAttr-border :: Int -> HtmlAttr-bordercolor :: String -> HtmlAttr-cellpadding :: Int -> HtmlAttr-cellspacing :: Int -> HtmlAttr-checked :: HtmlAttr-codebase :: String -> HtmlAttr-cols :: String -> HtmlAttr-colspan :: Int -> HtmlAttr-content :: String -> HtmlAttr-coords :: String -> HtmlAttr-disabled :: HtmlAttr-enctype :: String -> HtmlAttr-height :: String -> HtmlAttr-href :: String -> HtmlAttr-httpequiv :: String -> HtmlAttr-identifier :: String -> HtmlAttr-ismap :: HtmlAttr-lang :: String -> HtmlAttr-maxlength :: Int -> HtmlAttr-method :: String -> HtmlAttr-multiple :: HtmlAttr-name :: String -> HtmlAttr-nohref :: HtmlAttr-rel :: String -> HtmlAttr-rev :: String -> HtmlAttr-rows :: String -> HtmlAttr-rowspan :: Int -> HtmlAttr-rules :: String -> HtmlAttr-selected :: HtmlAttr-shape :: String -> HtmlAttr-size :: String -> HtmlAttr-src :: String -> HtmlAttr-theclass :: String -> HtmlAttr-thefor :: String -> HtmlAttr-thestyle :: String -> HtmlAttr-thetype :: String -> HtmlAttr-title :: String -> HtmlAttr-usemap :: String -> HtmlAttr-valign :: String -> HtmlAttr-value :: String -> HtmlAttr-width :: String -> HtmlAttr-stringToHtml :: String -> Html-lineToHtml :: String -> Html-linesToHtml :: [String] -> Html-primHtmlChar :: String -> Html-copyright :: Html-spaceHtml :: Html-bullet :: Html-p :: Html -> Html-type URL = String-data HotLink-HotLink :: URL -> Html -> [HtmlAttr] -> HotLink-hotLinkURL :: HotLink -> URL-hotLinkContents :: HotLink -> Html-hotLinkAttributes :: HotLink -> [HtmlAttr]-instance HTML HotLink-instance Show HotLink-hotlink :: URL -> Html -> HotLink-ordList :: HTML a => [a] -> Html-unordList :: HTML a => [a] -> Html-defList :: (HTML a, HTML b) => [(a, b)] -> Html-widget :: String -> String -> [HtmlAttr] -> Html-checkbox :: String -> String -> Html-hidden :: String -> String -> Html-radio :: String -> String -> Html-reset :: String -> String -> Html-submit :: String -> String -> Html-password :: String -> Html-textfield :: String -> Html-afile :: String -> Html-clickmap :: String -> Html-menu :: String -> [Html] -> Html-gui :: String -> Html -> Html--module Text.XHtml.Transitional-data Html-instance ADDATTRS Html-instance HTML Html-instance HTMLTABLE Html-instance Monoid Html-instance Show Html-data HtmlAttr-instance Show HtmlAttr-class HTML a-toHtml :: HTML a => a -> Html-toHtmlFromList :: HTML a => [a] -> Html-instance HTML Char-instance HTML HotLink-instance HTML Html-instance HTML HtmlTable-instance HTML HtmlTree-instance HTML a => HTML [a]-class ADDATTRS a-(!) :: ADDATTRS a => a -> [HtmlAttr] -> a-instance ADDATTRS Html-instance ADDATTRS b => ADDATTRS (a -> b)-(<<) :: HTML a => (Html -> b) -> a -> b-concatHtml :: HTML a => [a] -> Html-(+++) :: (HTML a, HTML b) => a -> b -> Html-noHtml :: Html-isNoHtml :: Html -> Bool-tag :: String -> Html -> Html-itag :: String -> Html-emptyAttr :: String -> HtmlAttr-intAttr :: String -> Int -> HtmlAttr-strAttr :: String -> String -> HtmlAttr-htmlAttr :: String -> Html -> HtmlAttr-primHtml :: String -> Html-showHtml :: HTML html => html -> String-renderHtml :: HTML html => html -> String-prettyHtml :: HTML html => html -> String-showHtmlFragment :: HTML html => html -> String-renderHtmlFragment :: HTML html => html -> String-prettyHtmlFragment :: HTML html => html -> String-abbr :: Html -> Html-acronym :: Html -> Html-address :: Html -> Html-anchor :: Html -> Html-area :: Html-bdo :: Html -> Html-big :: Html -> Html-blockquote :: Html -> Html-body :: Html -> Html-bold :: Html -> Html-br :: Html-button :: Html -> Html-caption :: Html -> Html-cite :: Html -> Html-col :: Html -> Html-colgroup :: Html -> Html-del :: Html -> Html-ddef :: Html -> Html-define :: Html -> Html-dlist :: Html -> Html-dterm :: Html -> Html-emphasize :: Html -> Html-fieldset :: Html -> Html-form :: Html -> Html-h1 :: Html -> Html-h2 :: Html -> Html-h3 :: Html -> Html-h4 :: Html -> Html-h5 :: Html -> Html-h6 :: Html -> Html-header :: Html -> Html-hr :: Html-image :: Html-input :: Html-ins :: Html -> Html-italics :: Html -> Html-keyboard :: Html -> Html-label :: Html -> Html-legend :: Html -> Html-li :: Html -> Html-meta :: Html-noscript :: Html -> Html-object :: Html -> Html-olist :: Html -> Html-optgroup :: Html -> Html-option :: Html -> Html-paragraph :: Html -> Html-param :: Html-pre :: Html -> Html-quote :: Html -> Html-sample :: Html -> Html-script :: Html -> Html-select :: Html -> Html-small :: Html -> Html-strong :: Html -> Html-style :: Html -> Html-sub :: Html -> Html-sup :: Html -> Html-table :: Html -> Html-tbody :: Html -> Html-td :: Html -> Html-textarea :: Html -> Html-tfoot :: Html -> Html-th :: Html -> Html-thead :: Html -> Html-thebase :: Html-thecode :: Html -> Html-thediv :: Html -> Html-thehtml :: Html -> Html-thelink :: Html -> Html-themap :: Html -> Html-thespan :: Html -> Html-thetitle :: Html -> Html-tr :: Html -> Html-tt :: Html -> Html-ulist :: Html -> Html-variable :: Html -> Html-frame :: Html -> Html-frameset :: Html -> Html-noframes :: Html -> Html-applet :: Html -> Html-basefont :: Html-center :: Html -> Html-dir :: Html -> Html-font :: Html -> Html-iframe :: Html -> Html-isindex :: Html-themenu :: Html -> Html-strike :: Html -> Html-underline :: Html -> Html-action :: String -> HtmlAttr-align :: String -> HtmlAttr-alt :: String -> HtmlAttr-altcode :: String -> HtmlAttr-archive :: String -> HtmlAttr-base :: String -> HtmlAttr-border :: Int -> HtmlAttr-bordercolor :: String -> HtmlAttr-cellpadding :: Int -> HtmlAttr-cellspacing :: Int -> HtmlAttr-checked :: HtmlAttr-codebase :: String -> HtmlAttr-cols :: String -> HtmlAttr-colspan :: Int -> HtmlAttr-content :: String -> HtmlAttr-coords :: String -> HtmlAttr-disabled :: HtmlAttr-enctype :: String -> HtmlAttr-height :: String -> HtmlAttr-href :: String -> HtmlAttr-httpequiv :: String -> HtmlAttr-identifier :: String -> HtmlAttr-ismap :: HtmlAttr-lang :: String -> HtmlAttr-maxlength :: Int -> HtmlAttr-method :: String -> HtmlAttr-multiple :: HtmlAttr-name :: String -> HtmlAttr-nohref :: HtmlAttr-rel :: String -> HtmlAttr-rev :: String -> HtmlAttr-rows :: String -> HtmlAttr-rowspan :: Int -> HtmlAttr-rules :: String -> HtmlAttr-selected :: HtmlAttr-shape :: String -> HtmlAttr-size :: String -> HtmlAttr-src :: String -> HtmlAttr-theclass :: String -> HtmlAttr-thefor :: String -> HtmlAttr-thestyle :: String -> HtmlAttr-thetype :: String -> HtmlAttr-title :: String -> HtmlAttr-usemap :: String -> HtmlAttr-valign :: String -> HtmlAttr-value :: String -> HtmlAttr-width :: String -> HtmlAttr-frameborder :: Int -> HtmlAttr-marginheight :: Int -> HtmlAttr-marginwidth :: Int -> HtmlAttr-noresize :: HtmlAttr-scrolling :: String -> HtmlAttr-alink :: String -> HtmlAttr-background :: String -> HtmlAttr-bgcolor :: String -> HtmlAttr-clear :: String -> HtmlAttr-code :: String -> HtmlAttr-color :: String -> HtmlAttr-compact :: HtmlAttr-face :: String -> HtmlAttr-hspace :: Int -> HtmlAttr-link :: String -> HtmlAttr-noshade :: HtmlAttr-nowrap :: HtmlAttr-start :: Int -> HtmlAttr-target :: String -> HtmlAttr-text :: String -> HtmlAttr-version :: String -> HtmlAttr-vlink :: String -> HtmlAttr-vspace :: Int -> HtmlAttr-aqua :: String-black :: String-blue :: String-fuchsia :: String-gray :: String-green :: String-lime :: String-maroon :: String-navy :: String-olive :: String-purple :: String-red :: String-silver :: String-teal :: String-yellow :: String-white :: String-stringToHtml :: String -> Html-lineToHtml :: String -> Html-linesToHtml :: [String] -> Html-primHtmlChar :: String -> Html-copyright :: Html-spaceHtml :: Html-bullet :: Html-p :: Html -> Html-type URL = String-data HotLink-HotLink :: URL -> Html -> [HtmlAttr] -> HotLink-hotLinkURL :: HotLink -> URL-hotLinkContents :: HotLink -> Html-hotLinkAttributes :: HotLink -> [HtmlAttr]-instance HTML HotLink-instance Show HotLink-hotlink :: URL -> Html -> HotLink-ordList :: HTML a => [a] -> Html-unordList :: HTML a => [a] -> Html-defList :: (HTML a, HTML b) => [(a, b)] -> Html-widget :: String -> String -> [HtmlAttr] -> Html-checkbox :: String -> String -> Html-hidden :: String -> String -> Html-radio :: String -> String -> Html-reset :: String -> String -> Html-submit :: String -> String -> Html-password :: String -> Html-textfield :: String -> Html-afile :: String -> Html-clickmap :: String -> Html-menu :: String -> [Html] -> Html-gui :: String -> Html -> Html--module Text.XHtml.Table-data HtmlTable-instance HTML HtmlTable-instance HTMLTABLE HtmlTable-instance Show HtmlTable-class HTMLTABLE ht-cell :: HTMLTABLE ht => ht -> HtmlTable-instance HTMLTABLE Html-instance HTMLTABLE HtmlTable-(</>) :: (HTMLTABLE ht1, HTMLTABLE ht2) => ht1 -> ht2 -> HtmlTable-above :: (HTMLTABLE ht1, HTMLTABLE ht2) => ht1 -> ht2 -> HtmlTable-(<->) :: (HTMLTABLE ht1, HTMLTABLE ht2) => ht1 -> ht2 -> HtmlTable-beside :: (HTMLTABLE ht1, HTMLTABLE ht2) => ht1 -> ht2 -> HtmlTable-aboves :: HTMLTABLE ht => [ht] -> HtmlTable-besides :: HTMLTABLE ht => [ht] -> HtmlTable-simpleTable :: [HtmlAttr] -> [HtmlAttr] -> [[Html]] -> Html--module Text.XHtml.Debug-data HtmlTree-HtmlLeaf :: Html -> HtmlTree-HtmlNode :: Html -> [HtmlTree] -> Html -> HtmlTree-instance HTML HtmlTree-treeHtml :: [String] -> HtmlTree -> Html-treeColors :: [String]-debugHtml :: HTML a => a -> Html--module Text.XHtml
− src/CmdLine.hs 
@@ -1,1 +0,0 @@-import CmdLine.Main
+ src/CmdLine/Action.hs view
@@ -0,0 +1,99 @@++module CmdLine.Action(actionCmdLine) where++import CmdLine.Flag+import CmdLine.Query+import CmdLine.Search+import CmdLine.Files+import CmdLine.Test+import General.Code+import Hoogle.All+import Test.All+import Text.ParserCombinators.Parsec++import Paths_hoogle(version)+import Data.Version(showVersion)+++actionCmdLine :: CmdQuery -> IO ()++actionCmdLine CmdQuery{queryText = text, query = Left err} = do+    exitMessage ["Parse error:", "  " ++ text+                ,replicate (sourceColumn (errorPos err) + 1) ' ' ++ "^"+                ,show err]+++actionCmdLine q | not $ null $ queryBadFlags q = do+    exitMessage $ "Unrecognised or malformed flags:":+                  map ("  "++) (queryBadFlags q) +++                  ["For details on correct flags pass --help"]+++actionCmdLine q | Version `elem` queryFlags q = putStr $ unlines+    ["Hoogle - (C) Neil Mitchell 2004-2008, University of York, UK"+    ,"Version " ++ showVersion version]+++actionCmdLine q | Help `elem` queryFlags q =+    putStr $ "Go to the website for full help, http://haskell.org/hoogle/\n" +++             "\n" +++             "Flag reference:\n" +++             flagsHelp+++actionCmdLine q | Test `elem` queryFlags q = test+++actionCmdLine q | TestFile{} `elemEnum` queryFlags q =+    mapM_ (actionTest q) [x | TestFile x <- queryFlags q]+++actionCmdLine q | Rank{} `elemEnum` queryFlags q =+    mapM_ rank [x | Rank x <- queryFlags q]+++actionCmdLine q | Convert{} `elemEnum` queryFlags q = do+    mapM_ (actionConvert q) [x | Convert x <- queryFlags q]+++actionCmdLine q | Dump{} `elemEnum` queryFlags q = do+    dbs <- getDataBaseFiles (queryFlags q) (fromRight $ query q)+    mapM_ (actionDump q) dbs+++actionCmdLine q | not $ usefulQuery $ fromRight $ query q = do+    exitMessage ["No query entered"+                ,"Try --help for command line options"]+++actionCmdLine q = actionSearch (queryFlags q) (fromRight $ query q)+++---------------------------------------------------------------------+-- SPECIFIC ACTIONS++actionDump :: CmdQuery -> FilePath -> IO ()+actionDump q file = do+    let part = head [x | Dump x <- queryFlags q]+    d <- loadDataBase file+    putStrLn $ "File: " ++ file+    putStr $ showDataBase part d+++actionConvert :: CmdQuery -> FilePath -> IO FilePath+actionConvert q infile = do+    let outfile = headDef (replaceExtension infile "hoo") [x | Output x <- queryFlags q]+    putStrLn $ "Converting " ++ infile+    convert (Debug `elem` queryFlags q) infile outfile+    putStrLn $ "Written " ++ outfile+    +    when (Dump{} `elemEnum` queryFlags q) $ do+        putStrLn ""+        actionDump q outfile+    return outfile+++actionTest :: CmdQuery -> FilePath -> IO ()+actionTest q infile = do+    outfile <- actionConvert q infile+    testFile infile outfile
+ src/CmdLine/All.hs view
@@ -0,0 +1,8 @@++module CmdLine.All(+    module CmdLine.Query,+    module CmdLine.Action+    ) where++import CmdLine.Query+import CmdLine.Action
+ src/CmdLine/Files.hs view
@@ -0,0 +1,27 @@++module CmdLine.Files(getDataBaseFiles) where++import CmdLine.Flag+import General.Glob+import General.Code+import Hoogle.Query.All+import Paths_hoogle(getDataDir)+++-- pick "default" if there are not ones specified+-- otherwise use the CmdFlag and any +package query flags+getDataBaseFiles :: [CmdFlag] -> Query -> IO [FilePath]+getDataBaseFiles flags q = do+    let dataFil = [x | DataFile x <- flags]+        plusPkg = [x | PlusPackage x <- scope q]+    if null dataFil && null plusPkg then+        liftM (:[]) $ resolve "default"+     else do+        rs <- mapM resolve plusPkg+        return $ dataFil ++ rs+    where+        inc = [x | Include x <- flags]+        resolve x = do+            dataDir <- getDataDir+            [x] <- globFile (inc++[dataDir]) ["hoo"] x+            return x
+ src/CmdLine/Flag.hs view
@@ -0,0 +1,247 @@+{-|+    Parse a list of flags supported in any of the front ends.++    Returns the flags in a data structure, along with any invalid flags.+    +    Deal with any files/include files in this stage.+-}++module CmdLine.Flag(+    CmdFlag(..), flagsHelp,+    flagsWebArgs, flagsWebQuery, flagsCmdLine+    ) where++import General.Code+import General.Glob++---------------------------------------------------------------------+-- The flags++data CmdFlag = Version           -- ^ Version information+             | Web               -- ^ Operate as a CGI process+             | Help              -- ^ Help text+             | Test              -- ^ Run the regression tests+             | Color Bool        -- ^ Colors on the console+             | Start Int         -- ^ First result to show+             | Count Int         -- ^ Number of results to show+             | Convert FilePath  -- ^ Convert a database+             | Output FilePath   -- ^ Output file+             | Dump String       -- ^ Dump a database to a file (optional section)+             | DataFile FilePath -- ^ Database location+             | Verbose           -- ^ Display verbose information+             | Info              -- ^ Display as much information as you can+             | Debug             -- ^ Do debugging activities+             | Include FilePath  -- ^ Include directory+             | TestFile FilePath -- ^ Run tests in a file+             | Rank FilePath     -- ^ Generate rankings+               deriving (Eq {-! Enum !-} )+++-- | In which circumstances are you allowed to pass this command+data Permission = PWebArgs | PWebQuery | PCmdLine | PMultiple+                  deriving Eq++data Argument = ArgNone CmdFlag+              | ArgBool (Bool     -> CmdFlag)+              | ArgInt  (Int      -> CmdFlag)+              | ArgNat  (Int      -> CmdFlag)+              | ArgPos  (Int      -> CmdFlag)+              | ArgFileIn (FilePath -> CmdFlag) [String]+              | ArgFileOut (FilePath -> CmdFlag)+              | ArgDir (FilePath -> CmdFlag)+              | ArgStr  (String   -> CmdFlag)++instance Show Argument where+    show (ArgNone _) = ""+    show (ArgInt  _) = "INT"+    show (ArgNat  _) = "NAT"+    show (ArgPos  _) = "POS"+    show (ArgBool _) = "BOOL"+    show (ArgFileIn _ _) = "FILE"+    show (ArgFileOut _) = "FILE"+    show (ArgDir _) = "DIR"+    show (ArgStr  _) = "STR"+++data FlagInfo = FlagInfo {+    argument :: Argument,+    names :: [String],+    permissions :: [Permission],+    description :: String+    }++flagInfo =+    [f (ArgNone Version) ["version","ver"] [PCmdLine] "Print out version information"+    ,f (ArgNone Help) ["?","help","h"] [PCmdLine] "Show help message"+    ,f (ArgNone Web) ["w","web"] [PCmdLine] "Run as though it was a CGI script"+    ,f (ArgBool Color) ["c","color","col","colour"] [PCmdLine] "Show color output (default=false)"+    ,f (ArgPos  Start) ["s","start"] [PCmdLine,PWebArgs] "First result to show (default=1)"+    ,f (ArgPos  Count) ["n","count","length","len"] [PCmdLine,PWebArgs] "Number of results to show (default=all)"+    ,f (ArgNone Test) ["test"] [PCmdLine] "Run the regression tests"+    ,f (ArgFileIn Convert ["txt"]) ["convert"] [PCmdLine,PMultiple] "Convert a database"+    ,f (ArgFileOut Output) ["output"] [PCmdLine] "Output file for convert"+    ,f (ArgStr  Dump) ["dump"] [PCmdLine] "Dump a database for debugging"+    ,f (ArgFileIn DataFile ["hoo"]) ["d","data"] [PCmdLine,PMultiple] "Database file"+    ,f (ArgNone Verbose) ["v","verbose"] [PCmdLine] "Display verbose information"+    ,f (ArgNone Info) ["info"] [PCmdLine] "Display full information on an entry"+    ,f (ArgNone Debug) ["debug"] [PCmdLine] "Debugging only"+    ,f (ArgDir Include) ["i","include"] [PCmdLine,PMultiple] "Include directories"+    ,f (ArgFileIn TestFile ["txt"]) ["testfile"] [PCmdLine,PMultiple] "Run tests from a file"+    ,f (ArgFileIn Rank ["txt"]) ["rank"] [PCmdLine,PMultiple] "Generate ranking scores"+    ]+    where f = FlagInfo+++cmdFlagBadArg flag typ "" = "Missing argument to flag " ++ flag ++ ", expected argument of type " ++ typ+cmdFlagBadArg flag "" x = "Unexpected argument to flag " ++ flag ++ ", got \"" ++ x ++ "\""+cmdFlagBadArg flag typ x = "Bad argument to flag " ++ flag ++ ", expected argument of type " ++ typ ++ ", got \"" ++ x ++ "\""++cmdFlagPermission flag = "Flag not allowed when running in this mode, flag " ++ flag++cmdFlagUnknown flag = "Unknown flag " ++ flag++cmdFlagDuplicate flag = "The flag " ++ flag ++ " may only occur once, but occured multiple times"+++---------------------------------------------------------------------+-- Operations on Flags++-- | flags that are passed in through web arguments,+--   i.e. ?foo=bar&...+flagsWebArgs :: [(String,String)] -> IO ([CmdFlag],[String])+flagsWebArgs = parseFlags PWebArgs+++-- | flags that are given in the web query string+flagsWebQuery :: [(String,String)] -> IO ([CmdFlag],[String])+flagsWebQuery = parseFlags PWebQuery+++-- | flags that are given in a query on the command line+flagsCmdLine :: [(String,String)] -> IO ([CmdFlag],[String])+flagsCmdLine = parseFlags PCmdLine+++flagsHelp :: String+flagsHelp = unlines $ map f res+    where+        f (a,b,c) = "  " ++ (if null a then "    " else "--" ++ a ++ ",") +++                    " --" ++ b ++ replicate (maxLong - length b) ' ' +++                    "  " ++ c++        maxLong = maximum $ map (length . snd3) res+        res = [ (shortOpt (names i), longOpt (names i) ++ typ (argument i), description i)+              | i <- flagInfo, PCmdLine `elem` permissions i]++        shortOpt ([x]:_) = [x]+        shortOpt _ = ""+        +        longOpt ([_]:x:_) = x+        longOpt (x:_) = x++        typ x = ['='|s/=""] ++ s+            where s = show x+++---------------------------------------------------------------------+-- Parsing Flags++-- TODO: check no flag is specified twice+parseFlags :: Permission -> [(String,String)] -> IO ([CmdFlag],[String])+parseFlags perm xs = do+    let args = concatMap (parseFlag perm) xs+        inc = [x | Right (_,_,_,Include x) <- args]+    incs <- mapM globDir $ ["."|null inc] ++ inc+    (a,b) <- mapAndUnzipM (f incs) args+    return ([Include "."|null inc] ++ concat a, concat b)+    where+        f inc (Right (_,val,FlagInfo{argument=ArgFileIn gen exts},_)) = do+            let vals = parseFile val+            files <- concatMapM (globFile inc exts) vals+            return (map gen files, [])+        f inc (Left v) = return ([],[v])+        f inc (Right (_,_,_,v)) = return ([v],[])+++-- does all validity checks apart from checking for duplicate flags+parseFlag :: Permission -> (String, String) -> [Either String (String,String,FlagInfo,CmdFlag)]+parseFlag perm (key,val)+        | isNothing m = [Left $ cmdFlagUnknown key]+        | perm `notElem` permissions flg = [Left $ cmdFlagPermission key]+        | null arg = [Left $ cmdFlagBadArg key (show $ argument flg) val]+        | otherwise = [Right (key,val,flg,a) | a <- arg]+    where+        key2 = lower key+        m@ ~(Just flg) = listToMaybe [i | i <- flagInfo, key2 `elem` names i]+        arg = parseArg (argument flg) val+++parseArg :: Argument -> String -> [CmdFlag]+parseArg (ArgNone v) xs = [v | null xs]+parseArg (ArgStr  v) xs = [v xs]+parseArg (ArgBool v) xs = map v $ parseBool xs+parseArg (ArgNat  v) xs = map v $ parseNat  xs+parseArg (ArgInt  v) xs = map v $ parseInt  xs+parseArg (ArgPos  v) xs = map v $ parsePos  xs+parseArg (ArgFileIn v _) xs = map v $ parseFile xs+parseArg (ArgFileOut v) xs = map v $ parseFile xs+parseArg (ArgDir v) xs = map v $ parseFile xs+++parseNat, parsePos, parseInt :: String -> [Int]+parseNat = filter (>= 0) . parseInt+parsePos = filter (> 0) . parseInt+parseInt x = [a | (a,"") <- reads x]++parseFile :: String -> [String]+parseFile = splitSearchPath++parseBool :: String -> [Bool]+parseBool v | v2 `elem` ["","on","yes","1","true","meep"] = [True]+            | v2 `elem` ["off","no","0","false","moop"] = [False]+            | otherwise = []+    where v2 = lower v++++--------------------------------------------------------+-- DERIVES GENERATED CODE+-- DO NOT MODIFY BELOW THIS LINE+-- CHECKSUM: 780144949++instance Enum CmdFlag+    where toEnum 0 = Version{}+          toEnum 1 = Web{}+          toEnum 2 = Help{}+          toEnum 3 = Test{}+          toEnum 4 = Color{}+          toEnum 5 = Start{}+          toEnum 6 = Count{}+          toEnum 7 = Convert{}+          toEnum 8 = Output{}+          toEnum 9 = Dump{}+          toEnum 10 = DataFile{}+          toEnum 11 = Verbose{}+          toEnum 12 = Info{}+          toEnum 13 = Debug{}+          toEnum 14 = Include{}+          toEnum 15 = TestFile{}+          toEnum 16 = Rank{}+          toEnum n = error ((++) "toEnum " ((++) (show n) ", not defined for CmdFlag"))+          fromEnum (Version {}) = 0+          fromEnum (Web {}) = 1+          fromEnum (Help {}) = 2+          fromEnum (Test {}) = 3+          fromEnum (Color {}) = 4+          fromEnum (Start {}) = 5+          fromEnum (Count {}) = 6+          fromEnum (Convert {}) = 7+          fromEnum (Output {}) = 8+          fromEnum (Dump {}) = 9+          fromEnum (DataFile {}) = 10+          fromEnum (Verbose {}) = 11+          fromEnum (Info {}) = 12+          fromEnum (Debug {}) = 13+          fromEnum (Include {}) = 14+          fromEnum (TestFile {}) = 15+          fromEnum (Rank {}) = 16
− src/CmdLine/Main.hs 
@@ -1,190 +0,0 @@-{--    This file is part of Hoogle, (c) Neil Mitchell 2004-2005-    http://www.cs.york.ac.uk/~ndm/hoogle/--    This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License.-    To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/2.0/-    or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.--}--{- |-    Provides the 'main' function for the Console version.-    Handles command line arguments.--}--module CmdLine.Main where-import Hoogle.Hoogle-import System.Environment-import Data.List-import Data.Maybe-import Data.Char-import System.Console.GetOpt-import System.Directory--import Paths_hoogle----- | The main function-main :: IO ()-main = do-        args <- getArgs-        let newargs = map safeArrow args-            (flags,query) = parseArgs newargs--        path <- findPath flags--        let verbose = Verbose `elem` flags-            help = HelpMsg `elem` flags-            color = Color `elem` flags-            count = fromCount $ fromMaybe (Count 0) (find isCount flags)--            query2 = concat $ intersperse " " query-            query3 = if help then "" else query2--        if null query3-            then putStr helpMsg-            else case path of-                    Left tried -> putStr $ unlines $ "Could not find hoogle database, looked for:" :-                                                     map ("  "++) tried-                    Right path -> hoogle path verbose count color query3-    where-        safeArrow "-#" = " ->"-        safeArrow "->" = " ->"-        safeArrow xs   = map (\x -> if x == '#' then '>' else x) xs----- | Given a list of flags, either give the answer, or say where you tried searching-findPath :: [Flag] -> IO (Either [FilePath] FilePath)-findPath flags = do-        let pflags = [x | Path x <- flags]-        try <- if null pflags then defaults else return pflags-        x <- checkPaths try-        return $ maybe (Left try) Right x-    where-        checkPaths [] = return Nothing-        checkPaths (x:xs) = do-            b <- doesFileExist x-            if b then return (Just x) else checkPaths xs--        defaults = do-            installed <- getDataFileName "hoogle.txt"--            prog <- getProgName-            path <- findExecutable prog-            beside <- return [setFileName x "hoogle.txt" | Just x <- [path]]--            return $ nub ([installed] ++ beside ++ ["hoogle.txt"])---test x = hoogle "" True 10 x--- | Invoke hoogle.---   The first argument is the file to use as a data file.---   The second is a verbose flag.---   The third is the thing to search for---hoogle :: FilePath -> Bool -> Int -> Bool -> String -> IO ()-hoogle _ _ _ _ "" = putStr helpMsg-hoogle p verbose count color x =-        case hoogleParseError search of-            Just x -> putStrLn $ "Hoogle Error: " ++ x-            Nothing ->-                do-                    case hoogleSuggest False search of-                        Just a -> putStrLn $ (if color then showTag else showText) a-                        Nothing -> return ()-                    if color-                        then putStrLn $ "Searching for: " ++ showTag (hoogleSearch search)-                        else return ()--                    res <- if count == 0 then hoogleResults p search else hoogleRange p search 0 count-                    case res of-                        [] -> putStrLn "No matches found"-                        xs -> putStr $ unlines $ map f xs-    where-        search = hoogleParse x--        f res = showResult color res ++-                if verbose-                then " @ " ++ show (resultScore res) ++ " " ++ show (resultInfo res)-                else ""---showResult :: Bool -> Result -> String-showResult color (Result modu name typ _ _ _ _) =-        (if null fmodu then "" else fmodu ++ ".") ++ f name ++ " :: " ++ f typ-    where-        fmodu = f modu-        f x = if color then showTag x else showText x---showTag :: TagStr -> String-showTag x = f [] x-    where-        f a (Str x) = x-        f a (Tags xs) = concatMap (f a) xs-        f a (Tag code x) = case getCode code of-                            Nothing -> f a x-                            Just val -> tag (val:a) ++ f (val:a) x ++ tag a--        getCode "b" = Just "1"-        getCode "a" = Just "4"-        getCode "u" = Just "4"-        getCode [x] | x <= '6' && x >= '1' = Just ['3', x]-        getCode _ = Nothing--        tag stack = chr 27 : '[' : (concat $ intersperse ";" $ ("0":reverse stack)) ++ "m"----- | A help message to give the user, roughly what you get from hoogle --help-helpMsg :: String-helpMsg-    = unlines $ [-        "HOOGLE - Haskell API Search",-        "(C) Neil Mitchell 2004-2008, York University, UK",-        "",-        usageInfo ("Usage: hoogle [OPTION...] search") opts,--        "examples:",-        "  hoogle map",-        "  hoogle (a -> b) -> [a] -> [b]",-        "  hoogle [Char] -> [Bool]",-        "",-        "To aid when using certain consoles, -# is a synonym for ->",-        "Suggestions/comments/bugs to ndm -AT- cs.york.ac.uk",-        "A web version is available at www.cs.york.ac.uk/~ndm/hoogle/"-        ]---isPath (Path _) = True; isPath _ = False-isCount (Count _) = True; isCount _ = False----- | Data structure representing the falgs-data Flag = Verbose -- ^ Should verbose info be given, mainly percentage match-          | Path {fromPath :: FilePath} -- ^ Where to find the data file-          | HelpMsg -- ^ Show the help message-          | Count {fromCount :: Int}-          | Color-            deriving Eq----- | The options available-opts :: [OptDescr Flag]-opts = [ Option ['v'] ["verbose"] (NoArg Verbose) "verbose results"-       , Option ['n'] ["count"]   ((ReqArg (\n -> Count (read n))) "30") "number of results"-       , Option ['l'] []          ((ReqArg (\p -> Path p)) "path/hoogle.txt") "path to hoogle.txt"-       , Option ['h'] ["help"]    (NoArg HelpMsg) "help message"-       , Option ['c'] ["color"]   (NoArg Color) "show with color"-       ]----- | Parse the arguments, give out appropriate messages-parseArgs :: [String] -> ([Flag], [String])-parseArgs argv = case getOpt Permute opts argv of-        (flags,query,[]) -> (flags,query)-        (_,_,err)        -> error $ concat err ++ helpMsg---setFileName :: FilePath -> String -> FilePath-setFileName path file = (reverse $ dropWhile (not . (`elem` "\\/")) $ reverse path) ++ file
+ src/CmdLine/Query.hs view
@@ -0,0 +1,73 @@+{-|+    Parse a query, that may have come from either a CGI variable+    or the command line arguments.++    Need to return the following pieces of information:+    +    * Was there a query, or was nothing entered+    +    * Are you wanting to operate in Web mode or Command Line mode. Adding a+    Web parameter to Command Line gives you Web mode.++    * Which flags were specified, and which were erroneous.+-}++module CmdLine.Query(cmdQuery, CmdQuery(..)) where++import General.Code+import Text.ParserCombinators.Parsec++import CmdLine.Flag+import General.CGI+import Hoogle.Query.All+++data CmdQuery = CmdQuery {+    queryWeb :: Bool, -- ^ Are you operating from the web (via CGI)+    queryText :: String, -- ^ The string the user entered, @""@ for no string+    query :: Either ParseError Query, -- ^ The actual query+    queryFlags :: [CmdFlag], -- ^ The flags from the query+    queryBadFlags :: [String] -- ^ The bad flags+    }+++-- | Left (query text, error message), null query text = no query given+--   Right (query, command line flags, unparsable/unsupported flags)+cmdQuery :: IO CmdQuery+cmdQuery = do+    r <- cgiArgs+    case r of+        Just y -> cmdQueryCGI y+        Nothing -> cmdQueryArgs =<< getArgs+++cmdQueryCGI :: [(String,String)] -> IO CmdQuery+cmdQueryCGI [("",x)] = cmdQueryCGI [("q",x)]+cmdQueryCGI xs = do+    (flags1,bad1) <- flagsWebArgs notq+    case parseQuery str of+        Left err -> return $ CmdQuery True str (Left err) flags1 bad1+        Right res -> do+            (flags2,bad2) <- flagsWebQuery $ queryArgs res+            return $ CmdQuery True str (Right res) (flags2++flags1) (bad2++bad1)+    where+        (q,notq) = partition ((==) "q" . fst) xs+        str = unwords $ map snd q+++cmdQueryArgs :: [String] -> IO CmdQuery+cmdQueryArgs xs = case parseCmdLineQuery xs of+    Left err -> return $ CmdQuery False orig (Left err) [] []+    Right res -> do+        (flags,bad) <- flagsCmdLine $ queryArgs res+        return $ CmdQuery (Web `elem` flags) orig (Right res) flags bad+    where orig = unwords $ map quote xs+++quote :: String -> String+quote x | any isSpace x = "\"" ++ x ++ "\""+        | otherwise = x+++queryArgs :: Query -> [(String,String)]+queryArgs q = [(a,b) | Flag a b <- flags q]
+ src/CmdLine/Search.hs view
@@ -0,0 +1,54 @@++module CmdLine.Search(actionSearch) where++import CmdLine.Flag+import CmdLine.Files+import Data.Range+import Data.TagStr+import General.Code+import Hoogle.Query.All+import Hoogle.Search.All+import Hoogle.DataBase.All+import Hoogle.Item.All+import Hoogle.All+import Data.Binary.Defer.Index+++actionSearch :: [CmdFlag] -> Query -> IO ()+actionSearch flags q = do+    db <- getDataBaseFiles flags q+    when verbose $+        putStr $ unlines $ "= DATABASES =" : map ("  "++) db++    dbs <- mapM loadDataBase db+    let sug = suggestQuery dbs q+    when (isJust sug) $+        putStrLn $ showTag $ fromJust sug+    when verbose $ putStrLn "= ANSWERS ="++    when (isJust (typeSig q) && color) $ do+        let view = [ArgPosNum i i | i <- [0..10]]+            tags = renderEntryText view $ renderTypeSig $ fromJust $ typeSig q+        putStrLn $ "Searching for: " ++ showTag tags++    let res = search dbs q+    if null res then+        putStrLn "No results found"+     else if Info `elemEnum` flags then do+        putStrLn $ f $ renderResult $ head res+        putStrLn ""+        putStrLn $ showTag $ renderHaddock $ entryDocs $ fromLink $ resultEntry $ head res+     else+        putStr $ unlines $ map (f . renderResult) res+    where+        search | start == 0 && count == maxBound = searchAll+               | otherwise = searchRange (rangeStartCount start count)+            where start = headDef 0 [i-1 | Start i <- flags]+                  count = headDef maxBound [i | Count i <- flags]++        verbose = Verbose `elem` flags+        color = Color True `elem` flags+        showTag = if color then showTagConsole else show++        f (m,r,v) = maybe "" (\m -> showModule m ++ " ") m +++                    showTag r ++ (if verbose then "  -- " ++ v else "")
+ src/CmdLine/Test.hs view
@@ -0,0 +1,53 @@++module CmdLine.Test(testFile) where++import Hoogle.All+import Hoogle.Item.All+import General.Code+import Data.Binary.Defer.Index+++testFile :: FilePath -> FilePath -> IO ()+testFile srcfile dbfile = do+    putStrLn $ "Testing " ++ srcfile+    db <- loadDataBase dbfile+    src <- readFile srcfile+    let bad = filter (not . runTest db) $ catMaybes $ zipWith parseTest [1..] $ lines src+    if null bad then+        putStrLn "All tests passed"+     else do+        putStr $ unlines $ map failedTest bad+        putStrLn $ show (length bad) ++ " tests failed"+++-- LineNo Query Results+data Test = Test Int String Query [String]+            deriving Show+++parseTest :: Int -> String -> Maybe Test+parseTest line str | "@test " `isPrefixOf` str =+    case reads $ drop 5 str of+        [(x,rest)] -> case parseQuery x of+            Right q -> Just $ Test line x q (words rest)+            _ -> err+        _ -> err+    where err = error $ "Couldn't parse @test on line " ++ show line+parseTest line str = Nothing+++runTest :: DataBase -> Test -> Bool+runTest db (Test _ _ q ans) = f ans $ searchAll [db] q+    where+        f ["*"] _ = True+        f ("*":x:xs) (m:ms) = f (if g x m then xs else "*":x:xs) ms+        f (x:xs) (m:ms) = g x m && f xs ms+        f [] [] = True+        f _ _ = False++        g name m = name == entryName (fromLink $ resultEntry m)+++failedTest :: Test -> String+failedTest (Test line str _ _) = "Line " ++ show line ++ ", " ++ str+
+ src/Data/Binary/Defer.hs view
@@ -0,0 +1,8 @@++module Data.Binary.Defer(+    module Data.Binary.Defer.Monad,+    module Data.Binary.Defer.Class+    ) where++import Data.Binary.Defer.Monad+import Data.Binary.Defer.Class
+ src/Data/Binary/Defer/Array.hs view
@@ -0,0 +1,56 @@++module Data.Binary.Defer.Array(+    (!), Array, array, elems, arraySize+    ) where++import Data.Array hiding ((!), Array, array, elems)+import qualified Data.Array as A+import Data.Binary.Defer+import Data.Binary.Raw+import System.IO.Unsafe+import Control.Monad.Reader+++newtype Array a = Array (A.Array Int a)++array :: [a] -> Array a+array xs = Array $ listArray (0, length xs - 1) xs++(!) :: Array a -> Int -> a+(!) (Array a) i = a A.! i++elems :: Array a -> [a]+elems (Array a) = A.elems a+++arraySize (Array a) = 1 + y - x+    where (x,y) = bounds a++instance Functor Array where+    fmap f (Array x) = Array (fmap f x)++instance Eq a => Eq (Array a) where+    Array x == Array y = x == y++instance Show a => Show (Array a) where+    show (Array x) = show x++instance BinaryDefer a => BinaryDefer (Array a) where+    put (Array xs) = putDefer $ do+        putInt $ snd $ bounds xs+        mapM_ putFixed (A.elems xs)++    get = getDefer ans+        where+            ans = do+                n <- getInt+                h <- asks fst+                s <- ask+                i <- lift $ hGetPos h+                let f j = unsafePerformIO $ do+                             hSetPos h (i + toInteger (sz*j))+                             runReaderT getFixed s+                return $ Array $ listArray (0,n) $ map f [0..n]++            unwrap = undefined :: DeferGet (Array a) -> a+            sz = size $ unwrap ans
+ src/Data/Binary/Defer/Chunk.hs view
@@ -0,0 +1,51 @@++module Data.Binary.Defer.Chunk(+    Chunk, newChunk,+    lookupChunk+    ) where++import Control.Monad+import Data.Binary.Defer+import Data.Binary.Defer.Array+import Data.Range+++chunkSize = 100 :: Int++newtype Chunk a = Chunk (Array (Vector a))+newtype Vector a = Vector {unVector :: [a]}+++newChunk :: [a] -> Chunk a+newChunk = Chunk . array . f+    where+        f [] = []+        f xs = Vector a : f b+            where (a,b) = splitAt chunkSize xs+++lookupChunk :: Range -> Chunk a -> [a]+lookupChunk r (Chunk xs) =+        drop m $ f d (count + m)+    where+        (start,count) = (rangeStart r, rangeCount r)+        (d,m) = start `divMod` chunkSize++        f i n | n == 0 = []+              | n < chunkSize = take n $ unVector $ xs ! i+              | otherwise = unVector (xs ! i) ++ f (i+1) (n-chunkSize)+++instance BinaryDefer a => BinaryDefer (Chunk a) where+    put (Chunk a) = put a+    get = get1 Chunk++instance BinaryDefer a => BinaryDefer (Vector a) where+    put (Vector xs) = putInt (length xs) >> mapM_ put xs+    get = do+        i <- getInt+        liftM Vector $ replicateM i get++instance Show a => Show (Chunk a) where+    show (Chunk xs) = unlines $ zipWith f [0..] $ concatMap unVector $ elems xs+        where f i x = show i ++ " = " ++ show x
+ src/Data/Binary/Defer/Class.hs view
@@ -0,0 +1,183 @@++module Data.Binary.Defer.Class where++import Control.Monad+import Data.Binary.Defer.Monad+import Data.Binary.Raw+++---------------------------------------------------------------------+-- BinaryDefer++class BinaryDefer a where+    put :: a -> DeferPut ()+    get :: DeferGet a++    size :: a -> Int+    size _ = 4+    +    putFixed :: a -> DeferPut ()+    putFixed = putDefer . put++    getFixed :: DeferGet a+    getFixed = getDefer get+++errorDeferGet :: String -> a+errorDeferGet typ = error $ "BinaryDefer.get(" ++ typ ++ "), corrupt database"+++get0 f = return f+get1 f = do x1 <- get; return (f x1)+get2 f = do x1 <- get; x2 <- get; return (f x1 x2)+get3 f = do x1 <- get; x2 <- get; x3 <- get; return (f x1 x2 x3)+get4 f = do x1 <- get; x2 <- get; x3 <- get; x4 <- get; return (f x1 x2 x3 x4)+get5 f = do x1 <- get; x2 <- get; x3 <- get; x4 <- get; x5 <- get; return (f x1 x2 x3 x4 x5)+get6 f = do x1 <- get; x2 <- get; x3 <- get; x4 <- get; x5 <- get; x6 <- get; return (f x1 x2 x3 x4 x5 x6)+++getFixed0 f = return f+getFixed1 f = do x1 <- getFixed; return (f x1)+getFixed2 f = do x1 <- getFixed; x2 <- getFixed; return (f x1 x2)+getFixed3 f = do x1 <- getFixed; x2 <- getFixed; x3 <- getFixed; return (f x1 x2 x3)+getFixed4 f = do x1 <- getFixed; x2 <- getFixed; x3 <- getFixed; x4 <- getFixed; return (f x1 x2 x3 x4)+getFixed5 f = do x1 <- getFixed; x2 <- getFixed; x3 <- getFixed; x4 <- getFixed; x5 <- getFixed; return (f x1 x2 x3 x4 x5)+getFixed6 f = do x1 <- getFixed; x2 <- getFixed; x3 <- getFixed; x4 <- getFixed; x5 <- getFixed; x6 <- getFixed; return (f x1 x2 x3 x4 x5 x6)+++put0 = return () :: DeferPut ()+put1 x1 = put x1+put2 x1 x2 = put x1 >> put x2+put3 x1 x2 x3 = put x1 >> put x2 >> put x3+put4 x1 x2 x3 x4 = put x1 >> put x2 >> put x3 >> put x4+put5 x1 x2 x3 x4 x5 = put x1 >> put x2 >> put x3 >> put x4 >> put x5+put6 x1 x2 x3 x4 x5 x6 = put x1 >> put x2 >> put x3 >> put x4 >> put x5 >> put x6+++putFixed0 = return () :: DeferPut ()+putFixed1 x1 = putFixed x1+putFixed2 x1 x2 = putFixed x1 >> putFixed x2+putFixed3 x1 x2 x3 = putFixed x1 >> putFixed x2 >> putFixed x3+putFixed4 x1 x2 x3 x4 = putFixed x1 >> putFixed x2 >> putFixed x3 >> putFixed x4+putFixed5 x1 x2 x3 x4 x5 = putFixed x1 >> putFixed x2 >> putFixed x3 >> putFixed x4 >> putFixed x5+putFixed6 x1 x2 x3 x4 x5 x6 = putFixed x1 >> putFixed x2 >> putFixed x3 >> putFixed x4 >> putFixed x5 >> putFixed x6+++instance BinaryDefer Int where+    put = putInt+    get = getInt+    size _ = 4+    putFixed = put+    getFixed = get++instance BinaryDefer Char where+    put = putChr+    get = getChr+    size _ = 1+    putFixed = put+    getFixed = get++instance BinaryDefer Bool where+    put x = putChr (if x then '1' else '0')+    get = liftM (== '1') getChr+    size _ = 1+    putFixed = put+    getFixed = get+++instance BinaryDefer () where+    put () = return ()+    get = return ()+    size _ = 0+    putFixed = put+    getFixed = get++instance (BinaryDefer a, BinaryDefer b) => BinaryDefer (a,b) where+    put (a,b) = put2 a b+    get = get2 (,)+    size x = let ~(a,b) = x in size a + size b+    putFixed (a,b) = putFixed2 a b+    getFixed = getFixed2 (,)++instance (BinaryDefer a, BinaryDefer b, BinaryDefer c) =>+    BinaryDefer (a,b,c) where+    put (a,b,c) = put3 a b c+    get = get3 (,,)+    size x = let ~(a,b,c) = x in size a + size b + size c+    putFixed (a,b,c) = putFixed3 a b c+    getFixed = getFixed3 (,,)++instance (BinaryDefer a, BinaryDefer b, BinaryDefer c, BinaryDefer d) =>+    BinaryDefer (a,b,c,d) where+    put (a,b,c,d) = put4 a b c d+    get = get4 (,,,)+    size x = let ~(a,b,c,d) = x in size a + size b + size c + size d+    putFixed (a,b,c,d) = putFixed4 a b c d+    getFixed = getFixed4 (,,,)++instance (BinaryDefer a, BinaryDefer b, BinaryDefer c, BinaryDefer d,+    BinaryDefer e) => BinaryDefer (a,b,c,d,e) where+    put (a,b,c,d,e) = put5 a b c d e+    get = get5 (,,,,)+    size x = let ~(a,b,c,d,e) = x in size a + size b + size c + size d + size e+    putFixed (a,b,c,d,e) = putFixed5 a b c d e+    getFixed = getFixed5 (,,,,)++instance (BinaryDefer a, BinaryDefer b, BinaryDefer c, BinaryDefer d,+    BinaryDefer e, BinaryDefer f) => BinaryDefer (a,b,c,d,e,f) where+    put (a,b,c,d,e,f) = put6 a b c d e f+    get = get6 (,,,,,)+    size x = let ~(a,b,c,d,e,f) = x in size a + size b + size c + size d + size e + size f+    putFixed (a,b,c,d,e,f) = putFixed6 a b c d e f+    getFixed = getFixed6 (,,,,,)++instance BinaryDefer a => BinaryDefer (Maybe a) where+    put Nothing = putByte 0+    put (Just a) = putByte 1 >> put a++    get = do i <- getByte+             case i of+                0 -> get0 Nothing+                1 -> get1 Just+                _ -> errorDeferGet "Maybe"++instance (BinaryDefer a, BinaryDefer b) => BinaryDefer (Either a b) where+    put (Left a) = putByte 0 >> put a+    put (Right a) = putByte 1 >> put a+    +    get = do i <- getByte+             case i of+                0 -> get1 Left+                1 -> get1 Right+                _ -> errorDeferGet "Either"+++-- strategy: write out in 100 byte chunks, where each successive+-- chunk is lazy, but the first is not+instance BinaryDefer a => BinaryDefer [a] where+    put xs | null b = putByte (length a) >> mapM_ put a+           | otherwise = putByte maxByte >> mapM_ put a >> putDefer (put b)+        where (a,b) = splitAt 100 xs++    get = do+        i <- getByte+        if i /= maxByte then do+            replicateM i get+         else do+            xs <- replicateM 100 get+            ys <- getDefer get+            return (xs++ys)+++newtype Defer a = Defer a++fromDefer :: Defer a -> a+fromDefer (Defer x) = x++instance BinaryDefer a => BinaryDefer (Defer a) where+    put (Defer x) = putDefer $ put x+    get = getDefer $ liftM Defer get+    putFixed = put+    getFixed = get++
+ src/Data/Binary/Defer/Graph.hs view
@@ -0,0 +1,136 @@++module Data.Binary.Defer.Graph(+    Graph, GraphNode, showGraphWith,+    searchDijkstraState, searchDijkstraCycle,+    Graph_(..), newGraph_,+    graphFreeze, graphFollow+    ) where++import Data.Binary.Defer+import Data.Binary.Defer.Array+import Data.List+import General.Code+import qualified Data.Heap as Heap+import qualified Data.Map as Map+import qualified Data.Set as Set+++---------------------------------------------------------------------+-- GRAPH++data Graph n e = Graph (Array (Node n e))++data Node n e = Node {nodeResults :: [n], nodeEdges :: [(e, GraphNode)]}++type GraphNode = Int+++showGraphWith :: (Show n, Show e) => (GraphNode -> String) -> Graph n e -> String+showGraphWith showNode (Graph xs) = unlines $ concat $ zipWith f [0..] $ elems xs+    where+        f i (Node res es) = showNode i : map ("    "++) (r : map g es)+            where r = if null res then "No results" else unwords (map show res)++        g (e,n) = showNode n ++ " ==> " ++ show e+++instance (Show n, Show e) => Show (Graph n e) where+    show = showGraphWith (\x -> '#':show x)+++instance (BinaryDefer n, BinaryDefer e) => BinaryDefer (Graph n e) where+    put (Graph a) = put1 a+    get = get1 Graph++instance (BinaryDefer n, BinaryDefer e) => BinaryDefer (Node n e) where+    put (Node a b) = put2 a b+    get = get2 Node+++-- Given an initial (cost,state), and how to transform a (cost,state) along an edge+-- return the (cost,state,node) pairs with the invariants that:+--    Items are returned sorted by c+--    No (_,s,n) pair is returned twice+searchDijkstraState :: (Ord c, Ord s) =>+    (c,s) -> (e -> (c,s) -> (c,s)) ->+    GraphNode -> Graph n e -> [(c,s,n)]+searchDijkstraState (c,s) gen n (Graph xs) = f Set.empty (Heap.singleton c (s,n))+    where+        f seen next = case Heap.pop next of+            Nothing -> []+            Just ((c,(s,n)),next)+                | (s,n) `Set.member` seen -> f seen next+                | otherwise -> [(c,s,n) | n <- ns] ++ f seen2 next2+                    where Node ns es = xs ! n+                          seen2 = Set.insert (s,n) seen+                          next2 = Heap.insertList [(c2,(s2,n)) | (e,n) <- es, let (c2,s2) = gen e (c,s)] next+++-- Invariant: No node is reached going through that node+searchDijkstraCycle :: Ord c =>+    c -> (e -> c -> Maybe c) ->+    GraphNode -> Graph n e -> [(c,n)]+searchDijkstraCycle c gen n (Graph xs) = f (Heap.singleton c (Set.singleton n,n))+    where+        f next = case Heap.pop next of+            Nothing -> []+            Just ((c,(s,n)),next) -> [(c,n) | n <- ns] ++ f (Heap.insertList new next)+                where Node ns es = xs ! n+                      new = [ (c2, (Set.insert n s,n))+                            | (e,n) <- es, not $ n `Set.member` s+                            , Just c2 <- [gen e c]]+++---------------------------------------------------------------------+-- MUTABLE GRAPH++data Graph_ k n e = Graph_ {graphResults :: [(k,n)], graphEdges :: [(k,k,e)]}+                    deriving Show+++newGraph_ :: Graph_ k n e+newGraph_ = Graph_ [] []+++graphKeys :: Graph_ k n e -> [k]+graphKeys (Graph_ res es) = map fst res ++ concatMap (\(a,b,c) -> [a,b]) es+++-- follow a node, if you create a new node, keep following+graphFollow :: Ord k => (k -> [(k,e)]) -> Graph_ k n e -> Graph_ k n e+graphFollow next g = g{graphEdges = graphEdges g ++ f Set.empty (graphKeys g)}+    where+        f seen [] = []+        f seen (t:odo)+            | t `Set.member` seen = f seen odo+            | otherwise =+                [(t,k,e) | (k,e) <- nxt] ++ f (Set.insert t seen) (map fst nxt ++ odo)+            where nxt = next t+++graphFreeze :: Ord k => Graph_ k n e -> (Graph n e, Map.Map k GraphNode)+graphFreeze (Graph_ res es) = (g, r)+    where+        g = Graph $ array $ map snd $ sortFst $ Map.elems mp+        r = Map.map fst mp+        mp = foldl' addEdge (foldl' addNode Map.empty (reverse res)) (reverse es)++        -- mp :: Map (key, (GraphNode, Node n e))+        addNode mp (k1,n) = Map.insertWith f k1 new mp+            where+                new = (Map.size mp, Node [n] [])+                f new (i, Node ns es) = (i, Node (n:ns) es)++        addEdge mp (k1,k2,e) = Map.insertWith f k1 new mp3+            where+                -- ensureKey k1 is important, even though ki1 is not needed+                -- otherwise k1 may not make it into the map+                (mp2,ki1) = ensureKey k1 mp+                (mp3,ki2) = ensureKey k2 mp2+                new = (Map.size mp, Node [] [(e, ki2)])+                f new (i, Node ns es) = (i, Node ns ((e,ki2):es))++        ensureKey k mp = case Map.lookup k mp of+            Just (y,_) -> (mp, y)+            Nothing -> (Map.insert k (n, Node [] []) mp, n)+                where n = Map.size mp
+ src/Data/Binary/Defer/Index.hs view
@@ -0,0 +1,136 @@++module Data.Binary.Defer.Index(+    Id,+    Index, newIndex,+    Lookup, newLookup, lookupKey, lookupIndex,+    Link, newLink, fromLink, linkKey,+    Index_, newIndex_, getLink, getLookup, indexFreeze+    ) where++import General.Util+import Data.Binary.Defer+import Data.Binary.Defer.Array+import qualified Data.Map as Map+import Data.Maybe+import Data.List+import Data.Typeable++type Id = Int+++---------------------------------------------------------------------+-- INDEX++newtype Index a = Index (Array a)+++typename_Index = mkTyCon "Data.Binary.Defer.Index.Index"+instance Typeable1 Index where typeOf1 _ = mkTyConApp typename_Index []+instance Typeable a => Typeable (Index a) where typeOf = typeOfDefault+++-- | Items will obtain the Id's 0..length-1+newIndex :: [a] -> Index a+newIndex = Index . array+++instance BinaryDefer a => BinaryDefer (Index a) where+    put (Index x) = put x+    get = get1 Index++instance Show a => Show (Index a) where+    show (Index xs) = unlines $ zipWith f [0..] (elems xs)+        where+            f i x = "#" ++ si ++ replicate (width - length si + 1) ' ' ++ show x+                where si = show i+            width = length $ show $ arraySize xs++instance Functor Index where+    fmap f (Index x) = Index $ fmap f x+++---------------------------------------------------------------------+-- LOOKUP++newtype Lookup a = Lookup {lookupKey :: Id}+                   deriving (Eq,Ord)++newLookup :: Id -> Lookup a+newLookup = Lookup++lookupIndex :: Lookup a -> Index a -> a+lookupIndex (Lookup i) (Index xs) = xs ! i+++instance BinaryDefer (Lookup a) where+    put (Lookup key) = put key+    get = get1 Lookup+    size _ = size (0 :: Id)+    putFixed (Lookup key) = putFixed key+    getFixed = getFixed1 Lookup+++instance Show (Lookup a) where+    show (Lookup key) = "#" ++ show key+++---------------------------------------------------------------------+-- LINK++data Link a = Link Id a++newLink :: Id -> a -> Link a+newLink = Link++fromLink :: Link a -> a+fromLink (Link k v) = v++linkKey :: Link a -> Id+linkKey (Link k v) = k++instance Eq (Link a) where+    a == b = linkKey a == linkKey b++instance Ord a => Ord (Link a) where+    compare a b = compare (fromLink a) (fromLink b)++instance Show a => Show (Link a) where+    show = show . fromLink++instance Typeable a => BinaryDefer (Link a) where+    put = put . linkKey+    get = do+        i <- get+        Index xs <- getDeferGet+        return $ Link i $ xs ! i++    size _ = size (0 :: Id)+    putFixed = put+    getFixed = get+++---------------------------------------------------------------------+-- INDEXMUTABLE++newtype Index_ a = Index_ (Map.Map a Id)++instance Show a => Show (Index_ a) where+    show = show . indexFreeze+++newIndex_ :: Index_ a+newIndex_ = Index_ Map.empty+++getLookup :: Ord a => a -> Index_ a -> (Index_ a, Lookup a)+getLookup x y = (a, Lookup $ linkKey b)+    where (a,b) = getLink x y++getLink :: Ord a => a -> Index_ a -> (Index_ a, Link a)+getLink x (Index_ mp) = (Index_ mp2, newLink (fromMaybe n res) x)+    where (res,mp2) = Map.insertLookupWithKey (\_ _ a -> a) x n mp+          n = Map.size mp+++indexFreeze :: Index_ a -> Index a+indexFreeze (Index_ mp) = newIndex $ map fst $ sortBy (compare `on` snd) $ Map.toList mp
+ src/Data/Binary/Defer/Map.hs view
@@ -0,0 +1,21 @@+{-|+    Provides a BinaryDefer instance for Data.Map++    Defers the entire thing, and every element, but not any keys+    which should give just about the right balance of laziness+-}++module Data.Binary.Defer.Map(+    module Data.Map+    ) where++import Control.Monad+import Control.Arrow+import Data.Map+import Data.Binary.Defer+import Data.Binary.Defer.Vector as Vector+++instance (Ord k, BinaryDefer k, BinaryDefer v) => BinaryDefer (Data.Map.Map k v) where+    put = putDefer . put . Vector.fromList . Prelude.map (id *** Defer) . Data.Map.toAscList+    get = getDefer $ liftM (Data.Map.fromAscList . Prelude.map (id *** fromDefer) . Vector.toList) get
+ src/Data/Binary/Defer/Monad.hs view
@@ -0,0 +1,86 @@++module Data.Binary.Defer.Monad where++import System.IO+import System.IO.Unsafe+import Data.Binary.Raw+import Control.Monad.Reader+import Data.IORef++import Data.Typeable+import qualified Data.TypeMap as TypeMap+++---------------------------------------------------------------------+-- Defer Put++type DeferPut a = ReaderT (Handle, IORef [DeferPending]) IO a+data DeferPending = DeferPending Integer (DeferPut ())++putInt, putByte :: Int -> DeferPut ()+putInt  x = do h <- asks fst; lift $ hPutInt  h x+putByte x = do h <- asks fst; lift $ hPutByte h x++putChr :: Char -> DeferPut ()+putChr  x = do h <- asks fst; lift $ hPutChar h x++putDefer :: DeferPut () -> DeferPut ()+putDefer x = do+    (h,ref) <- ask+    p <- lift $ hGetPos h+    lift $ hPutInt h 0 -- to backpatch+    lift $ modifyIORef ref (DeferPending p x :)++runDeferPut :: Handle -> DeferPut () -> IO ()+runDeferPut h m = do+    ref <- newIORef []+    runReaderT m (h,ref)+    todo <- readIORef ref+    mapM_ (runDeferPending h) (reverse todo)++runDeferPending :: Handle -> DeferPending -> IO ()+runDeferPending h (DeferPending pos act) = do+    i <- hGetPos h+    hSetPos h pos+    hPutInt h (fromInteger i)+    hSetPos h i+    runDeferPut h act+++---------------------------------------------------------------------+-- Defer Get++type DeferGet a = ReaderT (Handle, IORef TypeMap.TypeMap) IO a++getInt, getByte :: DeferGet Int+getInt  = do h <- asks fst; lift $ hGetInt  h+getByte = do h <- asks fst; lift $ hGetByte h++getChr :: DeferGet Char+getChr  = do h <- asks fst; lift $ hGetChar h++getDefer :: DeferGet a -> DeferGet a+getDefer x = do+    h <- asks fst+    i <- lift $ hGetInt h+    s <- ask+    lift $ unsafeInterleaveIO $ do+        hSetPos h (toInteger i)+        runReaderT x s++runDeferGet :: Handle -> DeferGet a -> IO a+runDeferGet h m = do+    ref <- newIORef TypeMap.empty+    runReaderT m (h,ref)+++getDeferGet :: Typeable a => DeferGet a+getDeferGet = do+    ref <- asks snd+    mp <- lift $ readIORef ref+    return $ TypeMap.find mp++getDeferPut :: Typeable a => a -> DeferGet ()+getDeferPut x = do+    ref <- asks snd+    lift $ modifyIORef ref $ TypeMap.insert x
+ src/Data/Binary/Defer/Trie.hs view
@@ -0,0 +1,44 @@++module Data.Binary.Defer.Trie(+    Trie, newTrie, lookupTrie+    ) where++import Data.Binary.Defer+import Data.List+import Data.Maybe+import General.Code+++-- Keep simple first, can move to an Array later if necessary+data Trie a = Trie (Maybe a) [(Char,Trie a)]+              deriving Eq+++newTrie :: [(String,a)] -> Trie a+newTrie = newTrieOrdered . sortBy (compare `on` fst)+++newTrieOrdered :: [(String,a)] -> Trie a+newTrieOrdered xs = Trie+        (fmap snd $ listToMaybe as)+        (map f $ groupBy ((==) `on` (head . fst)) bs)+    where+        (as,bs) = span (null . fst) xs+        f xs = (head $ fst $ head xs, newTrieOrdered [(a,b) | (_:a,b) <- xs])+++lookupTrie :: String -> Trie a -> Maybe a+lookupTrie [] (Trie a b) = a+lookupTrie (x:xs) (Trie a b) = lookup x b >>= lookupTrie xs+++instance BinaryDefer a => BinaryDefer (Trie a) where+    put (Trie a b) = putDefer $ put2 a b+    get = getDefer $ get2 Trie++instance Show a => Show (Trie a) where+    show = unlines . f ""+        where+            f str (Trie res xs) =+                [show str ++ " = " ++ show r | Just r <- [res]] +++                concat [f (str ++ [c]) t | (c,t) <- xs]
+ src/Data/Binary/Defer/Vector.hs view
@@ -0,0 +1,30 @@++-- TODO: Should probably use ByteString instead?++module Data.Binary.Defer.Vector(+    Vector, toList, fromList+    ) where++import Control.Monad+import Data.Binary.Defer+++newtype Vector a = Vector [a]+++instance BinaryDefer a => BinaryDefer (Vector a) where+    put (Vector xs) = putDefer $ do+        putInt (length xs)+        mapM_ put xs++    get = getDefer $ do+        i <- getInt+        liftM Vector $ replicateM i get+++toList :: Vector a -> [a]+toList (Vector xs) = xs+++fromList :: [a] -> Vector a+fromList = Vector
+ src/Data/Binary/Raw.hs view
@@ -0,0 +1,59 @@++-- Note: Some of these functions, when written in a point-free+-- style have a significant impact on the runtime speed of+-- unoptimised code, for example hGetPos contributes ~20% extra time++module Data.Binary.Raw(+    hGetInt, hPutInt,+    hGetByte, hPutByte, maxByte,+    hGetPos, hSetPos+    ) where++import System.IO+import Control.Monad+import Data.Bits+import Data.Char+++hGetPos :: Handle -> IO Integer+hGetPos hndl = hTell hndl++hSetPos :: Handle -> Integer -> IO ()+hSetPos hndl i = hSeek hndl AbsoluteSeek i+++maxByte :: Int+maxByte = 0xff++-- FROM the Binary module, thanks to the Hac 07 people!++hPutInt :: Handle -> Int -> IO ()+hPutInt hndl w32 = do+    let w4 = (w32 `shiftR` 24) .&. 0xff+        w3 = (w32 `shiftR` 16) .&. 0xff+        w2 = (w32 `shiftR`  8) .&. 0xff+        w1 =  w32              .&. 0xff+    hPutByte hndl w1+    hPutByte hndl w2+    hPutByte hndl w3+    hPutByte hndl w4++hPutByte :: Handle -> Int -> IO ()+hPutByte hndl i = hPutChar hndl $ chr i+++hGetInt :: Handle -> IO Int+hGetInt hndl = do+    w1 <- hGetByte hndl+    w2 <- hGetByte hndl+    w3 <- hGetByte hndl+    w4 <- hGetByte hndl+    return $! (w4 `shiftL` 24) .|.+              (w3 `shiftL` 16) .|.+              (w2 `shiftL`  8) .|.+              (w1)+++hGetByte :: Handle -> IO Int+hGetByte hndl = liftM ord $ hGetChar hndl+
+ src/Data/Heap.hs view
@@ -0,0 +1,76 @@++module Data.Heap(+    Heap, empty,+    fromList, toList, elems,+    singleton,+    insert, insertList,+    pop, popUntil, popWhile+    ) where++import Prelude+import qualified Data.Map as Map+import Data.Maybe+++-- (k,v) pairs are stored in reverse order++newtype Heap k v = Heap (Map.Map k [(k,v)])++empty :: Heap k v+empty = Heap Map.empty+++fromList :: Ord k => [(k,v)] -> Heap k v+fromList xs = insertList xs empty+++toList :: Heap k v -> [(k,v)]+toList (Heap mp) = concatMap reverse $ Map.elems mp+++elems :: Heap k v -> [v]+elems (Heap mp) = concatMap (reverse . map snd) $ Map.elems mp+++singleton :: Ord k => k -> v -> Heap k v+singleton k v = insert k v empty+++-- insert a value with a cost, does NOT overwrite values+insert :: Ord k => k -> v -> Heap k v -> Heap k v+insert k v (Heap xs) = Heap $ Map.insertWith (++) k [(k,v)] xs+++insertList :: Ord k => [(k,v)] -> Heap k v -> Heap k v+insertList xs mp = foldr (uncurry insert) mp xs+++-- retrieve the lowest value (can use minView in the future)+-- does NOT guarantee to be the first one inserted at that level+pop :: Ord k => Heap k v -> Maybe ((k,v), Heap k v)+pop (Heap mp) | Map.null mp = Nothing+              | null kvs    = Just ((k1,v1), Heap mp2)+              | otherwise   = Just ((k1,v1), Heap $ Map.insert k kvs mp2)+    where+        ((k,(k1,v1):kvs),mp2) = Map.deleteFindMin mp+++-- until you reach this key, do not pop those at this key+-- guarantees to return by order, then insertion time+popUntil :: Ord k => k -> Heap k v -> ([v], Heap k v)+popUntil x = popBy (< x)+++-- until you reach this key, and then pop those at this key+-- guarantees to return by order, then insertion time+popWhile :: Ord k => k -> Heap k v -> ([v], Heap k v)+popWhile x = popBy (<= x)+++popBy :: Ord k => (k -> Bool) -> Heap k v -> ([v], Heap k v)+popBy cmp (Heap mp)+    | Map.null mp || not (cmp k) = ([], Heap mp)+    | otherwise = (reverse (map snd kvs) ++ res, mp3)+        where+            ((k,kvs),mp2) = Map.deleteFindMin mp+            (res,mp3) = popBy cmp (Heap mp2)
+ src/Data/Key.hs view
@@ -0,0 +1,40 @@++module Data.Key(+    Key, keyPair, toKey, fromKey,+    sortKeys, sortWith+    ) where++import Data.List+import General.Code+++data Key k v = Key k v+++instance Eq k => Eq (Key k v) where+    Key k1 v1 == Key k2 v2 = k1 == k2++instance Ord k => Ord (Key k v) where+    compare (Key k1 v1) (Key k2 v2) = compare k1 k2+++keyPair :: k -> v -> Key k v+keyPair = Key+++toKey :: (v -> k) -> v -> Key k v+toKey f v = Key (f v) v+++fromKey :: Key k v -> v+fromKey (Key k v) = v+++sortKeys :: Ord k => [Key k v] -> [v]+sortKeys = map fromKey . sort+++-- | @sort f == sortBy (compare `on` f)@+--   but @f@ will only be applied to each element once+sortWith :: Ord k => (v -> k) -> [v] -> [v]+sortWith f = sortKeys . map (toKey f)
+ src/Data/Range.hs view
@@ -0,0 +1,59 @@+{-|+    Invariants: Count >= 0, End >= Start, Start >= 0++    Start/End are 0-based indicies++    Count may be maxBound::Int!++    The rangeStartCount and rangeStartEnd methods ensure the invariants,+    modifying the range if necessary+-}++module Data.Range(+    Range,+    rangeStart, rangeCount, rangeEnd,+    rangeStartCount, rangeStartEnd,+    listRange, mergeRanges+    ) where++import Data.List+import General.Code+++data Range = Range {rangeStart :: Int, rangeCount :: Int}+++instance Show Range where+    show r = "Range {rangeStart = " ++ show (rangeStart r) +++                  ", rangeCount = " ++ show (rangeCount r) +++                  ", rangeEnd = " ++ show (rangeEnd r) ++ "}"+++nat = max (0::Int)+++rangeEnd :: Range -> Int+rangeEnd r = rangeStart r + rangeCount r - 1+++rangeStartCount :: Int -> Int -> Range+rangeStartCount start count = Range (nat start) (nat count)+++rangeStartEnd :: Int -> Int -> Range+rangeStartEnd start end = Range start2 (nat $ end - start2 + 1)+    where start2 = nat start+++listRange :: Range -> [a] -> [a]+listRange r = take (rangeCount r) . drop (rangeStart r)+++-- make sure in the resultant range+-- end r_{n} < (start r_{n+1} - 1)+mergeRanges :: [Range] -> [Range]+mergeRanges = foldr f [] . sortOn rangeStart+    where+        f (Range s1 c1) (Range s2 c2 : rs) | s2 <= s1+c1 = r12 : rs+            where r12 = Range s1 (max c1 (s2-s1 + c2))+        f r rs = [r | rangeCount r > 0] ++ rs
+ src/Data/TagStr.hs view
@@ -0,0 +1,56 @@++module Data.TagStr where++import Data.Char+import Data.List+++data TagStr = Str String+            | Tags [TagStr]+            | TagBold TagStr+            | TagUnderline TagStr+            | TagHyperlink String TagStr+            | TagColor Int TagStr+++tagInner (TagBold x) = x+tagInner (TagUnderline x) = x+tagInner (TagHyperlink _ x) = x+tagInner (TagColor _ x) = x+++showTag :: TagStr -> String+showTag x = f x+    where+        f (Str x) = x+        f (Tags x) = concatMap f x+        f x = f $ tagInner x+++showTagConsole :: TagStr -> String+showTagConsole x = f [] x+    where+        f a (Str x) = x+        f a (Tags xs) = concatMap (f a) xs++        f a t =+            case getCode t of+                Nothing -> f a x+                Just val -> tag (val:a) ++ f (val:a) x ++ tag a+            where x = tagInner t+        +        getCode (TagBold _) = Just "1"+        getCode (TagHyperlink _ _) = Just "4"+        getCode (TagUnderline _) = Just "4"+        getCode (TagColor n _) | n <= 5 && n >= 0 = Just ['3', intToDigit (n + 1)]+        getCode _ = Nothing+        +        tag stack = chr 27 : '[' : (concat $ intersperse ";" $ ("0":reverse stack)) ++ "m"+++++instance Show TagStr where+    show (Str x) = x+    show (Tags x) = concatMap show x+    show x = show $ tagInner x
+ src/Data/TypeMap.hs view
@@ -0,0 +1,39 @@++module Data.TypeMap(+    TypeMap, empty,+    lookup, insert, find+    ) where++import Prelude hiding (lookup)+import Control.Monad+import Data.Dynamic+import Data.Maybe+import qualified Data.Map as Map++newtype TypeMap = TypeMap (Map.Map TypeRep Dynamic)+++empty :: TypeMap+empty = TypeMap Map.empty+++lookup :: Typeable a => TypeMap -> Maybe a+lookup (TypeMap mp) = res+    where res = liftM (fromJust . fromDynamic) $ Map.lookup (typeOf $ fromJust res) mp+++find :: Typeable a => TypeMap -> a+find mp = res+    where res = fromMaybe (error msg) $ lookup mp+          msg = "Data.TypeMap.find, couldn't find " ++ show (typeOf res)+++insert :: Typeable a => a -> TypeMap -> TypeMap+insert a (TypeMap mp) = TypeMap $ Map.insert (typeOf a) (toDyn a) mp+++instance Ord TypeRep where+    compare a b = compare (splitTyConApp a) (splitTyConApp b)++instance Ord TyCon where+    compare a b = compare (tyConString a) (tyConString b)
+ src/General/CGI.hs view
@@ -0,0 +1,92 @@++{- |+    Parse the CGI arguments+-}+++module General.CGI(cgiArgs, escape, escapeUpper, escapeLower, asCgi, escapeHTML, escapeAttrib) where++import General.TextUtil+import System.Environment+import Control.Monad+import Data.Maybe+import Data.Char+import Numeric+import Data.List+++cgiVariable :: IO (Maybe String)+cgiVariable = catch (liftM Just $ getEnv "QUERY_STRING")+                    (const $ return Nothing)+++cgiArgs :: IO (Maybe [(String, String)])+cgiArgs = do x <- cgiVariable+             return $ case x of+                Nothing -> Nothing+                Just y -> Just $ parseArgs $ ['=' | '=' `notElem` y] ++ y+++asCgi :: [(String, String)] -> String+asCgi x = concat $ intersperse "&" $ map f x+    where+        f (a,b) = a ++ "=" ++ escape b+++parseArgs :: String -> [(String, String)]+parseArgs xs = mapMaybe (parseArg . splitPair "=") $ splitList "&" xs++parseArg Nothing = Nothing+parseArg (Just (a,b)) = Just (unescape a, unescape b)+++-- | Take an escape encoded string, and return the original+unescape :: String -> String+unescape ('+':xs) = ' ' : unescape xs+unescape ('%':a:b:xs) = unescapeChar a b : unescape xs+unescape (x:xs) = x : unescape xs+unescape [] = []+++-- | Takes two hex digits and returns the char+unescapeChar :: Char -> Char -> Char+unescapeChar a b = chr $ (f a * 16) + f b+    where+        f x | isDigit x = ord x - ord '0'+            | otherwise = ord (toLower x) - ord 'a' + 10+++-- | Decide how you want to encode individual characters+--   i.e. upper or lower case+escapeWith :: (Char -> Char) -> String -> String+escapeWith f (x:xs) | isAlphaNum x = x : escapeWith f xs+                    | otherwise    = '%' : escapeCharWith f x ++ escapeWith f xs+escapeWith f [] = []+++escapeCharWith :: (Char -> Char) -> Char -> String+escapeCharWith f x = case map f $ showHex (ord x) "" of+                          [x] -> ['0',x]+                          x   -> x++escapeUpper = escapeWith toUpper+escapeLower = escapeWith toLower+escape = escapeLower++++-- | Take a piece of text and escape all the HTML special bits+escapeHTML :: String -> String+escapeHTML = concatMap f+    where+        f '<' = "&lt;"+        f '>' = "&gt;"+        f '&' = "&amp;"+        f  x  = [x]+++escapeAttrib :: String -> String+escapeAttrib = concatMap f . escapeHTML+    where+        f '\"' = "&quot;"+        f x = [x]
+ src/General/Code.hs view
@@ -0,0 +1,26 @@++module General.Code(+    module General.Util, module Safe,+    module Control.Arrow, module Control.Monad,+    module Data.Char, module Data.Maybe, module Data.List,+    module Debug.Trace, module Control.Exception,+    module System.Cmd, module System.Directory, module System.Environment,+    module System.Exit, module System.FilePath, module System.IO+    ) where++import General.Util+import Safe++import Control.Arrow+import Control.Monad+import Data.Char+import Data.Maybe+import Data.List+import Debug.Trace(trace)+import Control.Exception(assert)+import System.Cmd+import System.Directory+import System.Environment+import System.Exit+import System.FilePath hiding (FilePath)+import System.IO
+ src/General/Glob.hs view
@@ -0,0 +1,62 @@++module General.Glob(globFile, globDir) where++import General.Code+++-- Find the file given directories, extensions, search+-- supports * glob key+globFile :: [FilePath] -> [String] -> FilePath -> IO [FilePath]+globFile dirs exts file = f poss+    where+        f [] = exitMessage $ ["Could not find file:"+                             , "    " ++ file+                             ,"Searched:"] +++                             map ("    " ++) poss+        f (x:xs) = do+            y <- globFileTest x+            if null y then f xs else return y++        exts2 = "" : if hasExtension file then [] else exts+        poss = [d </> file <.> e | d <- dirs, e <- exts2]+++globFileTest :: FilePath -> IO [FilePath]+globFileTest file = do+    (dir,fil) <- return $ splitFileName file+    if '*' `notElem` fil then do+        b <- doesFileExist file+        return [file | b]+     else do+        s <- getDirectoryContents $ dropTrailingPathSeparator dir+        concatMapM (f dir fil) s+    where+        f dir fil x = do+            let dirx = dir </> x+            b <- doesFileExist dirx+            return [dirx | b && globMatch fil x]+++globMatch :: String -> String -> Bool+globMatch glob s | null glob = False+                 | otherwise =+        head matches `isPrefixOf` s2 && last matches `isSuffixOf` s2 && f matches s2+    where+        norm = if searchPathSeparator == ';' then lower else id+        s2 = norm s+        matches = split '*' $ norm glob++        f []     s  = True+        f (m:ms) [] = False+        f (m:ms) s  | m `isPrefixOf` s = f ms $ drop (length m) s+                    | otherwise = f (m:ms) (tail s)+++-- check for existence and crash if not+globDir :: FilePath -> IO FilePath+globDir x = do+    x <- canonicalizePath x+    b <- doesDirectoryExist x+    if b then return x else+        exitMessage ["Could not find directory:"+                    , "    " ++ x]
+ src/General/TextUtil.hs view
@@ -0,0 +1,64 @@+{-|+    General text utility functions+-}++module General.TextUtil where++import Prelude+import Data.Maybe+import Data.Char+import Data.List+++trim :: String -> String+trim = trimLeft . trimRight+trimLeft = dropWhile isSpace+trimRight = reverse . trimLeft . reverse+++isSubstrOf :: Eq a => [a] -> [a] -> Bool+isSubstrOf find list = any (isPrefixOf find) (tails list)+++splitList :: Eq a => [a] -> [a] -> [[a]]+splitList find str = if isJust q then a : splitList find b else [str]+    where+        q = splitPair find str+        Just (a, b) = q+++splitPair :: Eq a => [a] -> [a] -> Maybe ([a], [a])+splitPair find str = f str+    where+        f [] = Nothing+        f x  | isPrefixOf find x = Just ([], drop (length find) x)+             | otherwise = if isJust q then Just (head x:a, b) else Nothing+                where+                    q = f (tail x)+                    Just (a, b) = q+++indexOf find str = length $ takeWhile (not . isPrefixOf (lcase find)) (tails (lcase str))+++lcase = map toLower+ucase = map toUpper+++replace find with [] = []+replace find with str | find `isPrefixOf` str = with ++ replace find with (drop (length find) str)+                      | otherwise = head str : replace find with (tail str)+++++-- 0 based return+findNext :: Eq a => [[a]] -> [a] -> Maybe Int+findNext finds str = if null maxs then Nothing else Just (fst (head (sortBy compSnd maxs)))+    where+        maxs = mapMaybe f (zip [0..] finds)+        +        f (id, find) = if isJust q then Just (id, length (fst (fromJust q))) else Nothing+            where q = splitPair find str+        +        compSnd (_, a) (_, b) = compare a b
+ src/General/Util.hs view
@@ -0,0 +1,254 @@++module General.Util where++import Control.Monad+import Data.Char+import Data.List+import Debug.Trace+import System.Directory+import System.Exit+import qualified Data.IntSet as IntSet+import qualified Data.Map as Map+import Control.Arrow+import System.IO.Unsafe++infixl 0 `on`++fst3 (a,b,c) = a+snd3 (a,b,c) = b+thd3 (a,b,c) = c++on f g x y = f (g x) (g y)++swap (a,b) = (b,a)+++fix :: Eq a => (a -> a) -> a -> a+fix f x = if x == x2 then x else fix f x2+    where x2 = f x++++-- | If anyone of them returns Nothing, the whole thing does+mapMaybeAll :: (a -> Maybe b) -> [a] -> Maybe [b]+mapMaybeAll f xs = g [] xs+    where+        g acc [] = Just (reverse acc)+        g acc (x:xs) = case f x of+                           Just a -> g (a:acc) xs+                           Nothing -> Nothing+++concatMapMaybeAll :: (a -> Maybe [b]) -> [a] -> Maybe [b]+concatMapMaybeAll f xs = case mapMaybeAll f xs of+                             Just a -> Just $ concat a+                             Nothing -> Nothing+++idMaybeAll = mapMaybeAll id+concatIdMaybeAll = concatMapMaybeAll id++++-- | pick all subsets (maintaining order) with a length of n+--   n must be greater or equal to the length of the list passed in+selection :: Int -> [a] -> [[a]]+selection n xs = remove (len-n) len [] xs+    where+        len = length xs+        +        remove lrem lxs done todo =+                if lrem == lxs then [reverse done]+                else if null todo then []+                else remove lrem (lxs-1) (t:done) odo ++ remove (lrem-1) (lxs-1) done odo+            where (t:odo) = todo++++-- | all permutations of a list+permute :: [a] -> [[a]]+permute [] = [[]]+permute (x:xs) = concat $ map (\a -> zipWith f (inits a) (tails a)) (permute xs)+    where+        f a b = a ++ [x] ++ b++++catLefts :: [Either a b] -> [a]+catLefts (Left x:xs) = x : catLefts xs+catLefts (_:xs) = catLefts xs+catLefts [] = []+++fromLeft (Left x) = x+fromRight (Right x) = x+++iff :: Bool -> a -> Maybe a+iff b a = if b then Just a else Nothing+++setEq :: Eq a => [a] -> [a] -> Bool+setEq xs ys = all (`elem` ys) xs && all (`elem` xs) ys+++elemEnum :: Enum a => a -> [a] -> Bool+elemEnum x ys = fromEnum x `elem` map fromEnum ys++++data FileType = File | Directory | NotFound+                deriving (Eq,Show)++fileType :: FilePath -> IO FileType+fileType x = do+    b <- doesFileExist x+    if b then return File else do+        b <- doesDirectoryExist x+        return $ if b then Directory else NotFound++++sortOn f = sortBy (compare `on` f)+groupOn f = groupBy ((==) `on` f)+++sortFst mr = sortOn fst mr+groupFst mr = groupOn fst mr+++groupFsts :: Eq k => [(k,v)] -> [(k,[v])]+groupFsts = map (fst . head &&& map snd) . groupFst++sortGroupFsts mr = groupFsts . sortFst $ mr+sortGroupFst mr = groupFst . sortFst $ mr++++nubIntOn :: (v -> Int) -> [v] -> [v]+nubIntOn f = g IntSet.empty+    where+        g m [] = []+        g m (x:xs) | IntSet.member i m = g m xs+                   | otherwise = x : g (IntSet.insert i m) xs+            where i = f x+++fold :: a -> (a -> a -> a) -> [a] -> a+fold x f [] = x+fold x f xs = fold1 f xs+++fold1 :: (a -> a -> a) -> [a] -> a+fold1 f [x] = x+fold1 f xs = f (fold1 f a) (fold1 f b)+    where (a,b) = halves xs+++halves :: [a] -> ([a],[a])+halves [] = ([], [])+halves (x:xs) = (x:b,a)+    where (a,b) = halves xs+++merge :: Ord a => [a] -> [a] -> [a]+merge xs [] = xs+merge [] ys = ys+merge (x:xs) (y:ys)+    | x <= y = x : merge xs (y:ys)+    | otherwise = y : merge (x:xs) ys+++mergeBy :: (a -> a -> Ordering) -> [a] -> [a] -> [a]+mergeBy f xs [] = xs+mergeBy f [] ys = ys+mergeBy f (x:xs) (y:ys)+    | f x y /= GT = x : mergeBy f xs (y:ys)+    | otherwise = y : mergeBy f (x:xs) ys+++merges :: Ord a => [[a]] -> [a]+merges = fold [] merge++mergesBy :: (a -> a -> Ordering) -> [[a]] -> [a]+mergesBy f = fold [] (mergeBy f)+++concatMapM f = liftM concat . mapM f+++unzipEithers :: [Either a b] -> ([a],[b])+unzipEithers [] = ([],[])+unzipEithers (Left x:xs) = (x:a,b)+    where (a,b) = unzipEithers xs+unzipEithers (Right x:xs) = (a,x:b)+    where (a,b) = unzipEithers xs+++dropEnd :: (a -> Bool) -> [a] -> [a]+dropEnd f = reverse . dropWhile f . reverse++dropEnds :: (a -> Bool) -> [a] -> [a]+dropEnds f = dropWhile f . dropEnd f+++initLast :: [a] -> ([a], a)+initLast [] = error "initLast, empty list []"+initLast [x] = ([], x)+initLast (x:xs) = (x:a, b)+    where (a,b) = initLast xs+++(!!+) :: [a] -> (Int,a) -> [a]+(!!+) (x:xs) (0,a) = a:xs+(!!+) (x:xs) (n,a) = x : (!!+) xs (n-1,a)+++disjoint :: Eq a => [a] -> Bool+disjoint xs = xs == nub xs+++-- useful command line auxiliary+exitMessage :: [String] -> IO a+exitMessage msg = putStr (unlines msg) >> exitFailure+++lower = map toLower+upper = map toUpper+++split :: Eq a => a -> [a] -> [[a]]+split x [] = []+split x xs = if null b then [a] else a : split x (tail b)+    where (a,b) = break (== x) xs+++traceM :: Monad m => String -> m ()+traceM msg = trace msg $ return ()+++traceShow :: Show s => s -> a -> a+traceShow x = trace (show x)+++fromListMany :: Ord k => [(k,v)] -> Map.Map k [v]+fromListMany = Map.fromAscList . groupFsts . sortFst+++consNub :: Eq a => a -> [a] -> [a]+consNub x xs = [x | x `notElem` xs] ++ xs+++showLines :: Show a => [a] -> String+showLines = unlines . map show+++traceInline :: String -> a -> a+traceInline msg x = unsafePerformIO $ do+    putStr msg+    return x+++errorLines :: [String] -> b+errorLines [] = error "errorLines, finished"+errorLines (x:xs) = trace x $ errorLines xs
+ src/Hoogle/All.hs view
@@ -0,0 +1,13 @@++module Hoogle.All(+    Query(..), parseQuery, renderQuery, suggestQuery, usefulQuery,+    Flag(..),+    DataBase, loadDataBase, showDataBase,+    convert, rank,+    searchAll, searchRange, Result(..)+    ) where++import Hoogle.Query.All+import Hoogle.DataBase.All+import Hoogle.Search.All+import Hoogle.Operations.All
+ src/Hoogle/DataBase/Aliases.hs view
@@ -0,0 +1,79 @@++module Hoogle.DataBase.Aliases(+    Aliases, createAliases, normAliases+    ) where++import Hoogle.TextBase.All+import Hoogle.TypeSig.All+import qualified Data.Binary.Defer.Map as Map+import Data.Binary.Defer+import Data.Generics.Uniplate+import General.Code+++newtype Aliases = Aliases (Map.Map String Alias)++instance BinaryDefer Aliases where+    put (Aliases a) = put a+    get = get1 Aliases++instance Show Aliases where+    show (Aliases mp) = unlines [ unwords $ "type" : s : vs ++ ["=", show t]+                                | (s,Alias vs t) <- Map.toList mp]+++data Alias = Alias+    {args :: [String] -- the free variables+    ,rhs :: Type -- the resulting type+    }++instance BinaryDefer Alias where+    put (Alias a b) = put2 a b+    get = get2 Alias+++createAliases :: [TextItem] -> Aliases+createAliases ti = Aliases $ transitiveClosure $ Map.fromList+    [ (name, Alias [v | TVar v <- args] rhs)+    | ItemAlias (TypeSig _ lhs) (TypeSig _ rhs) <- ti+    , let (TLit name, args) = fromTApp lhs]+++-- Must be careful with aliases which expand back to themselves+-- i.e. template-haskell has "type Doc = PprM Doc"+-- probably the result of unqualifying names+transitiveClosure :: Map.Map String Alias -> Map.Map String Alias+transitiveClosure mp = Map.mapWithKey (\k x -> x{rhs = f [k] $ rhs x}) mp+    where+        f :: [String] -> Type -> Type+        f seen t = case [(name,x) | (name,x) <- followAliases (Aliases mp) t, name `notElem` seen] of+                        [] -> t+                        (name,x):_ -> f (name:seen) x+++-- perform a 1-step alias following+followAliases :: Aliases -> Type -> [(String,Type)]+followAliases as t =+    [ (s, gen x2)+    | (x, gen) <- contexts t+    , Just (s,x2) <- [followAlias as x]]+++followAlias :: Aliases -> Type -> Maybe (String, Type)+followAlias (Aliases mp) (TApp (TLit x) xs)+    | isJust m && length xs == length vs = Just (x, transform f rhs)+    where m@ ~(Just (Alias vs rhs)) = Map.lookup x mp+          rep = zip vs xs+          f (TVar v) = lookupJustDef (TVar v) v rep+          f x = x+followAlias as (TLit x) = followAlias as (TApp (TLit x) [])+followAlias _ _ = Nothing+++normAliases :: Aliases -> Type -> ([String], Type)+normAliases as t = (sort . nub *** id) $ f t+    where+        f t = case followAlias as t of+                  Just (s,t) -> ([s],t)+                  Nothing -> (concat *** gen) $ unzip $ map f cs+            where (cs, gen) = uniplate t
+ src/Hoogle/DataBase/All.hs view
@@ -0,0 +1,38 @@++module Hoogle.DataBase.All+    (DataBase, showDataBase+    ,TextScore, TypeScore+    ,module Hoogle.DataBase.All+    ,module Hoogle.DataBase.Serialise+    ) where++import Data.Binary.Defer.Index+import Hoogle.TextBase.All+import Hoogle.TypeSig.All+import Hoogle.DataBase.Type+import Hoogle.Item.All+import Hoogle.DataBase.Serialise+++createDataBase :: TextBase -> DataBase+createDataBase xs = DataBase items+        (createNameSearch ys) (createTypeSearch aliases instances ys)+        (createSuggest ys) aliases instances+    where+        (items,ys) = createItems xs+        zs = map fst ys+        aliases = createAliases zs+        instances = createInstances zs+++searchName :: DataBase -> String -> [(Link Entry,EntryView,TextScore)]+searchName db = searchNameSearch (nameSearch db)+++searchType :: DataBase -> TypeSig -> [(Link Entry,[EntryView],TypeScore)]+-- although aliases and instances are given, they are usually not used+searchType db = searchTypeSearch (aliases db) (instances db) (typeSearch db)+++suggestion :: [DataBase] -> TypeSig -> Maybe (Either String TypeSig)+suggestion db = askSuggest (map suggest db)
+ src/Hoogle/DataBase/Instances.hs view
@@ -0,0 +1,48 @@++module Hoogle.DataBase.Instances(+    Instances, createInstances,+    normInstances, hasInstance+    ) where++import General.Code+import Hoogle.TextBase.All+import Hoogle.TypeSig.All+import Data.Binary.Defer+import qualified Data.Binary.Defer.Map as Map+import Data.Generics.Uniplate+++-- Map type [classes]+newtype Instances = Instances (Map.Map String [String])++instance Show Instances where+    show (Instances mp) = unlines $ map f $ Map.toList mp+        where f (v,cs) = "instance " ++ v ++ " <= " ++ unwords cs+++instance BinaryDefer Instances where+    put (Instances x) = put1 x+    get = get1 Instances+++createInstances :: [TextItem] -> Instances+createInstances xs = Instances $ foldl f Map.empty ys+    where+        ys = [(v, c) | ItemInstance (TypeSig [] (TApp (TLit c) vs)) <- xs, TLit v <- vs]+        f mp (v,c) = Map.insertWith (++) v [c] mp+++-- Convert:+--    MPTC a b |-> MPTC a, MPTC b+--    C (M a) |-> C a+-- Do not load Instances ever+normInstances :: Instances -> TypeSig -> TypeSimp+normInstances _ (TypeSig a b) = TypeSimp con b+    where+        con = sort $ nub [(c,v) | TApp (TLit c) xs <- a, x <- xs, v <- variables x, v `elem` vs]+        vs = variables b+++-- hasInstance _ C M, does C M exist+hasInstance :: Instances -> String -> String -> Bool+hasInstance (Instances mp) c m = c `elem` Map.findWithDefault [] m mp
+ src/Hoogle/DataBase/Items.hs view
@@ -0,0 +1,91 @@++module Hoogle.DataBase.Items where++import Control.Monad.State+import Data.Binary.Defer.Index+import General.Code+import Hoogle.TextBase.All+import Hoogle.TypeSig.All+import Hoogle.Item.All+import Data.Binary.Defer hiding (get,put)+import qualified Data.Binary.Defer as D++-- Invariant: Index Entry is by order of EntryScore++data Items = Items+    {packages :: Index Package+    ,modules :: Index Module+    ,entries :: Index Entry+    }++instance BinaryDefer Items where+    put (Items a b c) = put3 a b c+    get = do+        res@(Items a b c) <- get3 Items+        getDeferPut a+        getDeferPut b+        getDeferPut c+        return res+++instance Show Items where+    show (Items a b c) = f "Packages" a ++ "\n" ++ f "Modules" b ++ "\n" ++ f "Entries" c+        where f header x = "== " ++ header ++ " ==\n\n" ++ show x+++-- temporary state structure+data S = S {pkg :: Package+           ,modId :: Int+           ,mods :: [Module]+           ,modCur :: Maybe (Link Module)+           ,entId :: Int+           ,ents :: [(TextItem, Maybe Entry)]+           }++createItems :: [(TextItem,String)] -> (Items, [(TextItem, Maybe (Link Entry))])+createItems xs = res+    where+        res = unS $ execState (mapM (uncurry f) xs) s0+        s0 = S (Package "" "" "" "") 0 [] Nothing 0 []++        unS s = (Items (newIndex [pkg s])+                       ms+                       (newIndex $ mapMaybe (liftM fromLink . snd) esJ2)+                ,map (id *** const Nothing) esN ++ esJ2)+            where+                ms = newIndex $ reverse $ mods s+                (esJ,esN) = partition (isJust . snd) $ ents s+                esJ2 = zipWith (\i (ti,Just e) -> (ti,Just $ newLink i e)) [0..] $+                       sortOn (entryScore . fromJust . snd) esJ++        f :: TextItem -> String -> State S ()+        f i@ItemInstance{} _ = addTextItem i++        f i@(ItemAttribute "keyword" name) d = addEntry i False EntryKeyword d+                [Keyword "keyword",Text " ",Focus name]++        f i@(ItemAttribute name val) _ = do+            addTextItem i+            when (name == "package") $ modify $ \s -> s{pkg = (pkg s){packageName = val}}+            when (name == "version") $ modify $ \s -> s{pkg = (pkg s){packageVersion = val}}++        f i@(ItemModule xs) d = do+            s <- get+            let modI = modId s+                m = Module xs (newLink 0 $ lookupIndex (newLookup 0) (packages $ fst res))+            put s{modId = modI + 1, mods = m : mods s+                 ,modCur = Just $ newLink modI m}+            addEntry i True EntryModule d+                [Keyword "module", Text $ ' ' : concatMap (++ ".") (init xs), Focus (last xs)]++        f i d = addEntry i True EntryOther d (renderTextItem i)++        addTextItem i = modify $ \s -> s{ents = (i,Nothing) : ents s}++        addEntry i modu typ doc txt = do+            s <- get+            let entI = entId s+                e = Entry (if modu then modCur s else Nothing)+                          (headDef "" [i | Focus i <- txt])+                          txt typ (newHaddock doc)+            put $ s{entId = entI + 1, ents = (i, Just e) : ents s}
+ src/Hoogle/DataBase/NameSearch.hs view
@@ -0,0 +1,135 @@++module Hoogle.DataBase.NameSearch+    (NameSearch, createNameSearch+    ,TextScore, searchNameSearch+    ) where++import Data.Binary.Defer+import Data.Binary.Defer.Trie+import Data.Binary.Defer.Chunk+import Data.Binary.Defer.Index+import Data.Char+import Data.List+import Data.Range+import General.Code+import Hoogle.Item.All+import Hoogle.TextBase.All+++---------------------------------------------------------------------+-- DATA TYPES++data NameSearch = NameSearch (Trie NameItem) (Chunk (Int,Link Entry))+                  deriving Show++data NameItem = NameItem {nameStart :: Int+                         ,nameCountAll :: Int -- number that match exactly+                         ,nameCountAny :: Int -- number that match a prefix+                         }++instance Show NameItem where+    show (NameItem a b c) = unwords $ map show [a,b,c]+++instance BinaryDefer NameSearch where+    put (NameSearch a b) = put2 a b+    get = get2 NameSearch++instance BinaryDefer NameItem where+    put (NameItem a b c) = put3 a b c+    get = get3 NameItem++{-+TRIE data structure++Given the functions "map" and "pm" we would generate:++Trie:+"ap"   (0,1,1)+"m"    (1,1,2)+"ma"   (2,0,1)  +"map"  (2,1,1)+"p"    (3,1,2)+"pm"   (4,1,1)++Chunk:+0 "ap"   (1,[map])+1 "m"    (1,[pm])+2 "map"  (0,[map])+3 "p"    (2,[map])+4 "pm"   (0,[pm])++There will be one trie entry per unique substring.+There will be one chunk entry per suffix.+Both are sorted by the string they represent.++[item] is the id of the item.+-}++---------------------------------------------------------------------+-- CREATION++createNameSearch :: [(a, Maybe (Link Entry))] -> NameSearch+createNameSearch xs = NameSearch+        (newTrie $ f sub (zip [0..] pre))+        (newChunk $ map snd pre)+    where+        ys = extractText xs+        sub = map head $ group $ sort $ concatMap (substrs . fst) ys+        pre = sortBy (compare `on` fst)+                  [(p,(i,e)) | (s,e) <- ys, (i,p) <- zip [0..] $ prefixes s]++        f :: [String] -> [(Int,(String,a))] -> [(String,NameItem)]+        f [] _ = []+        f (x:xs) ys = (x,NameItem s neq (neq+npr)) : f xs ys2+            where+                s = fst $ head ys+                (neq,npr) = (length eq, length pr)+                (eq,ys2) = span ((==) x . fst . snd) ys+                pr = takeWhile (isPrefixOf x . fst . snd) ys2+++extractText :: [(a, Maybe (Link Entry))] -> [(String, Link Entry)]+extractText xs = [(map toLower s, e) |(_, Just e) <- xs, Focus s <- entryText $ fromLink e]+++substrs, prefixes :: [a] -> [[a]]+substrs = concatMap (tail . inits) . prefixes+prefixes = init . tails+++---------------------------------------------------------------------+-- SEARCHING++-- lower is better+data TextScore = TSExact | TSStart | TSNone+                 deriving (Eq,Ord)++instance Show TextScore where+    show TSExact = "exact"+    show TSStart = "start"+    show TSNone = "_"+++searchNameSearch :: NameSearch -> String -> [(Link Entry,EntryView,TextScore)]+searchNameSearch (NameSearch trie chunk) str =+    case lookupTrie (map toLower str) trie of+        Nothing -> []+        Just i -> nubIntOn (linkKey . fst3) $ order exact0E ++ order (exact0S ++ start) ++ order none+            where+                (exact0,exactN) = partition ((==) 0 . fst) exact+                (partial0,partialN) = partition ((==) 0 . fst) partial+                (exact,partial) = splitAt (nameCountAll i) $+                    lookupChunk (rangeStartCount (nameStart i) (nameCountAny i)) chunk++                none = map (f $ const TSNone) $ exactN ++ partialN+                (exact0E,exact0S) = partition ((==) TSExact . thd3) $ map (f test) exact0+                start = map (f $ const TSStart) partial0+                test e = if entryName e == str then TSExact else TSStart+    where+        nstr = length str+        order = sortOn (linkKey . fst3)++        f :: (Entry -> TextScore) -> (Int, Link Entry) -> (Link Entry,EntryView,TextScore)+        f score (p,e) = (e, FocusOn (rangeStartCount p nstr), score $ fromLink e)+
+ src/Hoogle/DataBase/Serialise.hs view
@@ -0,0 +1,43 @@++module Hoogle.DataBase.Serialise(+    saveDataBase, loadDataBase+    ) where++import Data.Binary.Defer+import Data.Binary.Raw+import General.Code++import Hoogle.DataBase.Type+++hooVersion = 1 :: Int+hooString = "HOOG"+++saveDataBase :: FilePath -> DataBase -> IO ()+saveDataBase file db = do+    h <- openBinaryFile file WriteMode+    mapM_ (hPutChar h) hooString+    hPutInt h hooVersion+    runDeferPut h $ put db+    hClose h+++loadDataBase :: FilePath -> IO DataBase+loadDataBase file = do+    h <- openBinaryFile file ReadMode+    size <- hFileSize h++    when (size < 8) $+        error $ "Not a hoogle database: " ++ file++    str <- replicateM 4 (hGetChar h)+    when (str /= hooString) $+        error $ "Not a hoogle database: " ++ file++    ver <- hGetInt h+    when (ver /= hooVersion) $+        error $ "Wrong hoogle database version: " ++ show ver +++                " found, expected " ++ show hooVersion++    runDeferGet h get
+ src/Hoogle/DataBase/Suggest.hs view
@@ -0,0 +1,133 @@++-- TODO: Suggestions from imported packages should be detailed++module Hoogle.DataBase.Suggest where++import General.Code+import Data.Binary.Defer+import Data.Binary.Defer.Trie+import Data.Binary.Defer.Index+import qualified Data.Map as Map+import Hoogle.TextBase.All+import Hoogle.TypeSig.All+import Hoogle.Item.All+import Data.Generics.Uniplate+++newtype Suggest = Suggest {fromSuggest :: Trie SuggestItem}++-- if something is both a data and a ctor, no need to mention the ctor+data SuggestItem = SuggestItem+    {suggestCtor :: Maybe String -- constructor (and who the type is)+    ,suggestData :: [(String,Int)] -- data type, name (case correct), and possible kinds+    ,suggestClass :: [(String,Int)] -- class, name (case correct), kinds+    }+++instance Show Suggest where+    show (Suggest x) = show x++instance Show SuggestItem where+    show (SuggestItem a b c) = concat $ intersperse ", " $+        ["ctor " ++ x | Just x <- [a]] ++ f "data" b ++ f "class" c+        where+            f msg xs = [msg ++ " " ++ a ++ " " ++ show b | (a,b) <- xs]+++instance BinaryDefer Suggest where+    put (Suggest x) = put x+    get = get1 Suggest++instance BinaryDefer SuggestItem where+    put (SuggestItem a b c) = put3 a b c+    get = get3 SuggestItem+++-- note: do not look inside class's for data type information+--       as they may have higher-kinds and get it wrong+createSuggest :: [(TextItem, a)] -> Suggest+createSuggest xs = Suggest $ newTrie $ Map.toList res+    where+        res = foldl f Map.empty $ concatMap (getTextItem . fst) xs+            where f m (s,i) = Map.insertWith joinItem (map toLower s) i m++        sData  c n = (c, SuggestItem Nothing [(c,n)] [])+        sClass c n = (c, SuggestItem Nothing [] [(c,n)])++        getTextItem :: TextItem -> [(String,SuggestItem)]+        getTextItem (ItemClass x   ) = getTypeSig True x+        getTextItem (ItemFunc n x  ) = getTypeSig False x ++ getCtor n x+        getTextItem (ItemAlias x y ) = getTypeSig False x ++ getTypeSig False y+        getTextItem (ItemData _ x  ) = getTypeSig False x+        getTextItem (ItemInstance x) = getTypeSig True x+        getTextItem _ = []++        getTypeSig cls (TypeSig x y) = concatMap (getType True) x ++ getType cls y++        getType cls (TApp (TLit c) ys) = add cls c (length ys) +++                                         if cls then [] else concatMap (getType False) ys+        getType cls (TLit c) = add cls c 0+        getType cls x = if cls then [] else concatMap (getType False) $ children x++        add cls c i = [(if cls then sClass else sData) c i | not (isTLitTuple c)]++        getCtor name (TypeSig _ x) =+            [ (name, SuggestItem (Just c) [] [])+            | n:_ <- [name], isUpper n+            , (TLit c,_) <- [fromTApp $ last $ fromTFun x]]+++joinItem :: SuggestItem -> SuggestItem -> SuggestItem+joinItem (SuggestItem a1 b1 c1) (SuggestItem a2 b2 c2) =+    SuggestItem+        (if null b1 && null b2 then a1 `mplus` a2 else Nothing)+        (nub $ b1++b2) (nub $ c1++c2)+++askSuggest :: [Suggest] -> TypeSig -> Maybe (Either String TypeSig)+askSuggest sug q@(TypeSig con typ)+        | typ2 /= typ = Just (Right $ TypeSig con typ2)+        | not $ null datas = unknown "type" datas+        | not $ null classes = unknown "class" classes+        | otherwise = Nothing+    where+        tries = map fromSuggest sug+        get x = case catMaybes $ map (lookupTrie $ map toLower x) tries of+                    [] -> Nothing+                    xs -> Just $ foldr1 joinItem xs++        -- figure out if you have a totally unknown thing --+        classes = [x | c <- con, (TLit x,_) <- [fromTApp c], bad True x]+        datas = [x | TLit x <- concatMap universe $ typ : concatMap (snd . fromTApp) con+                   , not $ isTLitTuple x, bad False x]+        unknown typ (x:_) = Just $ Left $ "Warning: Unknown " ++ typ ++ " " ++ x++        bad cls name = case get name of+            Nothing -> True+            Just i | cls -> null $ suggestClass i+                   | otherwise -> null (suggestData i) && isNothing (suggestCtor i)++        -- try and improve the type --+        typ2 = removeTApp $ transform f $ insertTApp typ+            where+                free = map (TVar . (:[])) $ ['a'..] \\ [x | TVar [x] <- universe typ]++                f (TVar x) | length x > 1 = g (TVar x) x+                f (TLit x) = g (TLit x) x+                f (TApp (TLit x) xs) | isJust m && not (null kinds) && n `notElem` kinds =+                        TApp (TLit x) $ if maximum kinds > n+                        then xs ++ take (minimum (filter (> n) kinds) - n) free+                        else take (maximum kinds) xs+                    where+                        m@ ~(Just SuggestItem{suggestData=d}) = get x+                        kinds = [b | (a,b) <- d, a == x]+                        n = length xs+                f x = x+++                g def x | isJust m && x `notElem` (map fst d) &&+                          (not (null d) || isJust c)+                        = if isJust c then TLit $ fromJust c+                          else TLit $ fst $ head $ d+                    where m@ ~(Just SuggestItem{suggestData=d, suggestCtor=c}) = get x+                g def x = def
+ src/Hoogle/DataBase/Type.hs view
@@ -0,0 +1,57 @@++module Hoogle.DataBase.Type+    (module Hoogle.DataBase.Type+    ,module Hoogle.DataBase.Items+    ,module Hoogle.DataBase.Suggest+    ,module Hoogle.DataBase.Aliases+    ,module Hoogle.DataBase.Instances+    ,module Hoogle.DataBase.TypeSearch.All+    ,module Hoogle.DataBase.NameSearch+    ) where++import Hoogle.DataBase.Items+import Hoogle.DataBase.Suggest+import Hoogle.DataBase.Aliases+import Hoogle.DataBase.Instances+import Hoogle.DataBase.TypeSearch.All+import Hoogle.DataBase.NameSearch+import Data.Binary.Defer+import General.Code+++data DataBase = DataBase+    {items :: Items+    ,nameSearch :: NameSearch+    ,typeSearch :: TypeSearch+    ,suggest :: Suggest+    -- aliases and instances are stored+    -- but only used for linking with packages that depend+    -- on this database+    ,aliases :: Aliases+    ,instances :: Instances+    }+++instance BinaryDefer DataBase where+    put (DataBase a b c d e f) = put6 a b c d e f+    get = get6 DataBase+++instance Show DataBase where+    show = concatMap snd . showDataBaseParts+++showDataBaseParts :: DataBase -> [(String,String)]+showDataBaseParts (DataBase a b c d e f) =+    let name * val = (name, "= " ++ name ++ " =\n\n" ++ show val ++ "\n") in+    ["Items" * a,"NameSearch" * b, "TypeSearch" * c+    ,"Suggest" * d, "Aliases" * e, "Instances" * f]+++showDataBase :: String -> DataBase -> String+showDataBase "" d = show d+showDataBase x d | null r = "Error: Unknown database part, " ++ x+                 | length r > 1 = "Error: Ambiguous database part, " ++ x+                 | otherwise = head r+    where r = [b | (a,b) <- showDataBaseParts d, lower x `isPrefixOf` lower a]+
+ src/Hoogle/DataBase/TypeSearch/All.hs view
@@ -0,0 +1,44 @@++-- TODO: Aliases and Instances from imported packages should be+-- used when searching.++module Hoogle.DataBase.TypeSearch.All(+    createTypeSearch, TypeSearch,+    searchTypeSearch, TypeScore+    ) where++import Hoogle.DataBase.TypeSearch.Graphs+import Hoogle.DataBase.TypeSearch.TypeScore+import Hoogle.DataBase.Instances+import Hoogle.DataBase.Aliases+import Data.Binary.Defer+import Data.Binary.Defer.Index+import Hoogle.TextBase.All+import Hoogle.TypeSig.All+import Hoogle.Item.All+++newtype TypeSearch = TypeSearch Graphs++instance Show TypeSearch where+    show (TypeSearch x) = show x++instance BinaryDefer TypeSearch where+    put (TypeSearch x) = put x+    get = get1 TypeSearch+++---------------------------------------------------------------------+-- CREATION++createTypeSearch :: Aliases -> Instances -> [(TextItem, Maybe (Link Entry))] -> TypeSearch+createTypeSearch aliases instances xs = TypeSearch $ newGraphs aliases instances types+    where types = [(e, sig) | (ItemFunc _ sig, Just e) <- xs]+++---------------------------------------------------------------------+-- SEARCHING++searchTypeSearch :: Aliases -> Instances -> TypeSearch -> TypeSig -> [(Link Entry,[EntryView],TypeScore)]+searchTypeSearch as is (TypeSearch g) t =+    [(a, b, c) | (a,b,c) <- graphsSearch as is g t]
+ src/Hoogle/DataBase/TypeSearch/Binding.hs view
@@ -0,0 +1,120 @@+{-|+    Deal with variable bindings/alpha renaming in searches+    And with restrictions+-}++module Hoogle.DataBase.TypeSearch.Binding(+    Binding, newBinding, newBindingUnbox, newBindingRebox,+    addBinding, costBinding, costsBinding, mergeBindings, bindings+    ) where++import Hoogle.TypeSig.All+import General.Code+import Hoogle.DataBase.TypeSearch.Cost+import qualified Data.Map as Map+import qualified Data.Set as Set+++type Var = String+type Lit = String+++type Bind = Map.Map Var (Maybe Lit, Set.Set Var)++data Binding = Binding !Int [Box] Bind Bind++data Box = Unbox | Rebox+           deriving (Show,Eq)+++instance Show Binding where+    show b@(Binding _ box _ _) = unwords $ map (map toLower . show) box ++ map f (bindings b)+        where f (a,b) = show a ++ "=" ++ show b+++instance Eq Binding where+    (==) = (==) `on` costBinding++instance Ord Binding where+    compare = compare `on` costBinding+++costBinding :: Binding -> Int+costBinding (Binding x _ _ _) = x+++newBinding, newBindingUnbox, newBindingRebox :: Binding+newBinding      = Binding 0                []      Map.empty Map.empty+newBindingUnbox = Binding (cost CostUnbox) [Unbox] Map.empty Map.empty+newBindingRebox = Binding (cost CostRebox) [Rebox] Map.empty Map.empty++++costIf b v = if b then cost v else 0+++addBinding :: (Type, Type) -> Binding -> Maybe Binding+addBinding (TVar a, TVar b) (Binding c box x y) = Just $ Binding c2 box x2 y2+    where (x2,cx) = addVar a b x+          (y2,cy) = addVar b a y+          c2 = c + costIf cx CostDupVarQuery + costIf cy CostDupVarResult++addBinding (TVar a, TLit b) (Binding c box x y) = do+    (x2,cx) <- addLit a b x+    return $ Binding (c + costIf cx CostRestrict) box x2 y+addBinding (TLit a, TVar b) (Binding c box x y) = do+    (y2,cy) <- addLit b a y+    return $ Binding (c + costIf cy CostUnrestrict) box x y2++addBinding (TLit a, TLit b) bind = if a == b then Just bind else Nothing+++addVar :: Var -> Var -> Bind -> (Bind, Bool)+addVar a b mp = case Map.lookup a mp of+    Nothing -> (Map.insert a (Nothing, Set.singleton b) mp, False)+    Just (l, vs) | b `Set.member` vs -> (mp, False)+                 | otherwise -> (Map.insert a (l, Set.insert b vs) mp, True)+++addLit :: Var -> Lit -> Bind -> Maybe (Bind, Bool)+addLit a b mp | l == Just b = Just (mp, False)+              | isJust l = Nothing+              | otherwise = Just (Map.insert a (Just b, vs) mp, True)+    where (l, vs) = Map.findWithDefault (Nothing, Set.empty) a mp++++mergeBindings :: [Binding] -> Maybe Binding+mergeBindings bs = do+    let (box,ls,rs) = unzip3 [(b,l,r) | Binding _ b l r <- bs]+        (bl,br) = (Map.unionsWith f ls, Map.unionsWith f rs)+        res i = Binding i (concat box) bl br+    s <- costsBindingLocal (res 0)+    return $ res (score s)+    where+        f (l1,vs1) (l2,vs2)+            | l1 /= l2 && isJust l1 && isJust l2 = (Just "", vs1)+            | otherwise = (l1 `mplus` l2, Set.union vs1 vs2)+++costsBindingLocal :: Binding -> Maybe [Cost]+costsBindingLocal (Binding _ box l r) = do+    let cb = [if b == Unbox then CostUnbox else CostRebox | b <- box]+    cl <- f CostDupVarQuery  CostRestrict   l+    cr <- f CostDupVarResult CostUnrestrict r+    return $ cb++cl++cr+    where+        f var restrict = concatMapM g . Map.elems+            where+                g (Just "", _) = Nothing+                g (l, vs) = Just $ [restrict|isJust l] ++ var *+ (max 0 $ Set.size vs - 1)+++costsBinding :: Binding -> [Cost]+costsBinding = fromJust . costsBindingLocal+++bindings :: Binding -> [(Type, Type)]+bindings (Binding _ _ a b) =+    [(TVar v, t) | (v,(l,vs)) <- Map.toList a, t <- [TLit l | Just l <- [l]] ++ map TVar (Set.toList vs)] +++    [(TVar v, TLit l) | (v,(Just l,_)) <- Map.toList b]
+ src/Hoogle/DataBase/TypeSearch/Cost.hs view
@@ -0,0 +1,42 @@++module Hoogle.DataBase.TypeSearch.Cost(+    Cost(..), cost, score, (*+)+    ) where+++infixl 7  *+ -- same as *++(*+) :: Cost -> Int -> [Cost]+(*+) = flip replicate+++data Cost = CostAliasFwd+          | CostAliasBwd+          | CostUnbox+          | CostRebox+          | CostRestrict+          | CostUnrestrict+          | CostDupVarResult+          | CostDupVarQuery+          | CostInstanceDel+          | CostInstanceAdd+          | CostDeadArg+            deriving (Show,Eq,Ord,Enum,Bounded)+++score :: [Cost] -> Int+score = sum . map cost+++cost :: Cost -> Int+cost CostAliasFwd     =    1  -- 1..1000+cost CostAliasBwd     =    1  -- 1..997+cost CostUnbox        =    5  -- 5..1000+cost CostRebox        =    4  -- 4..999+cost CostRestrict     =    5  -- 5..1000+cost CostUnrestrict   =    4  -- 4..1000+cost CostDupVarResult =    4  -- 4..999+cost CostDupVarQuery  =    5  -- 5..1000+cost CostInstanceDel  =    4  -- 4..999+cost CostInstanceAdd  =    4  -- 4..999+cost CostDeadArg      =    3  -- 3..998
+ src/Hoogle/DataBase/TypeSearch/EntryInfo.hs view
@@ -0,0 +1,30 @@++module Hoogle.DataBase.TypeSearch.EntryInfo where++import Data.Binary.Defer+import Data.Binary.Defer.Index+import Hoogle.TypeSig.All+import Hoogle.Item.All+import Data.Typeable+++-- the information about an entry, including the arity+data EntryInfo = EntryInfo+    {entryInfoEntries :: [Link Entry]+    ,entryInfoArity :: Int+    ,entryInfoContext :: TypeContext+    ,entryInfoAlias :: [String]+    } deriving (Eq,Show)++instance Ord EntryInfo where+    compare (EntryInfo [] x1 x2 x3) (EntryInfo [] y1 y2 y3) = compare (x1,x2,x3) (y1,y2,y3)+    compare _ _ = error "Ord EntryInfo, can't compare EntryInfo's with items in them"+++typename_EntryInfo = mkTyCon "Hoogle.DataBase.TypeSearch.Result.EntryInfo"+instance Typeable EntryInfo+    where typeOf _ = mkTyConApp typename_EntryInfo []++instance BinaryDefer EntryInfo where+    put (EntryInfo a b c d) = put4 a b c d+    get = get4 EntryInfo
+ src/Hoogle/DataBase/TypeSearch/Graph.hs view
@@ -0,0 +1,103 @@+{-|+    Search for a type signature and context through a graph.++    Return results in best-first order, taking account of which+    nodes and edges have already been paid for.+-}++module Hoogle.DataBase.TypeSearch.Graph(+    Graph, newGraph,+    graphSearch+    ) where++import Hoogle.DataBase.TypeSearch.TypeScore+import Hoogle.DataBase.TypeSearch.Binding+import Hoogle.DataBase.TypeSearch.Result+import Hoogle.DataBase.Aliases+import Hoogle.Item.All+import Hoogle.TypeSig.All+import Data.Generics.Uniplate+import Data.Binary.Defer+import Data.Binary.Defer.Index+import qualified Data.IntMap as IntMap+import qualified Data.Map as Map+import qualified Data.Heap as Heap+import General.Code+import Data.Key+import qualified Data.Binary.Defer.Graph as G+import Data.Binary.Defer.Graph hiding (Graph, Graph_)++++newtype Graph = Graph (Map.Map Type [Node])++-- the Type's are stored in reverse, to make box/unbox computations quicker+data Node = Node [Type] [(Link EntryInfo,ArgPos)]+++instance Show Graph where+    show (Graph mp) = unlines $ concatMap f $ Map.toList mp+        where f (t,ns) = show (transform g t) : map (("  "++) . show) ns+              g x = if x == TVar "" then TVar "_" else x++instance Show Node where+    show (Node t xs) = unwords $ map show t ++ "=" : [show (linkKey a) ++ "." ++ show b | (a,b) <- xs]+++instance BinaryDefer Graph where+    put (Graph a) = put1 a+    get = get1 Graph++instance BinaryDefer Node where+    put (Node a b) = put2 a b+    get = get2 Node+++---------------------------------------------------------------------+-- GRAPH CONSTRUCTION+++typeStructure :: Type -> Type+typeStructure = transform f+    where f x = if isTLit x || isTVar x then TVar "" else x++typeUnstructure :: Type -> [Type]+typeUnstructure = reverse . filter (\x -> isTLit x || isTVar x) . universe+++newGraph :: [(Link EntryInfo, ArgPos, Type)] -> Graph+newGraph = Graph . Map.map newNode . foldl' f Map.empty +    where f mp x = Map.insertWith (++) (typeStructure $ thd3 x) [x] mp+++newNode :: [(Link EntryInfo, ArgPos, Type)] -> [Node]+newNode = map (uncurry Node) . sortGroupFsts . map (\(a,b,c) -> (typeUnstructure c,(a,b)))+++++---------------------------------------------------------------------+-- GRAPH SEARCHING++-- must search for each (node,bindings) pair, rather than just nodes++graphSearch :: Graph -> Type -> [ResultArg]+graphSearch (Graph mp) t = [ResultArg e p b | (b,ep) <- sortFst xs, (e,p) <- ep]+    where+        xs = f newBinding s ++ f newBindingRebox (TApp (TVar "") [s]) +++             concat [f newBindingUnbox x | TApp (TVar "") [x] <- [s]]+        u = typeUnstructure t+        s = typeStructure t++        f bind x = mapMaybe (graphCheck bind u) $ Map.findWithDefault [] x mp+++graphCheck :: Binding -> [Type] -> Node -> Maybe (Binding, [(Link EntryInfo,ArgPos)])+graphCheck b xs (Node ys res) = do+    b <- f b (zip xs ys)+    return (b, res)+    where+        f b [] = Just b+        f b (x:xs) = do+            b <- addBinding x b+            f b xs
+ src/Hoogle/DataBase/TypeSearch/Graphs.hs view
@@ -0,0 +1,136 @@++module Hoogle.DataBase.TypeSearch.Graphs where++import Hoogle.DataBase.TypeSearch.Graph+import Hoogle.DataBase.TypeSearch.Binding+import Hoogle.DataBase.TypeSearch.Result+import Hoogle.DataBase.Instances+import Hoogle.DataBase.Aliases+import Hoogle.DataBase.TypeSearch.TypeScore+import Hoogle.Item.All+import Hoogle.TypeSig.All++import Data.Binary.Defer+import Data.Binary.Defer.Index+import qualified Data.IntMap as IntMap+import qualified Data.Heap as Heap+import General.Code+import Control.Monad.State+++-- for resGraph, the associated ArgPos is the arity of the function++data Graphs = Graphs+    {entryInfo :: Index EntryInfo+    ,argGraph :: Graph -- the arguments+    ,resGraph :: Graph -- the results+    }++instance Show Graphs where+    show (Graphs a b c) = "== Arguments ==\n\n" ++ show b +++                          "\n== Results ==\n\n" ++ show c++instance BinaryDefer Graphs where+    put (Graphs a b c) = put3 a b c+    get = do+        res@(Graphs a b c) <- get3 Graphs+        getDeferPut a+        return res+++---------------------------------------------------------------------+-- GRAPHS CONSTRUCTION++newGraphs :: Aliases -> Instances -> [(Link Entry, TypeSig)] -> Graphs+newGraphs as is xs = Graphs (newIndex $ map snd entries) argGraph resGraph+    where+        entries = [ (t2, e2{entryInfoEntries = sortOn linkKey $ map snd ys})+                  | ys@(((t2,e2),_):_) <- sortGroupFst $ map (\(e,t) -> (normType as is t, e)) xs]++        argGraph = newGraph (concat args)+        resGraph = newGraph res++        (args,res) = unzip+            [ initLast $ zipWith (\i t -> (lnk, i, t)) [0..] $ fromTFun t+            | (i, (t, e)) <- zip [0..] entries, let lnk = newLink i e]+++normType :: Aliases -> Instances -> TypeSig -> (Type, EntryInfo)+normType as is t = (t3, EntryInfo [] (length (fromTFun t3) - 1) c2 a)+    where TypeSimp c2 t2 = normInstances is t+          (a,t3) = normAliases as t2++---------------------------------------------------------------------+-- GRAPHS SEARCHING+++-- sorted by TypeScore+graphsSearch :: Aliases -> Instances -> Graphs -> TypeSig -> [ResultReal]+graphsSearch as is gs t = resultsCombine is query ans+    where+        ans = mergesBy (compare `on` resultArgBind . snd) $ +              f Nothing (resGraph gs) res :+              zipWith (\i -> f (Just i) (argGraph gs)) [0..] args++        f a g = map ((,) a) . graphSearch g+        (args,res) = initLast $ fromTFun ts+        (ts,query) = normType as is t+++data S = S+    {infos :: IntMap.IntMap (Maybe ResultAll) -- Int = Link EntryInfo+    ,pending :: Heap.Heap Int Result+    ,todo :: [(Maybe ArgPos, ResultArg)]+    ,instances :: Instances+    ,query :: EntryInfo+    }+++resultsCombine :: Instances -> EntryInfo -> [(Maybe ArgPos, ResultArg)] -> [ResultReal]+resultsCombine is query xs = flattenResults $ evalState delResult s0+    where s0 = S IntMap.empty Heap.empty xs is query+++-- Heap -> answer+delResult :: State S [Result]+delResult = do+    pending <- gets pending+    todo <- gets todo+    case todo of+        [] -> concatMapM f $ Heap.elems pending+        t:odo -> do+            let (res,hp) = Heap.popWhile (costBinding $ resultArgBind $ snd t) pending+            modify $ \s -> s{todo=odo, pending=hp}+            ans1 <- concatMapM f res+            uncurry addResult t+            ans2 <- delResult+            return $ ans1 ++ ans2+    where+        f r = do+            infos <- gets infos+            (Just res,infos) <- return $ IntMap.updateLookupWithKey+                (\_ _ -> Just Nothing) (linkKey $ fst3 r) infos+            if isNothing res then return [] else do+                modify $ \s -> s{infos=infos}+                return [r]+++-- todo -> heap/info+addResult :: Maybe ArgPos -> ResultArg -> State S ()+addResult arg val = do+    let entId = linkKey $ resultArgEntry val+    infs <- gets infos+    is <- gets instances+    query <- gets query+    let def = newResultAll query (resultArgEntry val)+    case IntMap.lookup entId infs of+        Just Nothing -> return ()+        Nothing | isNothing def -> modify $ \s -> s{infos = IntMap.insert entId Nothing $ infos s}+        x -> do+            let inf = fromJust $ fromMaybe def x+            (inf,res) <- return $ addResultAll is query (arg,val) inf+            res <- return $ map (costTypeScore . thd3 &&& id) res+            modify $ \s -> s+                {infos = IntMap.insert entId (Just inf) $ infos s+                ,pending = Heap.insertList res (pending s)+                }
+ src/Hoogle/DataBase/TypeSearch/Result.hs view
@@ -0,0 +1,87 @@++module Hoogle.DataBase.TypeSearch.Result(+    module Hoogle.DataBase.TypeSearch.Result,+    module Hoogle.DataBase.TypeSearch.EntryInfo+    ) where++import Hoogle.DataBase.TypeSearch.TypeScore+import Hoogle.DataBase.TypeSearch.Binding+import Hoogle.DataBase.TypeSearch.EntryInfo+import Hoogle.DataBase.Instances+import Data.Binary.Defer+import Data.Binary.Defer.Index+import Hoogle.TypeSig.All+import Hoogle.Item.All+import General.Code+import qualified Data.IntSet as IntSet+++type ArgPos = Int+++-- the return from searching a graph, nearly+type Result = (Link EntryInfo,[EntryView],TypeScore)++type ResultReal = (Link Entry, [EntryView], TypeScore)+++flattenResults :: [Result] -> [(Link Entry, [EntryView], TypeScore)]+flattenResults xs = [(a,b,c) | (as,b,c) <- xs, a <- entryInfoEntries $ fromLink as]+++-- the result information from a whole type (many ResultArg)+-- number of lacking args, entry data, info (result:args)+data ResultAll = ResultAll Int (Link EntryInfo) [[ResultArg]]+                 deriving Show+++-- the result information from one single type graph (argument/result)+-- this result points at entry.id, argument, with such a score+data ResultArg = ResultArg+    {resultArgEntry :: Link EntryInfo+    ,resultArgPos :: ArgPos+    ,resultArgBind :: Binding+    } deriving Show+++newResultAll :: EntryInfo -> Link EntryInfo -> Maybe ResultAll+newResultAll query e+    | bad < 0 || bad > 2 = Nothing+    | otherwise = Just $ ResultAll bad e $ replicate (arityResult + 1) []+    where+        arityQuery = entryInfoArity query+        arityResult = entryInfoArity $ fromLink e+        bad = arityResult - arityQuery+++addResultAll :: Instances -> EntryInfo -> (Maybe ArgPos, ResultArg) -> ResultAll -> (ResultAll, [Result])+addResultAll is query (pos,res) (ResultAll i e info) =+        (ResultAll i e info2+        ,mapMaybe (\(r:rs) -> newGraphsResults is query e rs r) path)+    where+        ind = maybe 0 (+1) pos+        info2 = zipWith (\i x -> [res|i==ind] ++ x) [0..] info++        -- path returns a path through the ResultArg's+        -- must skip badarg items+        -- must take one element from 0+        -- must use res from ind+        path :: [[ResultArg]]+        path = f i IntSet.empty $ zip [0..] info++        f bad set [] = [[] | bad == 0]+        f bad set ((i,x):xs)+            | i == ind = map (res:) $ f bad set xs+            | i == 0 = [r:rs | r <- x, rs <- f bad set xs]+            | otherwise =+                (if bad > 0 then f (bad-1) set xs else []) +++                [r:rs | r <- x, let rp = resultArgPos r, not $ rp `IntSet.member` set+                      , rs <- f bad (IntSet.insert rp set) xs]+++newGraphsResults :: Instances -> EntryInfo -> Link EntryInfo -> [ResultArg] -> ResultArg -> Maybe Result+newGraphsResults is query e args res = do+    b <- mergeBindings $ map resultArgBind $ args ++ [res]+    let s = newTypeScore is query (fromLink e) b+        view = zipWith ArgPosNum [0..] $ map resultArgPos args+    return (e, view, s)
+ src/Hoogle/DataBase/TypeSearch/TypeScore.hs view
@@ -0,0 +1,74 @@+++module Hoogle.DataBase.TypeSearch.TypeScore(+    TypeScore, newTypeScore, costTypeScore, costsTypeScore+    ) where++import General.Code+import Hoogle.DataBase.TypeSearch.Cost+import Hoogle.DataBase.TypeSearch.Binding+import Hoogle.DataBase.TypeSearch.EntryInfo+import Hoogle.DataBase.Instances+import Hoogle.TypeSig.All+import qualified Data.Set as Set+++data TypeScore = TypeScore+    {costTypeScore :: !Int+    ,badargs :: Int+    ,bind :: Binding+    ,badInstance :: (TypeContext, TypeContext)+    ,badAlias :: ([String], [String])+    }+++instance Show TypeScore where+    show t = unwords $+             ['#' : show (costTypeScore t)] +++             replicate (badargs t) "badarg" +++             [show $ bind t] +++             both inst (badInstance t) +++             both alis (badAlias t)+        where+            both f (a,b) = map (f "+") a ++ map (f "-") b+            inst op (c,v) = c ++ op ++ v+            alis op c = op ++ c+++instance Eq TypeScore where+    (==) = (==) `on` costTypeScore++instance Ord TypeScore where+    compare = compare `on` costTypeScore+++newTypeScore :: Instances -> EntryInfo -> EntryInfo -> Binding -> TypeScore+newTypeScore is query result bs = t{costTypeScore = calcScore t}+    where+        t = TypeScore 0+            (entryInfoArity result - entryInfoArity query)+            bs +            (entryInfoContext query `diff` ctx)+            (entryInfoAlias query `diff` entryInfoAlias result)++        diff a b = (a \\ b, b \\ a)+        ctx = nub $ concat [f c b | (c,v) <- entryInfoContext result, (TVar a, b) <- bindings bs, a == v]+        f c (TVar v) = [(c,v)]+        f c (TLit l) = [(c,l) | not $ hasInstance is c l]+++calcScore :: TypeScore -> Int+calcScore t = costBinding (bind t) + score (costsTypeScoreLocal t)+++costsTypeScoreLocal :: TypeScore -> [Cost]+costsTypeScoreLocal t =+    CostDeadArg *+ badargs t +++    CostAliasFwd *+ length (fst $ badAlias t) +++    CostAliasBwd *+ length (snd $ badAlias t) +++    CostInstanceAdd *+ length (fst $ badInstance t) +++    CostInstanceDel *+ length (snd $ badInstance t)+++costsTypeScore :: TypeScore -> [Cost]+costsTypeScore t = costsBinding (bind t) ++ costsTypeScoreLocal t
− src/Hoogle/Database.hs 
@@ -1,74 +0,0 @@-{-
-    This file is part of Hoogle, (c) Neil Mitchell 2004-2005
-    http://www.cs.york.ac.uk/~ndm/hoogle/
-    
-    This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License.
-    To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/2.0/
-    or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.
--}
-
-module Hoogle.Database(
-    Database(..), 
-    loadDatabase
-    ) where
-
-import Data.Maybe
-import Data.List
-
-import Hoogle.TypeSig
-import Hoogle.Parser
-import Hoogle.Lexer
-import Hoogle.General
-
-import Hoogle.MatchName
-import Hoogle.MatchType
-import Hoogle.TypeAlias
-import Hoogle.MatchClass
-
-
--- | An abstract data type
-data Database = Database
-    {
-        aliases :: AliasTable,
-        names :: NameTable,
-        types :: TypeTable,
-        classes :: ClassTable
-    }
-    deriving Show
-    
-
--- | load a text file into a 'Database'
-loadTextfile :: String -> Database
-loadTextfile x = Database {
-        aliases = buildAlias $ filter isTypeAlias items,
-        names = buildName $ map ((,) []) modules ++ modnamed,
-        types = buildType $ filter (isFunc . snd) modnamed,
-        classes = buildClass $ filter isInstance items
-        }
-    where
-        -- all the items in the file
-        (items,errs) = splitEithers $ map parser $ filter validLine $ lines x
-        
-        (instances, namedItems) = partition isInstance items
-        (modules, modnamed) = modulify namedItems
-        
-
--- take a list of items, and return those which are modules
--- and tag every other item with its module
-modulify :: [Item] -> ([Item], [(ModuleName, Item)])
-modulify xs = f [] xs
-    where
-        f _ (Module x:xs) = (Module x:a, b)
-            where (a,b) = f x xs
-            
-        f m (x:xs) = (a, (m,x):b)
-            where (a,b) = f m xs
-        
-        f _ [] = ([], [])
-
-
--- | Load a database from a file
---   perform all cache'ing requried
-loadDatabase :: String -> IO Database
-loadDatabase file = do x <- readFile file
-                       return $ loadTextfile x
− src/Hoogle/General.hs 
@@ -1,84 +0,0 @@-{-
-    This file is part of Hoogle, (c) Neil Mitchell 2004-2005
-    http://www.cs.york.ac.uk/~ndm/hoogle/
-    
-    This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License.
-    To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/2.0/
-    or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.
--}
-
-{-|
-    General utilities
--}
-module Hoogle.General where
-
-import Data.List
-
--- | If anyone of them returns Nothing, the whole thing does
-mapMaybeAll :: (a -> Maybe b) -> [a] -> Maybe [b]
-mapMaybeAll f xs = g [] xs
-    where
-        g acc [] = Just (reverse acc)
-        g acc (x:xs) = case f x of
-                           Just a -> g (a:acc) xs
-                           Nothing -> Nothing
-
-
-concatMapMaybeAll :: (a -> Maybe [b]) -> [a] -> Maybe [b]
-concatMapMaybeAll f xs = case mapMaybeAll f xs of
-                             Just a -> Just $ concat a
-                             Nothing -> Nothing
-
-
-idMaybeAll = mapMaybeAll id
-concatIdMaybeAll = concatMapMaybeAll id
-
-
-
--- | pick all subsets (maintaining order) with a length of n
---   n must be greater or equal to the length of the list passed in
-selection :: Int -> [a] -> [[a]]
-selection n xs = remove (len-n) len [] xs
-    where
-        len = length xs
-        
-        remove lrem lxs done todo =
-                if lrem == lxs then [reverse done]
-                else if null todo then []
-                else remove lrem (lxs-1) (t:done) odo ++ remove (lrem-1) (lxs-1) done odo
-            where (t:odo) = todo
-
-
-
--- | all permutations of a list
-permute :: [a] -> [[a]]
-permute [] = [[]]
-permute (x:xs) = concat $ map (\a -> zipWith f (inits a) (tails a)) (permute xs)
-    where
-        f a b = a ++ [x] ++ b
-
-
-
-catLefts :: [Either a b] -> [a]
-catLefts (Left x:xs) = x : catLefts xs
-catLefts (_:xs) = catLefts xs
-catLefts [] = []
-
-
-splitEithers :: [Either a b] -> ([a],[b])
-splitEithers [] = ([],[])
-splitEithers (x:xs) = case x of
-                          Left  y -> (y:a,b)
-                          Right y -> (a,y:b)
-    where
-        (a,b) = splitEithers xs
-
-fromLeft (Left x) = x
-
-
-iff :: Bool -> a -> Maybe a
-iff b a = if b then Just a else Nothing
-
-
-setEq :: Eq a => [a] -> [a] -> Bool
-setEq xs ys = all (`elem` ys) xs && all (`elem` xs) ys
− src/Hoogle/Hoogle.hs 
@@ -1,77 +0,0 @@-
-module Hoogle.Hoogle(
-    hoogleParse, hoogleParseError, hoogleSearch, hoogleSuggest, hoogleResults, hoogleRange,
-    Search, module Hoogle.Result
-    ) where
-
-import Hoogle.Search
-import Hoogle.Result
-import Hoogle.Match
-import Hoogle.TypeSig
-
-import Data.List
-import Data.Char
-
-
-hoogleParse :: String -> Search
-hoogleParse = parseSearch
-
-
-hoogleParseError :: Search -> Maybe String
-hoogleParseError (Search _ (SearchError x)) = Just x
-hoogleParseError _ = Nothing
-
-
-hoogleSearch :: Search -> TagStr
-hoogleSearch (Search _ (SearchType x)) = showTypeTags x [1..]
-hoogleSearch (Search _ (SearchName x)) = Tag "b" $ Str x
-hoogleSearch (Search x _) = Str x
-
-
-
-hoogleSuggest :: Bool -> Search -> Maybe TagStr
-
-hoogleSuggest _ (Search _ (SearchType (c,t))) |
-        any dubiousVar (allTVar t) = Just $ Tags
-        [Str "Did you mean: ", Tag "a" (Tags $ f $ showConType (c, mapUnbound safeVar t))]
-    where
-        dubiousVar x = length x > 1 && isLower (head x)
-        safeVar x | dubiousVar x = TLit $ '{' : toUpper (head x) : tail x ++ "}"
-                  | otherwise = TVar x
-        
-        f xs = Str a : (if null b then [] else Tag "b" (Str c) : f (safeTail d))
-            where
-                (a,b) = break (== '{') xs
-                (c,d) = break (== '}') (tail b)
-                
-                safeTail [] = []
-                safeTail (x:xs) = xs
-        
-{-
-hoogleSuggest True (SearchName xs@(_:_:_)) = Just $ Tags
-        ["Tip: To search for a type, do "
-        ,Tag "a" (Str $ ":: " ++ concat (intersperse " " xs))]
--}
-
-hoogleSuggest _ (Search _ (SearchName (x:xs))) | isDigit x =
-        Just $ Str "Remember, I have no notion of numbers"
-
-hoogleSuggest _ (Search _ (SearchName x)) | '\"' `elem` x =
-        Just $ Str "Remember, I have no notion of quotes"
-
-hoogleSuggest True (Search _ (SearchName xs)) | xs == "google" =
-        Just $ Tags [Tag "a" (Str "http://www.google.com/"), Str " rocks!"]
-
-hoogleSuggest True (Search _ (SearchName (x:xs))) | xs == "oogle" =
-        Just $ Str "Can't think of anything more interesting to search for?"
-
-hoogleSuggest _ _ = Nothing
-
-
-
-
-hoogleResults :: FilePath -> Search -> IO [Result]
-hoogleResults p (Search _ x) = matchOrdered p x
-
-hoogleRange :: FilePath -> Search -> Int -> Int -> IO [Result]
-hoogleRange p (Search _ x) = matchRange p x
+ src/Hoogle/Item/All.hs view
@@ -0,0 +1,8 @@++module Hoogle.Item.All(+    module Hoogle.Item.Item,+    module Hoogle.Item.Haddock+    ) where++import Hoogle.Item.Item+import Hoogle.Item.Haddock
+ src/Hoogle/Item/Haddock.hs view
@@ -0,0 +1,72 @@++module Hoogle.Item.Haddock(+    Haddock, newHaddock, renderHaddock+    ) where++import General.Code+import Data.TagStr+import Data.Binary.Defer+import Data.Binary.Defer.Vector+++newtype Haddock = Haddock (Vector Char)+++instance BinaryDefer Haddock where+    put (Haddock x) = put x+    get = get1 Haddock+++newHaddock = Haddock . fromList+++renderHaddock :: Haddock -> TagStr+renderHaddock (Haddock xs) = Tags $ f False $ parseHaddock $ toList xs+    where+        nl = Char '\n'++        -- boolean, are you in a pre block+        f False (Char '\n':Char '\n':xs) = Str "\n\n" : f False (dropWhile (== nl) xs)+        f False (Char '\n':xs) = Str " " : f False xs++        f True (Char '\n':xs) = Str "\n" : Str "> " : f True xs++        f pre (Tag "tt" x:xs) = f pre (x++xs)+        f pre (Tag [t,'l'] x:xs) | t `elem` "ou" = tail $ f pre (filter (/= nl) x ++ xs)+        f pre (Tag "pre" x:xs) = init (init $ tail $ f True x) ++ f pre xs+        f pre (Tag "li" x:xs) = Str "\n" : Str "* " : f pre x ++ f pre xs+        f pre (Tag "a" x:xs) = TagUnderline (Tags $ f pre x) : f pre xs++        f pre (Tag n x:xs) = Str (show (Tag n x)) : f pre xs+        f pre (Char x:xs) = Str [x] : f pre xs+        f pre [] = []++++---------------------------------------------------------------------+-- PARSER++type Tags = [Tag]+data Tag = Char Char | Tag String Tags+           deriving (Eq,Show)++parseHaddock :: String -> Tags+parseHaddock = fst . readHaddock ">"+++readHaddock :: String -> String -> (Tags, String)+readHaddock name = f+    where+        f ('&':'a':'m':'p':';':xs) = g xs $ Char '&'+        f ('&':'g':'t':';':xs) = g xs $ Char '>'+        f ('&':'l':'t':';':xs) = g xs $ Char '<'+        f ('<':'/':xs) | a == name = ([], drop 1 b)+            where (a,b) = break (== '>') xs+        f ('<':xs) | not $ "/" `isPrefixOf` xs = g d $ Tag a c+            where (a,b) = break (== '>') xs+                  (c,d) = readHaddock a $ drop 1 b+        f (x:xs) = g xs $ Char x+        f [] = ([],[])++        g rest add = (add:a,b)+            where (a,b) = f rest
+ src/Hoogle/Item/Item.hs view
@@ -0,0 +1,172 @@++module Hoogle.Item.Item where++import General.Code+import Data.Binary.Defer+import Data.Binary.Defer.Index+import Hoogle.Item.Haddock+import Hoogle.TextBase.All+import Hoogle.TypeSig.All+import Data.Range+import Data.TagStr+import Data.Typeable+++data Package = Package+    {packageName :: String+    ,packageVersion :: String+    ,haddockURL :: String+    ,hscolourURL :: String+    }++typename_Package = mkTyCon "Hoogle.DataBase.Item.Package"+instance Typeable Package where typeOf _ = mkTyConApp typename_Package []+++data Module = Module+    {moduleName :: [String]+    ,modulePackage :: Link Package+    }++typename_Module = mkTyCon "Hoogle.DataBase.Item.Module"+instance Typeable Module where typeOf _ = mkTyConApp typename_Module []+++-- invariant: entryName == head [i | Focus i <- entryText]+data Entry = Entry+    {entryModule :: Maybe (Link Module)+    ,entryName :: String+    ,entryText :: [EntryText]+    ,entryType :: EntryType+    ,entryDocs :: Haddock+    }++typename_Entry = mkTyCon "Hoogle.DataBase.Item.Entry"+instance Typeable Entry where typeOf _ = mkTyConApp typename_Entry []+++data EntryText = Keyword String+               | Text String+               | Focus String -- the bit text search starts from+               | ArgPos Int String+               | ArgRes String+                 deriving Show++data EntryView = FocusOn Range -- characters in the range should be focused+               | ArgPosNum Int Int -- argument a b, a is remapped to b+                 deriving Show++data EntryType = EntryModule+               | EntryKeyword+               | EntryOther+                 deriving (Eq,Enum,Show)++-- the number of elements in the module name+-- the name of the entry, in lower case+-- the name of the entry+-- the module+data EntryScore = EntryScore Int String String [String]+                  deriving (Eq,Ord)+++entryScore :: Entry -> EntryScore+entryScore e = EntryScore+    (length m) (map toLower $ entryName e) (entryName e) m+    where m = maybe [] (moduleName . fromLink) $ entryModule e+++renderEntryText :: [EntryView] -> [EntryText] -> TagStr+renderEntryText view = Tags . map f+    where+        args = not $ null [() | ArgPosNum _ _ <- view]++        f (Keyword x) = TagUnderline $ Str x+        f (Text x) = Str x+        f (ArgPos i s) = (if null res then id else TagColor (head res)) $ Str s+            where res = [k+1 | ArgPosNum k j <- view, j == i]+        f (ArgRes s) = (if args then TagColor 0 else id) $ Str s+        f (Focus x) = renderFocus [i | FocusOn i <- view] x+++renderFocus :: [Range] -> String -> TagStr+renderFocus rs = Tags . f (mergeRanges rs) 0+    where+        str s = [Str s | s /= ""]++        f [] i s = str s+        f (r:rs) i s =+                str s1 ++ [TagBold $ Str s3] ++ f rs (rangeEnd r + 1) s4+            where+                (s1,s2) = splitAt (rangeStart r - i) s+                (s3,s4) = splitAt (rangeCount r) s2+++renderTextItem :: TextItem -> [EntryText]+renderTextItem x = case x of+    ItemClass i -> [Keyword "class", Text " "] ++ typeHead i+    ItemFunc name typ -> [Focus name, Text " :: "] ++ renderTypeSig typ+    ItemAlias a b -> [Keyword "type", Text " "] ++ typeHead a ++ [Text $ " = " ++ show b]+    ItemData d t -> [Keyword (show d), Text " "] ++ typeHead t+    where+        typeHead (TypeSig con sig) = [Text $ showConstraint con, Focus a, Text b]+            where (a,b) = break (== ' ') $ show sig+++renderTypeSig :: TypeSig -> [EntryText]+renderTypeSig (TypeSig con sig) = Text (showConstraint con) :+    intersperse (Text " -> ") (zipWith ArgPos [0..] a ++ [ArgRes b])+    where (a,b) = initLast $ map showFun $ fromTFun sig+++showModule = concat . intersperse "."++instance Show Package where+    show (Package a b c d) = unwords [a,b,c,d]++instance Show Module where+    show (Module a b) = unwords [showModule a, "{" ++ show b ++ "}"]++instance Show Entry where+    show (Entry a _ b _ _) = unwords [concatMap f b, m]+        where+            m = case a of+                    Nothing -> ""+                    Just y -> "{#" ++ show (linkKey y) ++ "}"++            f (Keyword x) = x+            f (Text x) = x+            f (Focus x) = x+            f (ArgPos _ x) = x+            f (ArgRes x) = x+++instance BinaryDefer Package where+    put (Package a b c d) = put4 a b c d+    get = get4 Package++instance BinaryDefer Module where+    put (Module a b) = put2 a b+    get = get2 Module++instance BinaryDefer Entry where+    put (Entry a b c d e) = put5 a b c d e+    get = get5 Entry++instance BinaryDefer EntryText where+    put (Keyword a)  = putByte 0 >> put1 a+    put (Text a)     = putByte 1 >> put1 a+    put (Focus a)    = putByte 2 >> put1 a+    put (ArgPos a b) = putByte 3 >> put2 a b+    put (ArgRes a)   = putByte 4 >> put1 a++    get = do i <- getByte+             case i of+                0 -> get1 Keyword+                1 -> get1 Text+                2 -> get1 Focus+                3 -> get2 ArgPos+                4 -> get1 ArgRes++instance BinaryDefer EntryType where+    put = put . fromEnum+    get = liftM toEnum get
− src/Hoogle/Lexer.hs 
@@ -1,101 +0,0 @@-{-
-    This file is part of Hoogle, (c) Neil Mitchell 2004-2005
-    http://www.cs.york.ac.uk/~ndm/hoogle/
-    
-    This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License.
-    To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/2.0/
-    or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.
--}
-
-{- |
-    A very basic lexer, splits things up into various 'Lexeme' pieces.
-    Uses the underlying Haskell lex function.
--}
-
-module Hoogle.Lexer (
-    Lexeme(..),
-    lexer
-    ) where
-
-import Prelude
-import Data.Char
-import Data.List
-
--- | The data structure for a lexeme
-data Lexeme = OpenSquare  -- ^ \[
-            | ShutSquare  -- ^ \]
-            | OpenRound   -- ^ \(
-            | ShutRound   -- ^ \)
-            | Comma       -- ^ \,
-            | LineArrow   -- ^ \->
-            | EqArrow     -- ^ \=>
-            | EqSymbol    -- ^ \=
-            | TypeColon   -- ^ \::
-            | ExSymbol    -- ^ \!
-            | TypeName String -- ^ Ctor
-            | VarName String  -- ^ func
-            deriving (Eq)
-
-
-instance Show Lexeme where
-    show OpenSquare  = "["
-    show ShutSquare  = "]"
-    show OpenRound   = "("
-    show ShutRound   = ")"
-    show Comma       = ","
-    show LineArrow   = "->"
-    show EqArrow     = "=>"
-    show EqSymbol    = "="
-    show TypeColon   = "::"
-    show ExSymbol    = "!"
-    show (TypeName x) = x
-    show (VarName  x) = x
-
-
--- | The main lexer
-lexer :: String -> Either [Lexeme] String
-
-lexer ('(':xs) | all isSymbolChar a = 
-        if null bs then Right "Parse Error: Missing closing bracket ')'"
-        else case lexRest [] (tail bs) of
-                  Left x -> Left $ VarName ('(':a++")") : x
-                  Right x -> Right x
-    where (a,bs) = break (== ')') xs
-    
-lexer xs | "keyword " `isPrefixOf` xs = Left [VarName "keyword", VarName $ drop 8 xs]
-
-lexer x = lexRest [] x
-
-
-isSymbolChar x = not (isSpace x) &&
-                 not (x == ',') &&
-                 not (isAlphaNum x) &&
-                 not (x == '_')
-
-
-lexRest :: [Lexeme] -> String -> Either [Lexeme] String
-lexRest acc (' ':xs) = lexRest acc xs
-lexRest acc ('(':')':xs) = lexRest (TypeName "()":acc) xs
-lexRest acc ('-':'>':xs) = lexRest (LineArrow  :acc) xs
-lexRest acc ('=':'>':xs) = lexRest (EqArrow    :acc) xs
-lexRest acc (':':':':xs) = lexRest (TypeColon  :acc) xs
-lexRest acc ('=':xs)     = lexRest (EqSymbol   :acc) xs
-lexRest acc ('!':xs)     = lexRest (ExSymbol   :acc) xs
-lexRest acc ('[':xs)     = lexRest (OpenSquare :acc) xs
-lexRest acc (']':xs)     = lexRest (ShutSquare :acc) xs
-lexRest acc ('(':xs)     = lexRest (OpenRound  :acc) xs
-lexRest acc (')':xs)     = lexRest (ShutRound  :acc) xs
-lexRest acc (',':xs)     = lexRest (Comma      :acc) xs
-lexRest acc (x:xs) | x == '_'      || (x >= 'a' && x <= 'z') = lexRest (VarName  a:acc) b
-                   | x `elem` "#?" || (x >= 'A' && x <= 'Z') = lexRest (TypeName a:acc) b
-                   where (a, b) = lexWord [x] xs
-lexRest acc (x:xs) = Right $ "Parse Error: Unexpected character '" ++ take 10 (x:xs) ++ "'"
-lexRest acc [] = Left $ reverse acc
-
-
-lexWord :: String -> String -> (String, String)
-lexWord acc [] = (reverse acc, "")
-lexWord acc (x:xs) | isDigit x || isAlpha x || x `elem` "_.'#?" = lexWord (x:acc) xs
-                   | otherwise = (reverse acc, x:xs)
-                   
-
− src/Hoogle/Match.hs 
@@ -1,61 +0,0 @@-{-
-    This file is part of Hoogle, (c) Neil Mitchell 2004-2005
-    http://www.cs.york.ac.uk/~ndm/hoogle/
-    
-    This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License.
-    To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/2.0/
-    or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.
--}
-
-{- |
-    The main driver module, all the associated interfaces call into this
--}
-
-module Hoogle.Match(matchUnordered, matchOrdered, matchRange) where
-
-import Hoogle.Result
-import Hoogle.Database
-import Hoogle.Search
-
-import Hoogle.MatchName
-import Hoogle.MatchType
-
-import Data.List
-
-
----------------------------------------------------------------------
--- DRIVER
-
-
-
--- | The main drivers for hoogle
-matchUnordered
-    :: FilePath -- ^ The full path to the hoogle file, if null then a default is used
-    -> SearchMode -- ^ The string to search for, unparsed
-    -> IO [Result] -- ^ A list of Results, from best to worst
-matchUnordered path find =
-    do 
-        let file = if null path then "hoogle.txt" else path
-        database <- loadDatabase file
-        return $ case find of
-            SearchName x -> lookupName (names database) x
-            SearchType x -> lookupType (classes database) (types database) x
-
-
--- | 
-matchOrdered :: FilePath -> SearchMode -> IO [Result]
-matchOrdered path find =
-    do res <- matchUnordered path find
-       return $ sort res
-
-
-
-matchRange :: FilePath -> SearchMode -> Int -> Int -> IO [Result]
-matchRange path find 0 count =
-    do res <- matchOrdered path find
-       return $ take count res
-
-
-matchRange path find from count = 
-    do res <- matchRange path find 0 (from+count)
-       return $ drop from res
− src/Hoogle/MatchClass.hs 
@@ -1,85 +0,0 @@-{-
-    This file is part of Hoogle, (c) Neil Mitchell 2004-2005
-    http://www.cs.york.ac.uk/~ndm/hoogle/
-    
-    This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License.
-    To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/2.0/
-    or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.
--}
-
-module Hoogle.MatchClass(
-    ClassTable,
-    buildClass,
-    lookupClass
-    ) where
-
-import Hoogle.Result
-import Hoogle.TypeSig
-import Hoogle.General
-
-import Data.Maybe
-import qualified Data.Map as Map
-
-
-data ClassTable = ClassTable (Map.Map String [TypeMatch])
-                  deriving Show
-
-
-data TypeMatch = TypeMatch [Type] Constraint
-                 deriving Show
-
-
--- item should only be instances
-buildClass :: [Item] -> ClassTable
-buildClass xs = ClassTable $ foldr add Map.empty (map f xs)
-    where
-        f (Instance (con, TList (TLit name:typs))) = (name, TypeMatch (f typs) (f con))
-            where
-                free = zip (allTVar (TList typs)) [0..]
-                f = map (mapUnbound g)
-                g x = TNum $ fromJust $ lookup x free
-        
-        add (name, value) mp = case Map.lookup name mp of
-                                   Just x -> Map.insert name (value:x) mp
-                                   Nothing -> Map.insert name [value] mp
-
-
-
--- return ClassMinor if something is minorly wrong, i.e. no Show for a
--- return ClassMajor for bigger errors, no FooBar for a
-lookupClass :: ClassTable -> Constraint -> String -> [Type] -> Maybe [MatchAmount]
-lookupClass ct given check xs | all isTVar xs =
-    if any (== TList (TLit check : xs)) given then Just []
-    else if check `elem` ["Eq","Show","Ord"] then Just [ClassMinor]
-    else Just [ClassMajor]
-
--- either reduce or perish!
-lookupClass c@(ClassTable ct) given check typ =
-        case mapMaybe f res of
-            [] -> Just [ClassMajor]
-            (x:xs) -> Just x
-    where
-        ltyp = length typ
-        res = Map.findWithDefault [] check ct
-        
-        f (TypeMatch typ2 con)
-                | length typ2 == ltyp && isJust unifs && isJust res
-                = Just $ fromJust res
-            where 
-                unifs = concatIdMaybeAll $ zipWith g typ2 typ
-                cons2 = map (mapNumber (\x -> fromJust $ lookup x (fromJust unifs))) con
-                res = concatMapMaybeAll ren cons2
-                
-                ren (TList (TLit x:xs)) = lookupClass c given x xs
-                
-        
-        f _ = Nothing
-        
-        -- type on the left must have the numbers in
-        g :: Type -> Type -> Maybe [(Int, Type)]
-        g (TNum x) y = Just [(x, y)]
-        g (TLit x) (TLit y) | x == y = Just []
-        g (TList x) (TList y) | length x == length y = concatIdMaybeAll $ zipWith g x y
-        g _ _ = Nothing
-        
-
− src/Hoogle/MatchName.hs 
@@ -1,112 +0,0 @@-{-
-    This file is part of Hoogle, (c) Neil Mitchell 2004-2005
-    http://www.cs.york.ac.uk/~ndm/hoogle/
-    
-    This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License.
-    To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/2.0/
-    or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.
--}
-
-module Hoogle.MatchName(
-    NameTable,
-    buildName, -- build a name table
-    lookupName -- lookup a name
-    ) where
-
-
-import Hoogle.Result
-import Hoogle.TypeSig
-
-import Data.Char
-import Data.List
-import Data.Maybe
-
-
--- | The abstract data type
-data NameTable = NameTable [(String, String, Result, Bool)]
-                 deriving Show
-
--- | build a 'NameTable'
-buildName :: [(ModuleName, Item)] -> NameTable
-buildName xs = NameTable $ map f xs
-    where
-        lcase = map toLower
-    
-        f (_, Module x) = (lcase name, name,
-            Result (Str $ showModuleName (init x)) (Str $ last x)
-                   (Tag "u" $ Str "module") "module" [] 0 0,
-            False)
-            where name = last x
-                   
-        
-        f (modu, x) = (lcase name, name,
-            Result (Str $ showModuleName modu) (Str $ getName x)
-                   (getType x) (getMode x) [] 0 (0 - length modu),
-            head (asString x) == '(')
-            where name = getName x
-
-
-        getName x = noBracket $ asString x
-        
-        getType (Func _ x) = Str $ showConType x
-        getType (Keyword x) = Tag "u" $ Str "keyword"
-        getType (Class x) =
-            Tags [Tag "u" $ Str "class", Str $ " " ++ showConType x]
-        getType (TypeAlias name args _) =
-            Tags [Tag "u" $ Str "type", Str $ concatMap (' ':) (name:args)]
-        getType (Data b x) = 
-            Tags [Tag "u" $ Str (if b then "newtype" else "data"), Str $ " " ++ showConType x]
-        
-        getMode (Func{}) = "func"
-        getMode (Keyword{}) = "keyword"
-        getMode (Class{}) = "class"
-        getMode (TypeAlias{}) = "type"
-        getMode (Data b x) = if b then "newtype" else "data"
-
-
-
-noBracket ('(':xs) = init xs
-noBracket x = x
-
-
--- | lookup an entry in a 'NameTable'
-lookupName :: NameTable -> String -> [Result]
-lookupName (NameTable xs) find = catMaybes $ map f xs
-    where
-        findc = noBracket find
-        find2 = map toLower findc
-    
-        f (fnd, orig, res, b) =
-            do (reason, pos) <- getMatch fnd orig
-               return $ res{
-                   resultName = brack b $ h pos (length find) (fromStr (resultName res)),
-                   resultInfo = [ReasonText reason],
-                   resultScore = score [ReasonText reason]
-                 }
-                            
-        fromStr (Str x) = x
-
-        getMatch :: String -> String -> Maybe (TextAmount, Int)
-        getMatch fnd orig
-            | findc == orig = Just (TextFullCase, 0)
-            | find2 == fnd  = Just (TextFull, 0)
-            | findc `isPrefixOf` orig = Just (TextPrefixCase, 0)
-            | find2 `isPrefixOf` fnd  = Just (TextPrefix, 0)
-            | find2 `isSuffixOf` fnd  = Just (TextSuffix, length fnd - length find2)
-            | otherwise = g fnd 0
-                     
-              
-        g [] n = Nothing
-        g xs n | find2 `isPrefixOf` xs = Just (TextSome, n)
-               | otherwise = g (tail xs) (n+1)
-                   
-                   
-        h pos len xs = Tags $ [
-                Str $ take pos2 xs,
-                Tag "b" $ Str $ take len $ drop pos2 xs,
-                Str $ drop (len+pos2) xs]
-            where pos2 = pos + (if head xs == '(' then 1 else 0)
-
-
-        brack True x = Tags [Str "(", x, Str ")"]
-        brack _ x = x
− src/Hoogle/MatchType.hs 
@@ -1,204 +0,0 @@-{-
-    This file is part of Hoogle, (c) Neil Mitchell 2004-2005
-    http://www.cs.york.ac.uk/~ndm/hoogle/
-    
-    This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License.
-    To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/2.0/
-    or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.
--}
-
-
-module Hoogle.MatchType(
-    TypeTable,
-    buildType,
-    lookupType,
-    compareTypes
-    ) where
-
-
-import Hoogle.TypeSig
-import Hoogle.Result
-import Hoogle.Parser
-import Hoogle.Lexer
-import Hoogle.MatchClass
-import Hoogle.General
-
-import Data.Maybe
-import Data.List
-
-
-data TypeTable = TypeTable [(ModuleName, Item, TypeCode)]
-                 deriving Show
-
-
-data TypeCode = TypeCode Int [Rule]
-                deriving Show
-
-
-data Rule = FreeSet [Var]
-          | DataBind String Var
-          | ClassBind String [Var]
-
-
-data Var = Var Int [Int]
-
-
-instance Show Var where
-    show (Var n xs) = "@" ++ show n ++ concatMap (\x -> '.':show x) xs
-
-
-instance Show Rule where
-    show (FreeSet x) = "{" ++ (concat $ intersperse " " $ map show x) ++ "}"
-    show (DataBind x y) = x ++ "=" ++ show y
-    show (ClassBind x y) = x ++ "=>" ++ show y
-
-           
-
-buildType :: [(ModuleName, Item)] -> TypeTable
-buildType x = TypeTable $ map f x
-    where f (a, b) = (a, b, buildTypeCode $ typ b)
-
-
-unpackSpine :: ConType -> (Constraint, [Type])
-unpackSpine (c, TList (TLit "->":xs)) = (c, xs)
-unpackSpine (c, x) = (c, [x])
-
-
-buildTypeCode :: ConType -> TypeCode
-buildTypeCode (con,typ) = TypeCode (length args) $ map asBound bound ++ concatMap asFree frees
-    where
-        frees = groupBy eqVar $ sortBy cmpVar free
-        (free, bound) = partition (isTVar . snd) binds
-        binds = concat $ zipWith f (map (\x -> Var x []) [0..]) (last args : init args)
-        
-        asBound (var, TLit x) = DataBind x var
-        
-        -- TODO: Multiparameter type classes
-        asFree x = FreeSet items : [ClassBind c [i] | i <- items, c <- classes]
-            where
-                items = map fst x
-                ((_,TVar var):_) = x
-                classes = [r | TList [TLit r,TVar v] <- con, v == var]
-        
-        f :: Var -> Type -> [(Var, Type)]
-        f var@(Var v vs) (TList (x:xs)) = (var, x) : (concat $ zipWith g [1..] xs)
-            where g n x = f (Var v (vs ++ [n])) x
-            
-        f var x = [(var, x)]
-    
-        args = snd $ unpackSpine (con,typ)
-        
-        eqVar  (_, TVar a) (_, TVar b) = a == b
-        cmpVar (_, TVar a) (_, TVar b) = compare a b
-
-
-compareTypes :: ClassTable -> ConType -> ConType -> [[Reason]]
-compareTypes classes left right = [a ++ b | a <- as, b <- bs]
-    where
-        as = map (map ReasonLeft  . thd3) $ checkType classes cleft right
-        bs = map (map ReasonRight . thd3) $ checkType classes cright left
-        thd3 (_,_,x) = x
-    
-        cleft = buildTypeCode left
-        cright = buildTypeCode right
-
-
-lookupType :: ClassTable -> TypeTable -> ConType -> [Result]
-lookupType classes (TypeTable types) find = mapMaybe f types
-    where
-        findCode = buildTypeCode find
-        
-        f (modu, item, code) = do (order, a) <- checkTypeOne classes code find
-                                  (_,     b) <- checkTypeOne classes findCode (typ item)
-                                  let reasons = map ReasonLeft a ++ map ReasonRight b
-                                  return $ Result
-                                      (Str $ showModuleName modu)
-                                      (Str $ name item)
-                                      (showTypeTags (typ item) order)
-                                      "func"
-                                      reasons
-                                      (score reasons)
-                                      (0 - length modu)
-
-
-checkTypeOne :: ClassTable -> TypeCode -> ConType -> Maybe ([Int], [MatchAmount])
-checkTypeOne ct tc typ = if null res then Nothing else Just (b, c)
-    where
-        (a,b,c) = maximumBy f res
-        res = checkType ct tc typ
-        
-        f (a,_,_) (b,_,_) = compare a b
-
-
-checkType :: ClassTable -> TypeCode -> ConType -> [(Score, [Int], [MatchAmount])]
-checkType classes code@(TypeCode n xs) typ = if abs posExtraArgs > 2 then [] else res
-    where
-        extraArgs = n - length types
-        posExtraArgs = abs extraArgs
-        badArgs = replicate extraArgs ArgExtra
-    
-        f (x:xs) = xs ++ [x]
-        
-        res = [(score reasons, f $ map fst arg, badArgs ++ reasons) | arg <- args,
-               Just reasons <- [applyType classes code cons (map snd arg)]]
-    
-        (cons, types) = unpackSpine typ
-        types2 = zip [1..] types
-        lastType = last types2
-        initType = init types2
-        addTypes = initType ++ replicate extraArgs (0, TVar "_")
-        
-        args = map (lastType:) $ concatMap permute $ selection (n-1) addTypes
-
-        
-
-applyType :: ClassTable -> TypeCode -> Constraint -> [Type] -> Maybe [MatchAmount]
-applyType classes (TypeCode n xs) cons types = if any isNothing res then Nothing
-                                       else Just (concatMap fromJust res)
-    where
-        res = map f xs
-
-        f :: Rule -> Maybe [MatchAmount]
-        f (ClassBind x y) = do items <- mapMaybeAll getElement y
-                               lookupClass classes cons x items
-        
-        f (DataBind x y) = case rootCtor y of
-                               Nothing -> Nothing
-                               Just "" -> Just [DataTooFree]
-                               Just z -> if x == z then Just [] else Nothing
-                               
-        f (FreeSet x) = if Nothing `elem` roots || length roots > 2
-                        then Nothing
-                        else Just $ concat [tooSpecific, tooDifferent]
-            where
-                tooSpecific = if length roots == 2 then [DataTooSpecific] else []
-                tooDifferent = replicate (length items - 1) FreeDifferent
-            
-                roots = nub $ Just "" : map rootCtor x
-                items = nub $ mapMaybe f x
-                
-                f x = case fromJust (getElement x) of
-                          TVar "_" -> Nothing
-                          TVar x -> Just x
-                          _ -> Nothing
-        
-        
-        -- empty string means a free variable, i.e no explicit root
-        -- Nothing means impossible
-        rootCtor :: Var -> Maybe String
-        rootCtor var = case getElement var of
-                            Nothing -> Nothing
-                            Just (TLit x) -> Just x
-                            Just (TList (TLit x:xs)) -> Just x
-                            x -> Just ""
-
-        
-        getElement :: Var -> Maybe Type
-        getElement (Var n xs) = f xs (types !! n)
-            where
-                f [] x = Just x
-                f (n:ns) (TList xs) | n < length xs = f ns (xs !! n)
-                f (n:ns) (TVar x) = Just $ TVar "_"
-                f _ _ = Nothing
-        
-
+ src/Hoogle/Operations/All.hs view
@@ -0,0 +1,8 @@++module Hoogle.Operations.All(+    module Hoogle.Operations.Convert,+    module Hoogle.Operations.Rank+    ) where++import Hoogle.Operations.Convert+import Hoogle.Operations.Rank
+ src/Hoogle/Operations/Convert.hs view
@@ -0,0 +1,26 @@++module Hoogle.Operations.Convert(convert) where++import General.Code+import Hoogle.TextBase.All+import Hoogle.DataBase.All+++-- error messages are given using trace and error+convert :: Bool -> FilePath -> FilePath -> IO ()+convert debugCheck tb db = do+    res <- parseTextBase tb+    case res of+        Left  x -> error $ show x+        Right x -> do+            let y = createDataBase x+            saveDataBase db y++            when (debugCheck) $ do+                putStr "Validating... "+                hFlush stdout+                z <- loadDataBase db+                if show y == show z+                    then putStrLn "Success"+                    else exitMessage ["Failure, database did not match"]+
+ src/Hoogle/Operations/Rank.hs view
@@ -0,0 +1,75 @@++module Hoogle.Operations.Rank(rank) where++import General.Code+import Hoogle.Query.All+import Hoogle.Search.All+import Hoogle.TextBase.All+import Hoogle.DataBase.All+import Hoogle.TypeSig.All+import Hoogle.Item.All+import Data.Binary.Defer.Index+import Hoogle.Operations.RankSolve++-- Privilaged imports+import Hoogle.DataBase.TypeSearch.Cost(Cost(..))+import Hoogle.DataBase.TypeSearch.TypeScore(costsTypeScore)+import Hoogle.Search.Result(Score(TypeScore))+++data RankTest = RankTest TypeSig [TypeSig]+                deriving Show+++rank :: FilePath -> IO ()+rank file = do+    (tb,tests) <- liftM readRankTests $ readFile file+    let rel = concatMap (runRankTest tb) tests+    rankSolve rel++++readRankTests :: String -> (TextBase,[RankTest])+readRankTests xs = (tb, join $ concatMap parse rest)+    where+        (pre,rest) = break ("@" `isPrefixOf`) $ lines xs+        tb = right $ parseTextBaseString $ unlines pre++        parse :: String -> [(Bool, TypeSig)]+        parse xs | null xs || "--" `isPrefixOf` xs = []+        parse ('@':xs) = [(True,f xs)]+        parse xs = [(False,f xs)]++        f = right . parseTypeSig +        right (Right x) = x+        right (Left x) = error $ "readRank failed to parse " ++ show x++        join ((_,t):xs) = RankTest t (map snd a) : join b+            where (a,b) = break fst xs+        join [] = []+++runRankTest :: TextBase -> RankTest -> [Cmp]+runRankTest tb (RankTest t xs) = order $ map grab xs2+    where+        xs2 = zip ["f" ++ show i | i <- [1..]] xs++        res = searchAll [db] q+        db = createDataBase $ tb ++ [(ItemFunc a b, "") | (a,b) <- xs2]+        q = defaultQuery{typeSig=Just t}++        grab :: (String,TypeSig) -> (TypeSig,[Cost])+        grab (name,typ) = (,) typ $+            headDef (err $ "Couldn't find result for " ++ show typ)+            [sort $ costsTypeScore c | r <- res, entryName (fromLink $ resultEntry r) == name+                                     , TypeScore c <- resultScore r]+++        order ((at,a):xs@((bt,b):_))+            | isNothing match = (a :< b) : order xs+            | otherwise = err $ "Two items have the same score, " ++ show at +++                                " AND " ++ show (fst $ fromJust match)+                where match = find ((==) a . snd) xs+        order _ = []++        err msg = error $ "Hoogle.Operations.runRankTest\nTest: " ++ show t ++ "\n" ++ msg
+ src/Hoogle/Operations/RankSolve.hs view
@@ -0,0 +1,73 @@++module Hoogle.Operations.RankSolve(Cmp(..), rankSolve) where++import General.Code+import qualified Data.IntMap as IntMap++-- Privilaged imports+import Hoogle.DataBase.TypeSearch.Cost(Cost(..))+++-- invariant, costs must remain sorted+data Cmp = [Cost] :< [Cost]+           deriving (Show,Eq)+++rankSolve :: [Cmp] -> IO ()+rankSolve xs | missing /= [] = error $ "Missing costs: " ++ show missing+             | otherwise = putStr $ showBind res+    where+        res = fix (solve xs2) emptyBind+        xs2 = nub $ concatMap simplify xs+        missing = costs \\ concat [a ++ b | a :< b <- xs2]+++costs = [minBound..maxBound] :: [Cost]++type Bind = IntMap.IntMap (Int,Int)++emptyBind :: Bind+emptyBind = IntMap.fromAscList [(fromEnum i, (1,1000)) | i <- costs]+++showBind :: Bind -> String+showBind mp = unlines ["cost " ++ padR ncosts (show (toEnum a :: Cost)) +++                       " = " ++ padL 4 (show b) ++ "  -- " ++ show b ++ ".." ++ show c +                      | (a,(b,c)) <- IntMap.toList mp]+    where ncosts = maximum $ map (length . show) costs++padL, padR :: Int -> String -> String+padL n xs = replicate (n - length xs) ' ' ++ xs+padR n xs = xs ++ replicate (n - length xs) ' '++++simplify :: Cmp -> [Cmp]+simplify c@(xs :< ys)+        | null xs2 = []+        | null ys2 = error $ "rankSolve, contradiction exists: " ++ show c+        | otherwise = [xs2 :< ys2]+    where+        common = intersect xs ys+        xs2 = xs \\ common+        ys2 = ys \\ common+++solve :: [Cmp] -> Bind -> Bind+solve xs mp = foldl' f mp xs+    where+        -- all x in xs, x.max = ys.max - 1+        -- all y in ys, y.min = xs.min + 1+        f mp (xs :< ys) = upd (id *** min (maxRhs - 1)) xs $+                          upd (max (minLhs + 1) *** id) ys mp+            where+                minLhs = grab fst xs mp+                maxRhs = grab snd ys mp+++        grab side xs mp = sum $ map (side . (mp IntMap.!) . fromEnum) xs++        -- TODO: does not deal well with multiple elements on either side+        --       some constraints may not be satisfied+        upd op [x] mp = IntMap.update (Just . op) (fromEnum x) mp+        upd op _ mp = mp
− src/Hoogle/Parser.hs 
@@ -1,134 +0,0 @@-{-
-    This file is part of Hoogle, (c) Neil Mitchell 2004-2005
-    http://www.cs.york.ac.uk/~ndm/hoogle/
-    
-    This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License.
-    To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/2.0/
-    or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.
--}
-
-module Hoogle.Parser (
-    parser,
-    parseConType,
-    validLine
-    ) where
-
-import Hoogle.Lexer
-import Hoogle.TypeSig
-
-
-
--- | Is this line a content based line
-validLine :: String -> Bool
-validLine "" = False
-validLine ('-':'-':_) = False
-validLine _ = True
-
-
--- | Parse one line of Lexemes at a time and convert it to an item, or raise a parse error
-parser :: String -> Either Item String
-parser x = case lexer x of
-               Left x -> parse x
-               Right x -> Right x
-
-parse :: [Lexeme] -> Either Item String
-parse (VarName "module":TypeName x:[]) = Left $ Module (splitOn '.' x)
-
-parse (VarName "class":x) = Left $ Class (readConType x)
-
-parse (VarName "instance":x) = Left $ Instance (readConType x)
-
-parse (VarName "keyword":xs) = Left $ Keyword $ concatMap show xs
-
-parse (VarName "newtype":x) = Left $ Data True  (readConType x)
-parse (VarName "data"   :x) = Left $ Data False (readConType x)
-
-parse (VarName "type":x) = Left $ TypeAlias name (map (\(VarName a) -> a) args) (readConType b)
-    where (TypeName name:args,_:b) = break (== EqSymbol) x
-
-parse (TypeName x:TypeColon:typ) = Left $ Func x (readConType typ)
-parse (VarName  x:TypeColon:typ) = Left $ Func x (readConType typ)
-
--- a data value produced by Haddock being foolish
-parse [VarName  x] = Right ""
-parse [TypeName x] = Right ""
-
-
-parse [] = Right "Parse error: unexpected empty line"
-parse (x:xs) = Right $ "Parse error: doesn't start with a keyword, or have a type annotation, " ++ show x
-
-
-parseConType :: String -> Either ConType String
-parseConType xs = case lexer xs of
-                      Left x -> Left (readConType x)
-                      Right x -> Right x
-
-
-splitOn :: Eq a => a -> [a] -> [[a]]
-splitOn e xs = if null b then [a] else a : splitOn e (tail b)
-    where (a,b) = break (== e) xs
-
-
-readConType :: [Lexeme] -> (Constraint, Type)
-readConType xs = (con, readType res)
-    where (con, res) = readConstraint xs
-
-
-readConstraint :: [Lexeme] -> (Constraint, [Lexeme])
-readConstraint (TypeColon:x) = readConstraint x
-readConstraint x = if not (EqArrow `elem` x) then ([],x)
-                   else (f (readType a) ++ con, lexe)
-    where
-        (a,b) = break (== EqArrow) x
-        (con,lexe) = readConstraint (tail b)
-        
-        f (TList (TLit ",":xs)) = xs
-        f x = [x]
-
-
-
-readType :: [Lexeme] -> Type
-readType x = f $ bracket $ filter (/= ExSymbol) x
-    where
-        f :: [Bracket Lexeme] -> Type
-        f xs = if not (singleton tups) then TList (TLit ",":map f tups)
-               else if not (singleton func) then TList (TLit "->":map f func)
-               else if singleton xs then g (head xs)
-               else if null xs then TVar "_"
-               else TList (map g xs)
-            where
-                tups = splitOn (BItem Comma    ) xs
-                func = splitOn (BItem LineArrow) xs
-        
-        g (Bracket OpenRound  x) = f x
-        g (Bracket OpenSquare []) = TLit "[]"
-        g (Bracket OpenSquare x) = TList [TLit "[]", f x]
-        g (BItem (TypeName x)) = TLit x
-        g (BItem (VarName  x)) = TVar x
-        g y = error $ "Hoogle.Parser.readType: " ++ show (x,y)
-    
-
-singleton [x] = True
-singleton _ = False
-
-
-data Bracket x = Bracket x [Bracket x]
-               | BItem x
-               deriving (Eq, Show)
-
-
-isOpen x = x `elem` [OpenRound, OpenSquare]
-isShut x = x `elem` [ShutRound, ShutSquare]
-
-bracket :: [Lexeme] -> [Bracket Lexeme]
-bracket xs = let (a,[]) = g xs in a
-    where
-        f :: [Lexeme] -> (Bracket Lexeme, [Lexeme])
-        f (x:xs) | isOpen x = let (a,b) = g xs in (Bracket x a, b)
-        f (x:xs) = (BItem x, xs)
-        
-        
-        g :: [Lexeme] -> ([Bracket Lexeme], [Lexeme])
-        g (x:xs) | isShut x = ([], xs)
-        g [] = ([], [])
-        g xs = let (a,b) = f xs ; (c,d) = g b in (a:c,d)
+ src/Hoogle/Query/All.hs view
@@ -0,0 +1,10 @@++module Hoogle.Query.All (+        module Hoogle.Query.Type, module Hoogle.Query.Parser,+        module Hoogle.Query.Render, module Hoogle.Query.Suggest+    ) where++import Hoogle.Query.Type+import Hoogle.Query.Parser+import Hoogle.Query.Render+import Hoogle.Query.Suggest
+ src/Hoogle/Query/Parser.hs view
@@ -0,0 +1,99 @@++module Hoogle.Query.Parser(parseQuery, parseCmdLineQuery, parsecQuery) where++import General.Code hiding (merge,merges)+import Hoogle.Query.Type+import Hoogle.TypeSig.All+import Text.ParserCombinators.Parsec+++ascSymbols = "!#$%&*+./<=>?@\\^|-~"++parseQuery :: String -> Either ParseError Query+parseQuery input = parse parsecQuery "" input+++-- TODO: I don't think this handles spaces/quotes properly in the right+--       places.+parseCmdLineQuery :: [String] -> Either ParseError Query+parseCmdLineQuery args = parseQuery $ unwords $ map f args+    where+        f x | any isSpace x && ("--" `isPrefixOf` x || "/" `isPrefixOf` x) = "\"" ++ x ++ "\""+            | otherwise = x+++blank = Query [] [] Nothing [] []++merge (Query a1 b1 c1 d1 e1) (Query a2 b2 c2 d2 e2) =+        Query (a1++a2) (b1++b2) (c1 `mplus` c2) (d1++d2) (e1++e2)++merges xs = foldr merge blank xs+++parsecQuery :: Parser Query+parsecQuery = do spaces ; try (end names) <|> (end types)+    where+        end f = do x <- f; eof; return x+    +        names = do a <- many (flag <|> name)+                   b <- option blank (string "::" >> spaces >> types)+                   return (merge (merges a) b)+        +        name = (do x <- operator ; spaces ; return blank{names=[x]})+               <|>+               (do xs <- keyword `sepBy1` (char '.') ; spaces+                   return $ case xs of+                       [x] -> blank{names=[x]}+                       xs -> blank{names=[last xs],scope=[PlusModule (init xs)]}+               )+        +        operator = between (char '(') (char ')') op <|> op++        op = many1 $ satisfy (`elem` ascSymbols)+        +        types = do a <- flags+                   b <- parsecTypeSig+                   c <- flags+                   return $ merges [a,blank{typeSig=Just b},c]+        +        flag = do x <- parseFlagScope ; spaces ; return x+        flags = many flag >>= return . merges+                   +++-- deal with the parsing of:+--     --count=30+--     /module+--     /?  (special case)+--     +Data.Map+parseFlagScope :: Parser Query+parseFlagScope = do x <- try scope <|> flag+                    spaces+                    return x+    where+        -- --n=30, --count=30, /flag, --flag+        -- either a flag or an itemType+        flag = do string "--" <|> string "/"+                  name <- many1 letter <|> string "?"+                  extra <- (do char '='; flagExtra) <|> (return "")+                  return blank{flags=[Flag (map toLower name) extra]}+            where+                flagExtra = quoteStr <|> spaceStr+                quoteStr = between (char '\"') (char '\"') (many anyChar)+                spaceStr = manyTill anyChar ((space >> return ()) <|> eof)++        scope = do pm <- oneOf "+-"+                   let aPackage = if pm == '+' then PlusPackage else MinusPackage+                       aModule  = if pm == '+' then PlusModule  else MinusModule+                   modu <- modname+                   case modu of+                       [x] -> return $ blank{scope=[if isLower (head x) then aPackage x else aModule [x]]}+                       xs -> return $ blank{scope=[aModule xs]}++        modname = keyword `sepBy1` (char '.')+++keyword = do x <- letter+             xs <- many $ satisfy (\x -> isAlphaNum x || x == '_')+             return (x:xs)+
+ src/Hoogle/Query/Render.hs view
@@ -0,0 +1,36 @@++module Hoogle.Query.Render(renderQuery) where++import General.Code+import Data.TagStr+import Hoogle.Query.Type+import Hoogle.TypeSig.All+++renderQuery :: Query -> TagStr+renderQuery x = Tags $ namesig ++ scp ++ itms ++ flgs+    where+        namesig = case (null (names x), isNothing (typeSig x)) of+                      (True, True) -> []+                      (True, False) -> showType+                      (False, True) -> showName +                      _ -> showName ++ [Str " :: "] ++ showType+        +        showName = intersperse (Str " ") $ map (TagBold . Str) (names x)+        showType = Str (showConstraint con) :+                   intersperse (Str " -> ") +                       (zipWith TagColor [0..] (map (Str . show) finit) +++                        [Str (show flast)])+            where+                Just (TypeSig con args) = typeSig x+                (finit, flast) = (init funcs, last funcs)+                funcs = splitFun args+        +        scp = []+        itms = []+        +        +        flgs = concatMap (\x -> [Str " ", Str (f x)]) (flags x)+            where+                f (Flag name extra) = "/" ++ name ++ ['='|not $ null extra] ++ q ++ extra ++ q+                    where q = ['\"' | any isSpace extra]
+ src/Hoogle/Query/Suggest.hs view
@@ -0,0 +1,23 @@++module Hoogle.Query.Suggest(suggestQuery) where++import Data.TagStr+import General.Code+import Hoogle.DataBase.All+import Hoogle.Query.Type+++suggestQuery :: [DataBase] -> Query -> Maybe TagStr+suggestQuery db q | "google" `elem` map (map toLower) (names q) =+    Just $ Tags [TagHyperlink "http://www.google.com/" (Str "Google"), Str " rocks!"]++suggestQuery db q | any f (names q) = Just $ Str "Can't think of anything more interesting to search for?"+    where f x = length x == 6 && "oogle" `isSuffixOf` x++suggestQuery db q | isJust $ typeSig q =+    case suggestion db (fromJust $ typeSig q) of+        Nothing -> Nothing+        Just (Left s) -> Just $ Str s+        Just (Right t) -> Just $ Str $ "Did you mean: " ++ show t++suggestQuery db q = Nothing
+ src/Hoogle/Query/Type.hs view
@@ -0,0 +1,66 @@++module Hoogle.Query.Type where++import Data.Maybe+import Data.Char+import Data.Generics.UniplateOn++import General.Code+import Hoogle.TypeSig.All+++usefulQuery query = not (null (names query)) || isJust (typeSig query)+++defaultQuery = Query [] [] Nothing [] []++data Query = Query {+        scope :: [Scope],+        names :: [String],+        typeSig :: Maybe TypeSig,+        items :: [ItemType],+        flags :: [Flag]+    }+    deriving Show+++instance Eq Query where+    (Query a1 b1 c1 d1 e1) == (Query a2 b2 c2 d2 e2) =+        and [a1 `setEq` a2, b1 `setEq` b2, c1 == c2, d1 `setEq` d2, e1 `setEq` e2]+++data Scope = PlusPackage  String+           | MinusPackage String+           | PlusModule  [String]+           | MinusModule [String]+           deriving (Eq, Show, Read)++isPlusModule  (PlusModule  _) = True; isPlusModule  _ = False+isMinusModule (MinusModule _) = True; isMinusModule _ = False+++data ItemType = ItemModule+              | ItemType+              | ItemFunction+              | ItemClass+              deriving (Eq, Show, Read)++itemTypes =+    [(["module"], ItemModule)+    ,(["type","data"], ItemType)+    ,(["function","ctor","fun"], ItemFunction)+    ,(["class","instance"], ItemClass)+    ]+++-- primarily for consoles, but some work on the web search+-- first is the name, second is optional data+data Flag = Flag String String+            deriving (Eq, Show, Read)+++transformQueryType :: (Type -> Type) -> Query -> Query+transformQueryType f q = q{typeSig = maybe Nothing (Just . transformOn onTypeSig f) (typeSig q)}++universeQueryType :: Query -> [Type]+universeQueryType = maybe [] (universeOn onTypeSig) . typeSig
− src/Hoogle/Result.hs 
@@ -1,164 +0,0 @@-{-
-    This file is part of Hoogle, (c) Neil Mitchell 2004-2005
-    http://www.cs.york.ac.uk/~ndm/hoogle/
-    
-    This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License.
-    To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/2.0/
-    or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.
--}
-
-module Hoogle.Result where
-
-import Hoogle.TypeSig
-import Data.List
-
-
-type Score = Int
-
-data Result = Result {
-                  resultModule :: TagStr,
-                  resultName :: TagStr,
-                  resultType :: TagStr,
-                  resultMode :: String,
-                  resultInfo :: [Reason],
-                  resultScore :: Score,
-                  resultPriority :: Int
-                  }
-                  deriving Show
-
-
-instance Eq Result where
-    a == b = resultScore a == resultScore b && resultPriority a == resultPriority b
-
-instance Ord Result where
-    compare a b = compare (resultScore b, resultPriority b) (resultScore a, resultPriority a)
-
-
--- some typical tags
---  a, hyperlink
---  b, bold
---  u, underline
---  1-6, color 1-6
-
-
-data TagStr = Str String
-            | Tag String TagStr
-            | Tags [TagStr]
-              deriving Show
-
-
-data Reason = ReasonText TextAmount
-            | ReasonLeft MatchAmount
-            | ReasonRight MatchAmount
-            
-            
-
-
-instance Show Reason where
-    show (ReasonText x) = show x
-    show (ReasonLeft x) = 'L' : show x
-    show (ReasonRight x) = 'R' : show x
-    
-    showList [ReasonText x] = showString $ show x
-    showList xs = showString $ f 'L' left ++ g left right ++ f 'R' right
-        where
-            (left, right) = partition isLeft xs
-            
-            f pre [] = ""
-            f pre xs = pre : concatMap (tail . show) xs
-            
-            g (_:_) (_:_) = "."
-            g _ _ = ""
-            
-            isLeft (ReasonLeft _) = True
-            isLeft _ = False
-
-
-data TextAmount = TextFullCase
-                | TextFull
-                | TextPrefixCase
-                | TextPrefix
-                | TextSuffix
-                | TextSome
-                  deriving Show
-
-data MatchAmount = DataTooFree
-                 | DataTooSpecific
-                 | FreeDifferent
-                 | ClassMinor
-                 | ClassMajor
-                 | ArgExtra
-                 deriving (Bounded, Eq, Enum)
-
-instance Show MatchAmount where
-    show DataTooFree = "?"
-    show DataTooSpecific = "!"
-    show FreeDifferent = "*"
-    show ArgExtra = "#"
-    show ClassMinor = "c"
-    show ClassMajor = "C"
-
-
-showText :: TagStr -> String
-showText (Str x) = x
-showText (Tag n x) = showText x
-showText (Tags xs) = concatMap showText xs
-
-
-
-
-class Scoreable a where
-    score :: a -> Score
-
-instance Scoreable a => Scoreable [a] where
-    score xs = sum (map score xs)
-
-instance Scoreable Reason where
-    score (ReasonText  x) = score x
-    score x = 0 - scoreGenerated x
-    --score (ReasonLeft  x) = score x
-    --score (ReasonRight x) = score x
-    
-instance Scoreable TextAmount where
-    score TextFullCase = 6
-    score TextFull = 5
-    score TextPrefixCase = 4
-    score TextPrefix = 3
-    score TextSuffix = 2
-    score TextSome = 1
-
-instance Scoreable MatchAmount where
-    score FreeDifferent = -1
-    score ArgExtra = -2
-    score ClassMinor = -1
-    score ClassMajor = -10
-    score _ = -5
-
-
--- this function is based on data generated by Score
-scoreGenerated :: Reason -> Score
-scoreGenerated (ReasonLeft  DataTooFree    ) = 1
-scoreGenerated (ReasonLeft  DataTooSpecific) = 5
-scoreGenerated (ReasonLeft  FreeDifferent  ) = 9
-scoreGenerated (ReasonLeft  ClassMinor     ) = 2
-scoreGenerated (ReasonLeft  ClassMajor     ) = 9
-scoreGenerated (ReasonLeft  ArgExtra       ) = 2
-scoreGenerated (ReasonRight DataTooFree    ) = 6
-scoreGenerated (ReasonRight DataTooSpecific) = 16
-scoreGenerated (ReasonRight FreeDifferent  ) = 1
-scoreGenerated (ReasonRight ClassMinor     ) = 3
-scoreGenerated (ReasonRight ClassMajor     ) = 1
-scoreGenerated (ReasonRight ArgExtra       ) = 16
-
-
-showTypeTags :: ConType -> [Int] -> TagStr
-showTypeTags (con, typ) tags = Tags $ Str (showCon con) : f typ
-    where
-        f (TList (TLit "->":xs)) = intersperse (Str " -> ") $ zipWith g tags xs
-        f x = [Str $ showType typ]
-        
-        g 0 typ = Str $ showTypePrec 1 typ
-        g n typ = Tag (show n) (g 0 typ)
-
-
-
− src/Hoogle/Search.hs 
@@ -1,41 +0,0 @@-
-module Hoogle.Search(Search(..), SearchMode(..), parseSearch) where
-
-
-import Hoogle.TypeSig
-import Hoogle.TextUtil
-import Hoogle.Parser
-import Data.Char
-import Data.List
-
-
-data Search = Search String SearchMode
-              deriving Show
-
-
-data SearchMode = SearchName String
-                | SearchType ConType
-                | SearchError String
-                deriving Show
-
-
-parseSearch :: String -> Search
-parseSearch x = Search x $
-                if not (null x3) && isHaskellName x3
-                then SearchName x3
-                else case parseConType x2 of
-                         Right x -> SearchError x
-                         Left x -> SearchType x
-    where
-        x2 = trim x
-        x3 = trimBrackets x2
-
-
-trimBrackets =
-    (\x -> if "(" `isPrefixOf` x then tail x else x) .
-    (\x -> if ")" `isSuffixOf` x then init x else x)
-
-
-isHaskellName :: String -> Bool
-isHaskellName (x:xs) | isAlpha x && all (\a -> isAlphaNum a || a `elem` "_'") xs = True
-isHaskellName xs = all (`elem` "!#$%&*+./<>=?@/^|-~") xs
+ src/Hoogle/Search/All.hs view
@@ -0,0 +1,41 @@++module Hoogle.Search.All(+    Result(..), renderResult,+    searchAll, searchRange+    ) where++import Data.Maybe+import Data.Range++import Hoogle.DataBase.All+import Hoogle.Query.All+import Hoogle.Search.Result+import Hoogle.Search.Results+import Hoogle.TypeSig.All+++-- return all the results+searchAll :: [DataBase] -> Query -> [Result]+searchAll databases query = getResults query databases+++-- should be possible to fast-path certain searches, currently not done+searchRange :: Range -> [DataBase] -> Query -> [Result]+searchRange r databases query = listRange r $ getResults query databases+++getResults :: Query -> [DataBase] -> [Result]+getResults query = mergeDataBaseResults . map (mergeQueryResults query . f)+    where+        f d = [typeSearch d q | Just q <- [typeSig query]] +++              map (nameSearch d) (names query)+++nameSearch :: DataBase -> String -> [Result]+nameSearch db query = [Result e [v] [TextScore s]+                      | (e,v,s) <- searchName db query]+++typeSearch :: DataBase -> TypeSig -> [Result]+typeSearch db query = [Result e v [TypeScore s]+                      | (e,v,s) <- searchType db query]
+ src/Hoogle/Search/Result.hs view
@@ -0,0 +1,36 @@++module Hoogle.Search.Result where++import General.Code+import Data.TagStr+import Hoogle.DataBase.All+import Hoogle.Item.All+import Data.Binary.Defer.Index+++data Result = Result+    {resultEntry :: Link Entry+    ,resultView :: [EntryView]+    ,resultScore :: [Score]+    }+    deriving Show++-- TypeScore must be less than TextScore+-- so that when name :: type is searched, type takes preference+data Score = TypeScore TypeScore+           | TextScore TextScore+             deriving (Eq,Ord)++instance Show Score where+    showList xs = showString $ concat $ intersperse " & " $ map show xs+    show (TypeScore x) = show x+    show (TextScore x) = show x+++-- return (module it is in, the text to go beside it, verbose scoring info)+renderResult :: Result -> (Maybe [String], TagStr, String)+renderResult r = (if entryType e == EntryModule then Nothing+                  else liftM (moduleName . fromLink) $ entryModule e+                 ,renderEntryText (resultView r) $ entryText e+                 ,show $ resultScore r)+    where e = fromLink $ resultEntry r
+ src/Hoogle/Search/Results.hs view
@@ -0,0 +1,88 @@++module Hoogle.Search.Results(+    mergeDataBaseResults, mergeQueryResults+    ) where++import General.Code+import Data.Key+import qualified Data.IntMap as IntMap+import Data.Binary.Defer.Index++import Hoogle.Item.All+import Hoogle.DataBase.All+import Hoogle.Query.All+import Hoogle.Search.Result+++---------------------------------------------------------------------+-- MERGE DATABASE++mergeDataBaseResults :: [[Result]] -> [Result]+mergeDataBaseResults = map fromKey . fold [] merge . map (map $ toKey f)+    where f r = (resultScore r, entryScore $ fromLink $ resultEntry r)+++entryScoreModule :: Maybe Module -> Entry -> EntryScore+entryScoreModule mod e = EntryScore+    (length m) (map toLower $ entryName e) (entryName e) m+    where m = maybe [] moduleName mod+++---------------------------------------------------------------------+-- MERGE QUERY++-- each query is correct, elements can be ordered by entry Id+mergeQueryResults :: Query -> [[Result]] -> [Result]+mergeQueryResults q = filterResults q . joinResults+++-- join the results of multiple searches+joinResults :: [[Result]] -> [Result]+joinResults [] = []+joinResults [x] = x+joinResults xs = sortWith scr $ IntMap.elems $+                 fold1 (IntMap.intersectionWith join) $+                 map asSet xs+    where+        asSet = IntMap.fromList . map (linkKey . resultEntry &&& id)++        join r1 r2 = r1{resultScore = sort $ resultScore r1 ++ resultScore r2+                       ,resultView = resultView r1 ++ resultView r2}++        scr = resultScore &&& linkKey . resultEntry+++---------------------------------------------------------------------+-- FILTER++-- | Apply the PlusModule, MinusModule and MinusPackage modes+filterResults :: Query -> [Result] -> [Result]+filterResults q = f mods correctModule . f pkgs correctPackage+    where+        f [] act = id+        f xs act = filter (maybe True (act xs . fromLink) . entryModule . fromLink . resultEntry)++        mods = filter (\x -> isPlusModule x || isMinusModule x) $ scope q+        pkgs = [x | MinusPackage x <- scope q]+++-- pkgs is a non-empty list of MinusPackage values+correctPackage :: [String] -> Module -> Bool+correctPackage pkgs = (`notElem` pkgs) . packageName . fromLink . modulePackage+++-- mods is a non-empty list of PlusModule/MinusModule+correctModule :: [Scope] -> Module -> Bool+correctModule mods = f base mods . moduleName+    where+        base = isMinusModule $ head mods++        f z [] y = z+        f z (PlusModule  x:xs) y | doesMatch x y = f True  xs y+        f z (MinusModule x:xs) y | doesMatch x y = f False xs y+        f z (x:xs) y = f z xs y++        -- match if x is further up the tree than y+        doesMatch [] y = True+        doesMatch (x:xs) (y:ys) = x == y && doesMatch xs ys+        doesMatch _ _ = False
+ src/Hoogle/TextBase/All.hs view
@@ -0,0 +1,7 @@++module Hoogle.TextBase.All (+        module Hoogle.TextBase.Type, module Hoogle.TextBase.Parser+    ) where++import Hoogle.TextBase.Type+import Hoogle.TextBase.Parser
+ src/Hoogle/TextBase/Parser.hs view
@@ -0,0 +1,91 @@++module Hoogle.TextBase.Parser(parseTextBase,parseTextBaseString) where++import General.Code+import Hoogle.TextBase.Type+import Hoogle.TypeSig.All+import Text.ParserCombinators.Parsec+import Text.ParserCombinators.Parsec.Error+++parseTextBase :: FilePath -> IO (Either ParseError TextBase)+parseTextBase file = do+    src <- readFile file+    return $ parseTextItems file src+++parseTextBaseString :: String -> Either ParseError TextBase+parseTextBaseString = parseTextItems ""+++parseTextItems :: FilePath -> String -> Either ParseError TextBase+parseTextItems file = join . f [] . zip [1..] . lines+    where+        f com [] = []+        f com ((i,s):is)+            | "-- | " `isPrefixOf` s = f [drop 5 s] is+            | "--   " `isPrefixOf` s && com /= [] = f (drop 5 s:com) is+            | "-- " `isPrefixOf` s = f [] is+            | all isSpace s = f [] is+            | otherwise = (case parse parsecTextItem file s of+                               Left y -> Left $ setErrorPos (setSourceLine (errorPos y) i) y+                               Right y -> Right [(y, unlines $ reverse com)])+                          : f [] is++        join xs | null err = Right $ concat items+                | otherwise = Left $ head err+            where (err,items) = unzipEithers xs+++isTextItem :: String -> Bool+isTextItem x = not $ null x2 || "--" `isPrefixOf` x2+    where x2 = dropWhile isSpace x+++parsecTextItem :: Parser TextItem+parsecTextItem = attribute <|> item+    where+        attribute = do x <- try (char '@' >> satisfy isAlpha)+                       xs <- many (satisfy isAlpha)+                       spaces+                       ys <- many (noneOf "\n")+                       return $ ItemAttribute (x:xs) ys++        item = modu <|> clas <|> inst <|> newtyp <|> typ <|> dat <|> func+        +        begin x = try (string x >> many1 space)++        modu = begin "module" >> liftM ItemModule (keyword `sepBy1` char '.')+        clas = begin "class" >> liftM ItemClass parsecTypeSig+        inst = begin "instance" >> liftM ItemInstance parsecTypeSig+        +        typ = do begin "type"+                 a <- parsecTypeSig+                 char '='+                 b <- parsecTypeSig+                 return $ ItemAlias a b+        +        newtyp = begin "newtype" >> dataAny NewTypeKeyword+        dat = begin "data" >> dataAny DataKeyword+        +        dataAny d = liftM (ItemData d) parsecTypeSig++        +        func = do name <- rounds <|> keysymbol <|> keyword <|> string "[]"+                  spaces+                  string "::"+                  spaces+                  typ <- parsecTypeSig+                  return $ ItemFunc name typ++        -- handle both () and (op)+        rounds = char '(' >>+            ((do x <- keysymbol ; char ')' ; return x) <|>+             (do char ')'; return "()"))++        keysymbol = many1 $ satisfy (\x -> isSymbol x || x `elem` ascSymbol)+        ascSymbol = "!#$%&*+./<=>?@\\^|-~:"++        keyword = do x <- letter+                     xs <- many $ satisfy (\x -> isAlphaNum x || x `elem` "_'#")+                     return (x:xs)
+ src/Hoogle/TextBase/Type.hs view
@@ -0,0 +1,26 @@++module Hoogle.TextBase.Type where++import Hoogle.TypeSig.All+++-- (the item, any haddock documentation)+type TextBase = [(TextItem,String)]++data TextItem = ItemModule [String]+              | ItemClass TypeSig+              | ItemFunc String TypeSig+              | ItemAlias TypeSig TypeSig+              | ItemData DataKeyword TypeSig+              | ItemInstance TypeSig+              | ItemAttribute String String+              deriving (Show,Eq)+++data DataKeyword = NewTypeKeyword+                 | DataKeyword+                 deriving Eq++instance Show DataKeyword where+    show NewTypeKeyword = "newtype"+    show DataKeyword = "data"
− src/Hoogle/TextUtil.hs 
@@ -1,121 +0,0 @@-{-
-    This file is part of Hoogle, (c) Neil Mitchell 2004-2005
-    http://www.cs.york.ac.uk/~ndm/hoogle/
-    
-    This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License.
-    To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/2.0/
-    or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.
--}
-
-{-|
-    General text utility functions
--}
-
-module Hoogle.TextUtil where
-
-import Prelude
-import Data.Maybe
-import Data.Char
-import Data.List
-
-
-trim :: String -> String
-trim = trimLeft . trimRight
-trimLeft = dropWhile isSpace
-trimRight = reverse . trimLeft . reverse
-
-
-isSubstrOf :: Eq a => [a] -> [a] -> Bool
-isSubstrOf find list = any (isPrefixOf find) (tails list)
-
-
-splitList :: Eq a => [a] -> [a] -> [[a]]
-splitList find str = if isJust q then a : splitList find b else [str]
-    where
-        q = splitPair find str
-        Just (a, b) = q
-
-
-splitPair :: Eq a => [a] -> [a] -> Maybe ([a], [a])
-splitPair find str = f str
-    where
-        f [] = Nothing
-        f x  | isPrefixOf find x = Just ([], drop (length find) x)
-             | otherwise = if isJust q then Just (head x:a, b) else Nothing
-                where
-                    q = f (tail x)
-                    Just (a, b) = q
-
-
-indexOf find str = length $ takeWhile (not . isPrefixOf (lcase find)) (tails (lcase str))
-
-
-lcase = map toLower
-ucase = map toUpper
-
-
-replace find with [] = []
-replace find with str | find `isPrefixOf` str = with ++ replace find with (drop (length find) str)
-                      | otherwise = head str : replace find with (tail str)
-
-
-
-
--- 0 based return
-findNext :: Eq a => [[a]] -> [a] -> Maybe Int
-findNext finds str = if null maxs then Nothing else Just (fst (head (sortBy compSnd maxs)))
-    where
-        maxs = mapMaybe f (zip [0..] finds)
-        
-        f (id, find) = if isJust q then Just (id, length (fst (fromJust q))) else Nothing
-            where q = splitPair find str
-        
-        compSnd (_, a) (_, b) = compare a b
-
-
--- bracketing...
-
-data Bracket = Bracket (Char, Char) [Bracket]
-             | UnBracket String
-             deriving (Show)
-
-data PartBracket = PBracket [PartBracket]
-                 | PUnBracket Char
-                 deriving (Show)
-
-
-bracketWith :: Char -> Char -> Bracket -> Bracket
-bracketWith strt stop (Bracket x y) = Bracket x (map (bracketWith strt stop) y)
-bracketWith strt stop (UnBracket x) = bracketString strt stop x
-
-
-bracketString :: Char -> Char -> String -> Bracket
-bracketString strt stop y = Bracket (strt, stop) (g "" res)
-    where
-        (a, b) = bracketPartial strt stop y
-        res = a ++ (map PUnBracket b)
-        
-        g c (PBracket x:xs  ) = deal c ++ Bracket (strt, stop) (g "" x) : g "" xs
-        g c (PUnBracket x:xs) = g (x:c) xs
-        g c []                = deal c
-        
-        deal [] = []
-        deal x  = [UnBracket (reverse x)]
-        
-
-
-bracketPartial :: Char -> Char -> String -> ([PartBracket], String)
-bracketPartial strt stop y = f y
-    where
-        
-        f [] = ([], "")
-        
-        f (x:xs) | x == strt = (PBracket a : c, d)
-                                 where
-                                    (a, b) = bracketPartial strt stop xs
-                                    (c, d) = f b
-
-        f (x:xs) | x == stop = ([], xs)
-        
-        f (x:xs) | otherwise = (PUnBracket x : a, b)
-                                  where (a, b) = f xs
− src/Hoogle/TypeAlias.hs 
@@ -1,75 +0,0 @@-{-
-    This file is part of Hoogle, (c) Neil Mitchell 2004-2005
-    http://www.cs.york.ac.uk/~ndm/hoogle/
-    
-    This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License.
-    To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/2.0/
-    or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.
--}
-
-{-|
-    Deal with type aliases, i.e. type String = [Char]
--}
-
-module Hoogle.TypeAlias(
-    AliasTable,
-    buildAlias,
-    lookupAlias,
-    showAliasTable
-    ) where
-
-import Hoogle.TypeSig
-
-import qualified Data.Map as Map
-import Data.Maybe
-
-
--- | Alias is a string, being the name of the constructor
---   the number of arguments it takes, and the resulting type
---   TNum is used for replacement positions
-data AliasTable = AliasTable (Map.Map String (Int, Type))
-                  deriving Show
-
-
--- | Given a list of aliases, build an alias table
---   All members of Item must be TypeAlias
-buildAlias :: [Item] -> AliasTable
-buildAlias xs = {- AliasTable $ Map.fromList $ -} fixpAlias $ map f xs
-    where
-        f (TypeAlias name args ([], typ)) =
-            (name, (length args, mapUnbound (g (zip args [0..])) typ))
-
-        g lst name = case lookup name lst of
-                        Just n -> TNum n
-                        Nothing -> TVar name
-
-
--- yay for circular programming
--- boo for possible non-termination
-fixpAlias :: [(String, (Int, Type))] -> AliasTable
-fixpAlias x = map2
-    where
-        map2 = AliasTable $ Map.map (\(a,b) -> (a, lookupAlias map2 b)) map1
-        map1 = Map.fromList x
-
-
--- | Given a type, follow all aliases to find the ultimate one
-lookupAlias :: AliasTable -> Type -> Type
-lookupAlias (AliasTable table) (TLit x) = typ
-    where (0, typ) = Map.findWithDefault (0, TLit x) x table
-    
-lookupAlias a@(AliasTable table) (TList (TLit x:xs)) = if isJust res then some else none
-    where
-        res = Map.lookup x table
-        none = TList (TLit x : map (lookupAlias a) xs)
-        Just (n, typ) = res
-        some = if n == length xs
-               then mapNumber (xs !!) typ
-               else error "lookupAlias: mismatch"
-
-lookupAlias _ x = x
-
-showAliasTable :: AliasTable -> String
-showAliasTable (AliasTable x) = unlines $ map showAlias (Map.toList x)
-
-showAlias (name, (args, typ)) = "type " ++ name ++ "[" ++ show args ++ "] = " ++ show typ
− src/Hoogle/TypeSig.hs 
@@ -1,132 +0,0 @@-{-
-    This file is part of Hoogle, (c) Neil Mitchell 2004-2005
-    http://www.cs.york.ac.uk/~ndm/hoogle/
-    
-    This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License.
-    To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/2.0/
-    or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.
--}
-
-{-|
-    Data structures for each of the type signatures
--}
-
-module Hoogle.TypeSig where
-
-import Data.List
-
-
-
-type ModuleName = [String]
-
-data Item = Module ModuleName
-          | Class {typ :: ConType}
-          | Func {name :: String, typ :: ConType}
-          | TypeAlias {name :: String, args :: [String], typ :: ConType}
-          | Data {new :: Bool, typ :: ConType}
-          | Instance {typ :: ConType}
-          | Keyword {name :: String}
-
-
-instance Show Item where
-    show (Module x) = "module " ++ concat (intersperse "." x)
-    show (Class typ) = "class " ++ showConType typ
-    show (Func name typ) = name ++ " :: " ++ showConType typ
-    show (TypeAlias name args typ) = name ++ concatMap (' ':) args ++ " = " ++ showConType typ
-    show (Data new typ) = (if new then "newtype" else "data") ++ " " ++ showConType typ
-    show (Instance typ) = "instance " ++ showConType typ
-    show (Keyword name) = "keyword " ++ name
-          
-
-
-isTypeAlias (TypeAlias{}) = True; isTypeAlias _ = False
-isInstance  (Instance {}) = True; isInstance  _ = False
-isFunc      (Func     {}) = True; isFunc      _ = False
-
-
-asString :: Item -> String
-asString (Module x) = concat $ intersperse "." x
-asString (Func {name=x}) = x
-asString (TypeAlias {name=x}) = x
-asString (Data {typ=(_,x)}) = typeName x
-asString (Class {typ=(_,x)}) = typeName x
-asString (Keyword {name=x}) = x
-
-
-asType :: Item -> String
-asType (Module x) = "module"
-asType x = showConType $ typ x
-
-
-typeName :: Type -> String
-typeName (TList (x:xs)) = typeName x
-typeName (TLit x) = x
-
-
-type ConType = (Constraint, Type)
-
-
-type Constraint = [Type]
-
-
-data Type = TList [Type] -- a list of types, first one being the constructor
-          | TLit String -- bound variables, Maybe, ":", "," (tuple), "->" (function)
-          | TVar String -- unbound variables, "a"
-          | TNum Int -- a point to a number
-          deriving (Show, Eq)
-          
-
-isTVar (TVar _) = True
-isTVar _ = False
-
-
-allTVar :: Type -> [String]
-allTVar x = nub $ f x
-    where
-        f (TList xs) = concatMap f xs
-        f (TVar  xs) = [xs]
-        f _          = []
-
-          
-mapUnbound :: (String -> Type) -> Type -> Type
-mapUnbound f (TList xs) = TList (map (mapUnbound f) xs)
-mapUnbound f (TVar  x ) = f x
-mapUnbound f x          = x
-
-mapNumber :: (Int -> Type) -> Type -> Type
-mapNumber f (TList xs) = TList (map (mapNumber f) xs)
-mapNumber f (TNum  x ) = f x
-mapNumber f x          = x
-
-
-showCon :: Constraint -> String
-showCon []  = ""
-showCon [c] = showType c ++ " => "
-showCon cs  = "(" ++ concat (intersperse ", " (map showType cs)) ++ ") => "
-
-
-showConType :: ConType -> String
-showConType (c, x) = showCon c ++ showType x
-
-
-showModuleName :: ModuleName -> String
-showModuleName x = concat $ intersperse "." x
-
-
-showType :: Type -> String
-showType = showTypePrec 0
-
-showTypePrec :: Int -> Type -> String
-showTypePrec _ (TLit x) = x
-showTypePrec _ (TVar x) = x
-showTypePrec _ (TNum x) = show x
-showTypePrec p (TList (x:xs)) = case x of
-        TLit "[]" -> "[" ++ showTypePrec 0 (head xs) ++ "]"
-        TLit ","  -> showTypeList True  ", "   0 xs
-        TLit "->" -> showTypeList (p>0) " -> " 1 xs
-        _         -> showTypeList (p>1) " "    2 (x:xs)
-    where
-        showTypeList p mid nxt xs = parens p $ concat $ intersperse mid $ map (showTypePrec nxt) xs
-        parens True  x = "(" ++ x ++ ")"
-        parens False x = x
-
+ src/Hoogle/TypeSig/All.hs view
@@ -0,0 +1,7 @@++module Hoogle.TypeSig.All (+        module Hoogle.TypeSig.Type, module Hoogle.TypeSig.Parser+    ) where++import Hoogle.TypeSig.Type+import Hoogle.TypeSig.Parser
+ src/Hoogle/TypeSig/Parser.hs view
@@ -0,0 +1,106 @@++module Hoogle.TypeSig.Parser(parsecTypeSig, parseTypeSig) where++import Hoogle.TypeSig.Type+import Text.ParserCombinators.Parsec+import General.Code+++parseTypeSig :: String -> Either ParseError TypeSig+parseTypeSig input = parse (do x <- parsecTypeSig ; eof ; return x) "" input+++parsecTypeSig :: Parser TypeSig+parsecTypeSig = do whites+                   c <- context+                   t <- typ0+                   return $ normaliseTypeSig $ TypeSig c t+    where+        -- all the parser must swallow up all trailing white space after them+        context = try acontext <|> return []+        +        acontext = do x <- conitems <|> (conitem >>= return . (:[]))+                      white $ string "=>"+                      return x+        +        conitems = between (wchar '(') (wchar ')') $ conitem `sepBy1` (wchar ',')+        conitem = typ1+        +    +        typ0 = function+        typ1 = application+        typ2 = forAll <|> tuple <|> list <|> atom <|> bang++        bang = wchar '!' >> typ2+        +        forAll = do try (white $ string "forall")+                    many atom+                    wchar '.'+                    TypeSig con typ <- parsecTypeSig+                    return typ+++        -- match (a,b) and (,)+        -- also pick up ( -> )+        tuple = do char '('+                   hash <- optionBool $ char '#'+                   let close = white $ string $ ['#'|hash] ++ ")"+                   whites +                   (do wchar ','+                       xs <- many $ wchar ','+                       close+                       return $ tLit hash (length xs + 1)+                    ) <|>+                    (do sym <- white $ keysymbol+                        close+                        return $ TLit sym+                    ) <|>+                    (do xs <- typ0 `sepBy` wchar ','+                        close+                        return $ case xs of+                            [] -> TLit "()"+                            [x] -> x+                            xs -> TApp (tLit hash $ length xs - 1) xs+                    )+            where+                tLit hash n = TLit $ "(" ++ h ++ replicate n ',' ++ h ++ ")"+                    where h = ['#'|hash]+            +            +        atom = do x <- satisfy isAlpha+                  xs <- many $ satisfy (\x -> isAlphaNum x || x `elem` "_'#")+                  whites+                  return $ (if isLower x then TVar else TLit) (x:xs)++        -- may be [a], or [] (then application takes the a after it)+        list = do char '['+                  colon <- optionBool $ char ':'+                  spaces+                  let close = white $ string $ [':'|colon] ++ "]"+                      lit = TLit $ if colon then "[::]" else "[]"+                  (close >> return lit) <|> (do+                      x <- typ0+                      close+                      return $ TApp lit [x])++        application = do (x:xs) <- many1 (white typ2)+                         return $ TApp x xs++        function = do lhs <- typ1+                      (do op <- white keysymbol; rhs <- function; return $ TApp (TLit op) [lhs,rhs])+                          <|> return lhs++        wchar c = white $ char c+        white x = do y <- x ; whites ; return y++        whites = many whiteChar+        whiteChar = oneOf " \v\f\t\r"++        keysymbol = try $ do+            x <- many1 $ satisfy (\x -> isSymbol x || x `elem` ascSymbol)+            if x `elem` ["::","=>",".","=","#",":","-","+","/"] then fail "Bad symbol" else+                return $ if x == "-#" then "->" else x+        ascSymbol = "!#$%&*+./<=>?@\\^|-~:"+++optionBool p = (p >> return True) <|> return False
+ src/Hoogle/TypeSig/Type.hs view
@@ -0,0 +1,185 @@++module Hoogle.TypeSig.Type where++import Data.Binary.Defer+import Data.List+import Data.Generics.UniplateOn+++---------------------------------------------------------------------+-- DATA TYPE WITH CONTEXT+++-- FULL TYPE+data TypeSig = TypeSig Constraint Type+               deriving (Eq,Ord)++type Constraint = [Type]+++-- CONSTRICTED TYPE+-- first argument is a list of contexts, (Context,Variable)+type TypeContext = [(String,String)]+data TypeSimp = TypeSimp TypeContext Type+                deriving (Eq,Ord)++instance Show TypeSimp where+    show (TypeSimp c t) = show $ TypeSig [TApp (TLit a) [TVar b] | (a,b) <- c] t+++---------------------------------------------------------------------+-- DATA TYPES++-- TODO: Add TForAll and treat it properly throughout+--       Add TBang to handle bangs properly+data Type = TApp Type [Type] -- a list of types, first one being the constructor+          | TLit String -- bound variables, Maybe, ":", "(,)", "(,,)" (tuple)+          | TVar String -- unbound variables, "a"+          | TFun [Type]+          deriving (Eq,Ord)+++tApp :: Type -> [Type] -> Type+tApp t [] = t+tApp t ts = TApp t ts+++fromTFun :: Type -> [Type]+fromTFun (TFun x) = x+fromTFun x = [x]+++isTLit, isTVar :: Type -> Bool+isTLit TLit{} = True; isTLit _ = False+isTVar TVar{} = True; isTVar _ = False+++fromTApp :: Type -> (Type, [Type])+fromTApp (TApp x y) = (x,y)+fromTApp x = (x,[])+++isTLitTuple :: String -> Bool+isTLitTuple x = ',' `elem` x+++insertTApp, removeTApp :: Type -> Type+insertTApp = transform f+    where+        f (TApp (TApp x []) y) = TApp x y+        f (TApp x y) = TApp x y+        f (TFun x) = TFun x+        f x = TApp x []++removeTApp = transform f+    where+        f (TApp x []) = x+        f x = x+++---------------------------------------------------------------------+-- UNIPLATE INSTANCES++onTypeSig :: BiplateType TypeSig Type+onTypeSig (TypeSig xs x) = (x:xs, \(x:xs) -> TypeSig xs x)++instance Uniplate Type where+    uniplate (TApp x xs) = (x:xs, \(x:xs) -> TApp x xs)+    uniplate (TFun xs) = (xs, \xs -> TFun xs)+    uniplate x = ([], \[] -> x)++variables :: Type -> [String]+variables x = [v | TVar v <- universe x]+++---------------------------------------------------------------------+-- BINARYDEFER INSTANCES++instance BinaryDefer TypeSig where+    put (TypeSig a b) = put2 a b+    get = get2 TypeSig++instance BinaryDefer Type where+    put (TApp a b) = putByte 0 >> put2 a b+    put (TLit a)   = putByte 1 >> put1 a+    put (TVar a)   = putByte 2 >> put1 a+    put (TFun a)   = putByte 3 >> put1 a++    get = do+        i <- getByte+        case i of+            0 -> get2 TApp+            1 -> get1 TLit+            2 -> get1 TVar+            3 -> get1 TFun+++---------------------------------------------------------------------+-- SHOW INSTANCES++showConstraint :: Constraint -> String+showConstraint [] = ""+showConstraint [x] = show x ++ " => "+showConstraint xs = "(" ++ concat (intersperse ", " $ map show xs) ++ ") => "+++-- TODO: show (TLit ":+:") should be "(:+:)"+instance Show Type where+    showsPrec i x = showString $ f i x+        where+            f i (TApp (TLit "[]") [x]) = "[" ++ show x ++ "]"+            f i (TApp (TLit ('(':tup)) xs)+                | not (null tup) && last tup == ')' && all (== ',') (init tup) && length tup == length xs+                = b True $ concat $ intersperse ", " $ map show xs+            +            f i (TLit x) = x+            f i (TVar x) = x+            +            f i (TApp x xs) = b (i > 1) $ concat (intersperse " " $ map (f 2) (x:xs))+            f i (TFun xs)   = b (i > 0) $ concat (intersperse " -> " $ map (f 1) xs)+            +            b True x = "(" ++ x ++ ")"+            b False x = x+++instance Show TypeSig where+    show (TypeSig x xs) = showConstraint x ++ show xs+++-- shows an element within a function+-- to get brackets right after splitFun+showFun :: Type -> String+showFun x = showsPrec 1 x ""+++---------------------------------------------------------------------+-- OPERATIONS++normaliseTypeSig :: TypeSig -> TypeSig+normaliseTypeSig = transformOn onTypeSig normaliseType+++normaliseType :: Type -> Type+normaliseType = transform f+    where+        f (TApp x []) = x+        f (TApp (TLit "->") xs) = f $ TFun xs+        f (TFun [x]) = x+        f (TFun xs) = TFun $ g xs+        f x = x++        g [] = []+        g [TFun xs] = g xs+        g (x:xs) = x : g xs+++splitFun :: Type -> [Type]+splitFun (TFun xs) = xs+splitFun x = [x]+++renameVars :: (String -> String) -> TypeSig -> TypeSig+renameVars f = transformOn onTypeSig g+    where+        g (TVar x) = TVar $ f x+        g x = x
+ src/Main.hs view
@@ -0,0 +1,106 @@++module Main where++import CmdLine.All+import Web.All+++main :: IO ()+main = do+    q <- cmdQuery+    if queryWeb q+        then actionWeb q+        else actionCmdLine q+++{-++++exec :: Origin -> Query -> IO ()++exec CmdLine q | not $ usefulQuery q = putStr $ "No query given\n" ++ helpMsg++exec CmdLine q = do+    checkFlags q (fColor ++ fDatabase ++ fStart ++ fCount ++ fDocs ++ fInfo)+    databases <- collectDataBases q+    res <- searcher databases+    if null res then putStrLn "No results found" else do+    +        when showInfo $ do+            putStrLn $ showTags $ renderResult $ head res+            putStrLn ""+            docs <- loadDocs $ itemResult $ head res+            case docs of+                Nothing -> putStrLn "No info on this item"+                Just x -> putStr $ showTags $ renderDocs x+        +        when (showInfo && showDocs) $ putStrLn ""+        when showDocs $ putStrLn $ fromMaybe "No documentation" $ locateWebDocs $ itemResult $ head res+        +        when (not (showDocs || showInfo)) $+            putStr $ unlines $ map (showTags . renderResult) res+    where+        showDocs = hasFlag q fDocs+        showInfo = hasFlag q fInfo+    +        showTags = if hasFlag q fColor then showTagConsole else showTag+        +        searcher dbs | isJust start || isJust count+                     = searchRange dbs q (fromMaybe 1 start - 1) (fromMaybe 25 count)+                     | otherwise = searchAll dbs q+        +        start = getPosIntFlag fStart+        count = getPosIntFlag fCount+        +        getPosIntFlag flags =+            case getFlag q flags of+                Nothing -> Nothing+                Just x ->+                    case (reads x :: [(Int,String)]) of+                        [(n,"")] | n > 0 -> Just n+                        _ -> Nothing+- }++{ - RULES+For each /db=... flag, it must be either a file (load it) or a folder (look for +packages in it)+If always check the current directory if all /db directives fail+If no /db files and no +packages then default to +base+- }+collectDataBases :: Query -> IO [DataBase]+collectDataBases q =  do+    (files,dirs) <- f (getFlags q fDatabase)+    let packs = [x | PlusPackage x <- scope q]+    files2 <- mapM (g (dirs++[""])) (if null packs && null files then ["base"] else packs)+    res <- mapM h (files ++ catMaybes files2)+    return $ catMaybes res+    where+        f :: [FilePath] -> IO ([FilePath],[FilePath])+        f [] = return ([], [])+        f (x:xs) = do+            bfile <- doesFileExist x+            bdir <- doesDirectoryExist x+            if not (bfile || bdir)+                then do+                    putStrLn $ "Warning, database not found: " ++ x+                    f xs+                else do+                    (a,b) <- f xs+                    return ([x|bfile]++a, [x|not bfile]++b)++        -- maybe return an item+        g :: [FilePath] -> String -> IO (Maybe FilePath)+        g (x:xs) y = do+            let file = x </> y <.> "hoo"+            b <- doesFileExist file+            if b then return $ Just file+                 else g xs y+        g [] y = do+            putStrLn $ "Warning, failed to find package " ++ y+            return Nothing++        h file = do+            db <- loadDataBase file+            when (isNothing db) $ putStrLn $ "Failed to load database, " ++ file+            return db+-}
+ src/Test/All.hs view
@@ -0,0 +1,13 @@++module Test.All(test) where++import Test.Parse_TypeSig+import Test.Parse_Query+import Test.Parse_TextBase+++test :: IO ()+test = print $ do+    parse_TypeSig+    parse_Query+    parse_TextBase
+ src/Test/General.hs view
@@ -0,0 +1,40 @@+{-# OPTIONS_GHC -fno-warn-missing-methods #-}++module Test.General where+++---------------------------------------------------------------------+-- The Test Monad++data Test a = Test++instance Monad Test where+    a >> b = a `seq` b++instance Show (Test a) where+    show x = x `seq` "All tests passed"++pass :: Test ()+pass = Test+++parseTest f input output =+    case f input of+        Left x -> err "Parse failed" (show x)+        Right x -> if x == output then pass else+                   err "Parse not equal" (show x)+    where+        err pre post = error $ pre ++ ":\n  " ++ input ++ "\n  " ++ show output ++ "\n  " ++ post+++---------------------------------------------------------------------+-- The List Monad++data List a b = List {fromList :: [a]}++instance Monad (List a) where+    List a >> List b = List (a++b)++pair :: a -> b -> List (a,b) c+pair a b = List [(a,b)]+
+ src/Test/Parse_Query.hs view
@@ -0,0 +1,25 @@++module Test.Parse_Query(parse_Query) where++import Test.General+import Hoogle.Query.All+import Hoogle.TypeSig.All++parse_Query = do+    let (===) = parseTest parseQuery++    "/info" === defaultQuery{flags = [Flag "info" ""]}+    "/?" === defaultQuery{flags = [Flag "?" ""]}+    "/count=10" === defaultQuery{flags = [Flag "count" "10"]}+    "map" === defaultQuery{names = ["map"]}+    "concat map" === defaultQuery{names = ["concat","map"]}+    "a -> b" === defaultQuery{typeSig = Just (TypeSig [] (TFun [TVar "a",TVar "b"]))}+    "(a b)" === defaultQuery{typeSig = Just (TypeSig [] (TApp (TVar "a") [TVar "b"]))}+    "map :: a -> b" === defaultQuery{names = ["map"], typeSig = Just (TypeSig [] (TFun [TVar "a",TVar "b"]))}+    "+Data.Map map" === defaultQuery{scope = [PlusModule ["Data","Map"]], names = ["map"]}+    "a -> b +foo" === defaultQuery{scope = [PlusPackage "foo"], typeSig = Just (TypeSig [] (TFun [TVar "a",TVar "b"]))}+    "a -> b /foo" === defaultQuery{flags = [Flag "foo" ""], typeSig = Just (TypeSig [] (TFun [TVar "a",TVar "b"]))}+    "Data.Map.map" === defaultQuery{scope = [PlusModule ["Data","Map"]], names = ["map"]}+    "[a]" === defaultQuery{typeSig = Just (TypeSig [] (TApp (TLit "[]") [TVar "a"]))}+    "++" === defaultQuery{names = ["++"]}+    "(++)" === defaultQuery{names = ["++"]}
+ src/Test/Parse_TextBase.hs view
@@ -0,0 +1,50 @@++module Test.Parse_TextBase(parse_TextBase) where++import Test.General+import Hoogle.TextBase.All+import Hoogle.TypeSig.All+++typ x = case parseTypeSig x of+            Left err -> error $ "parse_TextBase, failed to parse type signature: " ++ show x+            Right y -> y++parse_TextBase = do+    let (===) a b = parseTest parseTextBaseString a (map (flip (,) "") b)++    "" === []+    "-- foo" === []++    "module Foo.Bar.String" === [ItemModule ["Foo","Bar","String"]]+    "module Test" === [ItemModule ["Test"]]++    "class Foo a" === [ItemClass $ typ "Foo a"]+    "class Foo a b" === [ItemClass $ typ "Foo a b"]++    "foo :: Bool" === [ItemFunc "foo" $ typ "Bool"]+    "(++) :: Int" === [ItemFunc "++" $ typ "Int"]+    "++ :: Int" === [ItemFunc "++" $ typ "Int"]+    "@@ :: Int" === [ItemFunc "@@" $ typ "Int"]++    "type Bar a = Foo [a]" === [ItemAlias (typ "Bar a") (typ "Foo [a]")]++    "data [] a" === [ItemData DataKeyword $ typ "[a]"]+    "[] :: [] a" === [ItemFunc "[]" $ typ "[a]"]+    ": :: a -> [a] -> [] a" === [ItemFunc ":" $ typ "a -> [a] -> [a]"]+    "(:) :: a -> [a] -> [] a" === [ItemFunc ":" $ typ "a -> [a] -> [a]"]+    "() :: ()" === [ItemFunc "()" $ typ "()"]+    "data (:+:) a b" === [ItemData DataKeyword $ typ "(:+:) a b"]++    "data Foo a" === [ItemData DataKeyword $ typ "Foo a"]+    "newtype Foo a" === [ItemData NewTypeKeyword $ typ "Foo a"]++    "instance Eq a => Eq [a]" === [ItemInstance $ typ "Eq a => Eq [a]"]++    "@keyword ~" === [ItemAttribute "keyword" "~"]+    "@keyword ->" === [ItemAttribute "keyword" "->"]+    "@keyword module" === [ItemAttribute "keyword" "module"]++    "@package neil" === [ItemAttribute "package" "neil"]+    "@foo bar" === [ItemAttribute "foo" "bar"]+    "@debug" === [ItemAttribute "debug" ""]
+ src/Test/Parse_TypeSig.hs view
@@ -0,0 +1,67 @@++module Test.Parse_TypeSig(parse_TypeSig) where++import Test.General+import Hoogle.TypeSig.All++parse_TypeSig = do+    let (===) = parseTest parseTypeSig++    -- really basic stuff+    "a" === TypeSig [] (TVar "a")+    "A" === TypeSig [] (TLit "A")+    "m a" === TypeSig [] (TApp (TVar "m") [TVar "a"])+    "M a b" === TypeSig [] (TApp (TLit "M") [TVar "a",TVar "b"])++    -- lists and tuples+    "[a]" === TypeSig [] (TApp (TLit "[]") [TVar "a"])+    "[] a" === TypeSig [] (TApp (TLit "[]") [TVar "a"])+    "()" === TypeSig [] (TLit "()")+    "(a)" === TypeSig [] (TVar "a")+    "(a,b)" === TypeSig [] (TApp (TLit "(,)") [TVar "a",TVar "b"])+    "(,) a b" === TypeSig [] (TApp (TLit "(,)") [TVar "a",TVar "b"])+    "Foo [a]" === TypeSig [] (TApp (TLit "Foo") [TApp (TLit "[]") [TVar "a"]])++    -- functions+    "(->)" === TypeSig [] (TLit "->")+    "a -> b" === TypeSig [] (TFun [TVar "a",TVar "b"])+    "a->b->c" === TypeSig [] (TFun [TVar "a",TVar "b",TVar "c"])+    "a -> (b -> c)" === TypeSig [] (TFun [TVar "a",TVar "b",TVar "c"])+    "(a -> b) -> c" === TypeSig [] (TFun [TFun [TVar "a",TVar "b"],TVar "c"])+    "M (a b) c" === TypeSig [] (TApp (TLit "M") [TApp (TVar "a") [TVar "b"],TVar "c"])+    "(-#)" === TypeSig [] (TLit "->")+    "a -# b" === TypeSig [] (TFun [TVar "a",TVar "b"])++    -- classes+    "Eq a => a" === TypeSig [TApp (TLit "Eq") [TVar "a"]] (TVar "a")+    "Class a b => a b" === TypeSig [TApp (TLit "Class") [TVar "a",TVar "b"]] (TApp (TVar "a") [TVar "b"])+    "(Ord a, Eq b) => a -> b" === TypeSig [TApp (TLit "Ord") [TVar "a"],TApp (TLit "Eq") [TVar "b"]] (TFun [TVar "a",TVar "b"])++    -- forall+    "forall a . a -> a" === TypeSig [] (TFun [TVar "a", TVar "a"])+    "forall a b . a -> a" === TypeSig [] (TFun [TVar "a", TVar "a"])+    "(forall a . a -> a) -> b -> b" === TypeSig [] (TFun [TFun [TVar "a", TVar "a"], TVar "b", TVar "b"])+    "(forall a . Data a => a -> a) -> b -> b" === TypeSig [] (TFun [TFun [TVar "a", TVar "a"], TVar "b", TVar "b"])++    -- type operators+    "(:+:) a b" === TypeSig [] (TApp (TLit ":+:") [TVar "a", TVar "b"])+    "(+++) a b" === TypeSig [] (TApp (TLit "+++") [TVar "a", TVar "b"])+    "a :+: b" === TypeSig [] (TApp (TLit ":+:") [TVar "a", TVar "b"])+    "a +++ b" === TypeSig [] (TApp (TLit "+++") [TVar "a", TVar "b"])++    -- unboxed values+    "Int#" === TypeSig [] (TLit "Int#")+    "State# RealWorld" === TypeSig [] (TApp (TLit "State#") [TLit "RealWorld"])+    "(# a, b #)" === TypeSig [] (TApp (TLit "(#,#)") [TVar "a",TVar "b"])+    "(#,#) a b" === TypeSig [] (TApp (TLit "(#,#)") [TVar "a",TVar "b"])++    -- parallel arrays+    "[:a:]" === TypeSig [] (TApp (TLit "[::]") [TVar "a"])+    "[::] a" === TypeSig [] (TApp (TLit "[::]") [TVar "a"])++    -- real examples+    "(a -> b) -> [a] -> [b]" === TypeSig [] (TFun [TFun [TVar "a",TVar "b"],TApp (TLit "[]") [TVar "a"],TApp (TLit "[]") [TVar "b"]])+    "Monad a => (b -> a c) -> [b] -> a [c]" === TypeSig [TApp (TLit "Monad") [TVar "a"]] (TFun [TFun [TVar "b",TApp (TVar "a") [TVar "c"]],TApp (TLit "[]") [TVar "b"],TApp (TVar "a") [TApp (TLit "[]") [TVar "c"]]])+    "GraphM m gr => Node -> m (gr a b) -> m (Maybe [Node])" === TypeSig [TApp (TLit "GraphM") [TVar "m",TVar "gr"]] (TFun [TLit "Node",TApp (TVar "m") [TApp (TVar "gr") [TVar "a",TVar "b"]],TApp (TVar "m") [TApp (TLit "Maybe") [TApp (TLit "[]") [TLit "Node"]]]])+    "Ix a => Array a b -> a -> b" === TypeSig [TApp (TLit "Ix") [TVar "a"]] (TFun [TApp (TLit "Array") [TVar "a",TVar "b"],TVar "a",TVar "b"])+
+ src/Web/Action.hs view
@@ -0,0 +1,5 @@++module Web.Action(actionWeb) where+++actionWeb = undefined
+ src/Web/All.hs view
@@ -0,0 +1,6 @@++module Web.All(+    module Web.Action+    ) where++import Web.Action