Yi.Prelude

The Either type is sometimes used to represent a value which is either correct or an error; by convention, the Left constructor is used to hold an error value and the Right constructor is used to hold a correct value (mnemonic: "right" also means "correct").

Constructors

Left a
Right b

Instances

Typeable2 Either

Error e => MonadError e (Either e)

Error e => Monad (Either e)

Functor (Either a)

Error e => MonadFix (Either e)

Error e => MonadPlus (Either e)

Applicative (Either e)

Error e => Alternative (Either e)

(Eq a, Eq b) => Eq (Either a b)

(Data a, Data b) => Data (Either a b)

(Ord a, Ord b) => Ord (Either a b)

(Read a, Read b) => Read (Either a b)

(Show a, Show b) => Show (Either a b)

(HasTrie a, HasTrie b) => HasTrie (Either a b)

(Binary a, Binary b) => Binary (Either a b)

(Lift a, Lift b) => Lift (Either a b)

type Endom a = a -> a

Source

class Eq a where

Source

The Eq class defines equality (==) and inequality (/=). All the basic datatypes exported by the Prelude are instances of Eq, and Eq may be derived for any datatype whose constituents are also instances of Eq.

Minimal complete definition: either == or /=.

Methods

(==) :: a -> a -> Bool

Source

(/=) :: a -> a -> Bool

Instances

Eq ()

Eq PackageDescription

Eq GenericPackageDescription

Eq InstalledPackageId

Eq DL

Eq Finalizers

Eq Key

Eq KeyPr

Eq RequiredInstance

Eq Prec

Eq TraceBinIFaceReading

Eq PhantomModule

Eq PatternSetCharacterClass

Eq PatternSetCollatingElement

Eq PatternSetEquivalenceClass

Eq ModuleKind

Eq FolderKind

Eq FileKind

Eq ProjectItem

Eq Chunk

Eq DiredOpState

Eq DiredState

Eq DiredEntry

Eq DiredFileInfo

Eq CommentType

Eq a => Eq [a]

Integral a => Eq (Ratio a)

Eq (Ptr a)

Eq (FunPtr a)

Eq a => Eq (Maybe a)

Eq a => Eq (Flag a)

Eq c => Eq (Condition c)

Eq (ForeignPtr a)

Eq (Fixed a)

Eq a => Eq (Dual a)

Eq a => Eq (Sum a)

Eq a => Eq (Product a)

Eq a => Eq (First a)

Eq a => Eq (Last a)

Eq a => Eq (Down a)

Eq (TVar a)

Eq (IORef a)

Eq (MVar a)

Eq a => Eq (Tree a)

Eq a => Eq (Set a)

Eq a => Eq (Seq a)

Eq a => Eq (ViewL a)

Eq a => Eq (ViewR a)

Eq name => Eq (GenAvailInfo name)

Eq a => Eq (PointedList a)

Eq a => Eq (TreeLoc a)

Eq a => Eq (Chunk a)

Eq v => Eq (MaybeDefault v)

(Eq a, Eq b) => Eq (Either a b)

(Eq a, Eq b) => Eq (a, b)

(HasTrie a, Eq b) => Eq (:->: a b)

(Ix ix, Eq e, IArray UArray e) => Eq (UArray ix e)

(Ix i, Eq e) => Eq (Array i e)

Eq (STRef s a)

(Eq k, Eq a) => Eq (Map k a)

(Eq a, Eq (s a)) => Eq (ViewL s a)

(Eq a, Eq (s a)) => Eq (ViewR s a)

(Measured v a, Eq a) => Eq (FingerTree v a)

Eq t => Eq (::: t doc)

(Eq a, Eq b, Eq c) => Eq (a, b, c)

(Eq v, Eq c, Eq a) => Eq (CondTree v c a)

Eq (STUArray s i e)

Eq (STArray s i e)

(Eq a, Eq b, Eq c, Eq d) => Eq (a, b, c, d)

(Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (a, b, c, d, e)

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq (a, b, c, d, e, f)

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq (a, b, c, d, e, f, g)

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h) => Eq (a, b, c, d, e, f, g, h)

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i) => Eq (a, b, c, d, e, f, g, h, i)

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j) => Eq (a, b, c, d, e, f, g, h, i, j)

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k) => Eq (a, b, c, d, e, f, g, h, i, j, k)

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l) => Eq (a, b, c, d, e, f, g, h, i, j, k, l)

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m)

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n)

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n, Eq o) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)

