Safe Haskell	Safe-Inferred
Language	Haskell98

Text.XML.HaXml.Schema.PrimitiveTypes

Contents

Type class for parsing simpleTypes
Primitive XSD datatypes
Derived, yet builtin, datatypes

Synopsis

class SimpleType a where
- acceptingParser :: TextParser a
- simpleTypeText :: a -> String
class Functor f => Applicative (f :: Type -> Type) where
- pure :: a -> f a
- (<*>) :: f (a -> b) -> f a -> f b
- liftA2 :: (a -> b -> c) -> f a -> f b -> f c
- (*>) :: f a -> f b -> f b
- (<*) :: f a -> f b -> f a
class Applicative f => Alternative (f :: Type -> Type) where
- empty :: f a
- (<|>) :: f a -> f a -> f a
- some :: f a -> f [a]
- many :: f a -> f [a]
(<$) :: Functor f => a -> f b -> f a
(<**>) :: Applicative f => f a -> f (a -> b) -> f b
liftA :: Applicative f => (a -> b) -> f a -> f b
liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d
(<$>) :: Functor f => (a -> b) -> f a -> f b
satisfy :: (t -> Bool) -> Parser t t
eof :: Parser t ()
optional :: Alternative f => f a -> f (Maybe a)
many1 :: PolyParse p => p a -> p [a]
sepBy :: PolyParse p => p a -> p sep -> p [a]
sepBy1 :: PolyParse p => p a -> p sep -> p [a]
parens :: Bool -> TextParser a -> TextParser a
apply :: PolyParse p => p (a -> b) -> p a -> p b
asum :: (Foldable t, Alternative f) => t (f a) -> f a
newtype Const a (b :: k) = Const {
- getConst :: a
}
bracket :: PolyParse p => p bra -> p ket -> p a -> p a
newtype ZipList a = ZipList {
- getZipList :: [a]
}
newtype WrappedArrow (a :: Type -> Type -> Type) b c = WrapArrow {
- unwrapArrow :: a b c
}
newtype WrappedMonad (m :: Type -> Type) a = WrapMonad {
- unwrapMonad :: m a
}
newtype Parser t a = P ([t] -> Result [t] a)
data Result z a
- = Success z a
- | Failure z String
- | Committed (Result z a)
reparse :: [t] -> Parser t ()
class (Functor p, Monad p, MonadFail p, Applicative p, Alternative p, Commitment p) => PolyParse (p :: Type -> Type)
class Commitment (p :: Type -> Type) where
- commit :: p a -> p a
- adjustErr :: p a -> (String -> String) -> p a
- oneOf' :: [(String, p a)] -> p a
discard :: PolyParse p => p a -> p b -> p a
failBad :: PolyParse p => String -> p a
adjustErrBad :: PolyParse p => p a -> (String -> String) -> p a
oneOf :: PolyParse p => [p a] -> p a
indent :: Int -> String -> String
exactly :: PolyParse p => Int -> p a -> p [a]
upto :: PolyParse p => Int -> p a -> p [a]
bracketSep :: PolyParse p => p bra -> p sep -> p ket -> p a -> p [a]
manyFinally :: PolyParse p => p a -> p z -> p [a]
manyFinally' :: (PolyParse p, Show a) => p a -> p z -> p [a]
onFail :: Parser t a -> Parser t a -> Parser t a
next :: Parser t t
satisfyMsg :: Show t => (t -> Bool) -> String -> Parser t t
runParser :: Parser t a -> [t] -> (Either String a, [t])
class Parse a where
- parse :: TextParser a
- parsePrec :: Int -> TextParser a
- parseList :: TextParser [a]
type TextParser a = Parser Char a
parseByRead :: Read a => String -> TextParser a
readByParse :: TextParser a -> ReadS a
readsPrecByParsePrec :: (Int -> TextParser a) -> Int -> ReadS a
word :: TextParser String
isWord :: String -> TextParser String
literal :: String -> TextParser String
optionalParens :: TextParser a -> TextParser a
field :: Parse a => String -> TextParser a
constructors :: [(String, TextParser a)] -> TextParser a
enumeration :: Show a => String -> [a] -> TextParser a
parseSigned :: Real a => TextParser a -> TextParser a
parseInt :: Integral a => String -> a -> (Char -> Bool) -> (Char -> Int) -> TextParser a
parseDec :: Integral a => TextParser a
parseOct :: Integral a => TextParser a
parseHex :: Integral a => TextParser a
parseFloat :: RealFrac a => TextParser a
parseLitChar' :: TextParser Char
parseLitChar :: TextParser Char
allAsString :: TextParser String
newtype XsdString = XsdString String
type Boolean = Bool
data Base64Binary = Base64Binary String
data HexBinary = HexBinary String
data Float
data Decimal = Decimal Double
data Double
data AnyURI = AnyURI String
data QName
- = N Name
- | QN Namespace Name
data NOTATION = NOTATION String
data Duration = Duration Bool Int Int Int Int Int Float
data DateTime = DateTime String
data Time = Time String
data Date = Date String
data GYearMonth = GYearMonth String
data GYear = GYear String
data GMonthDay = GMonthDay String
data GDay = GDay String
data GMonth = GMonth String
newtype NormalizedString = Normalized String
newtype Token = Token String
newtype Language = Language String
newtype Name = Name String
newtype NCName = NCName String
newtype ID = ID String
newtype IDREF = IDREF String
newtype IDREFS = IDREFS String
newtype ENTITY = ENTITY String
newtype ENTITIES = ENTITIES String
newtype NMTOKEN = NMTOKEN String
newtype NMTOKENS = NMTOKENS String
data Integer
newtype NonPositiveInteger = NonPos Integer
newtype NegativeInteger = Negative Integer
newtype Long = Long Int64
data Int
newtype Short = Short Int16
newtype Byte = Byte Int8
newtype NonNegativeInteger = NonNeg Integer
newtype UnsignedLong = ULong Word64
newtype UnsignedInt = UInt Word32
newtype UnsignedShort = UShort Word16
newtype UnsignedByte = UByte Word8
newtype PositiveInteger = Positive Integer

Type class for parsing simpleTypes

class SimpleType a where Source #

Ultimately, an XML parser will find some plain text as the content of a simpleType, which will need to be parsed. We use a TextParser, because values of simpleTypes can also be given elsewhere, e.g. as attribute values in an XSD definition, e.g. to restrict the permissible values of the simpleType. Such restrictions are therefore implemented as layered parsers.

Methods

acceptingParser :: TextParser a Source #

simpleTypeText :: a -> String Source #

Instances

Instances details

SimpleType AnyURI Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser AnyURI Source # simpleTypeText :: AnyURI -> String Source #
SimpleType Base64Binary Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Base64Binary Source # simpleTypeText :: Base64Binary -> String Source #
SimpleType Byte Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Byte Source # simpleTypeText :: Byte -> String Source #
SimpleType Date Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Date Source # simpleTypeText :: Date -> String Source #
SimpleType DateTime Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser DateTime Source # simpleTypeText :: DateTime -> String Source #
SimpleType Decimal Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Decimal Source # simpleTypeText :: Decimal -> String Source #
SimpleType Duration Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Duration Source # simpleTypeText :: Duration -> String Source #
SimpleType ENTITIES Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser ENTITIES Source # simpleTypeText :: ENTITIES -> String Source #
SimpleType ENTITY Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser ENTITY Source # simpleTypeText :: ENTITY -> String Source #
SimpleType GDay Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser GDay Source # simpleTypeText :: GDay -> String Source #
SimpleType GMonth Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser GMonth Source # simpleTypeText :: GMonth -> String Source #
SimpleType GMonthDay Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser GMonthDay Source # simpleTypeText :: GMonthDay -> String Source #
SimpleType GYear Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser GYear Source # simpleTypeText :: GYear -> String Source #
SimpleType GYearMonth Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser GYearMonth Source # simpleTypeText :: GYearMonth -> String Source #
SimpleType HexBinary Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser HexBinary Source # simpleTypeText :: HexBinary -> String Source #
SimpleType ID Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser ID Source # simpleTypeText :: ID -> String Source #
SimpleType IDREF Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser IDREF Source # simpleTypeText :: IDREF -> String Source #
SimpleType IDREFS Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser IDREFS Source # simpleTypeText :: IDREFS -> String Source #
SimpleType Language Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Language Source # simpleTypeText :: Language -> String Source #
SimpleType Long Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Long Source # simpleTypeText :: Long -> String Source #
SimpleType NCName Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser NCName Source # simpleTypeText :: NCName -> String Source #
SimpleType NMTOKEN Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser NMTOKEN Source # simpleTypeText :: NMTOKEN -> String Source #
SimpleType NMTOKENS Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser NMTOKENS Source # simpleTypeText :: NMTOKENS -> String Source #
SimpleType NOTATION Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser NOTATION Source # simpleTypeText :: NOTATION -> String Source #
SimpleType Name Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Name Source # simpleTypeText :: Name -> String Source #
SimpleType NegativeInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser NegativeInteger Source # simpleTypeText :: NegativeInteger -> String Source #
SimpleType NonNegativeInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser NonNegativeInteger Source # simpleTypeText :: NonNegativeInteger -> String Source #
SimpleType NonPositiveInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser NonPositiveInteger Source # simpleTypeText :: NonPositiveInteger -> String Source #
SimpleType NormalizedString Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser NormalizedString Source # simpleTypeText :: NormalizedString -> String Source #
SimpleType PositiveInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser PositiveInteger Source # simpleTypeText :: PositiveInteger -> String Source #
SimpleType Short Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Short Source # simpleTypeText :: Short -> String Source #
SimpleType Time Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Time Source # simpleTypeText :: Time -> String Source #
SimpleType Token Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Token Source # simpleTypeText :: Token -> String Source #
SimpleType UnsignedByte Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser UnsignedByte Source # simpleTypeText :: UnsignedByte -> String Source #
SimpleType UnsignedInt Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser UnsignedInt Source # simpleTypeText :: UnsignedInt -> String Source #
SimpleType UnsignedLong Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser UnsignedLong Source # simpleTypeText :: UnsignedLong -> String Source #
SimpleType UnsignedShort Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser UnsignedShort Source # simpleTypeText :: UnsignedShort -> String Source #
SimpleType XsdString Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser XsdString Source # simpleTypeText :: XsdString -> String Source #
SimpleType Integer Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Integer Source # simpleTypeText :: Integer -> String Source #
SimpleType Bool Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Bool Source # simpleTypeText :: Bool -> String Source #
SimpleType Double Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Double Source # simpleTypeText :: Double -> String Source #
SimpleType Float Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Float Source # simpleTypeText :: Float -> String Source #
SimpleType Int Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Int Source # simpleTypeText :: Int -> String Source #

class Functor f => Applicative (f :: Type -> Type) where Source #

A functor with application, providing operations to

embed pure expressions (pure), and
sequence computations and combine their results (<*> and liftA2).

A minimal complete definition must include implementations of pure and of either <*> or liftA2. If it defines both, then they must behave the same as their default definitions:

(<*>) = liftA2 id

liftA2 f x y = f <$> x <*> y

Further, any definition must satisfy the following:

Identity

pure id <*> v = v

Composition

pure (.) <*> u <*> v <*> w = u <*> (v <*> w)

Homomorphism

pure f <*> pure x = pure (f x)

Interchange

u <*> pure y = pure ($ y) <*> u

The other methods have the following default definitions, which may be overridden with equivalent specialized implementations:

```
u *> v = (id <$ u) <*> v
```
```
u <* v = liftA2 const u v
```

As a consequence of these laws, the Functor instance for f will satisfy

```
fmap f x = pure f <*> x
```

It may be useful to note that supposing

forall x y. p (q x y) = f x . g y

it follows from the above that

liftA2 p (liftA2 q u v) = liftA2 f u . liftA2 g v

If f is also a Monad, it should satisfy

```
pure = return
```

m1 <*> m2 = m1 >>= (\x1 -> m2 >>= (\x2 -> return (x1 x2)))

```
(*>) = (>>)
```

(which implies that pure and <*> satisfy the applicative functor laws).

Minimal complete definition

pure, ((<*>) | liftA2)

Methods

pure :: a -> f a Source #

Lift a value into the Structure.

Examples

Expand

>>> pure 1 :: Maybe Int
Just 1

>>> pure 'z' :: [Char]
"z"

>>> pure (pure ":D") :: Maybe [String]
Just [":D"]

(<*>) :: f (a -> b) -> f a -> f b infixl 4 Source #

Sequential application.

A few functors support an implementation of <*> that is more efficient than the default one.

Example

Expand

Used in combination with (<$>), (<*>) can be used to build a record.

>>> data MyState = MyState {arg1 :: Foo, arg2 :: Bar, arg3 :: Baz}

>>> produceFoo :: Applicative f => f Foo
>>> produceBar :: Applicative f => f Bar
>>> produceBaz :: Applicative f => f Baz

>>> mkState :: Applicative f => f MyState
>>> mkState = MyState <$> produceFoo <*> produceBar <*> produceBaz

liftA2 :: (a -> b -> c) -> f a -> f b -> f c Source #

Lift a binary function to actions.

Some functors support an implementation of liftA2 that is more efficient than the default one. In particular, if fmap is an expensive operation, it is likely better to use liftA2 than to fmap over the structure and then use <*>.

This became a typeclass method in 4.10.0.0. Prior to that, it was a function defined in terms of <*> and fmap.

Example

Expand

>>> liftA2 (,) (Just 3) (Just 5)
Just (3,5)

>>> liftA2 (+) [1, 2, 3] [4, 5, 6]
[5,6,7,6,7,8,7,8,9]

(*>) :: f a -> f b -> f b infixl 4 Source #

Sequence actions, discarding the value of the first argument.

Examples

Expand

If used in conjunction with the Applicative instance for Maybe, you can chain Maybe computations, with a possible "early return" in case of Nothing.

>>> Just 2 *> Just 3
Just 3

>>> Nothing *> Just 3
Nothing

Of course a more interesting use case would be to have effectful computations instead of just returning pure values.

>>> import Data.Char
>>> import GHC.Internal.Text.ParserCombinators.ReadP
>>> let p = string "my name is " *> munch1 isAlpha <* eof
>>> readP_to_S p "my name is Simon"
[("Simon","")]

(<*) :: f a -> f b -> f a infixl 4 Source #

Sequence actions, discarding the value of the second argument.

Instances

Instances details

