Safe Haskell	None
Language	Haskell98

Language.Haskell.Preprocessor

Synopsis

module Language.Haskell.Preprocessor.Ast
module Language.Haskell.Preprocessor.Parser
module Language.Haskell.Preprocessor.Printer
module Language.Haskell.Preprocessor.SynSpec
module Language.Haskell.Preprocessor.Util
class Semigroup a => Monoid a where
class Locatable a where
cloneLoc :: Locatable a => a -> a -> a
scrub :: Data a => a -> a
data Extension = Extension {
- keywords :: [[Keyword]]
- transformer :: [Ast] -> IO [Ast]
- synspec :: SynSpec
- usage :: Maybe (IO ())
- syntaxerror :: Maybe (Error -> IO ())
}
base :: Extension
transform :: Extension -> [String] -> IO ()
hLoad :: SynSpec -> String -> Handle -> IO (Either Error [Ast])
fileLoad :: SynSpec -> String -> FilePath -> IO (Either Error [Ast])
stdinLoad :: SynSpec -> IO (Either Error [Ast])
hDump :: SynSpec -> Handle -> [Ast] -> IO ()
fileDump :: SynSpec -> String -> [Ast] -> IO ()
stdoutDump :: SynSpec -> [Ast] -> IO ()
stringDump :: SynSpec -> [Ast] -> String

Documentation

module Language.Haskell.Preprocessor.Ast

module Language.Haskell.Preprocessor.Parser

module Language.Haskell.Preprocessor.Printer

module Language.Haskell.Preprocessor.SynSpec

module Language.Haskell.Preprocessor.Util

class Semigroup a => Monoid a where #

The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following laws:

```
x <> mempty = x
```
```
mempty <> x = x
```
x <> (y <> z) = (x <> y) <> z (Semigroup law)
```
mconcat = foldr '(<>)' mempty
```

The method names refer to the monoid of lists under concatenation, but there are many other instances.

Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define newtypes and make those instances of Monoid, e.g. Sum and Product.

NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.

Minimal complete definition

mempty

Methods

mempty :: a #

Identity of mappend

mappend :: a -> a -> a #

An associative operation

NOTE: This method is redundant and has the default implementation mappend = '(<>)' since base-4.11.0.0.

mconcat :: [a] -> a #

Fold a list using the monoid.

For most types, the default definition for mconcat will be used, but the function is included in the class definition so that an optimized version can be provided for specific types.

Instances