class Num a => Fractional a where

Source

Fractional numbers, supporting real division.

Minimal complete definition: fromRational and (recip or (/))

Methods

(/) :: a -> a -> a

Source

fractional division

recip :: a -> a

Source

reciprocal fraction

fromRational :: Rational -> a

Source

Conversion from a Rational (that is Ratio Integer). A floating literal stands for an application of fromRational to a value of type Rational, so such literals have type (Fractional a) => a.

Instances

Fractional NominalDiffTime

Fractional DiffTime

Integral a => Fractional (Ratio a)

HasResolution a => Fractional (Fixed a)

class Functor f where

Source

The Functor class is used for types that can be mapped over. Instances of Functor should satisfy the following laws:

fmap id == id fmap (f . g) == fmap f . fmap g

The instances of Functor for lists, Data.Maybe.Maybe and System.IO.IO defined in the Prelude satisfy these laws.

Methods

fmap :: (a -> b) -> f a -> f b

Source

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

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.

Instances

Functor []

Functor Id

Functor FingerTree

Functor Digit

Functor Node

Functor Elem

Functor Id

Functor ((->) r)

Functor (Either a)

Functor ((,) a)

HasTrie a => Functor (:->: a)

Functor (ST s)

Ix i => Functor (Array i)

Functor (StateL s)

Functor (StateR s)

Functor (Const m)

Monad m => Functor (WrappedMonad m)

Functor (State s)

Functor (Map k)

Functor s => Functor (ViewL s)

Functor s => Functor (ViewR s)

Functor m => Functor (GhcT m)

Functor m => Functor (MTLAdapter m)

Functor m => Functor (GhcT m)

Monad m => Functor (InterpreterT m)

Functor m => Functor (ListT m)

Functor (Reader r)

Functor m => Functor (MaybeT m)

Functor m => Functor (IdentityT m)

Functor (Parser s)

Functor (Scanner st)

Functor (Parser r s)

Arrow a => Functor (WrappedArrow a b)

Functor (ContT r m)

Functor m => Functor (ErrorT e m)

Functor m => Functor (ReaderT r m)

Functor m => Functor (StateT s m)

Functor m => Functor (WriterT w m)

Monad m => Functor (ErrorT e m)

Monad m => Functor (ReaderT r m)

Functor (Reply s u)

Functor (I event w)

Functor (ParsecT s u m)

Functor m => Functor (RWST r w s m)

data IO a

Source

A value of type IO a is a computation which, when performed, does some I/O before returning a value of type a.

There is really only one way to "perform" an I/O action: bind it to Main.main in your program. When your program is run, the I/O will be performed. It isn't possible to perform I/O from an arbitrary function, unless that function is itself in the IO monad and called at some point, directly or indirectly, from Main.main.

IO is a monad, so IO actions can be combined using either the do-notation or the >> and >>= operations from the Monad class.

Instances

MonadError IOException IO

MonadError IOError IO

MArray IOArray e IO

Typeable a => Data (IO a)

PrintfType (IO a)

HPrintfType (IO a)

YiAction (IO x) x

data Integer

Source

Arbitrary-precision integers.

Instances

class (Real a, Enum a) => Integral a where

Source

Integral numbers, supporting integer division.

Minimal complete definition: quotRem and toInteger

Methods

quot :: a -> a -> a

Source

integer division truncated toward zero

rem :: a -> a -> a

Source

integer remainder, satisfying

(x `quot` y)*y + (x `rem` y) == x

div :: a -> a -> a

Source

integer division truncated toward negative infinity

mod :: a -> a -> a

Source

integer modulus, satisfying

(x `div` y)*y + (x `mod` y) == x

quotRem :: a -> a -> (a, a)

Source

simultaneous quot and rem

divMod :: a -> a -> (a, a)

Source

simultaneous div and mod

toInteger :: a -> Integer

Source

conversion to Integer

Instances

class Bounded a where

Source

The Bounded class is used to name the upper and lower limits of a type. Ord is not a superclass of Bounded since types that are not totally ordered may also have upper and lower bounds.

The Bounded class may be derived for any enumeration type; minBound is the first constructor listed in the data declaration and maxBound is the last. Bounded may also be derived for single-constructor datatypes whose constituent types are in Bounded.

Methods

minBound :: a

maxBound :: a

Instances