Applicative Complex	Since: base-4.9.0.0
Instance details Defined in Data.Complex Methods pure :: a -> Complex a Source # (<>) :: Complex (a -> b) -> Complex a -> Complex b Source # liftA2 :: (a -> b -> c) -> Complex a -> Complex b -> Complex c Source # (>) :: Complex a -> Complex b -> Complex b Source # (<*) :: Complex a -> Complex b -> Complex a Source #
Applicative First	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> First a Source # (<>) :: First (a -> b) -> First a -> First b Source # liftA2 :: (a -> b -> c) -> First a -> First b -> First c Source # (>) :: First a -> First b -> First b Source # (<*) :: First a -> First b -> First a Source #
Applicative Last	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Last a Source # (<>) :: Last (a -> b) -> Last a -> Last b Source # liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c Source # (>) :: Last a -> Last b -> Last b Source # (<*) :: Last a -> Last b -> Last a Source #
Applicative Max	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Max a Source # (<>) :: Max (a -> b) -> Max a -> Max b Source # liftA2 :: (a -> b -> c) -> Max a -> Max b -> Max c Source # (>) :: Max a -> Max b -> Max b Source # (<*) :: Max a -> Max b -> Max a Source #
Applicative Min	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Min a Source # (<>) :: Min (a -> b) -> Min a -> Min b Source # liftA2 :: (a -> b -> c) -> Min a -> Min b -> Min c Source # (>) :: Min a -> Min b -> Min b Source # (<*) :: Min a -> Min b -> Min a Source #
Applicative Put
Instance details Defined in Data.ByteString.Builder.Internal Methods pure :: a -> Put a Source # (<>) :: Put (a -> b) -> Put a -> Put b Source # liftA2 :: (a -> b -> c) -> Put a -> Put b -> Put c Source # (>) :: Put a -> Put b -> Put b Source # (<*) :: Put a -> Put b -> Put a Source #
Applicative Seq	Since: containers-0.5.4
Instance details Defined in Data.Sequence.Internal Methods pure :: a -> Seq a Source # (<>) :: Seq (a -> b) -> Seq a -> Seq b Source # liftA2 :: (a -> b -> c) -> Seq a -> Seq b -> Seq c Source # (>) :: Seq a -> Seq b -> Seq b Source # (<*) :: Seq a -> Seq b -> Seq a Source #
Applicative Tree
Instance details Defined in Data.Tree Methods pure :: a -> Tree a Source # (<>) :: Tree (a -> b) -> Tree a -> Tree b Source # liftA2 :: (a -> b -> c) -> Tree a -> Tree b -> Tree c Source # (>) :: Tree a -> Tree b -> Tree b Source # (<*) :: Tree a -> Tree b -> Tree a Source #
Applicative NonEmpty	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods pure :: a -> NonEmpty a Source # (<>) :: NonEmpty (a -> b) -> NonEmpty a -> NonEmpty b Source # liftA2 :: (a -> b -> c) -> NonEmpty a -> NonEmpty b -> NonEmpty c Source # (>) :: NonEmpty a -> NonEmpty b -> NonEmpty b Source # (<*) :: NonEmpty a -> NonEmpty b -> NonEmpty a Source #
Applicative ZipList	f <$> ZipList xs1 <> ... <> ZipList xsN = ZipList (zipWithN f xs1 ... xsN) where `zipWithN` refers to the `zipWith` function of the appropriate arity (`zipWith`, `zipWith3`, `zipWith4`, ...). For example: (\a b c -> stimes c [a, b]) <$> ZipList "abcd" <> ZipList "567" <> ZipList [1..] = ZipList (zipWith3 (\a b c -> stimes c [a, b]) "abcd" "567" [1..]) = ZipList {getZipList = ["a5","b6b6","c7c7c7"]} Since: base-2.1
Instance details Defined in GHC.Internal.Functor.ZipList Methods pure :: a -> ZipList a Source # (<>) :: ZipList (a -> b) -> ZipList a -> ZipList b Source # liftA2 :: (a -> b -> c) -> ZipList a -> ZipList b -> ZipList c Source # (>) :: ZipList a -> ZipList b -> ZipList b Source # (<*) :: ZipList a -> ZipList b -> ZipList a Source #
Applicative Par1	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods pure :: a -> Par1 a Source # (<>) :: Par1 (a -> b) -> Par1 a -> Par1 b Source # liftA2 :: (a -> b -> c) -> Par1 a -> Par1 b -> Par1 c Source # (>) :: Par1 a -> Par1 b -> Par1 b Source # (<*) :: Par1 a -> Par1 b -> Par1 a Source #
Applicative P	Since: base-4.5.0.0
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods pure :: a -> P a Source # (<>) :: P (a -> b) -> P a -> P b Source # liftA2 :: (a -> b -> c) -> P a -> P b -> P c Source # (>) :: P a -> P b -> P b Source # (<*) :: P a -> P b -> P a Source #
Applicative ReadP	Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods pure :: a -> ReadP a Source # (<>) :: ReadP (a -> b) -> ReadP a -> ReadP b Source # liftA2 :: (a -> b -> c) -> ReadP a -> ReadP b -> ReadP c Source # (>) :: ReadP a -> ReadP b -> ReadP b Source # (<*) :: ReadP a -> ReadP b -> ReadP a Source #
Applicative IO	Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods pure :: a -> IO a Source # (<>) :: IO (a -> b) -> IO a -> IO b Source # liftA2 :: (a -> b -> c) -> IO a -> IO b -> IO c Source # (>) :: IO a -> IO b -> IO b Source # (<*) :: IO a -> IO b -> IO a Source #
Applicative Parser
Instance details Defined in Text.ParserCombinators.HuttonMeijer Methods pure :: a -> Parser a Source # (<>) :: Parser (a -> b) -> Parser a -> Parser b Source # liftA2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c Source # (>) :: Parser a -> Parser b -> Parser b Source # (<*) :: Parser a -> Parser b -> Parser a Source #
Applicative Parser
Instance details Defined in Text.ParserCombinators.Poly.ByteString Methods pure :: a -> Parser a Source # (<>) :: Parser (a -> b) -> Parser a -> Parser b Source # liftA2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c Source # (>) :: Parser a -> Parser b -> Parser b Source # (<*) :: Parser a -> Parser b -> Parser a Source #
Applicative Parser
Instance details Defined in Text.ParserCombinators.Poly.ByteStringChar Methods pure :: a -> Parser a Source # (<>) :: Parser (a -> b) -> Parser a -> Parser b Source # liftA2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c Source # (>) :: Parser a -> Parser b -> Parser b Source # (<*) :: Parser a -> Parser b -> Parser a Source #
Applicative Parser
Instance details Defined in Text.ParserCombinators.Poly.Text Methods pure :: a -> Parser a Source # (<>) :: Parser (a -> b) -> Parser a -> Parser b Source # liftA2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c Source # (>) :: Parser a -> Parser b -> Parser b Source # (<*) :: Parser a -> Parser b -> Parser a Source #
Applicative Maybe	Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods pure :: a -> Maybe a Source # (<>) :: Maybe (a -> b) -> Maybe a -> Maybe b Source # liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c Source # (>) :: Maybe a -> Maybe b -> Maybe b Source # (<*) :: Maybe a -> Maybe b -> Maybe a Source #
Applicative Solo	Since: base-4.15
Instance details Defined in GHC.Internal.Base Methods pure :: a -> Solo a Source # (<>) :: Solo (a -> b) -> Solo a -> Solo b Source # liftA2 :: (a -> b -> c) -> Solo a -> Solo b -> Solo c Source # (>) :: Solo a -> Solo b -> Solo b Source # (<*) :: Solo a -> Solo b -> Solo a Source #
Applicative []	Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods pure :: a -> [a] Source # (<>) :: [a -> b] -> [a] -> [b] Source # liftA2 :: (a -> b -> c) -> [a] -> [b] -> [c] Source # (>) :: [a] -> [b] -> [b] Source # (<*) :: [a] -> [b] -> [a] Source #
Monad m => Applicative (WrappedMonad m)	Since: base-2.1
Instance details Defined in Control.Applicative Methods pure :: a -> WrappedMonad m a Source # (<>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b Source # liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c Source # (>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b Source # (<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a Source #
Applicative (SetM s)
Instance details Defined in Data.Graph Methods pure :: a -> SetM s a Source # (<>) :: SetM s (a -> b) -> SetM s a -> SetM s b Source # liftA2 :: (a -> b -> c) -> SetM s a -> SetM s b -> SetM s c Source # (>) :: SetM s a -> SetM s b -> SetM s b Source # (<*) :: SetM s a -> SetM s b -> SetM s a Source #
Applicative (Either e)	Since: base-3.0
Instance details Defined in GHC.Internal.Data.Either Methods pure :: a -> Either e a Source # (<>) :: Either e (a -> b) -> Either e a -> Either e b Source # liftA2 :: (a -> b -> c) -> Either e a -> Either e b -> Either e c Source # (>) :: Either e a -> Either e b -> Either e b Source # (<*) :: Either e a -> Either e b -> Either e a Source #
Applicative (U1 :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods pure :: a -> U1 a Source # (<>) :: U1 (a -> b) -> U1 a -> U1 b Source # liftA2 :: (a -> b -> c) -> U1 a -> U1 b -> U1 c Source # (>) :: U1 a -> U1 b -> U1 b Source # (<*) :: U1 a -> U1 b -> U1 a Source #
Applicative (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Lazy Methods pure :: a -> Parser t a Source # (<>) :: Parser t (a -> b) -> Parser t a -> Parser t b Source # liftA2 :: (a -> b -> c) -> Parser t a -> Parser t b -> Parser t c Source # (>) :: Parser t a -> Parser t b -> Parser t b Source # (<*) :: Parser t a -> Parser t b -> Parser t a Source #
Applicative (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Lex Methods pure :: a -> Parser t a Source # (<>) :: Parser t (a -> b) -> Parser t a -> Parser t b Source # liftA2 :: (a -> b -> c) -> Parser t a -> Parser t b -> Parser t c Source # (>) :: Parser t a -> Parser t b -> Parser t b Source # (<*) :: Parser t a -> Parser t b -> Parser t a Source #
Applicative (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Parser Methods pure :: a -> Parser t a Source # (<>) :: Parser t (a -> b) -> Parser t a -> Parser t b Source # liftA2 :: (a -> b -> c) -> Parser t a -> Parser t b -> Parser t c Source # (>) :: Parser t a -> Parser t b -> Parser t b Source # (<*) :: Parser t a -> Parser t b -> Parser t a Source #
Applicative (Parser s)
Instance details Defined in Text.ParserCombinators.Poly.StateText Methods pure :: a -> Parser s a Source # (<>) :: Parser s (a -> b) -> Parser s a -> Parser s b Source # liftA2 :: (a -> b -> c) -> Parser s a -> Parser s b -> Parser s c Source # (>) :: Parser s a -> Parser s b -> Parser s b Source # (<*) :: Parser s a -> Parser s b -> Parser s a Source #
Monoid a => Applicative ((,) a)	For tuples, the `Monoid` constraint on `a` determines how the first values merge. For example, `String`s concatenate: ("hello ", (+15)) <> ("world!", 2002) ("hello world!",2017) Since: base-2.1*
Instance details Defined in GHC.Internal.Base Methods pure :: a0 -> (a, a0) Source # (<>) :: (a, a0 -> b) -> (a, a0) -> (a, b) Source # liftA2 :: (a0 -> b -> c) -> (a, a0) -> (a, b) -> (a, c) Source # (>) :: (a, a0) -> (a, b) -> (a, b) Source # (<*) :: (a, a0) -> (a, b) -> (a, a0) Source #
Arrow a => Applicative (WrappedArrow a b)	Since: base-2.1
Instance details Defined in Control.Applicative Methods pure :: a0 -> WrappedArrow a b a0 Source # (<>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 Source # liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c Source # (>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 Source # (<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 Source #
(Applicative f, Monad f) => Applicative (WhenMissing f x)	Equivalent to `ReaderT k (ReaderT x (MaybeT f))`. Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods pure :: a -> WhenMissing f x a Source # (<>) :: WhenMissing f x (a -> b) -> WhenMissing f x a -> WhenMissing f x b Source # liftA2 :: (a -> b -> c) -> WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x c Source # (>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b Source # (<*) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x a Source #
Monoid m => Applicative (Const m :: Type -> Type)	Since: base-2.0.1
Instance details Defined in GHC.Internal.Data.Functor.Const Methods pure :: a -> Const m a Source # (<>) :: Const m (a -> b) -> Const m a -> Const m b Source # liftA2 :: (a -> b -> c) -> Const m a -> Const m b -> Const m c Source # (>) :: Const m a -> Const m b -> Const m b Source # (<*) :: Const m a -> Const m b -> Const m a Source #
(Generic1 f, Applicative (Rep1 f)) => Applicative (Generically1 f)	Since: base-4.17.0.0
Instance details Defined in GHC.Internal.Generics Methods pure :: a -> Generically1 f a Source # (<>) :: Generically1 f (a -> b) -> Generically1 f a -> Generically1 f b Source # liftA2 :: (a -> b -> c) -> Generically1 f a -> Generically1 f b -> Generically1 f c Source # (>) :: Generically1 f a -> Generically1 f b -> Generically1 f b Source # (<*) :: Generically1 f a -> Generically1 f b -> Generically1 f a Source #
Applicative f => Applicative (Rec1 f)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods pure :: a -> Rec1 f a Source # (<>) :: Rec1 f (a -> b) -> Rec1 f a -> Rec1 f b Source # liftA2 :: (a -> b -> c) -> Rec1 f a -> Rec1 f b -> Rec1 f c Source # (>) :: Rec1 f a -> Rec1 f b -> Rec1 f b Source # (<*) :: Rec1 f a -> Rec1 f b -> Rec1 f a Source #
Applicative (Parser s t)
Instance details Defined in Text.ParserCombinators.Poly.StateLazy Methods pure :: a -> Parser s t a Source # (<>) :: Parser s t (a -> b) -> Parser s t a -> Parser s t b Source # liftA2 :: (a -> b -> c) -> Parser s t a -> Parser s t b -> Parser s t c Source # (>) :: Parser s t a -> Parser s t b -> Parser s t b Source # (<*) :: Parser s t a -> Parser s t b -> Parser s t a Source #
Applicative (Parser s t)
Instance details Defined in Text.ParserCombinators.Poly.StateParser Methods pure :: a -> Parser s t a Source # (<>) :: Parser s t (a -> b) -> Parser s t a -> Parser s t b Source # liftA2 :: (a -> b -> c) -> Parser s t a -> Parser s t b -> Parser s t c Source # (>) :: Parser s t a -> Parser s t b -> Parser s t b Source # (<*) :: Parser s t a -> Parser s t b -> Parser s t a Source #
(Monoid a, Monoid b) => Applicative ((,,) a b)	Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Base Methods pure :: a0 -> (a, b, a0) Source # (<>) :: (a, b, a0 -> b0) -> (a, b, a0) -> (a, b, b0) Source # liftA2 :: (a0 -> b0 -> c) -> (a, b, a0) -> (a, b, b0) -> (a, b, c) Source # (>) :: (a, b, a0) -> (a, b, b0) -> (a, b, b0) Source # (<*) :: (a, b, a0) -> (a, b, b0) -> (a, b, a0) Source #
(Applicative f, Applicative g) => Applicative (Product f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods pure :: a -> Product f g a Source # (<>) :: Product f g (a -> b) -> Product f g a -> Product f g b Source # liftA2 :: (a -> b -> c) -> Product f g a -> Product f g b -> Product f g c Source # (>) :: Product f g a -> Product f g b -> Product f g b Source # (<*) :: Product f g a -> Product f g b -> Product f g a Source #
(Monad f, Applicative f) => Applicative (WhenMatched f x y)	Equivalent to `ReaderT Key (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods pure :: a -> WhenMatched f x y a Source # (<>) :: WhenMatched f x y (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b Source # liftA2 :: (a -> b -> c) -> WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y c Source # (>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b Source # (<*) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y a Source #
(Applicative f, Monad f) => Applicative (WhenMissing f k x)	Equivalent to `ReaderT k (ReaderT x (MaybeT f))` . Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods pure :: a -> WhenMissing f k x a Source # (<>) :: WhenMissing f k x (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b Source # liftA2 :: (a -> b -> c) -> WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x c Source # (>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b Source # (<*) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x a Source #
(Applicative f, Applicative g) => Applicative (f :*: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods pure :: a -> (f :: g) a Source # (<>) :: (f :: g) (a -> b) -> (f :: g) a -> (f :: g) b Source # liftA2 :: (a -> b -> c) -> (f :: g) a -> (f :: g) b -> (f :: g) c Source # (>) :: (f :: g) a -> (f :: g) b -> (f :: g) b Source # (<) :: (f :: g) a -> (f :: g) b -> (f :: g) a Source #
Monoid c => Applicative (K1 i c :: Type -> Type)	Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods pure :: a -> K1 i c a Source # (<>) :: K1 i c (a -> b) -> K1 i c a -> K1 i c b Source # liftA2 :: (a -> b -> c0) -> K1 i c a -> K1 i c b -> K1 i c c0 Source # (>) :: K1 i c a -> K1 i c b -> K1 i c b Source # (<*) :: K1 i c a -> K1 i c b -> K1 i c a Source #
Applicative (Parser s t e)
Instance details Defined in Text.ParserCombinators.HuttonMeijerWallace Methods pure :: a -> Parser s t e a Source # (<>) :: Parser s t e (a -> b) -> Parser s t e a -> Parser s t e b Source # liftA2 :: (a -> b -> c) -> Parser s t e a -> Parser s t e b -> Parser s t e c Source # (>) :: Parser s t e a -> Parser s t e b -> Parser s t e b Source # (<*) :: Parser s t e a -> Parser s t e b -> Parser s t e a Source #
(Monoid a, Monoid b, Monoid c) => Applicative ((,,,) a b c)	Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Base Methods pure :: a0 -> (a, b, c, a0) Source # (<>) :: (a, b, c, a0 -> b0) -> (a, b, c, a0) -> (a, b, c, b0) Source # liftA2 :: (a0 -> b0 -> c0) -> (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, c0) Source # (>) :: (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, b0) Source # (<*) :: (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, a0) Source #
Applicative ((->) r)	Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods pure :: a -> r -> a Source # (<>) :: (r -> (a -> b)) -> (r -> a) -> r -> b Source # liftA2 :: (a -> b -> c) -> (r -> a) -> (r -> b) -> r -> c Source # (>) :: (r -> a) -> (r -> b) -> r -> b Source # (<*) :: (r -> a) -> (r -> b) -> r -> a Source #
(Applicative f, Applicative g) => Applicative (Compose f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods pure :: a -> Compose f g a Source # (<>) :: Compose f g (a -> b) -> Compose f g a -> Compose f g b Source # liftA2 :: (a -> b -> c) -> Compose f g a -> Compose f g b -> Compose f g c Source # (>) :: Compose f g a -> Compose f g b -> Compose f g b Source # (<*) :: Compose f g a -> Compose f g b -> Compose f g a Source #
(Monad f, Applicative f) => Applicative (WhenMatched f k x y)	Equivalent to `ReaderT k (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods pure :: a -> WhenMatched f k x y a Source # (<>) :: WhenMatched f k x y (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b Source # liftA2 :: (a -> b -> c) -> WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y c Source # (>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b Source # (<*) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y a Source #
(Applicative f, Applicative g) => Applicative (f :.: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods pure :: a -> (f :.: g) a Source # (<>) :: (f :.: g) (a -> b) -> (f :.: g) a -> (f :.: g) b Source # liftA2 :: (a -> b -> c) -> (f :.: g) a -> (f :.: g) b -> (f :.: g) c Source # (>) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) b Source # (<*) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) a Source #
Applicative f => Applicative (M1 i c f)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods pure :: a -> M1 i c f a Source # (<>) :: M1 i c f (a -> b) -> M1 i c f a -> M1 i c f b Source # liftA2 :: (a -> b -> c0) -> M1 i c f a -> M1 i c f b -> M1 i c f c0 Source # (>) :: M1 i c f a -> M1 i c f b -> M1 i c f b Source # (<*) :: M1 i c f a -> M1 i c f b -> M1 i c f a Source #

class Applicative f => Alternative (f :: Type -> Type) where Source #

A monoid on applicative functors.

If defined, some and many should be the least solutions of the equations:

```
some v = (:) <$> v <*> many v
```
```
many v = some v <|> pure []
```

Examples

Expand

>>> Nothing <|> Just 42
Just 42

>>> [1, 2] <|> [3, 4]
[1,2,3,4]

>>> empty <|> print (2^15)
32768

Minimal complete definition

empty, (<|>)

Methods

empty :: f a Source #

The identity of <|>

empty <|> a     == a
a     <|> empty == a

(<|>) :: f a -> f a -> f a infixl 3 Source #

An associative binary operation

some :: f a -> f [a] Source #

One or more.

Examples

Expand

>>> some (putStr "la")
lalalalalalalalala... * goes on forever *

>>> some Nothing
nothing

>>> take 5 <$> some (Just 1)
* hangs forever *

Note that this function can be used with Parsers based on Applicatives. In that case some parser will attempt to parse parser one or more times until it fails.

many :: f a -> f [a] Source #

Zero or more.

Examples

Expand

>>> many (putStr "la")
lalalalalalalalala... * goes on forever *

>>> many Nothing
Just []

>>> take 5 <$> many (Just 1)
* hangs forever *

Note that this function can be used with Parsers based on Applicatives. In that case many parser will attempt to parse parser zero or more times until it fails.

Instances

Instances details

Alternative Seq	Since: containers-0.5.4
Instance details Defined in Data.Sequence.Internal Methods empty :: Seq a Source # (<\|>) :: Seq a -> Seq a -> Seq a Source # some :: Seq a -> Seq [a] Source # many :: Seq a -> Seq [a] Source #
Alternative ZipList	Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Functor.ZipList Methods empty :: ZipList a Source # (<\|>) :: ZipList a -> ZipList a -> ZipList a Source # some :: ZipList a -> ZipList [a] Source # many :: ZipList a -> ZipList [a] Source #
Alternative P	Since: base-4.5.0.0
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods empty :: P a Source # (<\|>) :: P a -> P a -> P a Source # some :: P a -> P [a] Source # many :: P a -> P [a] Source #
Alternative ReadP	Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods empty :: ReadP a Source # (<\|>) :: ReadP a -> ReadP a -> ReadP a Source # some :: ReadP a -> ReadP [a] Source # many :: ReadP a -> ReadP [a] Source #
Alternative IO	Takes the first non-throwing `IO` action's result. `empty` throws an exception. Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods empty :: IO a Source # (<\|>) :: IO a -> IO a -> IO a Source # some :: IO a -> IO [a] Source # many :: IO a -> IO [a] Source #
Alternative Parser
Instance details Defined in Text.ParserCombinators.HuttonMeijer Methods empty :: Parser a Source # (<\|>) :: Parser a -> Parser a -> Parser a Source # some :: Parser a -> Parser [a] Source # many :: Parser a -> Parser [a] Source #
Alternative Parser
Instance details Defined in Text.ParserCombinators.Poly.ByteString Methods empty :: Parser a Source # (<\|>) :: Parser a -> Parser a -> Parser a Source # some :: Parser a -> Parser [a] Source # many :: Parser a -> Parser [a] Source #
Alternative Parser
Instance details Defined in Text.ParserCombinators.Poly.ByteStringChar Methods empty :: Parser a Source # (<\|>) :: Parser a -> Parser a -> Parser a Source # some :: Parser a -> Parser [a] Source # many :: Parser a -> Parser [a] Source #
Alternative Parser
Instance details Defined in Text.ParserCombinators.Poly.Text Methods empty :: Parser a Source # (<\|>) :: Parser a -> Parser a -> Parser a Source # some :: Parser a -> Parser [a] Source # many :: Parser a -> Parser [a] Source #
Alternative Maybe	Picks the leftmost `Just` value, or, alternatively, `Nothing`. Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods empty :: Maybe a Source # (<\|>) :: Maybe a -> Maybe a -> Maybe a Source # some :: Maybe a -> Maybe [a] Source # many :: Maybe a -> Maybe [a] Source #
Alternative []	Combines lists by concatenation, starting from the empty list. Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods empty :: [a] Source # (<\|>) :: [a] -> [a] -> [a] Source # some :: [a] -> [[a]] Source # many :: [a] -> [[a]] Source #
MonadPlus m => Alternative (WrappedMonad m)	Since: base-2.1
Instance details Defined in Control.Applicative Methods empty :: WrappedMonad m a Source # (<\|>) :: WrappedMonad m a -> WrappedMonad m a -> WrappedMonad m a Source # some :: WrappedMonad m a -> WrappedMonad m [a] Source # many :: WrappedMonad m a -> WrappedMonad m [a] Source #
Alternative (U1 :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods empty :: U1 a Source # (<\|>) :: U1 a -> U1 a -> U1 a Source # some :: U1 a -> U1 [a] Source # many :: U1 a -> U1 [a] Source #
Alternative (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Lazy Methods empty :: Parser t a Source # (<\|>) :: Parser t a -> Parser t a -> Parser t a Source # some :: Parser t a -> Parser t [a] Source # many :: Parser t a -> Parser t [a] Source #
Alternative (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Lex Methods empty :: Parser t a Source # (<\|>) :: Parser t a -> Parser t a -> Parser t a Source # some :: Parser t a -> Parser t [a] Source # many :: Parser t a -> Parser t [a] Source #
Alternative (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Parser Methods empty :: Parser t a Source # (<\|>) :: Parser t a -> Parser t a -> Parser t a Source # some :: Parser t a -> Parser t [a] Source # many :: Parser t a -> Parser t [a] Source #
Alternative (Parser s)
Instance details Defined in Text.ParserCombinators.Poly.StateText Methods empty :: Parser s a Source # (<\|>) :: Parser s a -> Parser s a -> Parser s a Source # some :: Parser s a -> Parser s [a] Source # many :: Parser s a -> Parser s [a] Source #
(ArrowZero a, ArrowPlus a) => Alternative (WrappedArrow a b)	Since: base-2.1
Instance details Defined in Control.Applicative Methods empty :: WrappedArrow a b a0 Source # (<\|>) :: WrappedArrow a b a0 -> WrappedArrow a b a0 -> WrappedArrow a b a0 Source # some :: WrappedArrow a b a0 -> WrappedArrow a b [a0] Source # many :: WrappedArrow a b a0 -> WrappedArrow a b [a0] Source #
(Generic1 f, Alternative (Rep1 f)) => Alternative (Generically1 f)	Since: base-4.17.0.0
Instance details Defined in GHC.Internal.Generics Methods empty :: Generically1 f a Source # (<\|>) :: Generically1 f a -> Generically1 f a -> Generically1 f a Source # some :: Generically1 f a -> Generically1 f [a] Source # many :: Generically1 f a -> Generically1 f [a] Source #
Alternative f => Alternative (Rec1 f)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods empty :: Rec1 f a Source # (<\|>) :: Rec1 f a -> Rec1 f a -> Rec1 f a Source # some :: Rec1 f a -> Rec1 f [a] Source # many :: Rec1 f a -> Rec1 f [a] Source #
Alternative (Parser s t)
Instance details Defined in Text.ParserCombinators.Poly.StateLazy Methods empty :: Parser s t a Source # (<\|>) :: Parser s t a -> Parser s t a -> Parser s t a Source # some :: Parser s t a -> Parser s t [a] Source # many :: Parser s t a -> Parser s t [a] Source #
Alternative (Parser s t)
Instance details Defined in Text.ParserCombinators.Poly.StateParser Methods empty :: Parser s t a Source # (<\|>) :: Parser s t a -> Parser s t a -> Parser s t a Source # some :: Parser s t a -> Parser s t [a] Source # many :: Parser s t a -> Parser s t [a] Source #
(Alternative f, Alternative g) => Alternative (Product f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods empty :: Product f g a Source # (<\|>) :: Product f g a -> Product f g a -> Product f g a Source # some :: Product f g a -> Product f g [a] Source # many :: Product f g a -> Product f g [a] Source #
(Alternative f, Alternative g) => Alternative (f :*: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods empty :: (f :: g) a Source # (<\|>) :: (f :: g) a -> (f :: g) a -> (f :: g) a Source # some :: (f :: g) a -> (f :: g) [a] Source # many :: (f :: g) a -> (f :: g) [a] Source #
Alternative (Parser s t e)
Instance details Defined in Text.ParserCombinators.HuttonMeijerWallace Methods empty :: Parser s t e a Source # (<\|>) :: Parser s t e a -> Parser s t e a -> Parser s t e a Source # some :: Parser s t e a -> Parser s t e [a] Source # many :: Parser s t e a -> Parser s t e [a] Source #
(Alternative f, Applicative g) => Alternative (Compose f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods empty :: Compose f g a Source # (<\|>) :: Compose f g a -> Compose f g a -> Compose f g a Source # some :: Compose f g a -> Compose f g [a] Source # many :: Compose f g a -> Compose f g [a] Source #
(Alternative f, Applicative g) => Alternative (f :.: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods empty :: (f :.: g) a Source # (<\|>) :: (f :.: g) a -> (f :.: g) a -> (f :.: g) a Source # some :: (f :.: g) a -> (f :.: g) [a] Source # many :: (f :.: g) a -> (f :.: g) [a] Source #
Alternative f => Alternative (M1 i c f)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods empty :: M1 i c f a Source # (<\|>) :: M1 i c f a -> M1 i c f a -> M1 i c f a Source # some :: M1 i c f a -> M1 i c f [a] Source # many :: M1 i c f a -> M1 i c f [a] Source #

(<$) :: Functor f => a -> f b -> f a infixl 4 Source #

Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

Examples

Expand

Perform a computation with Maybe and replace the result with a constant value if it is Just:

>>> 'a' <$ Just 2
Just 'a'
>>> 'a' <$ Nothing
Nothing

(<**>) :: Applicative f => f a -> f (a -> b) -> f b infixl 4 Source #

A variant of <*> with the types of the arguments reversed. It differs from flip (<*>) in that the effects are resolved in the order the arguments are presented.

Examples

Expand

>>> (<**>) (print 1) (id <$ print 2)
1
2

>>> flip (<*>) (print 1) (id <$ print 2)
2
1

>>> ZipList [4, 5, 6] <**> ZipList [(+1), (*2), (/3)]
ZipList {getZipList = [5.0,10.0,2.0]}

liftA :: Applicative f => (a -> b) -> f a -> f b Source #

Lift a function to actions. Equivalent to Functor's fmap but implemented using only Applicative's methods: liftA f a = pure f <*> a

As such this function may be used to implement a Functor instance from an Applicative one.

Examples

Expand

Using the Applicative instance for Lists:

>>> liftA (+1) [1, 2]
[2,3]

Or the Applicative instance for Maybe

>>> liftA (+1) (Just 3)
Just 4

liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d Source #

Lift a ternary function to actions.

(<$>) :: Functor f => (a -> b) -> f a -> f b infixl 4 Source #

An infix synonym for fmap.

The name of this operator is an allusion to $. Note the similarities between their types:

 ($)  ::              (a -> b) ->   a ->   b
(<$>) :: Functor f => (a -> b) -> f a -> f b

Whereas $ is function application, <$> is function application lifted over a Functor.

Examples

Expand

Convert from a Maybe Int to a Maybe String using show:

>>> show <$> Nothing
Nothing

>>> show <$> Just 3
Just "3"

Convert from an Either Int Int to an Either Int String using show:

>>> show <$> Left 17
Left 17

>>> show <$> Right 17
Right "17"

Double each element of a list:

>>> (*2) <$> [1,2,3]
[2,4,6]

Apply even to the second element of a pair:

>>> even <$> (2,2)
(2,True)

satisfy :: (t -> Bool) -> Parser t t #

eof :: Parser t () #

optional :: Alternative f => f a -> f (Maybe a) Source #

One or none.

It is useful for modelling any computation that is allowed to fail.

Examples

Expand

Using the Alternative instance of Control.Monad.Except, the following functions:

>>> import Control.Monad.Except

>>> canFail = throwError "it failed" :: Except String Int
>>> final = return 42                :: Except String Int

Can be combined by allowing the first function to fail:

>>> runExcept $ canFail *> final
Left "it failed"

>>> runExcept $ optional canFail *> final
Right 42

many1 :: PolyParse p => p a -> p [a] #

sepBy :: PolyParse p => p a -> p sep -> p [a] #

sepBy1 :: PolyParse p => p a -> p sep -> p [a] #

parens :: Bool -> TextParser a -> TextParser a #

apply :: PolyParse p => p (a -> b) -> p a -> p b #

asum :: (Foldable t, Alternative f) => t (f a) -> f a Source #

The sum of a collection of actions using (<|>), generalizing concat.

asum is just like msum, but generalised to Alternative.

Examples

Expand

Basic usage:

>>> asum [Just "Hello", Nothing, Just "World"]
Just "Hello"

newtype Const a (b :: k) Source #

The Const functor.

Examples

Expand

>>> fmap (++ "World") (Const "Hello")
Const "Hello"

Because we ignore the second type parameter to Const, the Applicative instance, which has (<*>) :: Monoid m => Const m (a -> b) -> Const m a -> Const m b essentially turns into Monoid m => m -> m -> m, which is (<>)

>>> Const [1, 2, 3] <*> Const [4, 5, 6]
Const [1,2,3,4,5,6]

Constructors

Const
Fields getConst :: a

Instances

Instances details

Generic1 (Const a :: k -> Type)

Instance details

Defined in GHC.Internal.Data.Functor.Const

Associated Types

type Rep1 (Const a :: k -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Const type Rep1 (Const a :: k -> Type) = D1 ('MetaData "Const" "GHC.Internal.Data.Functor.Const" "ghc-internal" 'True) (C1 ('MetaCons "Const" 'PrefixI 'True) (S1 ('MetaSel ('Just "getConst") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))

Methods

from1 :: forall (a0 :: k). Const a a0 -> Rep1 (Const a :: k -> Type) a0 Source #

to1 :: forall (a0 :: k). Rep1 (Const a :: k -> Type) a0 -> Const a a0 Source #

Bifoldable (Const :: Type -> Type -> Type)

Since: base-4.10.0.0

Instance details

Defined in Data.Bifoldable

Methods

bifold :: Monoid m => Const m m -> m Source #

bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Const a b -> m Source #

bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Const a b -> c Source #

bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Const a b -> c Source #

Bifoldable1 (Const :: Type -> Type -> Type)

Instance details

Defined in Data.Bifoldable1

Methods

bifold1 :: Semigroup m => Const m m -> m Source #

bifoldMap1 :: Semigroup m => (a -> m) -> (b -> m) -> Const a b -> m Source #

Bifunctor (Const :: Type -> Type -> Type)

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> Const a c -> Const b d Source #

first :: (a -> b) -> Const a c -> Const b c Source #

second :: (b -> c) -> Const a b -> Const a c Source #

Bitraversable (Const :: Type -> Type -> Type)

Since: base-4.10.0.0

Instance details

Defined in Data.Bitraversable

Methods

bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Const a b -> f (Const c d) Source #

Eq2 (Const :: Type -> Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Const a c -> Const b d -> Bool Source #

Ord2 (Const :: Type -> Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Const a c -> Const b d -> Ordering Source #

Read2 (Const :: Type -> Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Const a b) Source #

liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Const a b] Source #

liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Const a b) Source #

liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Const a b] Source #

Show2 (Const :: Type -> Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Const a b -> ShowS Source #

liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Const a b] -> ShowS Source #

Eq a => Eq1 (Const a :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftEq :: (a0 -> b -> Bool) -> Const a a0 -> Const a b -> Bool Source #

Ord a => Ord1 (Const a :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftCompare :: (a0 -> b -> Ordering) -> Const a a0 -> Const a b -> Ordering Source #

Read a => Read1 (Const a :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Const a a0) Source #

liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Const a a0] Source #

liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Const a a0) Source #

liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Const a a0] Source #

Show a => Show1 (Const a :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> Const a a0 -> ShowS Source #

liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [Const a a0] -> ShowS Source #

Contravariant (Const a :: Type -> Type)

Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a' -> a0) -> Const a a0 -> Const a a' Source #

(>$) :: b -> Const a b -> Const a a0 Source #

Monoid m => Applicative (Const m :: Type -> Type)

Since: base-2.0.1

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

pure :: a -> Const m a Source #

(<*>) :: Const m (a -> b) -> Const m a -> Const m b Source #

liftA2 :: (a -> b -> c) -> Const m a -> Const m b -> Const m c Source #

(*>) :: Const m a -> Const m b -> Const m b Source #

(<*) :: Const m a -> Const m b -> Const m a Source #

Functor (Const m :: Type -> Type)

Since: base-2.1

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

fmap :: (a -> b) -> Const m a -> Const m b Source #

(<$) :: a -> Const m b -> Const m a Source #

Foldable (Const m :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

fold :: Monoid m0 => Const m m0 -> m0 Source #

foldMap :: Monoid m0 => (a -> m0) -> Const m a -> m0 Source #

foldMap' :: Monoid m0 => (a -> m0) -> Const m a -> m0 Source #

foldr :: (a -> b -> b) -> b -> Const m a -> b Source #

foldr' :: (a -> b -> b) -> b -> Const m a -> b Source #

foldl :: (b -> a -> b) -> b -> Const m a -> b Source #

foldl' :: (b -> a -> b) -> b -> Const m a -> b Source #

foldr1 :: (a -> a -> a) -> Const m a -> a Source #

foldl1 :: (a -> a -> a) -> Const m a -> a Source #

toList :: Const m a -> [a] Source #

null :: Const m a -> Bool Source #

length :: Const m a -> Int Source #

elem :: Eq a => a -> Const m a -> Bool Source #

maximum :: Ord a => Const m a -> a Source #

minimum :: Ord a => Const m a -> a Source #

sum :: Num a => Const m a -> a Source #

product :: Num a => Const m a -> a Source #

Monoid a => Monoid (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

mempty :: Const a b Source #

mappend :: Const a b -> Const a b -> Const a b Source #

mconcat :: [Const a b] -> Const a b Source #

Semigroup a => Semigroup (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

(<>) :: Const a b -> Const a b -> Const a b Source #

sconcat :: NonEmpty (Const a b) -> Const a b Source #

stimes :: Integral b0 => b0 -> Const a b -> Const a b Source #

Bits a => Bits (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

(.&.) :: Const a b -> Const a b -> Const a b Source #

(.|.) :: Const a b -> Const a b -> Const a b Source #

xor :: Const a b -> Const a b -> Const a b Source #

complement :: Const a b -> Const a b Source #

shift :: Const a b -> Int -> Const a b Source #

rotate :: Const a b -> Int -> Const a b Source #

zeroBits :: Const a b Source #

bit :: Int -> Const a b Source #

setBit :: Const a b -> Int -> Const a b Source #

clearBit :: Const a b -> Int -> Const a b Source #

complementBit :: Const a b -> Int -> Const a b Source #

testBit :: Const a b -> Int -> Bool Source #

bitSizeMaybe :: Const a b -> Maybe Int Source #

bitSize :: Const a b -> Int Source #

isSigned :: Const a b -> Bool Source #

shiftL :: Const a b -> Int -> Const a b Source #

unsafeShiftL :: Const a b -> Int -> Const a b Source #

shiftR :: Const a b -> Int -> Const a b Source #

unsafeShiftR :: Const a b -> Int -> Const a b Source #

rotateL :: Const a b -> Int -> Const a b Source #

rotateR :: Const a b -> Int -> Const a b Source #

popCount :: Const a b -> Int Source #

FiniteBits a => FiniteBits (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

finiteBitSize :: Const a b -> Int Source #

countLeadingZeros :: Const a b -> Int Source #

countTrailingZeros :: Const a b -> Int Source #

Bounded a => Bounded (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

minBound :: Const a b Source #

maxBound :: Const a b Source #

Enum a => Enum (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

succ :: Const a b -> Const a b Source #

pred :: Const a b -> Const a b Source #

toEnum :: Int -> Const a b Source #

fromEnum :: Const a b -> Int Source #

enumFrom :: Const a b -> [Const a b] Source #

enumFromThen :: Const a b -> Const a b -> [Const a b] Source #

enumFromTo :: Const a b -> Const a b -> [Const a b] Source #

enumFromThenTo :: Const a b -> Const a b -> Const a b -> [Const a b] Source #

Floating a => Floating (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

pi :: Const a b Source #

exp :: Const a b -> Const a b Source #

log :: Const a b -> Const a b Source #

sqrt :: Const a b -> Const a b Source #

(**) :: Const a b -> Const a b -> Const a b Source #

logBase :: Const a b -> Const a b -> Const a b Source #

sin :: Const a b -> Const a b Source #

cos :: Const a b -> Const a b Source #

tan :: Const a b -> Const a b Source #

asin :: Const a b -> Const a b Source #

acos :: Const a b -> Const a b Source #

atan :: Const a b -> Const a b Source #

sinh :: Const a b -> Const a b Source #

cosh :: Const a b -> Const a b Source #

tanh :: Const a b -> Const a b Source #

asinh :: Const a b -> Const a b Source #

acosh :: Const a b -> Const a b Source #

atanh :: Const a b -> Const a b Source #

log1p :: Const a b -> Const a b Source #

expm1 :: Const a b -> Const a b Source #

log1pexp :: Const a b -> Const a b Source #

log1mexp :: Const a b -> Const a b Source #

RealFloat a => RealFloat (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

floatRadix :: Const a b -> Integer Source #

floatDigits :: Const a b -> Int Source #

floatRange :: Const a b -> (Int, Int) Source #

decodeFloat :: Const a b -> (Integer, Int) Source #

encodeFloat :: Integer -> Int -> Const a b Source #

exponent :: Const a b -> Int Source #

significand :: Const a b -> Const a b Source #

scaleFloat :: Int -> Const a b -> Const a b Source #

isNaN :: Const a b -> Bool Source #

isInfinite :: Const a b -> Bool Source #

isDenormalized :: Const a b -> Bool Source #

isNegativeZero :: Const a b -> Bool Source #

isIEEE :: Const a b -> Bool Source #

atan2 :: Const a b -> Const a b -> Const a b Source #

Storable a => Storable (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

sizeOf :: Const a b -> Int Source #

alignment :: Const a b -> Int Source #

peekElemOff :: Ptr (Const a b) -> Int -> IO (Const a b) Source #

pokeElemOff :: Ptr (Const a b) -> Int -> Const a b -> IO () Source #

peekByteOff :: Ptr b0 -> Int -> IO (Const a b) Source #

pokeByteOff :: Ptr b0 -> Int -> Const a b -> IO () Source #

peek :: Ptr (Const a b) -> IO (Const a b) Source #

poke :: Ptr (Const a b) -> Const a b -> IO () Source #

Generic (Const a b)

Instance details

Defined in GHC.Internal.Data.Functor.Const

Associated Types

type Rep (Const a b)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Const type Rep (Const a b) = D1 ('MetaData "Const" "GHC.Internal.Data.Functor.Const" "ghc-internal" 'True) (C1 ('MetaCons "Const" 'PrefixI 'True) (S1 ('MetaSel ('Just "getConst") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))

Methods

from :: Const a b -> Rep (Const a b) x Source #

to :: Rep (Const a b) x -> Const a b Source #

Ix a => Ix (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

range :: (Const a b, Const a b) -> [Const a b] Source #

index :: (Const a b, Const a b) -> Const a b -> Int Source #

unsafeIndex :: (Const a b, Const a b) -> Const a b -> Int Source #

inRange :: (Const a b, Const a b) -> Const a b -> Bool Source #

rangeSize :: (Const a b, Const a b) -> Int Source #

unsafeRangeSize :: (Const a b, Const a b) -> Int Source #

Num a => Num (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

(+) :: Const a b -> Const a b -> Const a b Source #

(-) :: Const a b -> Const a b -> Const a b Source #

(*) :: Const a b -> Const a b -> Const a b Source #

negate :: Const a b -> Const a b Source #

abs :: Const a b -> Const a b Source #

signum :: Const a b -> Const a b Source #

fromInteger :: Integer -> Const a b Source #

Read a => Read (Const a b)

This instance would be equivalent to the derived instances of the Const newtype if the getConst field were removed

Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

readsPrec :: Int -> ReadS (Const a b) Source #

readList :: ReadS [Const a b] Source #

readPrec :: ReadPrec (Const a b) Source #

readListPrec :: ReadPrec [Const a b] Source #

Fractional a => Fractional (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

(/) :: Const a b -> Const a b -> Const a b Source #

recip :: Const a b -> Const a b Source #

fromRational :: Rational -> Const a b Source #

Integral a => Integral (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

quot :: Const a b -> Const a b -> Const a b Source #

rem :: Const a b -> Const a b -> Const a b Source #

div :: Const a b -> Const a b -> Const a b Source #

mod :: Const a b -> Const a b -> Const a b Source #

quotRem :: Const a b -> Const a b -> (Const a b, Const a b) Source #

divMod :: Const a b -> Const a b -> (Const a b, Const a b) Source #

toInteger :: Const a b -> Integer Source #

Real a => Real (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

toRational :: Const a b -> Rational Source #

RealFrac a => RealFrac (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

properFraction :: Integral b0 => Const a b -> (b0, Const a b) Source #

truncate :: Integral b0 => Const a b -> b0 Source #

round :: Integral b0 => Const a b -> b0 Source #

ceiling :: Integral b0 => Const a b -> b0 Source #

floor :: Integral b0 => Const a b -> b0 Source #

Show a => Show (Const a b)

This instance would be equivalent to the derived instances of the Const newtype if the getConst field were removed

Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

showsPrec :: Int -> Const a b -> ShowS Source #

show :: Const a b -> String Source #

showList :: [Const a b] -> ShowS Source #

Eq a => Eq (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

(==) :: Const a b -> Const a b -> Bool Source #

(/=) :: Const a b -> Const a b -> Bool Source #

Ord a => Ord (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

compare :: Const a b -> Const a b -> Ordering Source #

(<) :: Const a b -> Const a b -> Bool Source #

(<=) :: Const a b -> Const a b -> Bool Source #

(>) :: Const a b -> Const a b -> Bool Source #

(>=) :: Const a b -> Const a b -> Bool Source #

max :: Const a b -> Const a b -> Const a b Source #

min :: Const a b -> Const a b -> Const a b Source #

type Rep1 (Const a :: k -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

type Rep1 (Const a :: k -> Type) = D1 ('MetaData "Const" "GHC.Internal.Data.Functor.Const" "ghc-internal" 'True) (C1 ('MetaCons "Const" 'PrefixI 'True) (S1 ('MetaSel ('Just "getConst") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))

type Rep (Const a b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

type Rep (Const a b) = D1 ('MetaData "Const" "GHC.Internal.Data.Functor.Const" "ghc-internal" 'True) (C1 ('MetaCons "Const" 'PrefixI 'True) (S1 ('MetaSel ('Just "getConst") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))

bracket :: PolyParse p => p bra -> p ket -> p a -> p a #

newtype ZipList a Source #

Lists, but with an Applicative functor based on zipping.

Examples

Expand

In contrast to the Applicative for List:

>>> (+) <$> [1, 2, 3] <*> [4, 5, 6]
[5,6,7,6,7,8,7,8,9]

The Applicative instance of ZipList applies the operation by pairing up the elements, analogous to zipWithN

>>> (+) <$> ZipList [1, 2, 3] <*> ZipList [4, 5, 6]
ZipList {getZipList = [5,7,9]}

>>> (,,,) <$> ZipList [1, 2] <*> ZipList [3, 4] <*> ZipList [5, 6] <*> ZipList [7, 8]
ZipList {getZipList = [(1,3,5,7),(2,4,6,8)]}

>>> ZipList [(+1), (^2), (/ 2)] <*> ZipList [5, 5, 5]
ZipList {getZipList = [6.0,25.0,2.5]}

Constructors

ZipList
Fields getZipList :: [a]

Instances

Instances details

Alternative ZipList

Since: base-4.11.0.0

Instance details

Defined in GHC.Internal.Functor.ZipList

Methods

empty :: ZipList a Source #

(<|>) :: ZipList a -> ZipList a -> ZipList a Source #

some :: ZipList a -> ZipList [a] Source #

many :: ZipList a -> ZipList [a] Source #

Applicative ZipList

f <$> ZipList xs1 <*> ... <*> ZipList xsN
    = ZipList (zipWithN f xs1 ... xsN)

where zipWithN refers to the zipWith function of the appropriate arity (zipWith, zipWith3, zipWith4, ...). For example:

(\a b c -> stimes c [a, b]) <$> ZipList "abcd" <*> ZipList "567" <*> ZipList [1..]
    = ZipList (zipWith3 (\a b c -> stimes c [a, b]) "abcd" "567" [1..])
    = ZipList {getZipList = ["a5","b6b6","c7c7c7"]}

Since: base-2.1

Instance details

Defined in GHC.Internal.Functor.ZipList

Methods

pure :: a -> ZipList a Source #

(<*>) :: ZipList (a -> b) -> ZipList a -> ZipList b Source #

liftA2 :: (a -> b -> c) -> ZipList a -> ZipList b -> ZipList c Source #

(*>) :: ZipList a -> ZipList b -> ZipList b Source #

(<*) :: ZipList a -> ZipList b -> ZipList a Source #

Functor ZipList

Since: base-2.1

Instance details

Defined in GHC.Internal.Functor.ZipList

Methods

fmap :: (a -> b) -> ZipList a -> ZipList b Source #

(<$) :: a -> ZipList b -> ZipList a Source #

Foldable ZipList

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Functor.ZipList

Methods

fold :: Monoid m => ZipList m -> m Source #

foldMap :: Monoid m => (a -> m) -> ZipList a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ZipList a -> m Source #

foldr :: (a -> b -> b) -> b -> ZipList a -> b Source #

foldr' :: (a -> b -> b) -> b -> ZipList a -> b Source #

foldl :: (b -> a -> b) -> b -> ZipList a -> b Source #

foldl' :: (b -> a -> b) -> b -> ZipList a -> b Source #

foldr1 :: (a -> a -> a) -> ZipList a -> a Source #

foldl1 :: (a -> a -> a) -> ZipList a -> a Source #

toList :: ZipList a -> [a] Source #

null :: ZipList a -> Bool Source #

length :: ZipList a -> Int Source #

elem :: Eq a => a -> ZipList a -> Bool Source #

maximum :: Ord a => ZipList a -> a Source #

minimum :: Ord a => ZipList a -> a Source #

sum :: Num a => ZipList a -> a Source #

product :: Num a => ZipList a -> a Source #

Traversable ZipList

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Functor.ZipList

Methods

traverse :: Applicative f => (a -> f b) -> ZipList a -> f (ZipList b) Source #

sequenceA :: Applicative f => ZipList (f a) -> f (ZipList a) Source #

mapM :: Monad m => (a -> m b) -> ZipList a -> m (ZipList b) Source #

sequence :: Monad m => ZipList (m a) -> m (ZipList a) Source #

Generic1 ZipList

Instance details

Defined in GHC.Internal.Functor.ZipList

Associated Types

type Rep1 ZipList	Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Functor.ZipList type Rep1 ZipList = D1 ('MetaData "ZipList" "GHC.Internal.Functor.ZipList" "ghc-internal" 'True) (C1 ('MetaCons "ZipList" 'PrefixI 'True) (S1 ('MetaSel ('Just "getZipList") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 [])))

Methods

from1 :: ZipList a -> Rep1 ZipList a Source #

to1 :: Rep1 ZipList a -> ZipList a Source #

Data a => Data (ZipList a)

Since: base-4.14.0.0

Instance details

Defined in GHC.Internal.Functor.ZipList

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ZipList a -> c (ZipList a) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ZipList a) Source #

toConstr :: ZipList a -> Constr Source #

dataTypeOf :: ZipList a -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ZipList a)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ZipList a)) Source #

gmapT :: (forall b. Data b => b -> b) -> ZipList a -> ZipList a Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ZipList a -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ZipList a -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> ZipList a -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ZipList a -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ZipList a -> m (ZipList a) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ZipList a -> m (ZipList a) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ZipList a -> m (ZipList a) Source #

Generic (ZipList a)

Instance details

Defined in GHC.Internal.Functor.ZipList

Associated Types

type Rep (ZipList a)	Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Functor.ZipList type Rep (ZipList a) = D1 ('MetaData "ZipList" "GHC.Internal.Functor.ZipList" "ghc-internal" 'True) (C1 ('MetaCons "ZipList" 'PrefixI 'True) (S1 ('MetaSel ('Just "getZipList") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [a])))

Methods

from :: ZipList a -> Rep (ZipList a) x Source #

to :: Rep (ZipList a) x -> ZipList a Source #

IsList (ZipList a)

Since: base-4.15.0.0

Instance details

Defined in GHC.Internal.IsList

Associated Types

type Item (ZipList a)
Instance details Defined in GHC.Internal.IsList type Item (ZipList a) = a

Methods

fromList :: [Item (ZipList a)] -> ZipList a Source #

fromListN :: Int -> [Item (ZipList a)] -> ZipList a Source #

toList :: ZipList a -> [Item (ZipList a)] Source #

Read a => Read (ZipList a)

Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Functor.ZipList

Methods

readsPrec :: Int -> ReadS (ZipList a) Source #

readList :: ReadS [ZipList a] Source #

readPrec :: ReadPrec (ZipList a) Source #

readListPrec :: ReadPrec [ZipList a] Source #

Show a => Show (ZipList a)

Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Functor.ZipList

Methods

showsPrec :: Int -> ZipList a -> ShowS Source #

show :: ZipList a -> String Source #

showList :: [ZipList a] -> ShowS Source #

Eq a => Eq (ZipList a)

Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Functor.ZipList

Methods

(==) :: ZipList a -> ZipList a -> Bool Source #

(/=) :: ZipList a -> ZipList a -> Bool Source #

Ord a => Ord (ZipList a)

Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Functor.ZipList

Methods

compare :: ZipList a -> ZipList a -> Ordering Source #

(<) :: ZipList a -> ZipList a -> Bool Source #

(<=) :: ZipList a -> ZipList a -> Bool Source #

(>) :: ZipList a -> ZipList a -> Bool Source #

(>=) :: ZipList a -> ZipList a -> Bool Source #

max :: ZipList a -> ZipList a -> ZipList a Source #

min :: ZipList a -> ZipList a -> ZipList a Source #

type Rep1 ZipList

Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Functor.ZipList

type Rep1 ZipList = D1 ('MetaData "ZipList" "GHC.Internal.Functor.ZipList" "ghc-internal" 'True) (C1 ('MetaCons "ZipList" 'PrefixI 'True) (S1 ('MetaSel ('Just "getZipList") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 [])))

type Rep (ZipList a)

Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Functor.ZipList

type Rep (ZipList a) = D1 ('MetaData "ZipList" "GHC.Internal.Functor.ZipList" "ghc-internal" 'True) (C1 ('MetaCons "ZipList" 'PrefixI 'True) (S1 ('MetaSel ('Just "getZipList") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [a])))

type Item (ZipList a)

Instance details

Defined in GHC.Internal.IsList

type Item (ZipList a) = a

newtype WrappedArrow (a :: Type -> Type -> Type) b c Source #

Constructors

WrapArrow
Fields unwrapArrow :: a b c

Instances

Instances details

Generic1 (WrappedArrow a b :: Type -> Type)

Instance details

Defined in Control.Applicative

Associated Types

type Rep1 (WrappedArrow a b :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative type Rep1 (WrappedArrow a b :: Type -> Type) = D1 ('MetaData "WrappedArrow" "Control.Applicative" "base" 'True) (C1 ('MetaCons "WrapArrow" 'PrefixI 'True) (S1 ('MetaSel ('Just "unwrapArrow") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 (a b))))

Methods

from1 :: WrappedArrow a b a0 -> Rep1 (WrappedArrow a b) a0 Source #

to1 :: Rep1 (WrappedArrow a b) a0 -> WrappedArrow a b a0 Source #

(ArrowZero a, ArrowPlus a) => Alternative (WrappedArrow a b)

Since: base-2.1

Instance details

Defined in Control.Applicative

Methods

empty :: WrappedArrow a b a0 Source #

(<|>) :: WrappedArrow a b a0 -> WrappedArrow a b a0 -> WrappedArrow a b a0 Source #

some :: WrappedArrow a b a0 -> WrappedArrow a b [a0] Source #

many :: WrappedArrow a b a0 -> WrappedArrow a b [a0] Source #

Arrow a => Applicative (WrappedArrow a b)

Since: base-2.1

Instance details

Defined in Control.Applicative

Methods

pure :: a0 -> WrappedArrow a b a0 Source #

(<*>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 Source #

liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c Source #

(*>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 Source #

(<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 Source #

Arrow a => Functor (WrappedArrow a b)

Since: base-2.1

Instance details

Defined in Control.Applicative

Methods

fmap :: (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 Source #

(<$) :: a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 Source #

(Typeable a, Typeable b, Typeable c, Data (a b c)) => Data (WrappedArrow a b c)

Since: base-4.14.0.0

Instance details

Defined in Control.Applicative

Methods

gfoldl :: (forall d b0. Data d => c0 (d -> b0) -> d -> c0 b0) -> (forall g. g -> c0 g) -> WrappedArrow a b c -> c0 (WrappedArrow a b c) Source #

gunfold :: (forall b0 r. Data b0 => c0 (b0 -> r) -> c0 r) -> (forall r. r -> c0 r) -> Constr -> c0 (WrappedArrow a b c) Source #

toConstr :: WrappedArrow a b c -> Constr Source #

dataTypeOf :: WrappedArrow a b c -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c0 (t d)) -> Maybe (c0 (WrappedArrow a b c)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c0 (t d e)) -> Maybe (c0 (WrappedArrow a b c)) Source #

gmapT :: (forall b0. Data b0 => b0 -> b0) -> WrappedArrow a b c -> WrappedArrow a b c Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> WrappedArrow a b c -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> WrappedArrow a b c -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> WrappedArrow a b c -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> WrappedArrow a b c -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> WrappedArrow a b c -> m (WrappedArrow a b c) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> WrappedArrow a b c -> m (WrappedArrow a b c) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> WrappedArrow a b c -> m (WrappedArrow a b c) Source #

Generic (WrappedArrow a b c)

Instance details

Defined in Control.Applicative

Associated Types

type Rep (WrappedArrow a b c)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative type Rep (WrappedArrow a b c) = D1 ('MetaData "WrappedArrow" "Control.Applicative" "base" 'True) (C1 ('MetaCons "WrapArrow" 'PrefixI 'True) (S1 ('MetaSel ('Just "unwrapArrow") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (a b c))))

Methods

from :: WrappedArrow a b c -> Rep (WrappedArrow a b c) x Source #

to :: Rep (WrappedArrow a b c) x -> WrappedArrow a b c Source #

type Rep1 (WrappedArrow a b :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in Control.Applicative

type Rep1 (WrappedArrow a b :: Type -> Type) = D1 ('MetaData "WrappedArrow" "Control.Applicative" "base" 'True) (C1 ('MetaCons "WrapArrow" 'PrefixI 'True) (S1 ('MetaSel ('Just "unwrapArrow") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 (a b))))

type Rep (WrappedArrow a b c)

Since: base-4.7.0.0

Instance details

Defined in Control.Applicative

type Rep (WrappedArrow a b c) = D1 ('MetaData "WrappedArrow" "Control.Applicative" "base" 'True) (C1 ('MetaCons "WrapArrow" 'PrefixI 'True) (S1 ('MetaSel ('Just "unwrapArrow") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (a b c))))

newtype WrappedMonad (m :: Type -> Type) a Source #

Constructors

WrapMonad
Fields unwrapMonad :: m a

Instances

Instances details

Generic1 (WrappedMonad m :: Type -> Type)

Instance details

Defined in Control.Applicative

Associated Types

type Rep1 (WrappedMonad m :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative type Rep1 (WrappedMonad m :: Type -> Type) = D1 ('MetaData "WrappedMonad" "Control.Applicative" "base" 'True) (C1 ('MetaCons "WrapMonad" 'PrefixI 'True) (S1 ('MetaSel ('Just "unwrapMonad") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 m)))

Methods

from1 :: WrappedMonad m a -> Rep1 (WrappedMonad m) a Source #

to1 :: Rep1 (WrappedMonad m) a -> WrappedMonad m a Source #

MonadPlus m => Alternative (WrappedMonad m)

Since: base-2.1

Instance details

Defined in Control.Applicative

Methods

empty :: WrappedMonad m a Source #

(<|>) :: WrappedMonad m a -> WrappedMonad m a -> WrappedMonad m a Source #

some :: WrappedMonad m a -> WrappedMonad m [a] Source #

many :: WrappedMonad m a -> WrappedMonad m [a] Source #

Monad m => Applicative (WrappedMonad m)

Since: base-2.1

Instance details

Defined in Control.Applicative

Methods

pure :: a -> WrappedMonad m a Source #

(<*>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b Source #

liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c Source #

(*>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b Source #

(<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a Source #

Monad m => Functor (WrappedMonad m)

Since: base-2.1

Instance details

Defined in Control.Applicative

Methods

fmap :: (a -> b) -> WrappedMonad m a -> WrappedMonad m b Source #

(<$) :: a -> WrappedMonad m b -> WrappedMonad m a Source #

Monad m => Monad (WrappedMonad m)

Since: base-4.7.0.0

Instance details

Defined in Control.Applicative

Methods

(>>=) :: WrappedMonad m a -> (a -> WrappedMonad m b) -> WrappedMonad m b Source #

(>>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b Source #

return :: a -> WrappedMonad m a Source #

(Typeable m, Typeable a, Data (m a)) => Data (WrappedMonad m a)

Since: base-4.14.0.0

Instance details

Defined in Control.Applicative

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> WrappedMonad m a -> c (WrappedMonad m a) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (WrappedMonad m a) Source #

toConstr :: WrappedMonad m a -> Constr Source #

dataTypeOf :: WrappedMonad m a -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (WrappedMonad m a)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (WrappedMonad m a)) Source #

gmapT :: (forall b. Data b => b -> b) -> WrappedMonad m a -> WrappedMonad m a Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> WrappedMonad m a -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> WrappedMonad m a -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> WrappedMonad m a -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> WrappedMonad m a -> u Source #

gmapM :: Monad m0 => (forall d. Data d => d -> m0 d) -> WrappedMonad m a -> m0 (WrappedMonad m a) Source #

gmapMp :: MonadPlus m0 => (forall d. Data d => d -> m0 d) -> WrappedMonad m a -> m0 (WrappedMonad m a) Source #

gmapMo :: MonadPlus m0 => (forall d. Data d => d -> m0 d) -> WrappedMonad m a -> m0 (WrappedMonad m a) Source #

Generic (WrappedMonad m a)

Instance details

Defined in Control.Applicative

Associated Types

type Rep (WrappedMonad m a)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative type Rep (WrappedMonad m a) = D1 ('MetaData "WrappedMonad" "Control.Applicative" "base" 'True) (C1 ('MetaCons "WrapMonad" 'PrefixI 'True) (S1 ('MetaSel ('Just "unwrapMonad") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (m a))))

Methods

from :: WrappedMonad m a -> Rep (WrappedMonad m a) x Source #

to :: Rep (WrappedMonad m a) x -> WrappedMonad m a Source #

type Rep1 (WrappedMonad m :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in Control.Applicative

type Rep1 (WrappedMonad m :: Type -> Type) = D1 ('MetaData "WrappedMonad" "Control.Applicative" "base" 'True) (C1 ('MetaCons "WrapMonad" 'PrefixI 'True) (S1 ('MetaSel ('Just "unwrapMonad") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 m)))

type Rep (WrappedMonad m a)

Since: base-4.7.0.0

Instance details

Defined in Control.Applicative

type Rep (WrappedMonad m a) = D1 ('MetaData "WrappedMonad" "Control.Applicative" "base" 'True) (C1 ('MetaCons "WrapMonad" 'PrefixI 'True) (S1 ('MetaSel ('Just "unwrapMonad") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (m a))))

newtype Parser t a #

Constructors

P ([t] -> Result [t] a)

Instances

Instances details

Alternative (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Parser Methods empty :: Parser t a Source # (<\|>) :: Parser t a -> Parser t a -> Parser t a Source # some :: Parser t a -> Parser t [a] Source # many :: Parser t a -> Parser t [a] Source #
Applicative (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Parser Methods pure :: a -> Parser t a Source # (<>) :: Parser t (a -> b) -> Parser t a -> Parser t b Source # liftA2 :: (a -> b -> c) -> Parser t a -> Parser t b -> Parser t c Source # (>) :: Parser t a -> Parser t b -> Parser t b Source # (<*) :: Parser t a -> Parser t b -> Parser t a Source #
Functor (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Parser Methods fmap :: (a -> b) -> Parser t a -> Parser t b Source # (<$) :: a -> Parser t b -> Parser t a Source #
Monad (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Parser Methods (>>=) :: Parser t a -> (a -> Parser t b) -> Parser t b Source # (>>) :: Parser t a -> Parser t b -> Parser t b Source # return :: a -> Parser t a Source #
MonadFail (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Parser Methods fail :: String -> Parser t a Source #
Commitment (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Parser Methods commit :: Parser t a -> Parser t a # adjustErr :: Parser t a -> (String -> String) -> Parser t a # oneOf' :: [(String, Parser t a)] -> Parser t a #
PolyParse (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Parser

data Result z a #

Constructors

Success z a
Failure z String
Committed (Result z a)

Instances

Instances details

Functor (Result z)
Instance details Defined in Text.ParserCombinators.Poly.Result Methods fmap :: (a -> b) -> Result z a -> Result z b Source # (<$) :: a -> Result z b -> Result z a Source #

reparse :: [t] -> Parser t () #

class (Functor p, Monad p, MonadFail p, Applicative p, Alternative p, Commitment p) => PolyParse (p :: Type -> Type) #

Instances

Instances details

PolyParse Parser
Instance details Defined in Text.ParserCombinators.Poly.ByteString
PolyParse Parser
Instance details Defined in Text.ParserCombinators.Poly.ByteStringChar
PolyParse Parser
Instance details Defined in Text.ParserCombinators.Poly.Text
PolyParse (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Lazy
PolyParse (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Lex
PolyParse (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Parser
PolyParse (Parser s)
Instance details Defined in Text.ParserCombinators.Poly.StateText
PolyParse (Parser s t)
Instance details Defined in Text.ParserCombinators.Poly.StateLazy
PolyParse (Parser s t)
Instance details Defined in Text.ParserCombinators.Poly.StateParser

class Commitment (p :: Type -> Type) where #

Methods

commit :: p a -> p a #

adjustErr :: p a -> (String -> String) -> p a #

oneOf' :: [(String, p a)] -> p a #

Instances

Instances details

Commitment Parser
Instance details Defined in Text.ParserCombinators.Poly.ByteString Methods commit :: Parser a -> Parser a # adjustErr :: Parser a -> (String -> String) -> Parser a # oneOf' :: [(String, Parser a)] -> Parser a #
Commitment Parser
Instance details Defined in Text.ParserCombinators.Poly.ByteStringChar Methods commit :: Parser a -> Parser a # adjustErr :: Parser a -> (String -> String) -> Parser a # oneOf' :: [(String, Parser a)] -> Parser a #
Commitment Parser
Instance details Defined in Text.ParserCombinators.Poly.Text Methods commit :: Parser a -> Parser a # adjustErr :: Parser a -> (String -> String) -> Parser a # oneOf' :: [(String, Parser a)] -> Parser a #
Commitment (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Lazy Methods commit :: Parser t a -> Parser t a # adjustErr :: Parser t a -> (String -> String) -> Parser t a # oneOf' :: [(String, Parser t a)] -> Parser t a #
Commitment (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Lex Methods commit :: Parser t a -> Parser t a # adjustErr :: Parser t a -> (String -> String) -> Parser t a # oneOf' :: [(String, Parser t a)] -> Parser t a #
Commitment (Parser t)
Instance details Defined in Text.ParserCombinators.Poly.Parser Methods commit :: Parser t a -> Parser t a # adjustErr :: Parser t a -> (String -> String) -> Parser t a # oneOf' :: [(String, Parser t a)] -> Parser t a #
Commitment (Parser s)
Instance details Defined in Text.ParserCombinators.Poly.StateText Methods commit :: Parser s a -> Parser s a # adjustErr :: Parser s a -> (String -> String) -> Parser s a # oneOf' :: [(String, Parser s a)] -> Parser s a #
Commitment (Parser s t)
Instance details Defined in Text.ParserCombinators.Poly.StateLazy Methods commit :: Parser s t a -> Parser s t a # adjustErr :: Parser s t a -> (String -> String) -> Parser s t a # oneOf' :: [(String, Parser s t a)] -> Parser s t a #
Commitment (Parser s t)
Instance details Defined in Text.ParserCombinators.Poly.StateParser Methods commit :: Parser s t a -> Parser s t a # adjustErr :: Parser s t a -> (String -> String) -> Parser s t a # oneOf' :: [(String, Parser s t a)] -> Parser s t a #

discard :: PolyParse p => p a -> p b -> p a #

failBad :: PolyParse p => String -> p a #

adjustErrBad :: PolyParse p => p a -> (String -> String) -> p a #

oneOf :: PolyParse p => [p a] -> p a #

indent :: Int -> String -> String #

exactly :: PolyParse p => Int -> p a -> p [a] #

upto :: PolyParse p => Int -> p a -> p [a] #

bracketSep :: PolyParse p => p bra -> p sep -> p ket -> p a -> p [a] #

manyFinally :: PolyParse p => p a -> p z -> p [a] #

manyFinally' :: (PolyParse p, Show a) => p a -> p z -> p [a] #

onFail :: Parser t a -> Parser t a -> Parser t a #

next :: Parser t t #

satisfyMsg :: Show t => (t -> Bool) -> String -> Parser t t #

runParser :: Parser t a -> [t] -> (Either String a, [t]) #

class Parse a where #

Minimal complete definition

Nothing

Methods

parse :: TextParser a #

parsePrec :: Int -> TextParser a #

parseList :: TextParser [a] #

Instances

Instances details

Parse Ordering
Instance details Defined in Text.Parse Methods parse :: TextParser Ordering # parsePrec :: Int -> TextParser Ordering # parseList :: TextParser [Ordering] #
Parse Integer
Instance details Defined in Text.Parse Methods parse :: TextParser Integer # parsePrec :: Int -> TextParser Integer # parseList :: TextParser [Integer] #
Parse ()
Instance details Defined in Text.Parse Methods parse :: TextParser () # parsePrec :: Int -> TextParser () # parseList :: TextParser [()] #
Parse Bool
Instance details Defined in Text.Parse Methods parse :: TextParser Bool # parsePrec :: Int -> TextParser Bool # parseList :: TextParser [Bool] #
Parse Char
Instance details Defined in Text.Parse Methods parse :: TextParser Char # parsePrec :: Int -> TextParser Char # parseList :: TextParser [Char] #
Parse Double
Instance details Defined in Text.Parse Methods parse :: TextParser Double # parsePrec :: Int -> TextParser Double # parseList :: TextParser [Double] #
Parse Float
Instance details Defined in Text.Parse Methods parse :: TextParser Float # parsePrec :: Int -> TextParser Float # parseList :: TextParser [Float] #
Parse Int
Instance details Defined in Text.Parse Methods parse :: TextParser Int # parsePrec :: Int -> TextParser Int # parseList :: TextParser [Int] #
Parse a => Parse (Maybe a)
Instance details Defined in Text.Parse Methods parse :: TextParser (Maybe a) # parsePrec :: Int -> TextParser (Maybe a) # parseList :: TextParser [Maybe a] #
Parse a => Parse [a]
Instance details Defined in Text.Parse Methods parse :: TextParser [a] # parsePrec :: Int -> TextParser [a] # parseList :: TextParser [[a]] #
(Parse a, Parse b) => Parse (Either a b)
Instance details Defined in Text.Parse Methods parse :: TextParser (Either a b) # parsePrec :: Int -> TextParser (Either a b) # parseList :: TextParser [Either a b] #
(Parse a, Parse b) => Parse (a, b)
Instance details Defined in Text.Parse Methods parse :: TextParser (a, b) # parsePrec :: Int -> TextParser (a, b) # parseList :: TextParser [(a, b)] #
(Parse a, Parse b, Parse c) => Parse (a, b, c)
Instance details Defined in Text.Parse Methods parse :: TextParser (a, b, c) # parsePrec :: Int -> TextParser (a, b, c) # parseList :: TextParser [(a, b, c)] #

type TextParser a = Parser Char a #

parseByRead :: Read a => String -> TextParser a #

readByParse :: TextParser a -> ReadS a #

readsPrecByParsePrec :: (Int -> TextParser a) -> Int -> ReadS a #

word :: TextParser String #

isWord :: String -> TextParser String #

literal :: String -> TextParser String #

optionalParens :: TextParser a -> TextParser a #

field :: Parse a => String -> TextParser a #

constructors :: [(String, TextParser a)] -> TextParser a #

enumeration :: Show a => String -> [a] -> TextParser a #

parseSigned :: Real a => TextParser a -> TextParser a #

parseInt :: Integral a => String -> a -> (Char -> Bool) -> (Char -> Int) -> TextParser a #

parseDec :: Integral a => TextParser a #

parseOct :: Integral a => TextParser a #

parseHex :: Integral a => TextParser a #

parseFloat :: RealFrac a => TextParser a #

parseLitChar' :: TextParser Char #

parseLitChar :: TextParser Char #

allAsString :: TextParser String #

Primitive XSD datatypes

newtype XsdString Source #

Constructors

XsdString String

Instances

Instances details

SimpleType XsdString Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser XsdString Source # simpleTypeText :: XsdString -> String Source #
SchemaType XsdString Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser XsdString Source # schemaTypeToXML :: String -> XsdString -> [Content ()] Source #
Show XsdString Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> XsdString -> ShowS Source # show :: XsdString -> String Source # showList :: [XsdString] -> ShowS Source #
Eq XsdString Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: XsdString -> XsdString -> Bool Source # (/=) :: XsdString -> XsdString -> Bool Source #

type Boolean = Bool Source #

data Base64Binary Source #

Constructors

Base64Binary String

Instances

Instances details

SimpleType Base64Binary Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Base64Binary Source # simpleTypeText :: Base64Binary -> String Source #
SchemaType Base64Binary Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser Base64Binary Source # schemaTypeToXML :: String -> Base64Binary -> [Content ()] Source #
Show Base64Binary Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> Base64Binary -> ShowS Source # show :: Base64Binary -> String Source # showList :: [Base64Binary] -> ShowS Source #
Eq Base64Binary Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: Base64Binary -> Base64Binary -> Bool Source # (/=) :: Base64Binary -> Base64Binary -> Bool Source #

data HexBinary Source #

Constructors

HexBinary String

Instances

Instances details

SimpleType HexBinary Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser HexBinary Source # simpleTypeText :: HexBinary -> String Source #
SchemaType HexBinary Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser HexBinary Source # schemaTypeToXML :: String -> HexBinary -> [Content ()] Source #
Show HexBinary Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> HexBinary -> ShowS Source # show :: HexBinary -> String Source # showList :: [HexBinary] -> ShowS Source #
Eq HexBinary Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: HexBinary -> HexBinary -> Bool Source # (/=) :: HexBinary -> HexBinary -> Bool Source #

data Float Source #

Single-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE single-precision type.

Instances

Instances details

SimpleType Float Source #

Instance details

Defined in Text.XML.HaXml.Schema.PrimitiveTypes

Methods

acceptingParser :: TextParser Float Source #

simpleTypeText :: Float -> String Source #

SchemaType Float Source #

Instance details

Defined in Text.XML.HaXml.Schema.Schema

Methods

parseSchemaType :: String -> XMLParser Float Source #

schemaTypeToXML :: String -> Float -> [Content ()] Source #

HTypeable Float Source #

Instance details

Defined in Text.XML.HaXml.TypeMapping

Methods

toHType :: Float -> HType Source #

XmlContent Float Source #

Instance details

Defined in Text.XML.HaXml.XmlContent.Haskell

Methods

parseContents :: XMLParser Float Source #

toContents :: Float -> [Content ()] Source #

xToChar :: Float -> Char Source #

xFromChar :: Char -> Float Source #

PrintfArg Float

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

formatArg :: Float -> FieldFormatter Source #

parseFormat :: Float -> ModifierParser Source #

Enum Float

fromEnum just truncates its argument, beware of all sorts of overflows.

List generators have extremely peculiar behavior, mandated by Haskell Report 2010:

>>> [0..1.5 :: Float]
[0.0,1.0,2.0]

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

succ :: Float -> Float Source #

pred :: Float -> Float Source #

toEnum :: Int -> Float Source #

fromEnum :: Float -> Int Source #

enumFrom :: Float -> [Float] Source #

enumFromThen :: Float -> Float -> [Float] Source #

enumFromTo :: Float -> Float -> [Float] Source #

enumFromThenTo :: Float -> Float -> Float -> [Float] Source #

Floating Float

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

pi :: Float Source #

exp :: Float -> Float Source #

log :: Float -> Float Source #

sqrt :: Float -> Float Source #

(**) :: Float -> Float -> Float Source #

logBase :: Float -> Float -> Float Source #

sin :: Float -> Float Source #

cos :: Float -> Float Source #

tan :: Float -> Float Source #

asin :: Float -> Float Source #

acos :: Float -> Float Source #

atan :: Float -> Float Source #

sinh :: Float -> Float Source #

cosh :: Float -> Float Source #

tanh :: Float -> Float Source #

asinh :: Float -> Float Source #

acosh :: Float -> Float Source #

atanh :: Float -> Float Source #

log1p :: Float -> Float Source #

expm1 :: Float -> Float Source #

log1pexp :: Float -> Float Source #

log1mexp :: Float -> Float Source #

RealFloat Float

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

floatRadix :: Float -> Integer Source #

floatDigits :: Float -> Int Source #

floatRange :: Float -> (Int, Int) Source #

decodeFloat :: Float -> (Integer, Int) Source #

encodeFloat :: Integer -> Int -> Float Source #

exponent :: Float -> Int Source #

significand :: Float -> Float Source #

scaleFloat :: Int -> Float -> Float Source #

isNaN :: Float -> Bool Source #

isInfinite :: Float -> Bool Source #

isDenormalized :: Float -> Bool Source #

isNegativeZero :: Float -> Bool Source #

isIEEE :: Float -> Bool Source #

atan2 :: Float -> Float -> Float Source #

Num Float

This instance implements IEEE 754 standard with all its usual pitfalls about NaN, infinities and negative zero. Neither addition nor multiplication are associative or distributive:

>>> (0.1 + 0.1 :: Float) + 0.5 == 0.1 + (0.1 + 0.5)
False
>>> (0.1 + 0.2 :: Float) * 0.9 == 0.1 * 0.9 + 0.2 * 0.9
False
>>> (0.1 * 0.1 :: Float) * 0.9 == 0.1 * (0.1 * 0.9)
False

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

(+) :: Float -> Float -> Float Source #

(-) :: Float -> Float -> Float Source #

(*) :: Float -> Float -> Float Source #

negate :: Float -> Float Source #

abs :: Float -> Float Source #

signum :: Float -> Float Source #

fromInteger :: Integer -> Float Source #

Read Float

Since: base-2.1

Instance details

Defined in GHC.Internal.Read

Methods

readsPrec :: Int -> ReadS Float Source #

readList :: ReadS [Float] Source #

readPrec :: ReadPrec Float Source #

readListPrec :: ReadPrec [Float] Source #

Fractional Float

This instance implements IEEE 754 standard with all its usual pitfalls about NaN, infinities and negative zero.

>>> 0 == (-0 :: Float)
True
>>> recip 0 == recip (-0 :: Float)
False
>>> map (/ 0) [-1, 0, 1 :: Float]
[-Infinity,NaN,Infinity]
>>> map (* 0) $ map (/ 0) [-1, 0, 1 :: Float]
[NaN,NaN,NaN]

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

(/) :: Float -> Float -> Float Source #

recip :: Float -> Float Source #

fromRational :: Rational -> Float Source #

Real Float

Beware that toRational generates garbage for non-finite arguments:

>>> toRational (1/0 :: Float)
340282366920938463463374607431768211456 % 1
>>> toRational (0/0 :: Float)
510423550381407695195061911147652317184 % 1

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

toRational :: Float -> Rational Source #

RealFrac Float

Beware that results for non-finite arguments are garbage:

>>> [ f x | f <- [round, floor, ceiling], x <- [-1/0, 0/0, 1/0 :: Float] ] :: [Int]
[0,0,0,0,0,0,0,0,0]
>>> map properFraction [-1/0, 0/0, 1/0] :: [(Int, Float)]
[(0,0.0),(0,0.0),(0,0.0)]

and get even more non-sensical if you ask for Integer instead of Int.

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

properFraction :: Integral b => Float -> (b, Float) Source #

truncate :: Integral b => Float -> b Source #

round :: Integral b => Float -> b Source #

ceiling :: Integral b => Float -> b Source #

floor :: Integral b => Float -> b Source #

Show Float

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

showsPrec :: Int -> Float -> ShowS Source #

show :: Float -> String Source #

showList :: [Float] -> ShowS Source #

Eq Float

Note that due to the presence of NaN, Float's Eq instance does not satisfy reflexivity.

>>> 0/0 == (0/0 :: Float)
False

Also note that Float's Eq instance does not satisfy extensionality:

>>> 0 == (-0 :: Float)
True
>>> recip 0 == recip (-0 :: Float)
False

Instance details

Defined in GHC.Classes

Methods

(==) :: Float -> Float -> Bool Source #

(/=) :: Float -> Float -> Bool Source #

Ord Float

See instance Ord Double for discussion of deviations from IEEE 754 standard.

Instance details

Defined in GHC.Classes

Methods

compare :: Float -> Float -> Ordering Source #

(<) :: Float -> Float -> Bool Source #

(<=) :: Float -> Float -> Bool Source #

(>) :: Float -> Float -> Bool Source #

(>=) :: Float -> Float -> Bool Source #

max :: Float -> Float -> Float Source #

min :: Float -> Float -> Float Source #

Parse Float

Instance details

Defined in Text.Parse

Methods

parse :: TextParser Float #

parsePrec :: Int -> TextParser Float #

parseList :: TextParser [Float] #

Parse Float

Instance details

Defined in Text.Parse.ByteString

Methods

parse :: TextParser Float

parsePrec :: Int -> TextParser Float

parseList :: TextParser [Float]

Pretty Float

Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJClass

Methods

pPrintPrec :: PrettyLevel -> Rational -> Float -> Doc ann Source #

pPrint :: Float -> Doc ann Source #

pPrintList :: PrettyLevel -> [Float] -> Doc ann Source #

Pretty Float

Instance details

Defined in Text.PrettyPrint.HughesPJClass

Methods

pPrintPrec :: PrettyLevel -> Rational -> Float -> Doc Source #

pPrint :: Float -> Doc Source #

pPrintList :: PrettyLevel -> [Float] -> Doc Source #

Random Float

Instance details

Defined in System.Random

Methods

randomR :: RandomGen g => (Float, Float) -> g -> (Float, g)

random :: RandomGen g => g -> (Float, g)

randomRs :: RandomGen g => (Float, Float) -> g -> [Float]

randoms :: RandomGen g => g -> [Float]

UniformRange Float

Instance details

Defined in System.Random.Internal

Methods

uniformRM :: StatefulGen g m => (Float, Float) -> g -> m Float

Generic1 (URec Float :: k -> Type)

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep1 (URec Float :: k -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep1 (URec Float :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UFloat" 'PrefixI 'True) (S1 ('MetaSel ('Just "uFloat#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UFloat :: k -> Type)))

Methods

from1 :: forall (a :: k). URec Float a -> Rep1 (URec Float :: k -> Type) a Source #

to1 :: forall (a :: k). Rep1 (URec Float :: k -> Type) a -> URec Float a Source #

Foldable (UFloat :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => UFloat m -> m Source #

foldMap :: Monoid m => (a -> m) -> UFloat a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UFloat a -> m Source #

foldr :: (a -> b -> b) -> b -> UFloat a -> b Source #

foldr' :: (a -> b -> b) -> b -> UFloat a -> b Source #

foldl :: (b -> a -> b) -> b -> UFloat a -> b Source #

foldl' :: (b -> a -> b) -> b -> UFloat a -> b Source #

foldr1 :: (a -> a -> a) -> UFloat a -> a Source #

foldl1 :: (a -> a -> a) -> UFloat a -> a Source #

toList :: UFloat a -> [a] Source #

null :: UFloat a -> Bool Source #

length :: UFloat a -> Int Source #

elem :: Eq a => a -> UFloat a -> Bool Source #

maximum :: Ord a => UFloat a -> a Source #

minimum :: Ord a => UFloat a -> a Source #

sum :: Num a => UFloat a -> a Source #

product :: Num a => UFloat a -> a Source #

Functor (URec Float :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

fmap :: (a -> b) -> URec Float a -> URec Float b Source #

(<$) :: a -> URec Float b -> URec Float a Source #

Generic (URec Float p)

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep (URec Float p)
Instance details Defined in GHC.Internal.Generics type Rep (URec Float p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UFloat" 'PrefixI 'True) (S1 ('MetaSel ('Just "uFloat#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UFloat :: Type -> Type)))

Methods

from :: URec Float p -> Rep (URec Float p) x Source #

to :: Rep (URec Float p) x -> URec Float p Source #

Show (URec Float p)

Instance details

Defined in GHC.Internal.Generics

Methods

showsPrec :: Int -> URec Float p -> ShowS Source #

show :: URec Float p -> String Source #

showList :: [URec Float p] -> ShowS Source #

Eq (URec Float p)

Instance details

Defined in GHC.Internal.Generics

Methods

(==) :: URec Float p -> URec Float p -> Bool Source #

(/=) :: URec Float p -> URec Float p -> Bool Source #

Ord (URec Float p)

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: URec Float p -> URec Float p -> Ordering Source #

(<) :: URec Float p -> URec Float p -> Bool Source #

(<=) :: URec Float p -> URec Float p -> Bool Source #

(>) :: URec Float p -> URec Float p -> Bool Source #

(>=) :: URec Float p -> URec Float p -> Bool Source #

max :: URec Float p -> URec Float p -> URec Float p Source #

min :: URec Float p -> URec Float p -> URec Float p Source #

data URec Float (p :: k)

Used for marking occurrences of Float#

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

data URec Float (p :: k) = UFloat {

uFloat# :: Float#

}

type Rep1 (URec Float :: k -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep1 (URec Float :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UFloat" 'PrefixI 'True) (S1 ('MetaSel ('Just "uFloat#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UFloat :: k -> Type)))

type Rep (URec Float p)

Instance details

Defined in GHC.Internal.Generics

type Rep (URec Float p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UFloat" 'PrefixI 'True) (S1 ('MetaSel ('Just "uFloat#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UFloat :: Type -> Type)))

data Decimal Source #

Constructors

Decimal Double

Instances

Instances details

SimpleType Decimal Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Decimal Source # simpleTypeText :: Decimal -> String Source #
SchemaType Decimal Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser Decimal Source # schemaTypeToXML :: String -> Decimal -> [Content ()] Source #
Show Decimal Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> Decimal -> ShowS Source # show :: Decimal -> String Source # showList :: [Decimal] -> ShowS Source #
Eq Decimal Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: Decimal -> Decimal -> Bool Source # (/=) :: Decimal -> Decimal -> Bool Source #

data Double Source #

Double-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE double-precision type.

Instances

Instances details

SimpleType Double Source #

Instance details

Defined in Text.XML.HaXml.Schema.PrimitiveTypes

Methods

acceptingParser :: TextParser Double Source #

simpleTypeText :: Double -> String Source #

SchemaType Double Source #

Instance details

Defined in Text.XML.HaXml.Schema.Schema

Methods

parseSchemaType :: String -> XMLParser Double Source #

schemaTypeToXML :: String -> Double -> [Content ()] Source #

HTypeable Double Source #

Instance details

Defined in Text.XML.HaXml.TypeMapping

Methods

toHType :: Double -> HType Source #

XmlContent Double Source #

Instance details

Defined in Text.XML.HaXml.XmlContent.Haskell

Methods

parseContents :: XMLParser Double Source #

toContents :: Double -> [Content ()] Source #

xToChar :: Double -> Char Source #

xFromChar :: Char -> Double Source #

PrintfArg Double

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

formatArg :: Double -> FieldFormatter Source #

parseFormat :: Double -> ModifierParser Source #

Enum Double

fromEnum just truncates its argument, beware of all sorts of overflows.

List generators have extremely peculiar behavior, mandated by Haskell Report 2010:

>>> [0..1.5]
[0.0,1.0,2.0]

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

succ :: Double -> Double Source #

pred :: Double -> Double Source #

toEnum :: Int -> Double Source #

fromEnum :: Double -> Int Source #

enumFrom :: Double -> [Double] Source #

enumFromThen :: Double -> Double -> [Double] Source #

enumFromTo :: Double -> Double -> [Double] Source #

enumFromThenTo :: Double -> Double -> Double -> [Double] Source #

Floating Double

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

pi :: Double Source #

exp :: Double -> Double Source #

log :: Double -> Double Source #

sqrt :: Double -> Double Source #

(**) :: Double -> Double -> Double Source #

logBase :: Double -> Double -> Double Source #

sin :: Double -> Double Source #

cos :: Double -> Double Source #

tan :: Double -> Double Source #

asin :: Double -> Double Source #

acos :: Double -> Double Source #

atan :: Double -> Double Source #

sinh :: Double -> Double Source #

cosh :: Double -> Double Source #

tanh :: Double -> Double Source #

asinh :: Double -> Double Source #

acosh :: Double -> Double Source #

atanh :: Double -> Double Source #

log1p :: Double -> Double Source #

expm1 :: Double -> Double Source #

log1pexp :: Double -> Double Source #

log1mexp :: Double -> Double Source #

RealFloat Double

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

floatRadix :: Double -> Integer Source #

floatDigits :: Double -> Int Source #

floatRange :: Double -> (Int, Int) Source #

decodeFloat :: Double -> (Integer, Int) Source #

encodeFloat :: Integer -> Int -> Double Source #

exponent :: Double -> Int Source #

significand :: Double -> Double Source #

scaleFloat :: Int -> Double -> Double Source #

isNaN :: Double -> Bool Source #

isInfinite :: Double -> Bool Source #

isDenormalized :: Double -> Bool Source #

isNegativeZero :: Double -> Bool Source #

isIEEE :: Double -> Bool Source #

atan2 :: Double -> Double -> Double Source #

Num Double

This instance implements IEEE 754 standard with all its usual pitfalls about NaN, infinities and negative zero. Neither addition nor multiplication are associative or distributive:

>>> (0.1 + 0.1) + 0.4 == 0.1 + (0.1 + 0.4)
False
>>> (0.1 + 0.2) * 0.3 == 0.1 * 0.3 + 0.2 * 0.3
False
>>> (0.1 * 0.1) * 0.3 == 0.1 * (0.1 * 0.3)
False

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

(+) :: Double -> Double -> Double Source #

(-) :: Double -> Double -> Double Source #

(*) :: Double -> Double -> Double Source #

negate :: Double -> Double Source #

abs :: Double -> Double Source #

signum :: Double -> Double Source #

fromInteger :: Integer -> Double Source #

Read Double

Since: base-2.1

Instance details

Defined in GHC.Internal.Read

Methods

readsPrec :: Int -> ReadS Double Source #

readList :: ReadS [Double] Source #

readPrec :: ReadPrec Double Source #

readListPrec :: ReadPrec [Double] Source #

Fractional Double

This instance implements IEEE 754 standard with all its usual pitfalls about NaN, infinities and negative zero.

>>> 0 == (-0 :: Double)
True
>>> recip 0 == recip (-0 :: Double)
False
>>> map (/ 0) [-1, 0, 1]
[-Infinity,NaN,Infinity]
>>> map (* 0) $ map (/ 0) [-1, 0, 1]
[NaN,NaN,NaN]

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

(/) :: Double -> Double -> Double Source #

recip :: Double -> Double Source #

fromRational :: Rational -> Double Source #

Real Double

Beware that toRational generates garbage for non-finite arguments:

>>> toRational (1/0)
179769313 (and 300 more digits...) % 1
>>> toRational (0/0)
269653970 (and 300 more digits...) % 1

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

toRational :: Double -> Rational Source #

RealFrac Double

Beware that results for non-finite arguments are garbage:

>>> [ f x | f <- [round, floor, ceiling], x <- [-1/0, 0/0, 1/0] ] :: [Int]
[0,0,0,0,0,0,0,0,0]
>>> map properFraction [-1/0, 0/0, 1/0] :: [(Int, Double)]
[(0,0.0),(0,0.0),(0,0.0)]

and get even more non-sensical if you ask for Integer instead of Int.

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

properFraction :: Integral b => Double -> (b, Double) Source #

truncate :: Integral b => Double -> b Source #

round :: Integral b => Double -> b Source #

ceiling :: Integral b => Double -> b Source #

floor :: Integral b => Double -> b Source #

Show Double

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

showsPrec :: Int -> Double -> ShowS Source #

show :: Double -> String Source #

showList :: [Double] -> ShowS Source #

Eq Double

Note that due to the presence of NaN, Double's Eq instance does not satisfy reflexivity.

>>> 0/0 == (0/0 :: Double)
False

Also note that Double's Eq instance does not satisfy substitutivity:

>>> 0 == (-0 :: Double)
True
>>> recip 0 == recip (-0 :: Double)
False

Instance details

Defined in GHC.Classes

Methods

(==) :: Double -> Double -> Bool Source #

(/=) :: Double -> Double -> Bool Source #

Ord Double

IEEE 754 Double-precision type includes not only numbers, but also positive and negative infinities and a special element called NaN (which can be quiet or signal).

IEEE 754-2008, section 5.11 requires that if at least one of arguments of <=, <, >, >= is NaN then the result of the comparison is False, and instance Ord Double complies with this requirement. This violates the reflexivity: both NaN <= NaN and NaN >= NaN are False.

IEEE 754-2008, section 5.10 defines totalOrder predicate. Unfortunately, compare on Doubles violates the IEEE standard and does not define a total order. More specifically, both compare NaN x and compare x NaN always return GT.

Thus, users must be extremely cautious when using instance Ord Double. For instance, one should avoid ordered containers with keys represented by Double, because data loss and corruption may happen. An IEEE-compliant compare is available in fp-ieee package as TotallyOrdered newtype.

Moving further, the behaviour of min and max with regards to NaN is also non-compliant. IEEE 754-2008, section 5.3.1 defines that quiet NaN should be treated as a missing data by minNum and maxNum functions, for example, minNum(NaN, 1) = minNum(1, NaN) = 1. Some languages such as Java deviate from the standard implementing minNum(NaN, 1) = minNum(1, NaN) = NaN. However, min / max in base are even worse: min NaN 1 is 1, but min 1 NaN is NaN.

IEEE 754-2008 compliant min / max can be found in ieee754 package under minNum / maxNum names. Implementations compliant with minimumNumber / maximumNumber from a newer IEEE 754-2019, section 9.6 are available from fp-ieee package.

Instance details

Defined in GHC.Classes

Methods

compare :: Double -> Double -> Ordering Source #

(<) :: Double -> Double -> Bool Source #

(<=) :: Double -> Double -> Bool Source #

(>) :: Double -> Double -> Bool Source #

(>=) :: Double -> Double -> Bool Source #

max :: Double -> Double -> Double Source #

min :: Double -> Double -> Double Source #

Parse Double

Instance details

Defined in Text.Parse

Methods

parse :: TextParser Double #

parsePrec :: Int -> TextParser Double #

parseList :: TextParser [Double] #

Parse Double

Instance details

Defined in Text.Parse.ByteString

Methods

parse :: TextParser Double

parsePrec :: Int -> TextParser Double

parseList :: TextParser [Double]

Pretty Double

Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJClass

Methods

pPrintPrec :: PrettyLevel -> Rational -> Double -> Doc ann Source #

pPrint :: Double -> Doc ann Source #

pPrintList :: PrettyLevel -> [Double] -> Doc ann Source #

Pretty Double

Instance details

Defined in Text.PrettyPrint.HughesPJClass

Methods

pPrintPrec :: PrettyLevel -> Rational -> Double -> Doc Source #

pPrint :: Double -> Doc Source #

pPrintList :: PrettyLevel -> [Double] -> Doc Source #

Random Double

Instance details

Defined in System.Random

Methods

randomR :: RandomGen g => (Double, Double) -> g -> (Double, g)

random :: RandomGen g => g -> (Double, g)

randomRs :: RandomGen g => (Double, Double) -> g -> [Double]

randoms :: RandomGen g => g -> [Double]

UniformRange Double

Instance details

Defined in System.Random.Internal

Methods

uniformRM :: StatefulGen g m => (Double, Double) -> g -> m Double

Generic1 (URec Double :: k -> Type)

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep1 (URec Double :: k -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep1 (URec Double :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UDouble" 'PrefixI 'True) (S1 ('MetaSel ('Just "uDouble#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UDouble :: k -> Type)))

Methods

from1 :: forall (a :: k). URec Double a -> Rep1 (URec Double :: k -> Type) a Source #

to1 :: forall (a :: k). Rep1 (URec Double :: k -> Type) a -> URec Double a Source #

Foldable (UDouble :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => UDouble m -> m Source #

foldMap :: Monoid m => (a -> m) -> UDouble a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UDouble a -> m Source #

foldr :: (a -> b -> b) -> b -> UDouble a -> b Source #

foldr' :: (a -> b -> b) -> b -> UDouble a -> b Source #

foldl :: (b -> a -> b) -> b -> UDouble a -> b Source #

foldl' :: (b -> a -> b) -> b -> UDouble a -> b Source #

foldr1 :: (a -> a -> a) -> UDouble a -> a Source #

foldl1 :: (a -> a -> a) -> UDouble a -> a Source #

toList :: UDouble a -> [a] Source #

null :: UDouble a -> Bool Source #

length :: UDouble a -> Int Source #

elem :: Eq a => a -> UDouble a -> Bool Source #

maximum :: Ord a => UDouble a -> a Source #

minimum :: Ord a => UDouble a -> a Source #

sum :: Num a => UDouble a -> a Source #

product :: Num a => UDouble a -> a Source #

Functor (URec Double :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

fmap :: (a -> b) -> URec Double a -> URec Double b Source #

(<$) :: a -> URec Double b -> URec Double a Source #

Generic (URec Double p)

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep (URec Double p)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep (URec Double p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UDouble" 'PrefixI 'True) (S1 ('MetaSel ('Just "uDouble#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UDouble :: Type -> Type)))

Methods

from :: URec Double p -> Rep (URec Double p) x Source #

to :: Rep (URec Double p) x -> URec Double p Source #

Show (URec Double p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

showsPrec :: Int -> URec Double p -> ShowS Source #

show :: URec Double p -> String Source #

showList :: [URec Double p] -> ShowS Source #

Eq (URec Double p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

(==) :: URec Double p -> URec Double p -> Bool Source #

(/=) :: URec Double p -> URec Double p -> Bool Source #

Ord (URec Double p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: URec Double p -> URec Double p -> Ordering Source #

(<) :: URec Double p -> URec Double p -> Bool Source #

(<=) :: URec Double p -> URec Double p -> Bool Source #

(>) :: URec Double p -> URec Double p -> Bool Source #

(>=) :: URec Double p -> URec Double p -> Bool Source #

max :: URec Double p -> URec Double p -> URec Double p Source #

min :: URec Double p -> URec Double p -> URec Double p Source #

data URec Double (p :: k)

Used for marking occurrences of Double#

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

data URec Double (p :: k) = UDouble {

uDouble# :: Double#

}

type Rep1 (URec Double :: k -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep1 (URec Double :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UDouble" 'PrefixI 'True) (S1 ('MetaSel ('Just "uDouble#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UDouble :: k -> Type)))

type Rep (URec Double p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep (URec Double p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UDouble" 'PrefixI 'True) (S1 ('MetaSel ('Just "uDouble#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UDouble :: Type -> Type)))

data AnyURI Source #

Constructors

AnyURI String

Instances

Instances details

SimpleType AnyURI Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser AnyURI Source # simpleTypeText :: AnyURI -> String Source #
SchemaType AnyURI Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser AnyURI Source # schemaTypeToXML :: String -> AnyURI -> [Content ()] Source #
Show AnyURI Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> AnyURI -> ShowS Source # show :: AnyURI -> String Source # showList :: [AnyURI] -> ShowS Source #
Eq AnyURI Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: AnyURI -> AnyURI -> Bool Source # (/=) :: AnyURI -> AnyURI -> Bool Source #

data QName Source #

A QName is a (possibly) qualified name, in the sense of XML namespaces.

Constructors

N Name
QN Namespace Name

Instances

Instances details

Show QName Source #
Instance details Defined in Text.XML.HaXml.Types Methods showsPrec :: Int -> QName -> ShowS Source # show :: QName -> String Source # showList :: [QName] -> ShowS Source #
Eq QName Source #
Instance details Defined in Text.XML.HaXml.Types Methods (==) :: QName -> QName -> Bool Source # (/=) :: QName -> QName -> Bool Source #
Ord QName Source #
Instance details Defined in Text.XML.HaXml.Types Methods compare :: QName -> QName -> Ordering Source # (<) :: QName -> QName -> Bool Source # (<=) :: QName -> QName -> Bool Source # (>) :: QName -> QName -> Bool Source # (>=) :: QName -> QName -> Bool Source # max :: QName -> QName -> QName Source # min :: QName -> QName -> QName Source #

data NOTATION Source #

Constructors

NOTATION String

Instances

Instances details

SimpleType NOTATION Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser NOTATION Source # simpleTypeText :: NOTATION -> String Source #
SchemaType NOTATION Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser NOTATION Source # schemaTypeToXML :: String -> NOTATION -> [Content ()] Source #
Show NOTATION Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> NOTATION -> ShowS Source # show :: NOTATION -> String Source # showList :: [NOTATION] -> ShowS Source #
Eq NOTATION Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: NOTATION -> NOTATION -> Bool Source # (/=) :: NOTATION -> NOTATION -> Bool Source #

data Duration Source #

Constructors

Duration Bool Int Int Int Int Int Float

Instances

Instances details

SimpleType Duration Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Duration Source # simpleTypeText :: Duration -> String Source #
SchemaType Duration Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser Duration Source # schemaTypeToXML :: String -> Duration -> [Content ()] Source #
Show Duration Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> Duration -> ShowS Source # show :: Duration -> String Source # showList :: [Duration] -> ShowS Source #
Eq Duration Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: Duration -> Duration -> Bool Source # (/=) :: Duration -> Duration -> Bool Source #

data DateTime Source #

Constructors

DateTime String

Instances

Instances details

SimpleType DateTime Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser DateTime Source # simpleTypeText :: DateTime -> String Source #
SchemaType DateTime Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser DateTime Source # schemaTypeToXML :: String -> DateTime -> [Content ()] Source #
Show DateTime Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> DateTime -> ShowS Source # show :: DateTime -> String Source # showList :: [DateTime] -> ShowS Source #
Eq DateTime Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: DateTime -> DateTime -> Bool Source # (/=) :: DateTime -> DateTime -> Bool Source #

data Time Source #

Constructors

Time String

Instances

Instances details

SimpleType Time Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Time Source # simpleTypeText :: Time -> String Source #
SchemaType Time Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser Time Source # schemaTypeToXML :: String -> Time -> [Content ()] Source #
Show Time Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> Time -> ShowS Source # show :: Time -> String Source # showList :: [Time] -> ShowS Source #
Eq Time Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: Time -> Time -> Bool Source # (/=) :: Time -> Time -> Bool Source #

data Date Source #

Constructors

Date String

Instances

Instances details

SimpleType Date Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Date Source # simpleTypeText :: Date -> String Source #
SchemaType Date Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser Date Source # schemaTypeToXML :: String -> Date -> [Content ()] Source #
Show Date Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> Date -> ShowS Source # show :: Date -> String Source # showList :: [Date] -> ShowS Source #
Eq Date Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: Date -> Date -> Bool Source # (/=) :: Date -> Date -> Bool Source #

data GYearMonth Source #

Constructors

GYearMonth String

Instances

Instances details

SimpleType GYearMonth Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser GYearMonth Source # simpleTypeText :: GYearMonth -> String Source #
SchemaType GYearMonth Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser GYearMonth Source # schemaTypeToXML :: String -> GYearMonth -> [Content ()] Source #
Show GYearMonth Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> GYearMonth -> ShowS Source # show :: GYearMonth -> String Source # showList :: [GYearMonth] -> ShowS Source #
Eq GYearMonth Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: GYearMonth -> GYearMonth -> Bool Source # (/=) :: GYearMonth -> GYearMonth -> Bool Source #

data GYear Source #

Constructors

GYear String

Instances

Instances details

SimpleType GYear Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser GYear Source # simpleTypeText :: GYear -> String Source #
SchemaType GYear Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser GYear Source # schemaTypeToXML :: String -> GYear -> [Content ()] Source #
Show GYear Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> GYear -> ShowS Source # show :: GYear -> String Source # showList :: [GYear] -> ShowS Source #
Eq GYear Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: GYear -> GYear -> Bool Source # (/=) :: GYear -> GYear -> Bool Source #

data GMonthDay Source #

Constructors

GMonthDay String

Instances

Instances details

SimpleType GMonthDay Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser GMonthDay Source # simpleTypeText :: GMonthDay -> String Source #
SchemaType GMonthDay Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser GMonthDay Source # schemaTypeToXML :: String -> GMonthDay -> [Content ()] Source #
Show GMonthDay Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> GMonthDay -> ShowS Source # show :: GMonthDay -> String Source # showList :: [GMonthDay] -> ShowS Source #
Eq GMonthDay Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: GMonthDay -> GMonthDay -> Bool Source # (/=) :: GMonthDay -> GMonthDay -> Bool Source #

data GDay Source #

Constructors

GDay String

Instances

Instances details

SimpleType GDay Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser GDay Source # simpleTypeText :: GDay -> String Source #
SchemaType GDay Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser GDay Source # schemaTypeToXML :: String -> GDay -> [Content ()] Source #
Show GDay Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> GDay -> ShowS Source # show :: GDay -> String Source # showList :: [GDay] -> ShowS Source #
Eq GDay Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: GDay -> GDay -> Bool Source # (/=) :: GDay -> GDay -> Bool Source #

data GMonth Source #

Constructors

GMonth String

Instances

Instances details

SimpleType GMonth Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser GMonth Source # simpleTypeText :: GMonth -> String Source #
SchemaType GMonth Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser GMonth Source # schemaTypeToXML :: String -> GMonth -> [Content ()] Source #
Show GMonth Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> GMonth -> ShowS Source # show :: GMonth -> String Source # showList :: [GMonth] -> ShowS Source #
Eq GMonth Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: GMonth -> GMonth -> Bool Source # (/=) :: GMonth -> GMonth -> Bool Source #

SimpleType NMTOKENS Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser NMTOKENS Source # simpleTypeText :: NMTOKENS -> String Source #
SchemaType NMTOKENS Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser NMTOKENS Source # schemaTypeToXML :: String -> NMTOKENS -> [Content ()] Source #
Show NMTOKENS Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> NMTOKENS -> ShowS Source # show :: NMTOKENS -> String Source # showList :: [NMTOKENS] -> ShowS Source #
Eq NMTOKENS Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: NMTOKENS -> NMTOKENS -> Bool Source # (/=) :: NMTOKENS -> NMTOKENS -> Bool Source #

data Integer Source #

Arbitrary precision integers. In contrast with fixed-size integral types such as Int, the Integer type represents the entire infinite range of integers.

Integers are stored in a kind of sign-magnitude form, hence do not expect two's complement form when using bit operations.

If the value is small (i.e., fits into an Int), the IS constructor is used. Otherwise IP and IN constructors are used to store a BigNat representing the positive or the negative value magnitude, respectively.

Invariant: IP and IN are used iff the value does not fit in IS.

Instances

Instances details

SimpleType Integer Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Integer Source # simpleTypeText :: Integer -> String Source #
SchemaType Integer Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser Integer Source # schemaTypeToXML :: String -> Integer -> [Content ()] Source #
HTypeable Integer Source #
Instance details Defined in Text.XML.HaXml.TypeMapping Methods toHType :: Integer -> HType Source #
XmlContent Integer Source #
Instance details Defined in Text.XML.HaXml.XmlContent.Haskell Methods parseContents :: XMLParser Integer Source # toContents :: Integer -> [Content ()] Source # xToChar :: Integer -> Char Source # xFromChar :: Char -> Integer Source #
PrintfArg Integer	Since: base-2.1
Instance details Defined in Text.Printf Methods formatArg :: Integer -> FieldFormatter Source # parseFormat :: Integer -> ModifierParser Source #
Enum Integer	Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods succ :: Integer -> Integer Source # pred :: Integer -> Integer Source # toEnum :: Int -> Integer Source # fromEnum :: Integer -> Int Source # enumFrom :: Integer -> [Integer] Source # enumFromThen :: Integer -> Integer -> [Integer] Source # enumFromTo :: Integer -> Integer -> [Integer] Source # enumFromThenTo :: Integer -> Integer -> Integer -> [Integer] Source #
Num Integer	Since: base-2.1
Instance details Defined in GHC.Internal.Num Methods (+) :: Integer -> Integer -> Integer Source # (-) :: Integer -> Integer -> Integer Source # (*) :: Integer -> Integer -> Integer Source # negate :: Integer -> Integer Source # abs :: Integer -> Integer Source # signum :: Integer -> Integer Source # fromInteger :: Integer -> Integer Source #
Read Integer	Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Integer Source # readList :: ReadS [Integer] Source # readPrec :: ReadPrec Integer Source # readListPrec :: ReadPrec [Integer] Source #
Integral Integer	Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods quot :: Integer -> Integer -> Integer Source # rem :: Integer -> Integer -> Integer Source # div :: Integer -> Integer -> Integer Source # mod :: Integer -> Integer -> Integer Source # quotRem :: Integer -> Integer -> (Integer, Integer) Source # divMod :: Integer -> Integer -> (Integer, Integer) Source # toInteger :: Integer -> Integer Source #
Real Integer	Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods toRational :: Integer -> Rational Source #
Show Integer	Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Integer -> ShowS Source # show :: Integer -> String Source # showList :: [Integer] -> ShowS Source #
Eq Integer
Instance details Defined in GHC.Num.Integer Methods (==) :: Integer -> Integer -> Bool Source # (/=) :: Integer -> Integer -> Bool Source #
Ord Integer
Instance details Defined in GHC.Num.Integer Methods compare :: Integer -> Integer -> Ordering Source # (<) :: Integer -> Integer -> Bool Source # (<=) :: Integer -> Integer -> Bool Source # (>) :: Integer -> Integer -> Bool Source # (>=) :: Integer -> Integer -> Bool Source # max :: Integer -> Integer -> Integer Source # min :: Integer -> Integer -> Integer Source #
Parse Integer
Instance details Defined in Text.Parse Methods parse :: TextParser Integer # parsePrec :: Int -> TextParser Integer # parseList :: TextParser [Integer] #
Parse Integer
Instance details Defined in Text.Parse.ByteString Methods parse :: TextParser Integer parsePrec :: Int -> TextParser Integer parseList :: TextParser [Integer]
Pretty Integer
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJClass Methods pPrintPrec :: PrettyLevel -> Rational -> Integer -> Doc ann Source # pPrint :: Integer -> Doc ann Source # pPrintList :: PrettyLevel -> [Integer] -> Doc ann Source #
Pretty Integer
Instance details Defined in Text.PrettyPrint.HughesPJClass Methods pPrintPrec :: PrettyLevel -> Rational -> Integer -> Doc Source # pPrint :: Integer -> Doc Source # pPrintList :: PrettyLevel -> [Integer] -> Doc Source #
Random Integer
Instance details Defined in System.Random Methods randomR :: RandomGen g => (Integer, Integer) -> g -> (Integer, g) random :: RandomGen g => g -> (Integer, g) randomRs :: RandomGen g => (Integer, Integer) -> g -> [Integer] randoms :: RandomGen g => g -> [Integer]
UniformRange Integer
Instance details Defined in System.Random.Internal Methods uniformRM :: StatefulGen g m => (Integer, Integer) -> g -> m Integer

newtype NonPositiveInteger Source #

Constructors

NonPos Integer

Instances

Instances details

SimpleType NonPositiveInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser NonPositiveInteger Source # simpleTypeText :: NonPositiveInteger -> String Source #
SchemaType NonPositiveInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser NonPositiveInteger Source # schemaTypeToXML :: String -> NonPositiveInteger -> [Content ()] Source #
Show NonPositiveInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> NonPositiveInteger -> ShowS Source # show :: NonPositiveInteger -> String Source # showList :: [NonPositiveInteger] -> ShowS Source #
Eq NonPositiveInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: NonPositiveInteger -> NonPositiveInteger -> Bool Source # (/=) :: NonPositiveInteger -> NonPositiveInteger -> Bool Source #

newtype NegativeInteger Source #

Constructors

Negative Integer

Instances

Instances details

SimpleType NegativeInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser NegativeInteger Source # simpleTypeText :: NegativeInteger -> String Source #
SchemaType NegativeInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser NegativeInteger Source # schemaTypeToXML :: String -> NegativeInteger -> [Content ()] Source #
Show NegativeInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> NegativeInteger -> ShowS Source # show :: NegativeInteger -> String Source # showList :: [NegativeInteger] -> ShowS Source #
Eq NegativeInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: NegativeInteger -> NegativeInteger -> Bool Source # (/=) :: NegativeInteger -> NegativeInteger -> Bool Source #

newtype Long Source #

Constructors

Long Int64

Instances

Instances details

SimpleType Long Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Long Source # simpleTypeText :: Long -> String Source #
SchemaType Long Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser Long Source # schemaTypeToXML :: String -> Long -> [Content ()] Source #
Show Long Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> Long -> ShowS Source # show :: Long -> String Source # showList :: [Long] -> ShowS Source #
Eq Long Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: Long -> Long -> Bool Source # (/=) :: Long -> Long -> Bool Source #

data Int Source #

A fixed-precision integer type with at least the range [-2^29 .. 2^29-1]. The exact range for a given implementation can be determined by using minBound and maxBound from the Bounded class.

Instances

Instances details

SimpleType Int Source #

Instance details

Defined in Text.XML.HaXml.Schema.PrimitiveTypes

Methods

acceptingParser :: TextParser Int Source #

simpleTypeText :: Int -> String Source #

SchemaType Int Source #

Instance details

Defined in Text.XML.HaXml.Schema.Schema

Methods

parseSchemaType :: String -> XMLParser Int Source #

schemaTypeToXML :: String -> Int -> [Content ()] Source #

HTypeable Int Source #

Instance details

Defined in Text.XML.HaXml.TypeMapping

Methods

toHType :: Int -> HType Source #

XmlContent Int Source #

Instance details

Defined in Text.XML.HaXml.XmlContent.Haskell

Methods

parseContents :: XMLParser Int Source #

toContents :: Int -> [Content ()] Source #

xToChar :: Int -> Char Source #

xFromChar :: Char -> Int Source #

PrintfArg Int

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

formatArg :: Int -> FieldFormatter Source #

parseFormat :: Int -> ModifierParser Source #

Bounded Int

Since: base-2.1

Instance details

Defined in GHC.Internal.Enum

Methods

minBound :: Int Source #

maxBound :: Int Source #

Enum Int

Since: base-2.1

Instance details

Defined in GHC.Internal.Enum

Methods

succ :: Int -> Int Source #

pred :: Int -> Int Source #

toEnum :: Int -> Int Source #

fromEnum :: Int -> Int Source #

enumFrom :: Int -> [Int] Source #

enumFromThen :: Int -> Int -> [Int] Source #

enumFromTo :: Int -> Int -> [Int] Source #

enumFromThenTo :: Int -> Int -> Int -> [Int] Source #

Num Int

Since: base-2.1

Instance details

Defined in GHC.Internal.Num

Methods

(+) :: Int -> Int -> Int Source #

(-) :: Int -> Int -> Int Source #

(*) :: Int -> Int -> Int Source #

negate :: Int -> Int Source #

abs :: Int -> Int Source #

signum :: Int -> Int Source #

fromInteger :: Integer -> Int Source #

Read Int

Since: base-2.1

Instance details

Defined in GHC.Internal.Read

Methods

readsPrec :: Int -> ReadS Int Source #

readList :: ReadS [Int] Source #

readPrec :: ReadPrec Int Source #

readListPrec :: ReadPrec [Int] Source #

Integral Int

Since: base-2.0.1

Instance details

Defined in GHC.Internal.Real

Methods

quot :: Int -> Int -> Int Source #

rem :: Int -> Int -> Int Source #

div :: Int -> Int -> Int Source #

mod :: Int -> Int -> Int Source #

quotRem :: Int -> Int -> (Int, Int) Source #

divMod :: Int -> Int -> (Int, Int) Source #

toInteger :: Int -> Integer Source #

Real Int

Since: base-2.0.1

Instance details

Defined in GHC.Internal.Real

Methods

toRational :: Int -> Rational Source #

Show Int

Since: base-2.1

Instance details

Defined in GHC.Internal.Show

Methods

showsPrec :: Int -> Int -> ShowS Source #

show :: Int -> String Source #

showList :: [Int] -> ShowS Source #

Eq Int

Instance details

Defined in GHC.Classes

Methods

(==) :: Int -> Int -> Bool Source #

(/=) :: Int -> Int -> Bool Source #

Ord Int

Instance details

Defined in GHC.Classes

Methods

compare :: Int -> Int -> Ordering Source #

(<) :: Int -> Int -> Bool Source #

(<=) :: Int -> Int -> Bool Source #

(>) :: Int -> Int -> Bool Source #

(>=) :: Int -> Int -> Bool Source #

max :: Int -> Int -> Int Source #

min :: Int -> Int -> Int Source #

Parse Int

Instance details

Defined in Text.Parse

Methods

parse :: TextParser Int #

parsePrec :: Int -> TextParser Int #

parseList :: TextParser [Int] #

Parse Int

Instance details

Defined in Text.Parse.ByteString

Methods

parse :: TextParser Int

parsePrec :: Int -> TextParser Int

parseList :: TextParser [Int]

Pretty Int

Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJClass

Methods

pPrintPrec :: PrettyLevel -> Rational -> Int -> Doc ann Source #

pPrint :: Int -> Doc ann Source #

pPrintList :: PrettyLevel -> [Int] -> Doc ann Source #

Pretty Int

Instance details

Defined in Text.PrettyPrint.HughesPJClass

Methods

pPrintPrec :: PrettyLevel -> Rational -> Int -> Doc Source #

pPrint :: Int -> Doc Source #

pPrintList :: PrettyLevel -> [Int] -> Doc Source #

Random Int

Instance details

Defined in System.Random

Methods

randomR :: RandomGen g => (Int, Int) -> g -> (Int, g)

random :: RandomGen g => g -> (Int, g)

randomRs :: RandomGen g => (Int, Int) -> g -> [Int]

randoms :: RandomGen g => g -> [Int]

Uniform Int

Instance details

Defined in System.Random.Internal

Methods

uniformM :: StatefulGen g m => g -> m Int

UniformRange Int

Instance details

Defined in System.Random.Internal

Methods

uniformRM :: StatefulGen g m => (Int, Int) -> g -> m Int

Generic1 (URec Int :: k -> Type)

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep1 (URec Int :: k -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep1 (URec Int :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UInt" 'PrefixI 'True) (S1 ('MetaSel ('Just "uInt#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UInt :: k -> Type)))

Methods

from1 :: forall (a :: k). URec Int a -> Rep1 (URec Int :: k -> Type) a Source #

to1 :: forall (a :: k). Rep1 (URec Int :: k -> Type) a -> URec Int a Source #

Foldable (UInt :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => UInt m -> m Source #

foldMap :: Monoid m => (a -> m) -> UInt a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UInt a -> m Source #

foldr :: (a -> b -> b) -> b -> UInt a -> b Source #

foldr' :: (a -> b -> b) -> b -> UInt a -> b Source #

foldl :: (b -> a -> b) -> b -> UInt a -> b Source #

foldl' :: (b -> a -> b) -> b -> UInt a -> b Source #

foldr1 :: (a -> a -> a) -> UInt a -> a Source #

foldl1 :: (a -> a -> a) -> UInt a -> a Source #

toList :: UInt a -> [a] Source #

null :: UInt a -> Bool Source #

length :: UInt a -> Int Source #

elem :: Eq a => a -> UInt a -> Bool Source #

maximum :: Ord a => UInt a -> a Source #

minimum :: Ord a => UInt a -> a Source #

sum :: Num a => UInt a -> a Source #

product :: Num a => UInt a -> a Source #

Functor (URec Int :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

fmap :: (a -> b) -> URec Int a -> URec Int b Source #

(<$) :: a -> URec Int b -> URec Int a Source #

Generic (URec Int p)

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep (URec Int p)	Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep (URec Int p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UInt" 'PrefixI 'True) (S1 ('MetaSel ('Just "uInt#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UInt :: Type -> Type)))

Methods

from :: URec Int p -> Rep (URec Int p) x Source #

to :: Rep (URec Int p) x -> URec Int p Source #

Show (URec Int p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

showsPrec :: Int -> URec Int p -> ShowS Source #

show :: URec Int p -> String Source #

showList :: [URec Int p] -> ShowS Source #

Eq (URec Int p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

(==) :: URec Int p -> URec Int p -> Bool Source #

(/=) :: URec Int p -> URec Int p -> Bool Source #

Ord (URec Int p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: URec Int p -> URec Int p -> Ordering Source #

(<) :: URec Int p -> URec Int p -> Bool Source #

(<=) :: URec Int p -> URec Int p -> Bool Source #

(>) :: URec Int p -> URec Int p -> Bool Source #

(>=) :: URec Int p -> URec Int p -> Bool Source #

max :: URec Int p -> URec Int p -> URec Int p Source #

min :: URec Int p -> URec Int p -> URec Int p Source #

data URec Int (p :: k)

Used for marking occurrences of Int#

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

data URec Int (p :: k) = UInt {

uInt# :: Int#

}

type Rep1 (URec Int :: k -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep1 (URec Int :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UInt" 'PrefixI 'True) (S1 ('MetaSel ('Just "uInt#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UInt :: k -> Type)))

type Rep (URec Int p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep (URec Int p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UInt" 'PrefixI 'True) (S1 ('MetaSel ('Just "uInt#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UInt :: Type -> Type)))

newtype Short Source #

Constructors

Short Int16

Instances

Instances details

SimpleType Short Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Short Source # simpleTypeText :: Short -> String Source #
SchemaType Short Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser Short Source # schemaTypeToXML :: String -> Short -> [Content ()] Source #
Show Short Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> Short -> ShowS Source # show :: Short -> String Source # showList :: [Short] -> ShowS Source #
Eq Short Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: Short -> Short -> Bool Source # (/=) :: Short -> Short -> Bool Source #

newtype Byte Source #

Constructors

Byte Int8

Instances

Instances details

SimpleType Byte Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser Byte Source # simpleTypeText :: Byte -> String Source #
SchemaType Byte Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser Byte Source # schemaTypeToXML :: String -> Byte -> [Content ()] Source #
Show Byte Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> Byte -> ShowS Source # show :: Byte -> String Source # showList :: [Byte] -> ShowS Source #
Eq Byte Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: Byte -> Byte -> Bool Source # (/=) :: Byte -> Byte -> Bool Source #

newtype NonNegativeInteger Source #

Constructors

NonNeg Integer

Instances

Instances details

SimpleType NonNegativeInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser NonNegativeInteger Source # simpleTypeText :: NonNegativeInteger -> String Source #
SchemaType NonNegativeInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser NonNegativeInteger Source # schemaTypeToXML :: String -> NonNegativeInteger -> [Content ()] Source #
Show NonNegativeInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> NonNegativeInteger -> ShowS Source # show :: NonNegativeInteger -> String Source # showList :: [NonNegativeInteger] -> ShowS Source #
Eq NonNegativeInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: NonNegativeInteger -> NonNegativeInteger -> Bool Source # (/=) :: NonNegativeInteger -> NonNegativeInteger -> Bool Source #

newtype UnsignedLong Source #

Constructors

ULong Word64

Instances

Instances details

SimpleType UnsignedLong Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser UnsignedLong Source # simpleTypeText :: UnsignedLong -> String Source #
SchemaType UnsignedLong Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser UnsignedLong Source # schemaTypeToXML :: String -> UnsignedLong -> [Content ()] Source #
Show UnsignedLong Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> UnsignedLong -> ShowS Source # show :: UnsignedLong -> String Source # showList :: [UnsignedLong] -> ShowS Source #
Eq UnsignedLong Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: UnsignedLong -> UnsignedLong -> Bool Source # (/=) :: UnsignedLong -> UnsignedLong -> Bool Source #

newtype UnsignedInt Source #

Constructors

UInt Word32

Instances

Instances details

SimpleType UnsignedInt Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser UnsignedInt Source # simpleTypeText :: UnsignedInt -> String Source #
SchemaType UnsignedInt Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser UnsignedInt Source # schemaTypeToXML :: String -> UnsignedInt -> [Content ()] Source #
Show UnsignedInt Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> UnsignedInt -> ShowS Source # show :: UnsignedInt -> String Source # showList :: [UnsignedInt] -> ShowS Source #
Eq UnsignedInt Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: UnsignedInt -> UnsignedInt -> Bool Source # (/=) :: UnsignedInt -> UnsignedInt -> Bool Source #

newtype UnsignedShort Source #

Constructors

UShort Word16

Instances

Instances details

SimpleType UnsignedShort Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser UnsignedShort Source # simpleTypeText :: UnsignedShort -> String Source #
SchemaType UnsignedShort Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser UnsignedShort Source # schemaTypeToXML :: String -> UnsignedShort -> [Content ()] Source #
Show UnsignedShort Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> UnsignedShort -> ShowS Source # show :: UnsignedShort -> String Source # showList :: [UnsignedShort] -> ShowS Source #
Eq UnsignedShort Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: UnsignedShort -> UnsignedShort -> Bool Source # (/=) :: UnsignedShort -> UnsignedShort -> Bool Source #

newtype UnsignedByte Source #

Constructors

UByte Word8

Instances

Instances details

SimpleType UnsignedByte Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser UnsignedByte Source # simpleTypeText :: UnsignedByte -> String Source #
SchemaType UnsignedByte Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser UnsignedByte Source # schemaTypeToXML :: String -> UnsignedByte -> [Content ()] Source #
Show UnsignedByte Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> UnsignedByte -> ShowS Source # show :: UnsignedByte -> String Source # showList :: [UnsignedByte] -> ShowS Source #
Eq UnsignedByte Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: UnsignedByte -> UnsignedByte -> Bool Source # (/=) :: UnsignedByte -> UnsignedByte -> Bool Source #

newtype PositiveInteger Source #

Constructors

Positive Integer

Instances

Instances details

SimpleType PositiveInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods acceptingParser :: TextParser PositiveInteger Source # simpleTypeText :: PositiveInteger -> String Source #
SchemaType PositiveInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.Schema Methods parseSchemaType :: String -> XMLParser PositiveInteger Source # schemaTypeToXML :: String -> PositiveInteger -> [Content ()] Source #
Show PositiveInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods showsPrec :: Int -> PositiveInteger -> ShowS Source # show :: PositiveInteger -> String Source # showList :: [PositiveInteger] -> ShowS Source #
Eq PositiveInteger Source #
Instance details Defined in Text.XML.HaXml.Schema.PrimitiveTypes Methods (==) :: PositiveInteger -> PositiveInteger -> Bool Source # (/=) :: PositiveInteger -> PositiveInteger -> Bool Source #