Monoid Ordering	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: Ordering # mappend :: Ordering -> Ordering -> Ordering # mconcat :: [Ordering] -> Ordering #
Monoid ()	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: () # mappend :: () -> () -> () # mconcat :: [()] -> () #
Monoid All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: All # mappend :: All -> All -> All # mconcat :: [All] -> All #
Monoid Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Any # mappend :: Any -> Any -> Any # mconcat :: [Any] -> Any #
Monoid SynSpec #
Instance details Defined in Language.Haskell.Preprocessor.SynSpec Methods mempty :: SynSpec # mappend :: SynSpec -> SynSpec -> SynSpec # mconcat :: [SynSpec] -> SynSpec #
Monoid Extension #
Instance details Defined in Language.Haskell.Preprocessor Methods mempty :: Extension # mappend :: Extension -> Extension -> Extension # mconcat :: [Extension] -> Extension #
Monoid [a]	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: [a] # mappend :: [a] -> [a] -> [a] # mconcat :: [[a]] -> [a] #
Semigroup a => Monoid (Maybe a)	Lift a semigroup into `Maybe` forming a `Monoid` according to http://en.wikipedia.org/wiki/Monoid: "Any semigroup `S` may be turned into a monoid simply by adjoining an element `e` not in `S` and defining `ee = e` and `es = s = se` for all `s ∈ S`." Since 4.11.0: constraint on inner `a` value generalised from `Monoid` to `Semigroup`. Since: base-2.1*
Instance details Defined in GHC.Base Methods mempty :: Maybe a # mappend :: Maybe a -> Maybe a -> Maybe a # mconcat :: [Maybe a] -> Maybe a #
Monoid a => Monoid (IO a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods mempty :: IO a # mappend :: IO a -> IO a -> IO a # mconcat :: [IO a] -> IO a #
Monoid a => Monoid (Identity a)
Instance details Defined in Data.Functor.Identity Methods mempty :: Identity a # mappend :: Identity a -> Identity a -> Identity a # mconcat :: [Identity a] -> Identity a #
Monoid (First a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods mempty :: First a # mappend :: First a -> First a -> First a # mconcat :: [First a] -> First a #
Monoid (Last a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods mempty :: Last a # mappend :: Last a -> Last a -> Last a # mconcat :: [Last a] -> Last a #
Monoid a => Monoid (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Dual a # mappend :: Dual a -> Dual a -> Dual a # mconcat :: [Dual a] -> Dual a #
Monoid (Endo a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Endo a # mappend :: Endo a -> Endo a -> Endo a # mconcat :: [Endo a] -> Endo a #
Num a => Monoid (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Sum a # mappend :: Sum a -> Sum a -> Sum a # mconcat :: [Sum a] -> Sum a #
Num a => Monoid (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Product a # mappend :: Product a -> Product a -> Product a # mconcat :: [Product a] -> Product a #
Monoid b => Monoid (a -> b)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: a -> b # mappend :: (a -> b) -> (a -> b) -> a -> b # mconcat :: [a -> b] -> a -> b #
(Monoid a, Monoid b) => Monoid (a, b)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b) # mappend :: (a, b) -> (a, b) -> (a, b) # mconcat :: [(a, b)] -> (a, b) #
Monoid a => Monoid (ST s a)	Since: base-4.11.0.0
Instance details Defined in GHC.ST Methods mempty :: ST s a # mappend :: ST s a -> ST s a -> ST s a # mconcat :: [ST s a] -> ST s a #
Monoid (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods mempty :: Proxy s # mappend :: Proxy s -> Proxy s -> Proxy s # mconcat :: [Proxy s] -> Proxy s #
(Monoid a, Monoid b, Monoid c) => Monoid (a, b, c)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b, c) # mappend :: (a, b, c) -> (a, b, c) -> (a, b, c) # mconcat :: [(a, b, c)] -> (a, b, c) #
Monoid a => Monoid (Const a b)
Instance details Defined in Data.Functor.Const Methods mempty :: Const a b # mappend :: Const a b -> Const a b -> Const a b # mconcat :: [Const a b] -> Const a b #
Alternative f => Monoid (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Alt f a # mappend :: Alt f a -> Alt f a -> Alt f a # mconcat :: [Alt f a] -> Alt f a #
(Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b, c, d) # mappend :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) # mconcat :: [(a, b, c, d)] -> (a, b, c, d) #
(Monoid a, Semigroup (ParsecT s u m a)) => Monoid (ParsecT s u m a)	The `Monoid` instance for `ParsecT` is used for the same purposes as the `Semigroup` instance. Since: parsec-3.1.12
Instance details Defined in Text.Parsec.Prim Methods mempty :: ParsecT s u m a # mappend :: ParsecT s u m a -> ParsecT s u m a -> ParsecT s u m a # mconcat :: [ParsecT s u m a] -> ParsecT s u m a #
(Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b, c, d, e) # mappend :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # mconcat :: [(a, b, c, d, e)] -> (a, b, c, d, e) #

class Locatable a where #

Minimal complete definition

getLoc, setLoc

Methods

getLoc :: a -> Loc #

setLoc :: a -> Loc -> a #

Instances

Locatable Loc #
Instance details Defined in Language.Haskell.Preprocessor.Loc Methods getLoc :: Loc -> Loc # setLoc :: Loc -> Loc -> Loc #
Locatable Token #
Instance details Defined in Language.Haskell.Preprocessor.Token Methods getLoc :: Token -> Loc # setLoc :: Token -> Loc -> Token #
Locatable Ast #
Instance details Defined in Language.Haskell.Preprocessor.Ast Methods getLoc :: Ast -> Loc # setLoc :: Ast -> Loc -> Ast #
Locatable a => Locatable [a] #
Instance details Defined in Language.Haskell.Preprocessor.Loc Methods getLoc :: [a] -> Loc # setLoc :: [a] -> Loc -> [a] #
Locatable a => Locatable (Maybe a) #
Instance details Defined in Language.Haskell.Preprocessor.Loc Methods getLoc :: Maybe a -> Loc # setLoc :: Maybe a -> Loc -> Maybe a #
(Locatable a, Locatable b) => Locatable (Either a b) #
Instance details Defined in Language.Haskell.Preprocessor.Loc Methods getLoc :: Either a b -> Loc # setLoc :: Either a b -> Loc -> Either a b #

cloneLoc :: Locatable a => a -> a -> a #

scrub :: Data a => a -> a #

data Extension #

Constructors

Extension
Fields keywords :: [[Keyword]] transformer :: [Ast] -> IO [Ast] synspec :: SynSpec usage :: Maybe (IO ()) syntaxerror :: Maybe (Error -> IO ())

Instances

Semigroup Extension #
Instance details Defined in Language.Haskell.Preprocessor Methods (<>) :: Extension -> Extension -> Extension # sconcat :: NonEmpty Extension -> Extension # stimes :: Integral b => b -> Extension -> Extension #
Monoid Extension #
Instance details Defined in Language.Haskell.Preprocessor Methods mempty :: Extension # mappend :: Extension -> Extension -> Extension # mconcat :: [Extension] -> Extension #

base :: Extension #

transform :: Extension -> [String] -> IO () #

hLoad :: SynSpec -> String -> Handle -> IO (Either Error [Ast]) #

fileLoad :: SynSpec -> String -> FilePath -> IO (Either Error [Ast]) #

stdinLoad :: SynSpec -> IO (Either Error [Ast]) #

hDump :: SynSpec -> Handle -> [Ast] -> IO () #

fileDump :: SynSpec -> String -> [Ast] -> IO () #

stdoutDump :: SynSpec -> [Ast] -> IO () #

stringDump :: SynSpec -> [Ast] -> String #