Bounded ()

Bounded GeneralCategory

Bounded a => Bounded (Flag a)

Bounded a => Bounded (Dual a)

Bounded a => Bounded (Sum a)

Bounded a => Bounded (Product a)

(Bounded a, Bounded b) => Bounded (a, b)

(Bounded a, Bounded b, Bounded c) => Bounded (a, b, c)

(Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d)

(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e)

(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f)

(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g) => Bounded (a, b, c, d, e, f, g)

(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h) => Bounded (a, b, c, d, e, f, g, h)

(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i) => Bounded (a, b, c, d, e, f, g, h, i)

(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j) => Bounded (a, b, c, d, e, f, g, h, i, j)

(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k) => Bounded (a, b, c, d, e, f, g, h, i, j, k)

(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l)

(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m)

(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n)

(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n, Bounded o) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)

class Enum a where

Source

Class Enum defines operations on sequentially ordered types.

The enumFrom... methods are used in Haskell's translation of arithmetic sequences.

Instances of Enum may be derived for any enumeration type (types whose constructors have no fields). The nullary constructors are assumed to be numbered left-to-right by fromEnum from 0 through n-1. See Chapter 10 of the Haskell Report for more details.

For any type that is an instance of class Bounded as well as Enum, the following should hold:

The calls succ maxBound and pred minBound should result in a runtime error.
fromEnum and toEnum should give a runtime error if the result value is not representable in the result type. For example, toEnum 7 :: Bool is an error.
enumFrom and enumFromThen should be defined with an implicit bound, thus:

enumFrom x = enumFromTo x maxBound enumFromThen x y = enumFromThenTo x y bound where bound | fromEnum y >= fromEnum x = maxBound | otherwise = minBound

Methods

succ :: a -> a

Source

the successor of a value. For numeric types, succ adds 1.

pred :: a -> a

Source

the predecessor of a value. For numeric types, pred subtracts 1.

toEnum :: Int -> a

Source

Convert from an Int.

fromEnum :: a -> Int

Source

Convert to an Int. It is implementation-dependent what fromEnum returns when applied to a value that is too large to fit in an Int.

enumFrom :: a -> [a]

Source

Used in Haskell's translation of [n..].

enumFromThen :: a -> a -> [a]

Source

Used in Haskell's translation of [n,n'..].

enumFromTo :: a -> a -> [a]

Source

Used in Haskell's translation of [n..m].

enumFromThenTo :: a -> a -> a -> [a]

Source

Used in Haskell's translation of [n,n'..m].

Instances

data Maybe a

Source

The Maybe type encapsulates an optional value. A value of type Maybe a either contains a value of type a (represented as Just a), or it is empty (represented as Nothing). Using Maybe is a good way to deal with errors or exceptional cases without resorting to drastic measures such as error.

The Maybe type is also a monad. It is a simple kind of error monad, where all errors are represented by Nothing. A richer error monad can be built using the Data.Either.Either type.

Constructors

Nothing
Just a

Instances

Eq a => Eq (Maybe a)

Data a => Data (Maybe a)

Ord a => Ord (Maybe a)

Read a => Read (Maybe a)

Show a => Show (Maybe a)

Monoid a => Monoid (Maybe a)

Binary a => Binary (Maybe a)

Lift a => Lift (Maybe a)

UserOfLocalRegs a => UserOfLocalRegs (Maybe a)

UserOfSlots a => UserOfSlots (Maybe a)

VectorSpace v => VectorSpace (Maybe v)

(InnerSpace a, AdditiveGroup (Scalar a)) => InnerSpace (Maybe a)

Typeable a => Initializable (Maybe a)

class Monad m where

Source

The Monad class defines the basic operations over a monad, a concept from a branch of mathematics known as category theory. From the perspective of a Haskell programmer, however, it is best to think of a monad as an abstract datatype of actions. Haskell's do expressions provide a convenient syntax for writing monadic expressions.

Minimal complete definition: >>= and return.

Instances of Monad should satisfy the following laws:

return a >>= k == k a m >>= return == m m >>= (\x -> k x >>= h) == (m >>= k) >>= h

Instances of both Monad and Functor should additionally satisfy the law:

fmap f xs == xs >>= return . f

The instances of Monad for lists, Data.Maybe.Maybe and System.IO.IO defined in the Prelude satisfy these laws.

Methods

(>>=) :: m a -> (a -> m b) -> m b

Source

Sequentially compose two actions, passing any value produced by the first as an argument to the second.

(>>) :: m a -> m b -> m b

Source

Sequentially compose two actions, discarding any value produced by the first, like sequencing operators (such as the semicolon) in imperative languages.

return :: a -> m a

Source

Inject a value into the monadic type.

fail :: String -> m a

Source

Fail with a message. This operation is not part of the mathematical definition of a monad, but is invoked on pattern-match failure in a do expression.

Instances

Monad []

Monad P

Monad Id

Monad ((->) r)

Error e => Monad (Either e)

Monad (P s)

HasTrie a => Monad (:->: a)

Monad (ST s)

ArrowApply a => Monad (ArrowMonad a)

Monad (State s)

Monad m => Monad (GhcT m)

Monad m => Monad (MTLAdapter m)

Monad m => Monad (GhcT m)

Monad m => Monad (InterpreterT m)

Monad m => Monad (ListT m)

Monad (Reader r)

Monad m => Monad (MaybeT m)

Monad m => Monad (IdentityT m)

Monad (Parser s)

Monad (Parser r s)

Monad (ContT r m)

(Monad m, Error e) => Monad (ErrorT e m)

Monad m => Monad (ReaderT r m)

Monad m => Monad (StateT s m)

(Monoid w, Monad m) => Monad (WriterT w m)

(Monad m, Error e) => Monad (ErrorT e m)

Monad m => Monad (ReaderT r m)

Monad (I event w)

Monad (ParsecT s u m)

(Monoid w, Monad m) => Monad (RWST r w s m)

class (Eq a, Show a) => Num a where

Source

Basic numeric class.

Minimal complete definition: all except negate or (-)

Methods

(+) :: a -> a -> a

Source

(*) :: a -> a -> a

Source

(-) :: a -> a -> a

Source

negate :: a -> a

Source

Unary negation.

abs :: a -> a

Source

Absolute value.

signum :: a -> a

Source

Sign of a number. The functions abs and signum should satisfy the law:

abs x * signum x == x

For real numbers, the signum is either -1 (negative), 0 (zero) or 1 (positive).

fromInteger :: Integer -> a

Source

Conversion from an Integer. An integer literal represents the application of the function fromInteger to the appropriate value of type Integer, so such literals have type (Num a) => a.

Instances

Integral a => Num (Ratio a)

HasResolution a => Num (Fixed a)

Num t => Num (::: t doc)

class Eq a => Ord a where

Source

The Ord class is used for totally ordered datatypes.

Instances of Ord can be derived for any user-defined datatype whose constituent types are in Ord. The declared order of the constructors in the data declaration determines the ordering in derived Ord instances. The Ordering datatype allows a single comparison to determine the precise ordering of two objects.

Minimal complete definition: either compare or <=. Using compare can be more efficient for complex types.

Methods

compare :: a -> a -> Ordering

Source

(<) :: a -> a -> Bool

Source

(>=) :: a -> a -> Bool

Source

(>) :: a -> a -> Bool

Source

(<=) :: a -> a -> Bool

Source

max :: a -> a -> a

Source

min :: a -> a -> a

Instances

Ord ()

Ord PackageIdentifier

Ord InstalledPackageId

Ord DL

Ord RequiredInstance

Ord Prec

Ord PatternSetCharacterClass

Ord PatternSetCollatingElement

Ord PatternSetEquivalenceClass

Ord ModuleKind

Ord FolderKind

Ord FileKind

Ord ProjectItem

Ord a => Ord [a]

Integral a => Ord (Ratio a)

Ord (Ptr a)

Ord (FunPtr a)

Ord a => Ord (Maybe a)

Ord (ForeignPtr a)

Ord (Fixed a)

Ord a => Ord (Dual a)

Ord a => Ord (Sum a)

Ord a => Ord (Product a)

Ord a => Ord (First a)

Ord a => Ord (Last a)

Ord a => Ord (Down a)

Ord a => Ord (Set a)

Ord a => Ord (Seq a)

Ord a => Ord (ViewL a)

Ord a => Ord (ViewR a)

Ord a => Ord (PointedList a)

(Ord a, Ord b) => Ord (Either a b)

(Ord a, Ord b) => Ord (a, b)

(Ix ix, Ord e, IArray UArray e) => Ord (UArray ix e)

(Ix i, Ord e) => Ord (Array i e)

(Ord k, Ord v) => Ord (Map k v)

(Ord a, Ord (s a)) => Ord (ViewL s a)

(Ord a, Ord (s a)) => Ord (ViewR s a)

(Measured v a, Ord a) => Ord (FingerTree v a)

(Ord a, Ord b, Ord c) => Ord (a, b, c)

(Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d)

(Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (a, b, c, d, e)

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord (a, b, c, d, e, f)

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord (a, b, c, d, e, f, g)

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => Ord (a, b, c, d, e, f, g, h)

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i) => Ord (a, b, c, d, e, f, g, h, i)

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j) => Ord (a, b, c, d, e, f, g, h, i, j)

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k) => Ord (a, b, c, d, e, f, g, h, i, j, k)

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l) => Ord (a, b, c, d, e, f, g, h, i, j, k, l)

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m)

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n)

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n, Ord o) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)

class Read a where

Source

Parsing of Strings, producing values.

Minimal complete definition: readsPrec (or, for GHC only, readPrec)

Derived instances of Read make the following assumptions, which derived instances of Text.Show.Show obey:

If the constructor is defined to be an infix operator, then the derived Read instance will parse only infix applications of the constructor (not the prefix form).
Associativity is not used to reduce the occurrence of parentheses, although precedence may be.
If the constructor is defined using record syntax, the derived Read will parse only the record-syntax form, and furthermore, the fields must be given in the same order as the original declaration.
The derived Read instance allows arbitrary Haskell whitespace between tokens of the input string. Extra parentheses are also allowed.

For example, given the declarations

infixr 5 :^: data Tree a = Leaf a | Tree a :^: Tree a

the derived instance of Read in Haskell 98 is equivalent to

instance (Read a) => Read (Tree a) where readsPrec d r = readParen (d > app_prec) (\r -> [(Leaf m,t) | ("Leaf",s) <- lex r, (m,t) <- readsPrec (app_prec+1) s]) r ++ readParen (d > up_prec) (\r -> [(u:^:v,w) | (u,s) <- readsPrec (up_prec+1) r, (":^:",t) <- lex s, (v,w) <- readsPrec (up_prec+1) t]) r where app_prec = 10 up_prec = 5

Note that right-associativity of :^: is unused.

The derived instance in GHC is equivalent to

instance (Read a) => Read (Tree a) where readPrec = parens $ (prec app_prec $ do Ident "Leaf" <- lexP m <- step readPrec return (Leaf m)) +++ (prec up_prec $ do u <- step readPrec Symbol ":^:" <- lexP v <- step readPrec return (u :^: v)) where app_prec = 10 up_prec = 5 readListPrec = readListPrecDefault

Methods

readsPrec

Source

:: Int the operator precedence of the enclosing context (a number from 0 to 11). Function application has precedence 10.

-> ReadS a

attempts to parse a value from the front of the string, returning a list of (parsed value, remaining string) pairs. If there is no successful parse, the returned list is empty.

Derived instances of Read and Text.Show.Show satisfy the following:

(x,"") is an element of (readsPrec d (Text.Show.showsPrec d x "")).

That is, readsPrec parses the string produced by Text.Show.showsPrec, and delivers the value that Text.Show.showsPrec started with.

readList :: ReadS [a]

Source

The method readList is provided to allow the programmer to give a specialised way of parsing lists of values. For example, this is used by the predefined Read instance of the Char type, where values of type String should be are expected to use double quotes, rather than square brackets.

Instances

Read ()

Read ComponentLocalBuildInfo

Read PackageDescription

Read PackageIdentifier

Read InstalledPackageId

Read a => Read [a]

(Integral a, Read a) => Read (Ratio a)

Read a => Read (Maybe a)

Read a => Read (Dual a)

Read a => Read (Sum a)

Read a => Read (Product a)

Read a => Read (First a)

Read a => Read (Last a)

Read a => Read (Tree a)

(Read a, Ord a) => Read (Set a)

Read a => Read (Seq a)

Read a => Read (ViewL a)

Read a => Read (ViewR a)

Read a => Read (TreeLoc a)

(Read a, Read b) => Read (Either a b)

(Read a, Read b) => Read (a, b)

(Ix a, Read a, Read b) => Read (Array a b)

(Ord k, Read k, Read e) => Read (Map k e)

(Read a, Read (s a)) => Read (ViewL s a)

(Read a, Read (s a)) => Read (ViewR s a)

(Read a, Read b, Read c) => Read (a, b, c)

(Read a, Read b, Read c, Read d) => Read (a, b, c, d)

(Read a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e)

(Read a, Read b, Read c, Read d, Read e, Read f) => Read (a, b, c, d, e, f)

(Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read (a, b, c, d, e, f, g)

(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h) => Read (a, b, c, d, e, f, g, h)

(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i) => Read (a, b, c, d, e, f, g, h, i)

(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j) => Read (a, b, c, d, e, f, g, h, i, j)

(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k) => Read (a, b, c, d, e, f, g, h, i, j, k)

(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l) => Read (a, b, c, d, e, f, g, h, i, j, k, l)

(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m)

(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n)

(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n, Read o) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)

class (Num a, Ord a) => Real a where

Source

Methods

toRational :: a -> Rational

Source

the rational equivalent of its real argument with full precision

Instances

class (Real a, Fractional a) => RealFrac a where

Source

Extracting components of fractions.

Minimal complete definition: properFraction

Methods

properFraction :: Integral b => a -> (b, a)

Source

The function properFraction takes a real fractional number x and returns a pair (n,f) such that x = n+f, and:

n is an integral number with the same sign as x; and
f is a fraction with the same type and sign as x, and with absolute value less than 1.

The default definitions of the ceiling, floor, truncate and round functions are in terms of properFraction.

truncate :: Integral b => a -> b

Source

truncate x returns the integer nearest x between zero and x

round :: Integral b => a -> b

Source

round x returns the nearest integer to x; the even integer if x is equidistant between two integers

ceiling :: Integral b => a -> b

Source

ceiling x returns the least integer not less than x

floor :: Integral b => a -> b

Source

floor x returns the greatest integer not greater than x

Instances

RealFrac NominalDiffTime

Integral a => RealFrac (Ratio a)

HasResolution a => RealFrac (Fixed a)

newtype ReaderT r m a

Source

The reader monad transformer, which adds a read-only environment to the given monad.

The return function ignores the environment, while >>= passes the inherited environment to both subcomputations.

Constructors

ReaderT

runReaderT :: r -> m a

The underlying computation, as a function of the environment.

Instances

MonadError e m => MonadError e (ReaderT r m)

Monad m => MonadReader r (ReaderT r m)

MonadState s m => MonadState s (ReaderT r m)

MonadWriter w m => MonadWriter w (ReaderT r m)

MonadTrans (ReaderT r)

Monad m => Monad (ReaderT r m)

Functor m => Functor (ReaderT r m)

MonadFix m => MonadFix (ReaderT r m)

MonadPlus m => MonadPlus (ReaderT r m)

Applicative m => Applicative (ReaderT r m)

Alternative m => Alternative (ReaderT r m)

MonadIO m => MonadIO (ReaderT r m)

class SemiNum absolute relative | absolute -> relative where

Source

Methods

(+~) :: absolute -> relative -> absolute

Source

(-~) :: absolute -> relative -> absolute

Source

(~-) :: absolute -> absolute -> relative

Source

Instances

SemiNum Point Size

type String = [Char]

Source

A String is a list of characters. String constants in Haskell are values of type String.

commonPrefix :: Eq a => [[a]] -> [a]

Source

Return the longest common prefix of a set of lists.

 P(xs) === all (isPrefixOf (commonPrefix xs)) xs
 length s > length (commonPrefix xs) --> not (all (isPrefixOf s) xs)

discard :: Functor f => f a -> f ()

Source

every :: Traversable t => Accessor whole part -> Accessor (t whole) (t part)

Source

Lift an accessor to a traversable structure. (This can be seen as a generalization of fmap)

fromIntegral :: (Integral a, Num b) => a -> b

Source

general coercion from integral types

fst :: (a, b) -> a

Source

Extract the first component of a pair.

fst3 :: (a, b, c) -> a

Source

groupBy' :: (a -> a -> Bool) -> [a] -> [[a]]

Source

Alternative to groupBy.

 groupBy' (\a b -> abs (a - b) <= 1) [1,2,3] = [[1,2,3]]

whereas

 groupBy (\a b -> abs (a - b) <= 1) [1,2,3] = [[1,2],[3]]

TODO: Check in ghc 6.12 release if groupBy == groupBy'.

list :: b -> (a -> [a] -> b) -> [a] -> b

Source

head :: [a] -> a

Source

Extract the first element of a list, which must be non-empty.

init :: [a] -> [a]

Source

Return all the elements of a list except the last one. The list must be non-empty.

io :: MonadIO m => IO a -> m a

Source

last :: [a] -> a

Source

Extract the last element of a list, which must be finite and non-empty.

lookup :: Eq a => a -> [(a, b)] -> Maybe b

Source

lookup key assocs looks up a key in an association list.

mapAdjust' :: Ord k => (a -> a) -> k -> Map k a -> Map k a

Source

As Map.adjust, but the combining function is applied strictly.

mapAlter' :: Ord k => (Maybe a -> Maybe a) -> k -> Map k a -> Map k a

Source

As Map.alter, but the newly inserted element is forced with the map.

module Control.Applicative

module Control.Category

module Data.Accessor

module Data.Accessor.Monad.FD.State

putA :: MonadState r m => T r a -> a -> m ()

Source

getA :: MonadState r m => T r a -> m a

Source

modA :: MonadState r m => T r a -> (a -> a) -> m ()

Source

module Data.Bool

module Data.Foldable

module Data.Function

module Data.Int

data Rope

Instances

fromString :: String -> Rope

Source

Conversions from Rope

toString :: Rope -> String

Source

toReverseString :: Rope -> String

Source

List-like functions

null :: Rope -> Bool

Source

empty :: Rope

Source

take :: Int -> Rope -> Rope

Source

drop :: Int -> Rope -> Rope

Source

append :: Rope -> Rope -> Rope

Source

Append two strings by merging the two finger trees.

splitAt :: Int -> Rope -> (Rope, Rope)

Source

Split the string at the specified position.

splitAtLine :: Int -> Rope -> (Rope, Rope)

Source

Split before the specified line. Lines are indexed from 0.

length :: Rope -> Int

Source

Get the length of the string. (This information cached, so O(1) amortized runtime.)

reverse :: Rope -> Rope

Source

countNewLines :: Rope -> Int

Source

Count the number of newlines in the strings. (This information cached, so O(1) amortized runtime.)

readFile :: FilePath -> IO Rope

Source

writeFile :: FilePath -> Rope -> IO ()

Source

Low level functions

splitAtChunkBefore :: Int -> Rope -> (Rope, Rope)

Source

Split the rope on a chunk, so that the desired position lies within the first chunk of the second rope.

module Data.Traversable

module Text.Show

module Yi.Debug

module Yi.Monad

nubSet :: Ord a => [a] -> [a]

Source

As Prelude.nub, but with O(n*log(n)) behaviour.

null :: [a] -> Bool

Source

Test whether a list is empty.

print :: Show a => a -> IO ()

Source

The print function outputs a value of any printable type to the standard output device. Printable types are those that are instances of class Show; print converts values to strings for output using the show operation and adds a newline.

For example, a program to print the first 20 integers and their powers of 2 could be written as:

main = print ([(n, 2^n) | n <- [0..19]])

putStrLn :: String -> IO ()

Source

The same as putStr, but adds a newline character.

replicate :: Int -> a -> [a]

Source

replicate n x is a list of length n with x the value of every element. It is an instance of the more general Data.List.genericReplicate, in which n may be of any integral type.

read :: Read a => String -> a

Source

The read function reads input from a string, which must be completely consumed by the input process.

seq :: a -> b -> b

Source

Evaluates its first argument to head normal form, and then returns its second argument as the result.

singleton :: a -> [a]

Source

snd :: (a, b) -> b

Source

Extract the second component of a pair.

snd3 :: (a, b, c) -> b

Source

tail :: [a] -> [a]

Source

Extract the elements after the head of a list, which must be non-empty.

trd3 :: (a, b, c) -> c

Source

undefined :: a

Source

A special case of error. It is expected that compilers will recognize this and insert error messages which are more appropriate to the context in which undefined appears.

unlines :: [String] -> String

Source

unlines is an inverse operation to lines. It joins lines, after appending a terminating newline to each.

when :: Monad m => Bool -> m () -> m ()

Source

Conditional execution of monadic expressions. For example,

when debug (putStr "Debugging\n")

will output the string Debugging\n if the Boolean value debug is True, and otherwise do nothing.

writeFile :: FilePath -> String -> IO ()

Source

The computation writeFile file str function writes the string str, to the file file.

Produced by Haddock version 2.6.1